Mikkel Thorup
Computer Networks and Communications · 2000–2005
A researcher in the Science corpus: 8 papers; trusts 20 researchers and is trusted by 40 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 17 citations into it; #976 of 9,886 by trust here, #1,672 by citations
- Electrical and Electronic Engineering — 7 citations into it; #1,632 of 16,539 by trust here, #6,854 by citations
- Computational Theory and Mathematics — 6 citations into it; #1,398 of 12,182 by trust here, #5,239 by citations
Whom Mikkel Thorup trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Bernard Fortz
- M. Ericsson
- David Peleg
- Xipeng Xiao
- Yves Crama
- Fred W. Glover
- Anja Feldmann
- Uri Zwick
- Jin Cao
- Maurício Resende
Who trusts Mikkel Thorup overall
- Peter Sanders
- Bernard Fortz
- Andrew Vladislav Goldberg
- Daniel Delling
- Dominik Schultes
- Robert Geisberger
- Michal Pióro
- Hannah Bast
- Haim Kaplan
- Renato F. Werneck
Papers from Mikkel Thorup's perspective
Ordered by how strongly the researchers Mikkel Thorup trusts endorse each paper. Same corpus, a different order for every researcher.
- Deriving traffic demands for operational IP networks: methodology and experience (TNET)
- Internet traffic engineering by optimizing OSPF weights (Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064))
- Traffic engineering with MPLS in the Internet (IEEE Network)
- Increasing Internet Capacity Using Local Search (Computational optimization and applications)
- Time-varying network tomography: router link data (2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060))
- Optimizing OSPF/IS-IS weights in a changing world (IEEE J. Sel. Areas Commun.)
- Local Search in Combinatorial Optimization (Artificial Neural Networks)
- Traffic engineering with traditional IP routing protocols (IEEE Communications Magazine)
- The complexity of theorem-proving procedures
- Tabu Search
Their papers
- Traffic engineering with traditional IP routing protocols (2002) — 551 citations
- Internet traffic engineering by optimizing OSPF weights (2000) — 1,360 citations
- Optimizing OSPF/IS-IS weights in a changing world (2002) — 774 citations
- Compact oracles for reachability and approximate distances in planar digraphs (2001) — 350 citations
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity (2001) — 519 citations
- Approximate distance oracles (2001) — 759 citations
- Estimating flow distributions from sampled flow statistics (2005) — 314 citations
- Increasing Internet Capacity Using Local Search (2004) — 307 citations