Danny Hendler
From MaRDI portal
Person:661044
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| scientific article; zbMATH DE number 7832770 (Why is no real title available?) | 2024-04-15 | Paper |
| Long-lived counters with polylogarithmic amortized step complexity Distributed Computing | 2023-03-14 | Paper |
| Long-lived counters with polylogarithmic amortized step complexity | 2023-02-03 | Paper |
| Upper and Lower Bounds on the Space Complexity of Detectable Objects Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Long-Lived Snapshots with Polylogarithmic Amortized Step Complexity Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| On the complexity of global computation in the presence of link failures: the general case Distributed Computing | 2020-11-30 | Paper |
| Recoverable mutual exclusion under system-wide failures Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Nesting-safe recoverable linearizability: modular constructions for non-volatile memory Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Separating Lock-Freedom from Wait-Freedom Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Upper bounds for multi-level multi-server paging Information Processing Letters | 2018-12-05 | Paper |
| Lower bound on the step complexity of anonymous binary consensus | 2018-08-16 | Paper |
| Recoverable mutual exclusion in sub-logarithmic time Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Nontrivial and universal helping for wait-free queues and stacks | 2017-09-29 | Paper |
| On the Complexity of Reader-Writer Locks Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Space-Efficient TCAM-Based Classification Using Gray Coding IEEE Transactions on Computers | 2017-07-12 | Paper |
| Lower bounds for restricted-use objects SIAM Journal on Computing | 2016-06-16 | Paper |
| Trading fences with RMRs and separating memory models Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| The price of being adaptive Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| The complexity of obstruction-free implementations Journal of the ACM | 2015-11-11 | Paper |
| Operation-valency and the cost of coordination Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
| Complexity tradeoffs for read and update operations Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| On the inherent weakness of conditional synchronization primitives Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
| Synchronizing without locks is inherently expensive Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| An \(O(1)\) RMRs leader election algorithm Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Adaptive randomized mutual exclusion in sub-logarithmic expected time Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
| An \(O(1)\)-barriers optimal RMRs mutual exclusion algorithm (extended abstract) Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Non-blocking steal-half work queues Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
| Randomized mutual exclusion in \(\mathcal{O}(\log N / \log \log N)\) RMRs Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Laws of order, expensive synchronization in concurrent algorithms cannot be eliminated Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-04-10 | Paper |
| Constant-RMR implementations of CAS and other synchronization primitives using read and write operations Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| Bounded-wait combining: constructing robust and high-throughput shared objects Distributed Computing | 2013-06-28 | Paper |
| Solo-valency and the cost of coordination Distributed Computing | 2013-06-28 | Paper |
| On the inherent weakness of conditional primitives Distributed Computing | 2013-06-13 | Paper |
| A dynamic-sized nonblocking work stealing deque Distributed Computing | 2013-06-07 | Paper |
| RMR-efficient implementations of comparison primitives using read and write operations Distributed Computing | 2013-02-04 | Paper |
| On the inherent sequentiality of concurrent objects SIAM Journal on Computing | 2012-09-12 | Paper |
| A scalable lock-free stack algorithm Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
| Randomized mutual exclusion with sub-logarithmic RMR-complexity Distributed Computing | 2012-02-06 | Paper |
| An \(O(1)\) RMRs leader election algorithm SIAM Journal on Computing | 2011-04-04 | Paper |
| scientific article; zbMATH DE number 5485533 (Why is no real title available?) | 2009-01-05 | Paper |
| Constructing Shared Objects That Are Both Robust and High-Throughput Lecture Notes in Computer Science | 2008-09-09 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2006-11-01 | Paper |
Research outcomes over time
This page was built for person: Danny Hendler
