publication venue for
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement. 285:104869-104869. 2022
- Improved time bounds for linearizable implementations of abstract data types. 263:1-30. 2018
- Tight lower bounds for certain parameterized NP-hard problems. 201:216-231. 2005
- ON THE STRUCTURE OF PARAMETERIZED PROBLEMS IN NP. 123:38-49. 1995
- Optimal Amortized Distributed Consensus. 120:93-100. 1995
- CONNECTION MANAGEMENT WITHOUT RETAINING INFORMATION. 123:155-171. 1995
- Modular construction of a Byzantine agreement protocol with optimal message bit complexity. 97:61-85. 1992
- A new fault-tolerant algorithm for clock synchronization. 77:1-36. 1988
- Simulating synchronous processors. 74:159-171. 1987
- On zeroing the output of a linear system. 20:135-142. 1972
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree 2017