| 
 
| The Open University
 The Department of Mathematics and Computer Science
 | האוניברסיטה הפתוחה
 המחלקה למתמטיקה ולמדעי המחשב
 |  
| 
 The Seventh Israel CS Theory Day
 Monday, March 24th, 2014
 
 at  The Open University, Dorothy de Rothschild Campus
 1 University Road, Raanana
 
 
 |  
| 
		
			| Schedule 
 
 |  
				| 10:00 - 10:40 | Gathering, refreshments |  
			| 10:40 - 10:50 | Greetings: Tamir Tassa, The Department of Mathematics and Computer Science, The Open University (OUI)
 |  
			| First Session: | Chair -  Zeev Nutov,    The Department of Mathematics and Computer Science, OUI |  
	| 10:50 - 11:40 | Amit Daniely,
 The Hebrew University From Average Case Complexity to Improper Learning Complexity
 |  
		| 11:40 - 12:30 | Michel Goemans, MIT Polynomiality for Bin Packing with a Constant Number of Item Types
 |  
		| 12:30 - 14:00 | Lunch |  
	| Second Session: | Chair -  Tamir Tassa, The  Department of Mathematics and Computer Science, OUI |  
			| 14:00 - 14:50 | Orna Kupferman ,    The Hebrew University Formal Verification - Deciding the Undecidable
 |  
				| 14:50 - 15:40 | Manor Mendel, The  Open University Expanders with respect to Metric Spaces
 |  
	| 15:40 - 16:10 | Afternoon gathering |  
	| Third Session: | Chair - Noam Shental,  The Department of Mathematics and Computer Science, OUI |  
	| 16:10 - 17:00 | Ely Porat, Bar Ilan  University Group Testing, Compressed Sensing and Algorithmic Applications
 |  
					| 17:00 - 17:50 | Haim Kaplan ,   Tel Aviv University Graph Labeling
 |  
					| 17:50 - 18:00 | Concluding Remarks |  |  
| 
 
 
 
 
 |  |