| 2010 | IMC | Flowroute: inferring forwarding table updates using passive flow-level measurements. | Amogh Dhamdhere, Lee Breslau, Nick G. Duffield, Cheng Tien Ee, Alexandre Gerber, Carsten Lund, Subhabrata Sen |
| 2009 | SODA | Stream sampling for variance-optimal estimation of subset sums. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2009 | SIGCOMM | Modeling and understanding end-to-end class of service policies in operational networks. | Yu-Wei Eric Sung, Carsten Lund, Mark Lyn, Sanjay G. Rao, Subhabrata Sen |
| 2008 | SIGMETRICS | Confident estimation for multistage measurement sampling and aggregation. | Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2008 | SIGMETRICS | Scalable VPN routing via relaying. | Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan Pei, Subhabrata Sen |
| 2007 | IMC | Algorithms and estimators for accurate summarization of internet traffic. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2007 | PODS | Sketching unaggregated data streams for subpopulation-size queries. | Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup |
| 2005 | IMC | Optimal Combination of Sampled Network Measurements. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2005 | PODS | Estimating arbitrary subset sums with few probes. | Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2005 | SIGMETRICS | Packet classification in large ISPs: design and evaluation of decision tree classifiers. | Edith Cohen, Carsten Lund |
| 2004 | IMC | Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. | Yin Zhang, Sumeet Singh, Subhabrata Sen, Nick G. Duffield, Carsten Lund |
| 2004 | SIGMETRICS | Flow sampling under hard resource constraints. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2003 | IMC | Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure. | Nick G. Duffield, Carsten Lund |
| 2003 | SIGCOMM | Estimating flow distributions from sampled flow statistics. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2003 | SIGCOMM | An information-theoretic approach to traffic matrix estimation. | Yin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho |
| 2002 | IMC | Properties and prediction of flow statistics from sampled packet streams. | Nick G. Duffield, Carsten Lund, Mikkel Thorup |
| 2000 | SIGCOMM | Deriving traffic demands for operational IP networks: methodology and experience. | Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford, Fred True |
| 1995 | INFOCOM | Adaptive Hodling Policies for IP over ATM Networks. | Carsten Lund, Steven J. Phillips, Nick Reingold |
| 1994 | ESA | On-Line Distributed Data Management. | Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan |
| 1994 | FOCS | IP over connection-oriented networks and distributional paging | Carsten Lund, Steven J. Phillips, Nick Reingold |
| 1994 | SODA | Linear Programs for Randomized On-Line Algorithms. | Carsten Lund, Nick Reingold |
| 1994 | STOC | Efficient probabilistic checkable proofs and applications to approximation. | Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell |
| 1993 | ICALP | The Approximation of Maximum Subgraph Problems. | Carsten Lund, Mihalis Yannakakis |
| 1993 | STOC | Efficient probabilistically checkable proofs and applications to approximations. | Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell |
| 1993 | STOC | Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. | Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor |
| 1993 | STOC | On the hardness of approximating minimization problems. | Carsten Lund, Mihalis Yannakakis |
| 1992 | FOCS | Proof Verification and Hardness of Approximation Problems | Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy |
| 1992 | STOC | On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) | Uriel Feige, Carsten Lund |
| 1991 | CAV | Complexity Results for POMSET Languages. | Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund |
| 1991 | STACS | Interactive Proof Systems and Alternating Time-Space Complexity. | Lance Fortnow, Carsten Lund |
| 1990 | FOCS | Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols | Lszl Babai, Lance Fortnow, Carsten Lund |
| 1990 | FOCS | Algebraic Methods for Interactive Proof Systems | Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan |
| 1989 | EuroCrypt | Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. | Joan Boyar, Katalin Friedl, Carsten Lund |