|
Keren Censor Hillel
Keren Censor Hillel
I'm a Ph.D. Student at the Computer Science Department, Technion. My main interest is of probabilistic methods in distributed computing. My CV can be found here. Advisor: Prof. Hagit Attiya
Office : Taub 410 E-mail : ckeren at cs.technion.ac.il My M.Sc., titled "Constrained Codes for Two-Dimensional Channels", was done under the supervision of Prof. Tuvi Etzion. My thesis can be found here: thesis.pdf, thesis.ps. Conference Publications:
· 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:
· 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, To appear in ACM Transactions on Algorithms (TALG), SODA 2009 special issue. · 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. Other Publications: · Keren Censor and Christoph Lenzen, A review of PODC 2009, SIGACT News, Volume 40, No.4, pp. 71-74, 2009. Teaching: · Distributed Algorithms B 236755 Other:
|
