Ben-Gurion University, Department of Computer Science

Computer Science Seminar, 2005/06

CS seminars usually take place on Tuesdays at noon, room -101 of building 58.

Previous years: 2004/05

Organizer: Michael Elkin

Time	Location	Speaker	Title
Nov.1, 10:30am	-101	Mendel Manor	Fast construction of nets in low dimensional metrics, and their applications
Nov. 8, 12am	-101	Zeev Nutov	Approximating Connectivity Augmentation Problems
Nov. 15, 12am	-101	Yuval Emek	A Tight Upper Bound on the Probabilistic Embedding of Series-Parallel Graphs
Nov. 22, 12am	-101	Adi Rosen	Distributed Online Call Control on General Networks
Nov. 27, 12am	-101	Moshe Levenstein	TSPs, Cycle Covers and Approximations in Directed Graphs
Nov. 28, 12am	-101	Gill Bejerano	The Human Genome: Solving a Million Problems
Dec. 6, 12am.	-101	Ron Lavi	Truthful and Near-Optimal Mechanism Design via Linear Programming
Dec. 11, 12am	201	Guy Kindler	On Gallager's problem: new lower-bounds for noisy communication
Dec. 14, 11am	Bldng. 90, Room 233	Jonathan Schaeffer	One Jump Ahead: Challenging Human Supremacy at Checkers
Dec. 20, 12am	-101	Ricky Rosen	Lattice Problems and Norms Embeddings
Dec. 25, 11:20am	-101	Robert Krauthgamer	Unstructural data: Practical Algorithms with Rigorous Analysis
Dec. 25, 12:45am	-101	Shakhar Samorodnitsky	Conflict-Free Colorings
Dec. 27, 12am	-101	Ran_Wolff	A Privacy Model for Data Mining
Jan. 2, 12am	-101	Itzik Peer	Data, technology and population for genomo-wide association studies
Jan. 3, 12am	-101	Yuval Krymolowski	Clustering verbs into semantic classes based on their subcategorisation frame distribution
Jan. 8,12am	-101	Shlomo Hoory	Monotone circuits for the majority function
Jan. 10, 12am	-101	Yael Tauman Kallai	On the Impossibility of Obfuscation with Auxiliary Input
Jan. 17, 12am	-101	Boaz Patt-Shamir	Trust, Collaboration and Recommendations in Peer-to-Peer Systems
Jan. 24, 12am	-101	Moshe_Schwartz	Coding Theory in Two Dimensions
Jan. 31, 12am	-101	Yaron Caspi	Exceeding video bounds
March 7, 12am	-101	Liam Roditty	Developments in Dynamic Graph Algorithms
March 21, 12am	-101	Yael Moses	Distributed Solution for Multi-camera Correspondence
April 4, 12am	-101	Amir Shpilka	Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
April 23, 12am	-101	Yehuda Lindell	Information-Theoretically Secure Protocols and Security under Composition
May 9, 12am	-101	Avigdor Gal	Web Resource Monitoring and Data Delivery
May 16, 12am	-101	Joel Ratsaby	On the combinatorial representation of information
May 25, 11am	201	Eliezer Kantorowitz	Beyond Object Oriented Programming
May 30, 12am	-101	Michael Werman	Geometry and Statistics in Computer Vision
June 6, 12am	-101	Eitan Bachmat	Causal sets and their applications
June 13, 12am	-101	Yair Weiss	Solving NP-hard problems in practice - lessons from computer vision and computational biology
June 20, 12am	-101	Andrzej Pelc	Oracles: a new paradigm in network algorithms
June 27, 12am	-101	Catriel Beeri	BPQL - A Query Language for Business Processes
July 11, 12am	-101	Gil Segev	Tight bounds for unconditional authentication protocols in the manual channel and shared key models