Seth Gilbert
From MaRDI portal
Person:660992
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 |
|---|---|---|
| Contention resolution with message deadlines Distributed Computing | 2026-01-20 | Paper |
| Jamming-resistant backoff with polylogarithmic sending and listening cost SIAM Journal on Computing | 2025-10-21 | Paper |
| Smoothed analysis of information spreading in dynamic networks Journal of the ACM | 2025-08-21 | Paper |
| Robust overlays meet blockchains: on handling high churn and catastrophic failures Theoretical Computer Science | 2025-08-01 | Paper |
| Fully energy-efficient randomized backoff: slow feedback loops yield fast contention resolution | 2025-06-13 | Paper |
| All Byzantine agreement problems are expensive | 2025-06-13 | Paper |
| DARE to agree: Byzantine agreement with optimal resilience and adaptive communication | 2025-06-13 | Paper |
| How to allocate tasks asynchronously | 2025-05-05 | Paper |
| Byzantine consensus is \(\Theta(n^2)\): the Dolev-Reischuk bound is tight even in partial synchrony! Distributed Computing | 2024-07-26 | Paper |
| Contention Resolution with Predictions Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| On the Validity of Consensus Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing | 2024-03-26 | Paper |
| Brief announcement: Polygraph: accountable Byzantine agreement | 2023-11-02 | Paper |
| Leader election in well-connected graphs Algorithmica | 2023-04-11 | Paper |
| Parallel finger search structures | 2023-02-03 | Paper |
| On bioelectric algorithms | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7561455 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561642 (Why is no real title available?) (available as arXiv preprint) | 2022-07-21 | Paper |
| Latency, capacity, and distributed minimum spanning trees Journal of Computer and System Sciences | 2022-03-29 | Paper |
| DConstructor: Efficient and Robust Network Construction with Polylogarithmic Overhead Proceedings of the 39th Symposium on Principles of Distributed Computing | 2021-03-15 | Paper |
| Confidential gossip Distributed Computing | 2020-10-16 | Paper |
| On simple back-off in unreliable radio networks Theoretical Computer Science | 2020-01-16 | Paper |
| On simple back-off in unreliable radio networks Theoretical Computer Science | 2020-01-16 | Paper |
| Contention resolution on a fading channel Distributed Computing | 2019-11-27 | Paper |
| Leader election in well-connected graphs Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| Dynamic Task Allocation in Asynchronous Shared Memory Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| A new approach to incremental topological ordering | 2019-05-06 | Paper |
| Scaling exponential backoff: constant throughput, polylogarithmic channel-access attempts, and robustness Journal of the ACM | 2019-02-25 | Paper |
| Cost-oblivious storage reallocation ACM Transactions on Algorithms | 2018-11-05 | Paper |
| A new approach to incremental cycle detection and related problems ACM Transactions on Algorithms | 2018-10-30 | Paper |
| The computational power of beeps (available as arXiv preprint) | 2018-08-24 | Paper |
| Smoothed analysis of dynamic networks Lecture Notes in Computer Science | 2018-08-24 | Paper |
| Smoothed analysis of dynamic networks Distributed Computing | 2018-08-13 | Paper |
| How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| File maintenance: when in doubt, change the layout! Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Symmetry breaking with noisy processes Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Communication primitives in cognitive radio networks Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Brief announcement: Gossiping with latencies Proceedings of the ACM Symposium on Principles of Distributed Computing | 2017-10-11 | Paper |
| Who are you? Secure identities in single hop ad hoc networks Distributed Computing | 2017-10-06 | Paper |
| Bounds for Blind Rate Adaptation | 2017-09-29 | Paper |
| Contention resolution on a fading channel Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| On Differentially Private Online Collaborative Recommendation Systems Information Security and Cryptology - ICISC 2015 | 2016-05-19 | Paper |
| Efficient communication in cognitive radio networks Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
| Reconfigurable distributed storage for dynamic networks Journal of Parallel and Distributed Computing | 2015-12-18 | Paper |
| Reallocation problems in scheduling Algorithmica | 2015-10-19 | Paper |
| Optimal-time adaptive strong renaming, with applications to counting Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Structuring unreliable radio networks Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
| Consensus and collision detectors in wireless ad hoc networks Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| Maximal independent sets in multichannel radio networks Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Meeting the deadline, on the complexity of fault-tolerant \textsc{Continuous Gossip} Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
| Secure communication over radio channels Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
| On the complexity of asynchronous gossip Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
| Virtual infrastructure for collision-prone wireless networks Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
| Leader election in shared spectrum radio networks Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| Aggregation in dynamic networks Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| Making evildoers pay, resource-competitive broadcast in sensor networks Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| Broadcast in the Ad Hoc SINR Model Lecture Notes in Computer Science | 2014-09-29 | Paper |
| Extensible encoding of type hierarchies Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2014-09-12 | Paper |
| Tight bounds for asynchronous renaming Journal of the ACM | 2014-09-12 | Paper |
| The Complexity of Renaming 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| Mutual Exclusion with O(log^2 Log n) Amortized Work 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
| The wireless synchronization problem Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Structuring unreliable radio networks Distributed Computing | 2014-07-11 | Paper |
| scientific article; zbMATH DE number 6297761 (Why is no real title available?) | 2014-05-22 | Paper |
| Asynchronous gossip Journal of the ACM | 2014-02-17 | Paper |
| Consensus and collision detectors in radio networks Distributed Computing | 2013-06-28 | Paper |
| GeoQuorums: implementing atomic memory in mobile ad hoc networks Distributed Computing | 2013-06-07 | Paper |
| Generating fast indulgent algorithms Theory of Computing Systems | 2012-12-07 | Paper |
| Of choices, failures and asynchrony: the many faces of set agreement Algorithmica | 2012-04-26 | Paper |
| \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks Distributed Computing | 2012-02-06 | Paper |
| Meeting the deadline: on the complexity of fault-tolerant continuous gossip Distributed Computing | 2012-02-06 | Paper |
| Leveraging channel diversity to gain efficiency and robustness for wireless broadcast Lecture Notes in Computer Science | 2011-10-28 | Paper |
| Fast randomized test-and-set and renaming Lecture Notes in Computer Science | 2010-09-10 | Paper |
| Trusted computing for fault-prone wireless networks Lecture Notes in Computer Science | 2010-09-10 | Paper |
| How efficient can gossip be? (On the cost of resilient information exchange) Automata, Languages and Programming | 2010-09-07 | Paper |
| Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement Algorithms and Computation | 2009-12-17 | Paper |
| Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks Theoretical Computer Science | 2009-03-02 | Paper |
| How to Solve Consensus in the Smallest Window of Synchrony Lecture Notes in Computer Science | 2008-11-20 | Paper |
| Gossiping in a Multi-channel Radio Network Lecture Notes in Computer Science | 2008-09-02 | Paper |
| On the Message Complexity of Indulgent Consensus Lecture Notes in Computer Science | 2008-09-02 | Paper |
| Contention Resolution with Heterogeneous Job Sizes Lecture Notes in Computer Science | 2008-03-11 | Paper |
| Principles of Distributed Systems Lecture Notes in Computer Science | 2005-12-15 | Paper |
Research outcomes over time
This page was built for person: Seth Gilbert
