Faith Ellen
From MaRDI portal
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 |
|---|---|---|
| Revisionist simulations: a new approach to proving space lower bounds SIAM Journal on Computing | 2024-08-06 | Paper |
| Reductions and Extension-Based Proofs Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7774287 (Why is no real title available?) | 2023-12-08 | Paper |
| Why Extension-Based Proofs Fail SIAM Journal on Computing | 2023-08-10 | Paper |
| Wait-free approximate agreement on graphs Theoretical Computer Science | 2023-02-13 | Paper |
| scientific article; zbMATH DE number 7559135 (Why is no real title available?) | 2022-07-18 | Paper |
| Wait-free approximate agreement on graphs Structural Information and Communication Complexity | 2022-03-22 | Paper |
| Space lower bounds for the signal detection problem Theory of Computing Systems | 2021-08-05 | Paper |
| Brief Announcement: Why Extension-Based Proofs Fail Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Randomized distributed online algorithms against adaptive offline adversaries Information Processing Letters | 2020-08-04 | Paper |
| A complexity-based classification for multiprocessor synchronization Distributed Computing | 2020-04-23 | Paper |
| Why extension-based proofs fail Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Revisionist simulations: a new approach to proving space lower bounds Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Tight bounds for restricted grid scheduling International Journal of Foundations of Computer Science | 2019-06-21 | Paper |
| A little advice can be very helpful | 2019-05-10 | Paper |
| Erratum to: ``Limited-use atomic snapshots with polylogarithmic step complexity Journal of the ACM | 2019-02-25 | Paper |
| Simulating a shared register in an asynchronous system that never stops changing (extended abstract) (available as arXiv preprint) | 2018-08-24 | Paper |
| Impossibility results for distributed computing Synthesis Lectures on Distributed Computing Theory | 2018-06-19 | Paper |
| Deterministic objects: life beyond consensus Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| A complexity-based hierarchy for multiprocessor synchronization (extended abstract) Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Atomic snapshots from small registers | 2017-09-29 | Paper |
| Universal constructions that ensure disjoint-access parallelism and wait-freedom Distributed Computing | 2016-10-17 | Paper |
| Upper and lower bounds on the power of advice SIAM Journal on Computing | 2016-08-26 | Paper |
| Limitations of highly-available eventually-consistent data stores Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| The amortized complexity of non-blocking binary search trees Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| Limited-use atomic snapshots with polylogarithmic step complexity Journal of the ACM | 2015-08-14 | Paper |
| Pragmatic primitives for non-blocking data structures Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Tight bounds for adopt-commit objects Theory of Computing Systems | 2015-01-19 | Paper |
| Universal constructions that ensure disjoint-access parallelism and wait-freedom Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| Faster than optimal snapshots (for a while), preliminary version Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| SNZI, scalable nonzero indicators Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| Bounds for scheduling jobs on grid processors Lecture Notes in Computer Science | 2013-09-13 | Paper |
| The space complexity of unbounded timestamps Distributed Computing | 2013-07-04 | Paper |
| Efficient fetch-and-increment Lecture Notes in Computer Science | 2013-03-13 | Paper |
| On the inherent sequentiality of concurrent objects SIAM Journal on Computing | 2012-09-12 | Paper |
| The complexity of updating snapshot objects Journal of Parallel and Distributed Computing | 2012-02-14 | Paper |
| Fully-adaptive algorithms for long-lived renaming Distributed Computing | 2012-02-06 | Paper |
| Time lower bounds for implementations of multi-writer snapshots Journal of the ACM | 2008-12-21 | Paper |
| Fully-Adaptive Algorithms for Long-Lived Renaming Lecture Notes in Computer Science | 2008-09-09 | Paper |
| The Space Complexity of Unbounded Timestamps Lecture Notes in Computer Science | 2008-09-02 | Paper |
Research outcomes over time
This page was built for person: Faith Ellen
