| Publication | Date of Publication | Type |
|---|
| Enabling robust and efficient distributed computation in dynamic peer-to-peer networks | 2025-08-05 | Paper |
| Bruisable onions: anonymous communication in the asynchronous model | 2025-07-23 | Paper |
scientific article; zbMATH DE number 7706041 (Why is no real title available?)
(available as arXiv preprint) | 2023-07-03 | Paper |
Balanced Allocation: Patience Is Not a Virtue
SIAM Journal on Computing | 2023-04-04 | Paper |
Reducing polarization and increasing diverse navigability in graphs by inserting edges and swapping edge weights
Data Mining and Knowledge Discovery | 2023-01-04 | Paper |
Safe and efficient traffic laws for mobile robots
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Stochastic analysis of dynamic processes
Fundamentals of Computation Theory | 2022-12-09 | Paper |
| Differentially Mutated Subnetworks Discovery | 2022-07-18 | Paper |
Practical and provably secure onion routing
(available as arXiv preprint) | 2021-07-28 | Paper |
Bandits and Experts in Metric Spaces
Journal of the ACM | 2020-02-11 | Paper |
Near-perfect token distribution
Automata, Languages and Programming | 2019-12-04 | Paper |
Efficient approximation for restricted biclique cover problems
Algorithms | 2019-10-30 | Paper |
Optimizing static and adaptive probing schedules for rapid event detection
Theoretical Computer Science | 2019-06-25 | Paper |
| Towards robust and efficient computation in dynamic peer-to-peer networks | 2019-05-10 | Paper |
On the theory of interconnection networks for parallel computers
Automata, Languages and Programming | 2019-04-29 | Paper |
Balanced allocation: patience is not a virtue
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A wait-free sorting algorithm
Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
Tolerating linear number of faults in networks of bounded degree
Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
| Stochastic analysis of the \(k\)-server problem on the circle | 2017-02-10 | Paper |
| Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis | 2016-11-17 | Paper |
Algorithms on evolving graphs
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Static and dynamic evaluation of QoS properties
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Efficient routing in all-optical networks
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Balanced allocations (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
On the sample complexity of cancer pathways identification
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Optimizing static and adaptive probing schedules for rapid event detection
Lecture Notes in Computer Science | 2016-02-05 | Paper |
Tight bounds on information dissemination in sparse mobile networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Entropy-based bounds for online algorithms
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Distributed agreement in dynamic peer-to-peer networks
Journal of Computer and System Sciences | 2015-07-13 | Paper |
How much can hardware help routing?
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Fast distributed PageRank computation
Theoretical Computer Science | 2014-12-02 | Paper |
The Melbourne shuffle: improving oblivious storage in the cloud
Automata, Languages, and Programming | 2014-07-01 | Paper |
An efficient rigorous approach for identifying statistically significant frequent itemsets
Journal of the ACM | 2014-02-17 | Paper |
Sorting and selection on dynamic data
Theoretical Computer Science | 2011-06-07 | Paper |
Online stochastic optimization under time constraints
Annals of Operations Research | 2010-10-04 | Paper |
The hiring problem and Lake Wobegon strategies
SIAM Journal on Computing | 2010-09-06 | Paper |
Sort Me If You Can: How to Sort Dynamic Data
Automata, Languages and Programming | 2009-07-14 | Paper |
| scientific article; zbMATH DE number 5485582 (Why is no real title available?) | 2009-01-05 | Paper |
Commitment under uncertainty: Two-stage stochastic matching problems
Theoretical Computer Science | 2008-12-12 | Paper |
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
Automata, Languages and Programming | 2007-11-28 | Paper |
Using PageRank to Characterize Web Structure
Internet Mathematics | 2007-04-05 | Paper |
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input
SIAM Journal on Computing | 2005-09-16 | Paper |
Steady state analysis of balanced‐allocation routing
Random Structures & Algorithms | 2005-08-29 | Paper |
| Probability and Computing | 2005-08-05 | Paper |
A simple and deterministic competitive algorithm for online facility location
Information and Computation | 2005-01-11 | Paper |
Efficient communication in an ad-hoc network
Journal of Algorithms | 2004-11-23 | Paper |
| scientific article; zbMATH DE number 2089988 (Why is no real title available?) | 2004-08-12 | Paper |
On-line routing of random calls in networks
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2003-07-08 | Paper |
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM | 2003-06-25 | Paper |
A theory of wormhole routing in parallel computers
IEEE Transactions on Computers | 2003-06-25 | Paper |
A wait-free sorting algorithm
Theory of Computing Systems | 2002-09-29 | Paper |
| Can entropy characterize performance of online algorithms? | 2002-03-24 | Paper |
| scientific article; zbMATH DE number 1256694 (Why is no real title available?) | 2002-01-16 | Paper |
| scientific article; zbMATH DE number 1263198 (Why is no real title available?) | 2001-08-27 | Paper |
| scientific article; zbMATH DE number 1559568 (Why is no real title available?) | 2001-02-28 | Paper |
Tolerating a linear number of faults in networks of bounded degree
Information and Computation | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1380616 (Why is no real title available?) | 1999-12-19 | Paper |
Balanced Allocations
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1256752 (Why is no real title available?) | 1999-05-18 | Paper |
Reliable Fault Diagnosis with Few Tests
Combinatorics, Probability and Computing | 1999-02-02 | Paper |
A steady state analysis of diffracting trees
Theory of Computing Systems | 1999-01-11 | Paper |
Stochastic Contention Resolution With Short Delays
SIAM Journal on Computing | 1998-09-21 | Paper |
Optimal Construction of Edge-Disjoint Paths in Random Graphs
SIAM Journal on Computing | 1998-09-21 | Paper |
How much can hardware help routing?
Journal of the ACM | 1998-02-17 | Paper |
| scientific article; zbMATH DE number 1003293 (Why is no real title available?) | 1997-08-03 | Paper |
The worst-case running time of the random simplex algorithm is exponential in the height
Information Processing Letters | 1997-02-27 | Paper |
| scientific article; zbMATH DE number 871922 (Why is no real title available?) | 1996-12-11 | Paper |
Existence and Construction of Edge-Disjoint Paths on Expander Graphs
SIAM Journal on Computing | 1995-03-09 | Paper |
| scientific article; zbMATH DE number 437557 (Why is no real title available?) | 1994-11-29 | Paper |
Computing with Noisy Information
SIAM Journal on Computing | 1994-11-29 | Paper |
An <i>O</i> (log <i>N</i> ) deterministic packet-routing scheme
Journal of the ACM | 1994-11-13 | Paper |
Near‐perfect token distribution
Random Structures & Algorithms | 1994-11-08 | Paper |
Trading Space for Time in Undirected <i>s</i>-<i>t</i> Connectivity
SIAM Journal on Computing | 1994-06-16 | Paper |
| scientific article; zbMATH DE number 432843 (Why is no real title available?) | 1993-10-20 | Paper |
Fault Tolerant Sorting Networks
SIAM Journal on Discrete Mathematics | 1992-06-27 | Paper |
A trade-off between space and efficiency for routing tables
Journal of the ACM | 1992-06-25 | Paper |
Randomized broadcast in networks
Random Structures & Algorithms | 1990-01-01 | Paper |
A Time-Randomness Trade-Off for Oblivious Routing
SIAM Journal on Computing | 1990-01-01 | Paper |
The Token Distribution Problem
SIAM Journal on Computing | 1989-01-01 | Paper |
Constructing disjoint paths on expander graphs
Combinatorica | 1989-01-01 | Paper |
Fault Tolerance in Networks of Bounded Degree
SIAM Journal on Computing | 1988-01-01 | Paper |
A tradeoff between search and update time for the implicit dictionary problem
Theoretical Computer Science | 1988-01-01 | Paper |
Parallel hashing
Journal of the ACM | 1988-01-01 | Paper |
The complexity of parallel search
Journal of Computer and System Sciences | 1988-01-01 | Paper |
How to share memory in a distributed system
Journal of the ACM | 1987-01-01 | Paper |
The generalized packet routing problem
Theoretical Computer Science | 1987-01-01 | Paper |
A Time-Space Tradeoff for Element Distinctness
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3980480 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3956454 (Why is no real title available?) | 1986-01-01 | Paper |
Constructing a perfect matching is in random NC
Combinatorica | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3900151 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3883622 (Why is no real title available?) | 1985-01-01 | Paper |
Random hypergraph coloring algorithms and the weak chromatic number
Journal of Graph Theory | 1985-01-01 | Paper |
Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
Journal of Algorithms | 1984-01-01 | Paper |
Efficient Schemes for Parallel Communication
Journal of the ACM | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3825200 (Why is no real title available?) | 1983-01-01 | Paper |
