Danny Hendler

	2009
26		Danny Hendler, Philipp Woelfel: Randomized mutual exclusion in O(log N / log log N) RMRs. PODC 2009: 26-35
25		Danny Hendler, Shay Kutten: Bounded-wait combining: constructing robust and high-throughput shared objects. Distributed Computing 21(6): 405-431 (2009)
24		Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov: The complexity of obstruction-free implementations. J. ACM 56(4): (2009)
23		Danny Hendler: Book review of synchronization algorithms and concurrent programming by Gadi Taubenfeld (Pearson/Prentice Hall, 2006). SIGACT News 40(1): 47-50 (2009)
	2008
22		Shlomi Dolev, Danny Hendler, Adi Suissa: CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory. PODC 2008: 125-134
21		Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight RMR lower bounds for mutual exclusion and other problems. PODC 2008: 447
20		Anat Bremler-Barr, David Hay, Danny Hendler, Boris Farber: Layered interval codes for tcam-based classification. SIGMETRICS 2008: 445-446
19		Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226
18		Danny Hendler, Nir Shavit: Solo-valency and the cost of coordination. Distributed Computing 21(1): 43-54 (2008)
	2007
17		Anat Bremler-Barr, Danny Hendler: Space-Efficient TCAM-Based Classification Using Gray Coding. INFOCOM 2007: 1388-1396
16		Wojciech M. Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel: Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. PODC 2007: 3-12
	2006
15		Danny Hendler, Shay Kutten: Constructing Shared Objects That Are Both Robust and High-Throughput. DISC 2006: 428-442
14		Wojciech M. Golab, Danny Hendler, Philipp Woelfel: An O(1) RMRs leader election algorithm. PODC 2006: 238-247
13		Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov: Synchronizing without locks is inherently expensive. PODC 2006: 300-307
12		Danny Hendler, Yossi Lev, Mark Moir, Nir Shavit: A dynamic-sized nonblocking work stealing deque. Distributed Computing 18(3): 189-207 (2006)
11		Faith Ellen Fich, Danny Hendler, Nir Shavit: On the inherent weakness of conditional primitives. Distributed Computing 18(4): 267-277 (2006)
	2005
10		Hagit Attiya, Danny Hendler: Time and Space Lower Bounds for Implementations Using k-CAS. DISC 2005: 169-183
9		Faith Ellen Fich, Danny Hendler, Nir Shavit: Linear Lower Bounds on Real-World Implementations of Concurrent Objects. FOCS 2005: 165-173
	2004
8		Danny Hendler, Yossi Lev, Nir Shavit: Dynamic Memory ABP Work-Stealing. DISC 2004: 188-200
7		Faith Ellen Fich, Danny Hendler, Nir Shavit: On the inherent weakness of conditional synchronization primitives. PODC 2004: 80-87
6		Danny Hendler, Nir Shavit, Lena Yerushalmi: A scalable lock-free stack algorithm. SPAA 2004: 206-215
	2003
5		Danny Hendler, Nir Shavit: Operation-valency and the cost of coordination. PODC 2003: 84-91
	2002
4		Danny Hendler, Nir Shavit: Non-blocking steal-half work queues. PODC 2002: 280-289
3		Danny Hendler, Nir Shavit: Work dealing. SPAA 2002: 164-172
	1995
2		Yehuda Afek, Danny Hendler: On the Comnplexity of Global Computation in the Presence of Link Failures: The General Case. Distributed Computing 8(3): 115-120 (1995)
	1993
1		Yehuda Afek, Danny Hendler: On the Complexity of Global Computation in the Presence of Link Failures: The General Case. ISTCS 1993: 160-166

Coauthor Index

1	Yehuda Afek	[1] [2]
2	Hagit Attiya (Chagit Attiya)	[10] [13] [19] [21] [24]
3	Anat Bremler-Barr	[17] [20]
4	Shlomi Dolev	[22]
5	Faith Ellen (Faith Ellen Fich, Faith E. Fich)	[7] [9] [11]
6	Boris Farber	[20]
7	Wojciech M. Golab	[14] [16]
8	Rachid Guerraoui	[13] [24]
9	Vassos Hadzilacos	[16]
10	David Hay	[20]
11	Shay Kutten	[15] [25]
12	Petr Kuznetsov (Petr Kouznetsov)	[13] [24]
13	Yossi Lev	[8] [12]
14	Mark Moir	[12]
15	Nir Shavit	[3] [4] [5] [6] [7] [8] [9] [11] [12] [18]
16	Adi Suissa	[22]
17	Philipp Woelfel	[14] [16] [19] [21] [26]
18	Lena Yerushalmi	[6]