Search the dblp DataBase
Danny Hendler :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Faith Ellen Fich , Danny Hendler , Nir Shavit Linear Lower Bounds on Real-World Implementations of Concurrent Objects. [Citation Graph (0, 0)][DBLP ] FOCS, 2005, pp:165-173 [Conf ] Yehuda Afek , Danny Hendler On the Complexity of Global Computation in the Presence of Link Failures: The General Case. [Citation Graph (0, 0)][DBLP ] ISTCS, 1993, pp:160-166 [Conf ] Hagit Attiya , Rachid Guerraoui , Danny Hendler , Petr Kouznetsov Synchronizing without locks is inherently expensive. [Citation Graph (0, 0)][DBLP ] PODC, 2006, pp:300-307 [Conf ] Faith Ellen Fich , Danny Hendler , Nir Shavit On the inherent weakness of conditional synchronization primitives. [Citation Graph (0, 0)][DBLP ] PODC, 2004, pp:80-87 [Conf ] Wojciech M. Golab , Danny Hendler , Philipp Woelfel An O (1) RMRs leader election algorithm. [Citation Graph (0, 0)][DBLP ] PODC, 2006, pp:238-247 [Conf ] Danny Hendler , Nir Shavit Non-blocking steal-half work queues. [Citation Graph (0, 0)][DBLP ] PODC, 2002, pp:280-289 [Conf ] Danny Hendler , Nir Shavit Operation-valency and the cost of coordination. [Citation Graph (0, 0)][DBLP ] PODC, 2003, pp:84-91 [Conf ] Danny Hendler , Nir Shavit Work dealing. [Citation Graph (0, 0)][DBLP ] SPAA, 2002, pp:164-172 [Conf ] Danny Hendler , Nir Shavit , Lena Yerushalmi A scalable lock-free stack algorithm. [Citation Graph (0, 0)][DBLP ] SPAA, 2004, pp:206-215 [Conf ] Hagit Attiya , Danny Hendler Time and Space Lower Bounds for Implementations Using k -CAS. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:169-183 [Conf ] Danny Hendler , Yossi Lev , Nir Shavit Dynamic Memory ABP Work-Stealing. [Citation Graph (0, 0)][DBLP ] DISC, 2004, pp:188-200 [Conf ] Danny Hendler , Shay Kutten Constructing Shared Objects That Are Both Robust and High-Throughput. [Citation Graph (0, 0)][DBLP ] DISC, 2006, pp:428-442 [Conf ] Yehuda Afek , Danny Hendler On the Comnplexity of Global Computation in the Presence of Link Failures: The General Case. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 1995, v:8, n:3, pp:115-120 [Journal ] Faith Ellen Fich , Danny Hendler , Nir Shavit On the inherent weakness of conditional primitives. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2006, v:18, n:4, pp:267-277 [Journal ] Danny Hendler , Yossi Lev , Mark Moir , Nir Shavit A dynamic-sized nonblocking work stealing deque. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2006, v:18, n:3, pp:189-207 [Journal ] Anat Bremler-Barr , Danny Hendler Space-Efficient TCAM-Based Classification Using Gray Coding. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2007, pp:1388-1396 [Conf ] Wojciech M. Golab , Vassos Hadzilacos , Danny Hendler , Philipp Woelfel Constant-RMR implementations of CAS and other synchronization primitives using read and write operations. [Citation Graph (0, 0)][DBLP ] PODC, 2007, pp:3-12 [Conf ] Layered Interval Codes for TCAM-Based Classification. [Citation Graph (, )][DBLP ] PEDS: A Parallel Error Detection Scheme for TCAM Devices. [Citation Graph (, )][DBLP ] On the Impact of Serializing Contention Management on STM Performance. [Citation Graph (, )][DBLP ] CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory. [Citation Graph (, )][DBLP ] Tight RMR lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP ] Randomized mutual exclusion in O(log N / log log N) RMRs. [Citation Graph (, )][DBLP ] Adaptive randomized mutual exclusion in sub-logarithmic expected time. [Citation Graph (, )][DBLP ] Scheduling support for transactional memory contention management. [Citation Graph (, )][DBLP ] Layered interval codes for tcam-based classification. [Citation Graph (, )][DBLP ] Flat combining and the synchronization-parallelism tradeoff. [Citation Graph (, )][DBLP ] Tight rmr lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP ] Scalable Flat-Combining Based Synchronous Queues. [Citation Graph (, )][DBLP ] Solo-valency and the cost of coordination. [Citation Graph (, )][DBLP ] Bounded-wait combining: constructing robust and high-throughput shared objects. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.004secs