Keren Censor-Hillel

Keren Censor

	2012
21		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. STOC 2012: 961-970
20		James Aspnes, Hagit Attiya, Keren Censor-Hillel: Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1): 2 (2012)
	2011
19		Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam: Optimal-time adaptive strong renaming, with applications to counting. PODC 2011: 239-248
18		Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker: Order optimal information spreading using algebraic gossip. PODC 2011: 363-372
17		Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Nancy A. Lynch, Calvin C. Newport: Structuring unreliable radio networks. PODC 2011: 79-88
16		Keren Censor-Hillel, Hadas Shachnai: Fast Information Spreading in Graphs with Large Weak Conductance. SODA 2011: 440-448
15		Chen Avin, Michael Borokhovich, Keren Censor-Hillel, Zvi Lotker: Order Optimal Information Spreading Using Algebraic Gossip CoRR abs/1101.4372: (2011)
14		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: (2011)
	2010
13		Keren Censor-Hillel, Hadas Shachnai: Partial information spreading with application to distributed maximum coverage. PODC 2010: 161-170
12		Keren Censor-Hillel: Multi-sided shared coins and randomized set-agreement. SPAA 2010: 60-68
11		James Aspnes, Keren Censor: Approximate shared-memory counting despite a strong adversary. ACM Transactions on Algorithms 6(2): (2010)
10		James Aspnes, Hagit Attiya, Keren Censor: Combining shared-coin algorithms. J. Parallel Distrib. Comput. 70(3): 317-322 (2010)
9		Hagit Attiya, Keren Censor-Hillel: Lower Bounds for Randomized Consensus under a Weak Adversary. SIAM J. Comput. 39(8): 3885-3904 (2010)
	2009
8		James Aspnes, Hagit Attiya, Keren Censor: Max registers, counters, and monotone circuits. PODC 2009: 36-45
7		James Aspnes, Keren Censor: Approximate shared-memory counting despite a strong adversary. SODA 2009: 441-450
6		Keren Censor, Christoph Lenzen: A review of PODC 2009. SIGACT News 40(4): 71-74 (2009)
	2008
5		Hagit Attiya, Keren Censor: Lower bounds for randomized consensus under a weak adversary. PODC 2008: 315-324
4		James Aspnes, Hagit Attiya, Keren Censor: Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334
3		Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. J. ACM 55(5): (2008)
	2007
2		Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. STOC 2007: 155-164
	2006
1		Keren Censor, Tuvi Etzion: The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels. IEEE Transactions on Information Theory 52(11): 5128-5140 (2006)

Coauthor Index

1	Dan Alistarh	[19]
2	James Aspnes	[4] [7] [8] [10] [11] [19] [20]
3	Hagit Attiya (Chagit Attiya)	[2] [3] [4] [5] [8] [9] [10] [20]
4	Chen Avin	[15] [18]
5	Michael Borokhovich	[15] [18]
6	Tuvi Etzion	[1]
7	Seth Gilbert	[17] [19]
8	Bernhard Haeupler	[14] [21]
9	Jonathan A. Kelner	[14] [21]
10	Fabian Kuhn	[17]
11	Christoph Lenzen	[6]
12	Zvi Lotker	[15] [18]
13	Nancy A. Lynch	[17]
14	Petar Maymounkov	[14] [21]
15	Calvin C. Newport	[17]
16	Hadas Shachnai	[13] [16]
17	Morteza Zadimoghaddam	[19]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page