| Publication | Date of Publication | Type |
|---|
Oblivious routing on node-capacitated and directed graphs
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Scalable expanders: exploiting hierarchical random wiring
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Resource discovery in distributed networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
| scientific article; zbMATH DE number 6472594 (Why is no real title available?) | 2015-08-14 | Paper |
Correction: ``Basic network creation games
SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
| Semi-oblivious routing: lower bounds | 2014-12-18 | Paper |
| Online client-server load balancing without global information | 2014-10-13 | Paper |
| Oblivious routing on node-capacitated and directed graphs | 2014-10-13 | Paper |
Compression using efficient multicasting
1296.68047 | 2014-09-26 | Paper |
The Akamai approach to achieving performance and reliability on the Internet
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Basic network creation games
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Some results on greedy embeddings in metric spaces
Discrete & Computational Geometry | 2010-11-08 | Paper |
Consistent load balancing via spread minimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Hat Guessing Games
SIAM Review | 2009-06-11 | Paper |
Hat Guessing Games
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
Localized Client-Server Load Balancing without Global Information
SIAM Journal on Computing | 2008-08-14 | Paper |
On the Max-flow min-cut ratio for directed multicommodity flows
Theoretical Computer Science | 2006-03-24 | Paper |
Reconstructing a three-dimensional model with arbitrary errors
Journal of the ACM | 2005-01-25 | Paper |
| scientific article; zbMATH DE number 1962159 (Why is no real title available?) | 2003-08-10 | Paper |
New algorithmic aspects of the local lemma with applications to routing and partitioning
SIAM Journal on Computing | 2002-04-23 | Paper |
Compression using efficient multicasting
Journal of Computer and System Sciences | 2002-02-27 | Paper |
| Guessing secrets. (Extended abstract) | 2002-01-30 | Paper |
| Containment properties of product and power graphs | 2001-10-24 | Paper |
| scientific article; zbMATH DE number 1263220 (Why is no real title available?) | 2001-08-28 | Paper |
General dynamic routing with per-packet delay guarantees of O(Distance + 1/Session rate)
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1559581 (Why is no real title available?) | 2001-03-01 | Paper |
Guessing secrets
The Electronic Journal of Combinatorics | 2001-02-19 | Paper |
Guessing secrets
The Electronic Journal of Combinatorics | 2001-02-19 | Paper |
A $2d - 1$ Lower Bound for Two-Layer Knock-Knee Channel Routing
SIAM Journal on Discrete Mathematics | 2000-06-21 | Paper |
The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian
Combinatorics, Probability and Computing | 2000-06-04 | Paper |
Automatic Methods for Hiding Latency in Parallel and Distributed Computation
SIAM Journal on Computing | 2000-03-19 | Paper |
Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
Combinatorica | 2000-02-21 | Paper |
Tight Bounds on the Size of Fault-Tolerant Merging and Sorting Networks with Destructive Faults
SIAM Journal on Computing | 1999-10-28 | Paper |
Tight Bounds for On-Line Tree Embeddings
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1256771 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1256764 (Why is no real title available?) | 1999-10-04 | Paper |
| scientific article; zbMATH DE number 1256742 (Why is no real title available?) | 1999-05-18 | Paper |
| scientific article; zbMATH DE number 1256692 (Why is no real title available?) | 1999-04-22 | Paper |
Greedy Dynamic Routing on Arrays
Journal of Algorithms | 1999-01-17 | Paper |
On the design of reliable Boolean circuits that contain partially unreliable gates
Journal of Computer and System Sciences | 1998-08-04 | Paper |
On probabilistic networks for selection, merging, and sorting
Theory of Computing Systems | 1998-08-03 | Paper |
Hypercubic Sorting Networks
SIAM Journal on Computing | 1998-05-10 | Paper |
Nearly optimal algorithms and bounds for multilayer channel routing
Journal of the ACM | 1998-02-02 | Paper |
| scientific article; zbMATH DE number 1030993 (Why is no real title available?) | 1997-08-24 | Paper |
Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults
Journal of Computer and System Sciences | 1997-08-03 | Paper |
| scientific article; zbMATH DE number 1024078 (Why is no real title available?) | 1997-07-20 | Paper |
Analysis of Backoff Protocols for Multiple Access Channels
SIAM Journal on Computing | 1997-03-03 | Paper |
| scientific article; zbMATH DE number 910914 (Why is no real title available?) | 1996-11-10 | Paper |
| scientific article; zbMATH DE number 850078 (Why is no real title available?) | 1996-10-21 | Paper |
| scientific article; zbMATH DE number 910904 (Why is no real title available?) | 1996-10-13 | Paper |
| scientific article; zbMATH DE number 512924 (Why is no real title available?) | 1996-08-20 | Paper |
Fast approximation algorithms for multicommodity flow problems
Journal of Computer and System Sciences | 1995-07-05 | Paper |
Methods for message routing in parallel machines
Theoretical Computer Science | 1994-09-20 | Paper |
| scientific article; zbMATH DE number 432837 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 403954 (Why is no real title available?) | 1993-09-06 | Paper |
A Tight Lower Bound on the Size of Planar Permutation Networks
SIAM Journal on Discrete Mathematics | 1993-04-01 | Paper |
Generalized planar matching
Journal of Algorithms | 1990-01-01 | Paper |
A tight lower bound for the train reversal problem
Information Processing Letters | 1990-01-01 | Paper |
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Combinatorica | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4077533 (Why is no real title available?) | 1988-01-01 | Paper |
Tight Bounds on the Complexity of Parallel Sorting
IEEE Transactions on Computers | 1985-01-01 | Paper |
Wafer-Scale Integration of Systolic Arrays
IEEE Transactions on Computers | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3876584 (Why is no real title available?) | 1983-01-01 | Paper |
