Clik here to view.
The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels.
Keren Censor, Tuvi Etzion: The Positive Capacity Region of Two-Dimensional Run Length Constrained Channels. ISIT 2006: 1467-1471
View ArticleClik here to view.
The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels.
Keren Censor, Tuvi Etzion: The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels. IEEE Trans. Inf. Theory 52(11): 5128-5140 (2006)
View ArticleClik here to view.
Tight bounds for asynchronous randomized consensus.
Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. STOC 2007: 155-164
View ArticleClik here to view.
Randomized consensus in expected O(n log n) individual work.
James Aspnes, Hagit Attiya, Keren Censor: Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334
View ArticleClik here to view.
Lower bounds for randomized consensus under a weak adversary.
Hagit Attiya, Keren Censor: Lower bounds for randomized consensus under a weak adversary. PODC 2008: 315-324
View ArticleClik here to view.
Tight bounds for asynchronous randomized consensus.
Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. J. ACM 55(5): 20:1-20:26 (2008)
View ArticleClik here to view.
Approximate shared-memory counting despite a strong adversary.
James Aspnes, Keren Censor: Approximate shared-memory counting despite a strong adversary. SODA 2009: 441-450
View ArticleClik here to view.
Max registers, counters, and monotone circuits.
James Aspnes, Hagit Attiya, Keren Censor: Max registers, counters, and monotone circuits. PODC 2009: 36-45
View ArticleClik here to view.
A review of PODC 2009.
Keren Censor, Christoph Lenzen: A review of PODC 2009. SIGACT News 40(4): 71-74 (2009)
View ArticleClik here to view.
Multi-sided shared coins and randomized set-agreement.
Keren Censor-Hillel: Multi-sided shared coins and randomized set-agreement. SPAA 2010: 60-68
View ArticleClik here to view.
Partial information spreading with application to distributed maximum coverage.
Keren Censor-Hillel, Hadas Shachnai: Partial information spreading with application to distributed maximum coverage. PODC 2010: 161-170
View ArticleClik here to view.
Approximate shared-memory counting despite a strong adversary.
James Aspnes, Keren Censor: Approximate shared-memory counting despite a strong adversary. ACM Trans. Algorithms 6(2): 25:1-25:23 (2010)
View ArticleClik here to view.
Lower Bounds for Randomized Consensus under a Weak Adversary.
Hagit Attiya, Keren Censor-Hillel: Lower Bounds for Randomized Consensus under a Weak Adversary. SIAM J. Comput. 39(8): 3885-3904 (2010)
View ArticleClik here to view.
Combining shared-coin algorithms.
James Aspnes, Hagit Attiya, Keren Censor: Combining shared-coin algorithms. J. Parallel Distributed Comput. 70(3): 317-322 (2010)
View ArticleClik here to view.
Probabilistic methods in distributed computing.
Keren Censor-Hillel: Probabilistic methods in distributed computing. Technion - Israel Institute of Technology, Israel, 2010
View ArticleClik here to view.
Global Computation in a Poorly Connected World: Fast Rumor Spreading with No...
Keren Censor-Hillel, Bernhard Haeupler, Jonathan A. Kelner, Petar Maymounkov: Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance. CoRR abs/1104.2944...
View ArticleClik here to view.
Order Optimal Information Spreading Using Algebraic Gossip.
Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker: Order Optimal Information Spreading Using Algebraic Gossip. CoRR abs/1101.4372 (2011)
View ArticleClik here to view.
Fast Information Spreading in Graphs with Large Weak Conductance.
Keren Censor-Hillel, Hadas Shachnai: Fast Information Spreading in Graphs with Large Weak Conductance. SODA 2011: 440-448
View ArticleClik here to view.
Order optimal information spreading using algebraic gossip.
Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker: Order optimal information spreading using algebraic gossip. PODC 2011: 363-372
View ArticleClik here to view.
Optimal-time adaptive strong renaming, with applications to counting.
Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam: Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248
View Article
