Internet traffic engineering by optimizing OSPF weights B Fortz, M Thorup Proceedings IEEE INFOCOM 2000. conference on computer communications …, 2000 | 1734 | 2000 |
Approximate distance oracles M Thorup, U Zwick Journal of the ACM (JACM) 52 (1), 1-24, 2005 | 919 | 2005 |
Optimizing OSPF/IS-IS weights in a changing world B Fortz, M Thorup IEEE journal on selected areas in communications 20 (4), 756-767, 2002 | 898 | 2002 |
Traffic engineering with traditional IP routing protocols B Fortz, J Rexford, M Thorup IEEE communications Magazine 40 (10), 118-124, 2002 | 700 | 2002 |
Compact routing schemes M Thorup, U Zwick Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001 | 700 | 2001 |
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity J Holm, K De Lichtenberg, M Thorup Journal of the ACM (JACM) 48 (4), 723-760, 2001 | 668 | 2001 |
Undirected single-source shortest paths with positive integer weights in linear time M Thorup Journal of the ACM (JACM) 46 (3), 362-394, 1999 | 598 | 1999 |
Estimating flow distributions from sampled flow statistics N Duffield, C Lund, M Thorup Proceedings of the 2003 conference on Applications, technologies …, 2003 | 409 | 2003 |
Compact oracles for reachability and approximate distances in planar digraphs M Thorup Journal of the ACM (JACM) 51 (6), 993-1024, 2004 | 387 | 2004 |
Increasing internet capacity using local search B Fortz, M Thorup Computational Optimization and Applications 29, 13-48, 2004 | 354 | 2004 |
Properties and prediction of flow statistics from sampled packet streams N Duffield, C Lund, M Thorup Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, 159-171, 2002 | 326 | 2002 |
String matching in Lempel-Ziv compressed strings M Farach, M Thorup Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995 | 281 | 1995 |
Priority sampling for estimation of arbitrary subset sums N Duffield, C Lund, M Thorup Journal of the ACM (JACM) 54 (6), 32-es, 2007 | 278* | 2007 |
Charging from sampled network usage N Duffield, C Lund, M Thorup Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement, 245-256, 2001 | 264 | 2001 |
On the approximability of numerical taxonomy (fitting distances by tree metrics) R Agarwala, V Bafna, M Farach, M Paterson, M Thorup SIAM Journal on Computing 28 (3), 1073-1085, 1998 | 242 | 1998 |
Time-space trade-offs for predecessor search M Pătraşcu, M Thorup Proceedings of the thirty-eighth annual ACM symposium on Theory of computing …, 2006 | 235 | 2006 |
Near-optimal fully-dynamic graph connectivity M Thorup Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000 | 227 | 2000 |
A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing LS Buriol, MGC Resende, CC Ribeiro, M Thorup Networks: An International Journal 46 (1), 36-56, 2005 | 219 | 2005 |
Integer priority queues with decrease key in constant time and the single source shortest paths problem M Thorup Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 217 | 2003 |
Learn more, sample less: control of volume and variance in network measurement N Duffield, C Lund, M Thorup IEEE Transactions on Information Theory 51 (5), 1756-1775, 2005 | 215 | 2005 |