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 |
|---|---|---|
| Self-stabilizing MIS computation in the beeping model Distributed Computing | 2026-02-25 | Paper |
| Randomized mutual exclusion with constant amortized RMR complexity on the DSM | 2025-08-05 | Paper |
| Faster randomized repeated choice and DCAS | 2025-06-13 | Paper |
| Brief announcement: Self-stabilizing MIS computation in the beeping model | 2025-06-13 | Paper |
| Luby's MIS algorithms made self-stabilizing Information Processing Letters | 2025-01-14 | Paper |
| Search via Parallel Lévy Walks on Z2 Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Distributed Self-Stabilizing MIS with Few States and Weak Communication Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| scientific article; zbMATH DE number 7788467 (Why is no real title available?) | 2024-01-15 | Paper |
| Expanders via local edge flips in quasilinear time Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Efficient randomized DCAS Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Spread of information and diseases via random walks in sparse graphs | 2023-11-02 | Paper |
| Brief Announcement: Optimal Time and Space Leader Election in Population Protocols Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| How to Spread a Rumor Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
| Optimal time and space leader election in population protocols Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| An Improved Bound for Random Binary Search Trees with Concurrent Insertions | 2020-08-05 | Paper |
| Efficient randomized test-and-set implementations Distributed Computing | 2019-11-27 | Paper |
| Tight bounds for rumor spreading with vertex expansion Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| Rumor spreading and vertex expansion | 2019-05-10 | Paper |
| Rumor spreading and conductance Journal of the ACM | 2018-12-06 | Paper |
| Tight Bounds on Vertex Connectivity Under Sampling ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Privacy-conscious information diffusion in social networks | 2018-08-24 | Paper |
| Tight bounds for coalescing-branching random walks on regular graphs | 2018-03-15 | Paper |
| Bounds on the Voter Model in Dynamic Networks (available as arXiv preprint) | 2017-12-19 | Paper |
| Efficient plurality consensus, or: the benefits of cleaning up from time to time | 2017-12-19 | Paper |
| Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Tight bounds on vertex connectivity under vertex sampling Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| scientific article; zbMATH DE number 6783407 (Why is no real title available?) | 2017-09-29 | Paper |
| How asynchrony affects rumor spreading time Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Amplifiers and Suppressors of Selection for the Moran Process on Undirected Graphs | 2016-11-04 | Paper |
| Test-and-set in optimal space Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
| A scheme for load balancing in heterogenous distributed hash tables Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Randomized loose renaming in \(O(\log \log n)\) time Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Greedy routing in small-world networks with power-law degrees Distributed Computing | 2015-02-23 | Paper |
| Brief announcement, a tight RMR lower bound for randomized mutual exclusion Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| On the time and space complexity of randomized test-and-set Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| On the searchability of small-world networks with arbitrary underlying structure Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
| The effect of power-law degrees on the navigability of small worlds (extended abstract) Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Randomized Rumor Spreading in Dynamic Graphs Automata, Languages, and Programming | 2014-07-01 | Paper |
| Optimal path search in small worlds, dimension matters Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| A tight RMR lower bound for randomized mutual exclusion Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| On the complexity of greedy routing in ring-based peer-to-peer networks Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
| Low randomness rumor spreading via hashing | 2012-08-23 | Paper |
| Tight bounds for rumor spreading in graphs of a given conductance | 2012-01-23 | Paper |
Research outcomes over time
This page was built for person: George Giakkoupis
