The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Danny Hendler: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. Danny Hendler, Nir Shavit
    Non-blocking steal-half work queues. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:280-289 [Conf]
  7. Danny Hendler, Nir Shavit
    Operation-valency and the cost of coordination. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:84-91 [Conf]
  8. Danny Hendler, Nir Shavit
    Work dealing. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:164-172 [Conf]
  9. Danny Hendler, Nir Shavit, Lena Yerushalmi
    A scalable lock-free stack algorithm. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:206-215 [Conf]
  10. 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]
  11. Danny Hendler, Yossi Lev, Nir Shavit
    Dynamic Memory ABP Work-Stealing. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:188-200 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. Anat Bremler-Barr, Danny Hendler
    Space-Efficient TCAM-Based Classification Using Gray Coding. [Citation Graph (0, 0)][DBLP]
    INFOCOM, 2007, pp:1388-1396 [Conf]
  17. 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]

  18. Layered Interval Codes for TCAM-Based Classification. [Citation Graph (, )][DBLP]


  19. PEDS: A Parallel Error Detection Scheme for TCAM Devices. [Citation Graph (, )][DBLP]


  20. On the Impact of Serializing Contention Management on STM Performance. [Citation Graph (, )][DBLP]


  21. CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory. [Citation Graph (, )][DBLP]


  22. Tight RMR lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP]


  23. Randomized mutual exclusion in O(log N / log log N) RMRs. [Citation Graph (, )][DBLP]


  24. Adaptive randomized mutual exclusion in sub-logarithmic expected time. [Citation Graph (, )][DBLP]


  25. Scheduling support for transactional memory contention management. [Citation Graph (, )][DBLP]


  26. Layered interval codes for tcam-based classification. [Citation Graph (, )][DBLP]


  27. Flat combining and the synchronization-parallelism tradeoff. [Citation Graph (, )][DBLP]


  28. Tight rmr lower bounds for mutual exclusion and other problems. [Citation Graph (, )][DBLP]


  29. Scalable Flat-Combining Based Synchronous Queues. [Citation Graph (, )][DBLP]


  30. Solo-valency and the cost of coordination. [Citation Graph (, )][DBLP]


  31. Bounded-wait combining: constructing robust and high-throughput shared objects. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002