Mr. Leonid Barenboim

leonidba foto

Ph.D

Office hours:by email appointment

Contacts

Email:
Homepage:
Office:	205 in 37 building
Phone number:	08-6428044
Fax number:	08-6477650
Box number:	82
Office hours:	Wed 16:00-18:00

Teaching

Spring 2006	20219081 C Programming
Fall 2006-2007	20219011 Computer Programming
Spring 2007	20219031 Computer Programming in java
Fall 2007-2008	20211011 Introduction to Computer Science
Fall 2007-2008	20211041 Introduction To Programming For Information Systems
Spring 2008	20219031 Computer Programming in java
Fall 2008-2009	20212031 Systems Programming
Spring 2009	20215181 Object Oriented Software Design
Fall 2009-2010	20212031 Systems Programming
Spring 2010	20215181 Object Oriented Software Design
Spring 2011	20215181 Object Oriented Software Design
Fall 2011-2012	20214331 Mini-Project on Distributed Agorithms for Channel Allocation
Spring 2012	20215181 Object Oriented Software Design
Fall 2012-2013	20215761 Selected Topics in Object-Oriened Programming
Fall 2012-2013	20214331 Mini-Project on Distributed Agorithms for Channel Allocation
Spring 2013	20215181 Object Oriented Software Design

Selected publications all BibTex

Articles

BibTeX Leonid Barenboim and Michael Elkin. Distributed Deterministic Edge Coloring Using Bounded Neighborhood Independence. Distributed Computing, special issue of PODC'11. To appear.
BibTeX Leonid Barenboim and Michael Elkin. Deterministic Distributed Coloring in Polylogarithmic Time. In Journal of ACM, 58(5):23:1--23:25, 2011.
BibTeX Leonid Barenboim and Michael Elkin. Sublogarithmic Distributed MIS Algorithm for Sparse Graphs using Nash-Williams Decomposition. Distributed Computing, special issue of PODC'08, 22:363-379, 2010.

Conference Articles
BibTeX Leonid Barenboim. On the Locality of Some NP-Complete Problems. In Proc.of International Colloquium on Automata, Languages, and Programming, ICALP'12 (2), pages 403-415, 2012.
BibTeX Leonid Barenboim and Michael Elkin. Distributed Deterministic Edge Coloring Using Bounded Neighborhood Independence. In Proc. of International Symp. on Principles of Distributed Computing, PODC'11, pages 129-138, 2011.
BibTeX Leonid Barenboim and Michael Elkin. Combinatorial Algorithms for Distributed Graph Coloring. In Proc. of International Symp. on Distributed Computing, DISC'11, pages 66-81, 2011.
BibTeX Leonid Barenboim, Shlomi Dolev, and Rafail Ostrovsky. Deterministic and Energy-Optimal Wireless Synchronization. In Proc. of International Symp. on Distributed Computing, DISC'11, pages 237-251, 2011.
BibTeX Leonid Barenboim and Michael Elkin. Deterministic Distributed Coloring in Polylogarithmic Time. In Proc. of International Symp. on Principles of Distributed Computing, PODC'10, pages 410-419, 2010.
BibTeX Leonid Barenboim and Michael Elkin. Distributed (Delta+1)-Coloring in Linear (in Delta) Time. In Proc. of Symp. on Theory of Computing, STOC'09, pages 111-120, 2009.
BibTeX Leonid Barenboim and Michael Elkin. Sublogarithmic Distributed MIS Algorithm for Sparse Graphs using Nash-Williams Decomposition. In Proc. of International Symp. on Principles of Distributed Computing, PODC'08, pages 25-34, 2008.