Ben-Gurion University, Department of Computer Science

Computer Science Seminar, 2006/07

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

Previous years: 2004/05, 2005/6

Organizer: Michael Elkin

Time	Location	Speaker	Title
Oct. 24, 12:00	Alon bldng, 202	Joel Ratsaby	Maximal Width Learning of Binary Functions
Oct. 31, 12:00	Bldng 58, Room -101	Nissan Lev-Tov	Some geometric optimization problems in wireless networks
Nov. 7, 12:00	Bldng 58, Room -101	Zvika Lotker	Tight Upper Bound on the Number of Vertices of Polyhedra with $0,1$- Constraint Matrices
Nov. 14, 12:00	Bldng 58, Room -101	Ishay Haviv	Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors.
Nov. 21, 12:00	Bldng 58, Room -101	Gregory Gutin	Worst Case Analysis of Greedy, Max-Regret, and Other Heuristics for Multidimensional assignments and Traveling Salesman Problems
Nov. 27, 12:00	Bldng 37, Room 202	Wolfgang Reisig	Service oriented architectures: Modeling and Analysis Techniques
Nov. 28, 12:00	Bldng 58, Room -101	Ittai Abraham	Distributed Computing Meets Game Theory: upper and lower bounds for mediator implementation with cheap talk
Dec. 5, 12:00	Bldng 58, Room -101	Ronen Brafman	Decision-Theoretic Planning for Planetary Exploration
Dec. 12, 12:00	Bldng 37, Room 202	Moshe Babaioff	Selfish Agents and Approximation Mechanisms
Dec. 19, 12:00	Bldng 37, Room 202	Refael Wenger	Interval Persistence
Dec. 26, 12:00	Bldng 37, Room 202	Michal Feldman	Selfishness and Incentives in Networked Systems
Jan. 2, 12:00	Bldng 58, Room -101	Yaron Kanza	Protecting privacy without misleading users, in the realm of XML
Jan. 9, 12:00	Bldng 37, Room 202	Tami Ricklin	Segmentation by Level sets and Symmetry
Jan. 16, 12:00	Bldng 37, Room 202	Tzvika Hartman	Sorting by Transpositions
Jan. 23, 12:00	Bldng 37, Room 202	Ittai Balaban	Modular Data Abstraction for Liveness Proofs
Jan. 30, 12:00	Bldng 37, Room 202	Michael Kifer	Semantic Web: Schism of the Languages
Feb. 6, 12:00	Bldng 37, Room 202	Iddo Drori	Sparse solution of underdetermined systems of equations
Feb. 15, 12:00	Bldng 58, Room -101	Noam Slonim	Finding Informative Regulatory Elements
Feb. 19, 12:00	Bldng 37, Room 202	Martin Golumbic	Read-Once Functions and Cographs Revisited
Feb. 27, 12:00	Bldng 37, Room 202	Tamir Tassa	k-Anonymization with Minimal Loss of Information
March 6, 12:00	Bldng 37, Room 202	Danny Hendler	On the complexity of local-spin algorithms
March 13, 2007	Bldng 37, Room 202	Yuval Emek	Broadcasting in UDG Radio Networks with Unknown Topology
March 27, 12:00	Bldng 37, Room 202	Shay Solomon	A Solution of the  $k$-Relaxed Tower of Hanoi Problem
April 10, 12:00	Bldng 37, Room 202	Yossi Moshe	On the subword complexity of $k$-automatic and $k$-context-free sequences
April 17, 12:00	Bldng 37, Room 202	Danny Segev	Improved Online Algorithms for the Sorting Buffer Problem
April 22, 12:00	Bldng 37, Room 202	Dennis Dams	The Orion Static Program Analyzer
May 1, 12:00	Bldng 58, Room -101	Alan Hartman	Industrial Experience with Model Driven Development
June 26, 12:00	Bldng 37, Room 202	Danny Harnik	The Randomized Iterate and Pseudorandom Generators from One-Way Functions