| Publication | Date of Publication | Type |
|---|
Robust Algorithms for TSP and Steiner Tree
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Universal Algorithms for Clustering Problems
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Foundations of Differentially Oblivious Algorithms
Journal of the ACM | 2023-04-27 | Paper |
An algorithm for finding predecessors in integer sets
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Retracting Graphs to Cycles
| 2022-07-21 | Paper |
Puncturable pseudorandom sets and private information retrieval with near-optimal online bandwidth and time
| 2022-05-18 | Paper |
Symmetric interdiction for matching problems
| 2021-07-28 | Paper |
Foundations of differentially oblivious algorithms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
On hierarchical routing in doubling metrics
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Approximate load balancing on dynamic and asynchronous networks
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Multi-scale self-simulation
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Quorum placement in networks, minimizing network congestion
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Quorum placement in networks to minimize access delays
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Simultaneous source location
ACM Transactions on Algorithms | 2014-11-18 | Paper |
On hierarchical routing in doubling metrics
| 2014-10-13 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
scientific article; zbMATH DE number 2090659 (Why is no real title available?)
| 2004-08-12 | Paper |
scientific article; zbMATH DE number 2079361 (Why is no real title available?)
| 2004-07-28 | Paper |
scientific article; zbMATH DE number 1775423 (Why is no real title available?)
| 2004-01-27 | Paper |
Protocols for asymmetric communication channels
Journal of Computer and System Sciences | 2002-07-04 | Paper |
On the benefit of supporting virtual channels in wormhole routers
Journal of Computer and System Sciences | 2001-09-09 | Paper |
Improved routing and sorting on multibutterflies
Algorithmica | 2001-07-03 | Paper |
scientific article; zbMATH DE number 1559567 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1306888 (Why is no real title available?)
| 2000-06-21 | Paper |
Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
Combinatorica | 2000-02-21 | Paper |
scientific article; zbMATH DE number 1256692 (Why is no real title available?)
| 1999-04-22 | Paper |
Simple Algorithms for Routing on Butterfly Networks with Bounded Queues
SIAM Journal on Computing | 1999-02-22 | Paper |
On the Fault Tolerance of Some Popular Bounded-Degree Networks
SIAM Journal on Computing | 1998-09-20 | Paper |
Real-time emulations of bounded-degree networks
Information Processing Letters | 1998-08-13 | Paper |
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
SIAM Journal on Computing | 1998-02-10 | Paper |
Work-preserving emulations of fixed-connection networks
Journal of the ACM | 1998-01-22 | Paper |
On-Line Algorithms for Path Selection in a Nonblocking Network
SIAM Journal on Computing | 1996-11-26 | Paper |
Randomized Routing and Sorting on Fixed-Connection Networks
Journal of Algorithms | 1995-03-09 | Paper |
Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
Combinatorica | 1994-08-11 | Paper |
scientific article; zbMATH DE number 176074 (Why is no real title available?)
| 1993-05-18 | Paper |
Fast algorithms for bit-serial routing on a hypercube
Mathematical Systems Theory | 1991-01-01 | Paper |
Communication-efficient parallel algorithms for distributed random-access machines
Algorithmica | 1988-01-01 | Paper |
