Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. - László Babai; Lance Fortnow; Carsten Lund (Comput. Complex., 1991)

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. - Joan Boyar; Katalin Friedl; Carsten Lund (J. Cryptol., 1991)

Power of interaction. - Carsten Lund (MIT Press, 1992)

On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) - Uriel Feige; Carsten Lund (STOC, 1992)

Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. - László Babai; Lance Fortnow; Carsten Lund (Comput. Complex., 1992)

Algebraic Methods for Interactive Proof Systems. - Carsten Lund; Lance Fortnow; Howard J. Karloff; Noam Nisan (J. ACM, 1992)

The Approximation of Maximum Subgraph Problems. - Carsten Lund; Mihalis Yannakakis (ICALP, 1993)

Efficient probabilistically checkable proofs and applications to approximations. - Mihir Bellare; Shafi Goldwasser; Carsten Lund; Alexander Russell (STOC, 1993)

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. - Anne Condon; Joan Feigenbaum; Carsten Lund; Peter W. Shor (STOC, 1993)

On the Communication Complexity of Zero-Knowledge Proofs. - Joan Boyar; Carsten Lund; René Peralta 001 (J. Cryptol., 1993)

Complexity Results for Pomset Languages. - Joan Feigenbaum; Jeremy A. Kahn; Carsten Lund (SIAM J. Discret. Math., 1993)

Interactive Proof Systems and Alternating Time-Space Complexity. - Lance Fortnow; Carsten Lund (Theor. Comput. Sci., 1993)

On-Line Distributed Data Management. - Carsten Lund; Nick Reingold; Jeffery R. Westbrook; Dicky C. K. Yan (ESA, 1994)

IP over connection-oriented networks and distributional paging - Carsten Lund; Steven J. Phillips; Nick Reingold (FOCS, 1994)

Linear Programs for Randomized On-Line Algorithms. - Carsten Lund; Nick Reingold (SODA, 1994)

Efficient probabilistic checkable proofs and applications to approximation. - Mihir Bellare; Shafi Goldwasser; Carsten Lund; Alexander Russell (STOC, 1994)

The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. - Joan Feigenbaum; Lance Fortnow; Carsten Lund; Daniel A. Spielman (Comput. Complex., 1994)

On the Hardness of Approximating Minimization Problems. - Carsten Lund; Mihalis Yannakakis (J. ACM, 1994)

Adaptive Hodling Policies for IP over ATM Networks. - Carsten Lund; Steven J. Phillips; Nick Reingold (INFOCOM, 1995)

Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. - Anne Condon; Joan Feigenbaum; Carsten Lund; Peter W. Shor (Chic. J. Theor. Comput. Sci., 1995)

Balanced Allocations for Tree-Like Inputs. - Andrei Z. Broder; Alan M. Frieze; Carsten Lund; Steven J. Phillips; Nick Reingold (Inf. Process. Lett., 1995)

An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. - Srinivasan Keshav; Carsten Lund; Steven J. Phillips; Nick Reingold; Huzur Saran (IEEE J. Sel. Areas Commun., 1995)

On the Hardness of Computing the Permanent of Random Matrices. - Uriel Feige; Carsten Lund (Comput. Complex., 1997)

A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. - Marek Chrobak; Lawrence L. Larmore; Carsten Lund; Nick Reingold (Inf. Process. Lett., 1997)

On Bounded Queries and Approximation. - Richard Chang 001; William I. Gasarch; Carsten Lund (SIAM J. Comput., 1997)

Random Debaters and the Hardness of Approximating Stochastic Functions. - Anne Condon; Joan Feigenbaum; Carsten Lund; Peter W. Shor (SIAM J. Comput., 1997)

Proof verification and the hardness of approximation problems. - Sanjeev Arora; Carsten Lund; Rajeev Motwani 001; Madhu Sudan 001; Mario Szegedy (Electron. Colloquium Comput. Complex., 1998)

Paging Against a Distribution and IP Networking. - Carsten Lund; Steven J. Phillips; Nick Reingold (J. Comput. Syst. Sci., 1999)

Competitive On-Line Algorithms for Distributed Data Management. - Carsten Lund; Nick Reingold; Jeffery R. Westbrook; Dicky C. K. Yan (SIAM J. Comput., 1999)

Alternation in interaction. - Marcos A. Kiwi; Carsten Lund; Daniel A. Spielman; Alexander Russell; Ravi Sundaram (Comput. Complex., 2000)

NetScope: traffic engineering for IP networks. - Anja Feldmann; Albert G. Greenberg; Carsten Lund; Nick Reingold; Jennifer Rexford (IEEE Netw., 2000)

Charging from sampled network usage. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (Internet Measurement Workshop, 2001)

Deriving traffic demands for operational IP networks: methodology and experience. - Anja Feldmann; Albert G. Greenberg; Carsten Lund; Nick Reingold; Jennifer Rexford; Fred True (IEEE/ACM Trans. Netw., 2001)

Properties and prediction of flow statistics from sampled packet streams. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (Internet Measurement Workshop, 2002)

Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure. - Nick G. Duffield; Carsten Lund (Internet Measurement Conference, 2003)

An information-theoretic approach to traffic matrix estimation. - Yin Zhang 001; Matthew Roughan; Carsten Lund; David L. Donoho (SIGCOMM, 2003)

Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. - Yin Zhang 001; Sumeet Singh; Subhabrata Sen; Nick G. Duffield; Carsten Lund (Internet Measurement Conference, 2004)

Flow sampling under hard resource constraints. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (SIGMETRICS, 2004)

Optimal Combination of Sampled Network Measurements. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (Internet Measurement Conference, 2005)

Estimating arbitrary subset sums with few probes. - Noga Alon; Nick G. Duffield; Carsten Lund; Mikkel Thorup (PODS, 2005)

Packet classification in large ISPs: design and evaluation of decision tree classifiers. - Edith Cohen; Carsten Lund (SIGMETRICS, 2005)

Sampling to estimate arbitrary subset sums - Nick G. Duffield; Carsten Lund; Mikkel Thorup (CoRR, 2005)

Learn more, sample less: control of volume and variance in network measurement. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (IEEE Trans. Inf. Theory, 2005)

Estimating flow distributions from sampled flow statistics. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (IEEE/ACM Trans. Netw., 2005)

Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach. - Yin Zhang 001; Matthew Roughan; Carsten Lund; David L. Donoho (IEEE/ACM Trans. Netw., 2005)

Algorithms and estimators for accurate summarization of internet traffic. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Internet Measurement Conference, 2007)

Sketching unaggregated data streams for subpopulation-size queries. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (PODS, 2007)

Priority sampling for estimation of arbitrary subset sums. - Nick G. Duffield; Carsten Lund; Mikkel Thorup (J. ACM, 2007)

Confident estimation for multistage measurement sampling and aggregation. - Edith Cohen; Nick G. Duffield; Carsten Lund; Mikkel Thorup (SIGMETRICS, 2008)

Scalable VPN routing via relaying. - Changhoon Kim; Alexandre Gerber; Carsten Lund; Dan Pei; Subhabrata Sen (SIGMETRICS, 2008)

Variance optimal sampling based estimation of subset sums - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (CoRR, 2008)

Darkstar: Using exploratory data mining to raise the bar on network reliability and performance. - Charles R. Kalmanek; Ihui Ge; Seungjoon Lee; Carsten Lund; Dan Pei; Joseph Seidel; Jacobus E. van der Merwe; Jennifer Ates (DRCN, 2009)

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 (SIGCOMM, 2009)

Stream sampling for variance-optimal estimation of subset sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SODA, 2009)

Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (Proc. VLDB Endow., 2009)

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 (Internet Measurement Conference, 2010)

Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (SIAM J. Comput., 2011)

Algorithms and estimators for summarization of unaggregated data streams. - Edith Cohen; Nick G. Duffield; Haim Kaplan; Carsten Lund; Mikkel Thorup (J. Comput. Syst. Sci., 2014)

On the Tradeoff between Stability and Fit. - Edith Cohen; Graham Cormode; Nick G. Duffield; Carsten Lund (ACM Trans. Algorithms, 2016)