| Publication | Date of Publication | Type |
|---|
Oblivious routing on node-capacitated and directed graphs ACM Transactions on Algorithms | 2018-11-05 | 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 |
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 |
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 |
A 2d - 1 Lower Bound for Two-Layer Knock-Knee Channel Routing SIAM Journal on Discrete Mathematics | 2000-06-21 | 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 |
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 |