Carsten Lund

Computer Networks and Communications · 1992–2005

A researcher in the Science corpus: 6 papers; trusts 5 researchers and is trusted by 11 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 12 citations into it; #2,680 of 9,886 by trust here, #1,992 by citations
• Artificial Intelligence — 6 citations into it; #21,443 of 35,345 by trust here, #19,018 by citations

Whom Carsten Lund trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Florin Baboescu
2. Sumeet Singh
3. Cristian Estan
4. David Moore
5. Anja Feldmann
6. George Varghese

Who trusts Carsten Lund overall

1. Anukool Lakhina
2. Eli Ben-Sasson
3. Srinath T. V. Setty
4. Subhash Khot
5. Paul Valiant
6. Mark Crovella
7. Yuval Ishai
8. Michael Walfish
9. Oded Goldreich
10. Andrew Justin Blumberg

Papers from Carsten Lund's perspective

Ordered by how strongly the researchers Carsten Lund trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Spread of the Sapphire/Slammer Worm
2. 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))
3. Scalable packet classification (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
4. On network-aware clustering of Web clients (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
5. Traffic matrix estimation: existing techniques and new directions (Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication)
6. Time-varying network tomography: router link data (2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060))
7. Traffic engineering with MPLS in the Internet (IEEE Network)
8. Measuring ISP topologies with Rocketfuel (IEEE/ACM Transactions on Networking)
9. Atomic Decomposition by Basis Pursuit
10. Fast accurate computation of large-scale IP traffic matrices from link loads (Measurement and Modeling of Computer Systems)

Their papers

• Non-deterministic exponential time has two-prover interactive protocols (2005) — 506 citations
• Deriving traffic demands for operational IP networks: methodology and experience (2001) — 623 citations
• Estimating flow distributions from sampled flow statistics (2005) — 314 citations
• Packet classification in large ISPs: design and evaluation of decision tree classifiers (2005) — 70 citations
• An information-theoretic approach to traffic matrix estimation (2003) — 330 citations
• Proof verification and hardness of approximation problems (1992)