| Publication | Date of Publication | Type |
|---|
Scalable and secure computation among strangers: message-competitive Byzantine protocols
| 2023-11-02 | Paper |
Communication costs in a geometric communication network
Theoretical Computer Science | 2023-10-17 | Paper |
A simpler minimum spanning tree verification algorithm
Lecture Notes in Computer Science | 2022-12-16 | Paper |
Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
| 2022-07-21 | Paper |
A resource-competitive jamming defense
Distributed Computing | 2022-02-15 | Paper |
Communication-efficient randomized consensus
Distributed Computing | 2022-02-15 | Paper |
Broadcast and minimum spanning tree with \(o(m)\) messages in the asynchronous CONGEST model
Distributed Computing | 2021-09-06 | Paper |
A deterministic distributed algorithm for exact weighted all-pairs shortest paths in \(\tilde{O}(n^{3/2})\) rounds
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
Faster agreement via a spectral method for detecting malicious behavior
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Dynamic graph connectivity in polylogarithmic worst case time
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Kinetic \(k\)-semi-Yao graph and its applications
Computational Geometry | 2018-11-19 | Paper |
Byzantine Agreement in Expected Polynomial Time
Journal of the ACM | 2018-08-02 | Paper |
Maintaining minimum spanning trees in dynamic graphs
Automata, Languages and Programming | 2018-07-04 | Paper |
Secure multi-party computation in large networks
Distributed Computing | 2017-08-31 | Paper |
Simultaneous secrecy and reliability amplification for a general channel model
Theory of Cryptography | 2016-12-21 | Paper |
A fully dynamic algorithm for maintaining the transitive closure
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
An optimal EREW PRAM algorithm for minimum spanning tree verification
Information Processing Letters | 2016-06-01 | Paper |
Construction and impromptu repair of an MST in a distributed network with \(o(m)\) communication
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Kinetic reverse \(k\)-nearest neighbor problem
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Conflict on a communication channel
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Choosing a random peer
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
A simple, faster method for kinetic proximity problems
Computational Geometry | 2015-05-12 | Paper |
Lower bound for scalable Byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Sleeping on the job
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Brief announcement: Breaking the \(O(nm)\) bit barrier, secure multiparty computation with a static adversary
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Fast asynchronous Byzantine agreement and leader election with full information
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Byzantine agreement in polynomial expected time (extended abstract)
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
Journal of the ACM | 2014-02-17 | Paper |
Lower bound for scalable Byzantine agreement
Distributed Computing | 2013-06-28 | Paper |
Kinetic and Stationary Point-Set Embeddability for Plane Graphs
Graph Drawing | 2013-04-03 | Paper |
Sleeping on the job: energy-efficient and robust broadcast for radio networks
Algorithmica | 2011-11-07 | Paper |
Scalable leader election
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764832 (Why is no real title available?)
| 2010-08-06 | Paper |
From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
Lecture Notes in Computer Science | 2009-11-19 | Paper |
Choosing a random peer in Chord
Algorithmica | 2007-11-28 | Paper |
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 2079368 (Why is no real title available?)
| 2004-07-28 | Paper |
A fully dynamic algorithm for maintaining the transitive closure
Journal of Computer and System Sciences | 2003-05-04 | Paper |
scientific article; zbMATH DE number 1798166 (Why is no real title available?)
| 2002-11-04 | Paper |
Maintaining minimum spanning forests in dynamic graphs
SIAM Journal on Computing | 2002-04-23 | Paper |
scientific article; zbMATH DE number 1701356 (Why is no real title available?)
| 2002-02-05 | Paper |
scientific article; zbMATH DE number 1263228 (Why is no real title available?)
| 2002-01-29 | Paper |
scientific article; zbMATH DE number 1306899 (Why is no real title available?)
| 2000-04-26 | Paper |
Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
Algorithmica | 1999-06-29 | Paper |
A simpler minimum spanning tree verification algorithm
Algorithmica | 1997-05-28 | Paper |
Limits on the power of parallel random access machines with weak forms of write conflict resolution
Journal of Computer and System Sciences | 1997-03-31 | Paper |
scientific article; zbMATH DE number 871930 (Why is no real title available?)
| 1996-10-08 | Paper |
scientific article; zbMATH DE number 512845 (Why is no real title available?)
| 1996-07-29 | Paper |
On boolean decision trees with faulty nodes
Random Structures \& Algorithms | 1994-09-19 | Paper |
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
SIAM Journal on Computing | 1993-05-17 | Paper |
An \(\Omega{} (n^{5/4})\) lower bound on the randomized complexity of graph properties
Combinatorica | 1992-06-27 | Paper |
A lower bound for the recognition of digraph properties
Combinatorica | 1990-01-01 | Paper |
