Keren Censor-Hillel

 

I'm a Simons Postdoctoral Fellow at the Theory Group of CSAIL, MIT. I’m with the Theory of Distributed Systems Group, headed by Prof. Nancy Lynch. My interests are in distributed computing, especially probabilistic algorithms and lower bounds, and theory of computing in general.

Before coming to MIT, I was a Ph.D. Student at the Department of Computer Science at the Technion, where I had the fortune of having Prof. Hagit Attiya as my advisor.  I did my M.Sc. also at the Technion, under the supervision of Prof. Tuvi Etzion in the area of constrained coding.

Here is my CV, and this is a link to my DBLP entry.

Phone : +1 (617)-253-4632

Office : 32-G666

E-mail : ckeren at csail.mit.edu

 

  

Program Committee Member:

 

The 8th ACM Workshop on Foundations of Mobile Computing (FOMC) 2012

The 31st Annual ACM Symposium on Principles of Distributed Computing  (PODC) 2012

The 31st International Conference on Distributed Computing Systems (ICDCS) 2012

The 12th International Conference on Distributed Computing and Networking (ICDCN) 2012

The 25th International Symposium on Distributed Computing (DISC) 2011

 

 

Conference Publications:

· Keren Censor-Hillel and Nancy Lynch. Bounded-Contention Coding for Wireless Networks. In preparation.

 

· James Aspnes, Hagit Attiya, Keren Censor-Hillel, and Faith Ellen. Faster than Optimal Snapshots (for a While). To appear in PODC 2012.

 

· James Aspnes, Hagit Attiya, Keren Censor-Hillel, and Danny Hendler. Lower Bounds for Restricted-Use Objects. To appear in SPAA 2012.

 

· Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, and Petar Maymounkov. Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance. To appear in STOC 2012.

    

· Chen Avin, Michael Borokhovich, Keren Censor-Hillel, and Zvi Lotker. Order Optimal Information Spreading Using Algebraic Gossip. In  Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC), pages 363-372, 2011.

  

· Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy Lynch, and Calvin Newport. Structuring Unreliable Radio Networks. In  Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC), pages 79-88, 2011.

  

· Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, and Morteza Zadimoghaddam. Optimal-Time Adaptive Tight Renaming, with Applications to Counting. In  Proceedings of the 30th ACM Symposium on Principles of Distributed Computing (PODC), pages 239-248, 2011.

  

· Keren Censor-Hillel and Hadas Shachnai, Fast Information Spreading in Graphs with Large Weak Conductance. In  Proceedings of the 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 440-448, 2011.

  

· Keren Censor Hillel and Hadas Shachnai, Partial Information Spreading with Application to Distributed Maximum Coverage. In Proceedings of the 29th ACM Symposium on Principles of Distributed Computing (PODC), pages 161-170, 2010.

  

· Keren Censor Hillel, Multi-Sided Shared Coins and Randomized Set-Agreement. In Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 60-68, 2010.

 

· James Aspnes, Hagit Attiya, and Keren Censor, Max Registers, Counters, and Monotone Circuits, In Proceedings of the 28th annual ACM Symposium on Principles of Distributed Computing (PODC), pages 36–45, 2009. Best Student Paper Award.

 

· James Aspnes and Keren Censor, Approximate Counting Despite a Strong Adversary, In Proceedings of the 20th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 441–450, 2009.

 

· James Aspnes, Hagit Attiya and Keren Censor, Randomized Consensus in Expected  O(nlogn) Individual Work, In Proceedings of the 27th annual ACM Symposium on Principles of Distributed Computing (PODC), pages 325–334, 2008.

 

· Hagit Attiya and Keren Censor, Lower Bounds for Randomized Consensus under a Weak Adversary, In Proceedings of the 27th annual ACM Symposium on Principles of Distributed Computing (PODC), pages 315–324, 2008.

 

· Hagit Attiya and Keren Censor, Tight Bounds for Asynchronous Randomized Consensus, In Proceedings of the 39th annual ACM Symposium on Theory of computing (STOC), pages 155–164, 2007.

 

· Keren Censor and Tuvi Etzion, The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels, IEEE International Symposium on Information Theory (ISIT), Seattle, WA. July 2006.

 

Journal Publications:

· Chen Avin, Michael Borokhovich, Keren Censor-Hillel, and Zvi Lotker. Order Optimal Information Spreading Using Algebraic Gossip. Submitted.

· Keren Censor-Hillel and Hadas Shachnai, Fast Information Spreading in Graphs with Large Weak Conductance. Submitted.

 · Keren Censor-Hillel and Hadas Shachnai, Partial Information Spreading with Application to Distributed Maximum Coverage. Submitted.

· James Aspnes, Hagit Attiya, and Keren Censor-Hillel, Polylogarithmic Concurrent Data Structures from Monotone Circuits. Journal of the ACM (JACM), Volume 59, Issue 1, February 2012.

 

· Hagit Attiya,and Keren Censor, Lower Bounds for Randomized Consensus Under a Weak Adversary, SIAM Journal of Computing (SICOMP), Volume 39, Issue 8, pp. 3885-3904, December 2010.

 

· James Aspnes, Hagit Attiya, and Keren Censor, Combining Shared Coin Algorithms, Journal of Parallel and Distributed Computing (JPDC), Volume 70, Issue 3, pp. 317-322, March 2010.

 

· James Aspnes and Keren Censor, Approximate Shared-memory Counting Despite a Strong Adversary, ACM Transactions on Algorithms (TALG), SODA 2009 special issue, Volume 6, Issue 2, Article 25, March 2010.

 

· Hagit Attiya and Keren Censor, Tight Bounds for Asynchronous Randomized Consensus, Journal of the ACM (JACM), Volume 55, Issue 5, Article 20, October 2008.

 

· Keren Censor and Tuvi Etzion, The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels, IEEE Transactions on Information Theory , vol.52, no.11 pp. 5128- 5140, Nov. 2006.

 

Theses:

· Keren Censor, Constrained Codes for Two-Dimensional Channels. M.Sc. Thesis, Technion, 2006.

 

· Keren Censor Hillel, Probabilistic Methods in Distributed Computing. Ph.D. Thesis, Technion, 2010.

 

 

Other Publications:

· Keren Censor and Christoph Lenzen, A review of PODC 2009, SIGACT News, Volume 40, No.4, pp. 71-74, 2009.

 

 

From MITnews:

· Breaking bottlenecks, by Larry Hardesty.

 

 

Teaching:

· MIT: Lecturer (with Nancy Lynch) Distributed Algorithms: New Topics and Techniques 6.885 

· Technion: TA Distributed Algorithms B 236755 

· Technion: TA Logic and Set Theory 234293

 

 

Other:

· Gil's photography site

· Dotan