Carsten Lund

According to our database, Carsten Lund authored at least 59 papers between 1991 and 2016.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2016

On the Tradeoff between Stability and Fit.

Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund

ACM Trans. Algorithms, 2016

2014

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

2011

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

2010

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

Proceedings of the 10th ACM SIGCOMM Internet Measurement Conference, 2010

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

Stream sampling for variance-optimal estimation of subset sums.

Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 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

Proceedings of the ACM SIGCOMM 2009 Conference on Applications, 2009

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

Proceedings of the 7th International Workshop on Design of Reliable Communication Networks, 2009

2008

Variance optimal sampling based estimation of subset sums

Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup

CoRR, 2008

Scalable VPN routing via relaying.

Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan Pei, Subhabrata Sen

Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008

Confident estimation for multistage measurement sampling and aggregation.

Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup

Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2008

2007

Priority sampling for estimation of arbitrary subset sums.

Nick G. Duffield, Carsten Lund, Mikkel Thorup

J. ACM, 2007

Sketching unaggregated data streams for subpopulation-size queries.

Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Algorithms and estimators for accurate summarization of internet traffic.

Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup

Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

2005

Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach.

Yin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho

IEEE/ACM Trans. Netw., 2005

Estimating flow distributions from sampled flow statistics.

Nick G. Duffield, Carsten Lund, Mikkel Thorup

IEEE/ACM Trans. Netw., 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

Sampling to estimate arbitrary subset sums

Nick G. Duffield, Carsten Lund, Mikkel Thorup

CoRR, 2005

Packet classification in large ISPs: design and evaluation of decision tree classifiers.

Edith Cohen, Carsten Lund

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

Estimating arbitrary subset sums with few probes.

Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Optimal Combination of Sampled Network Measurements.

Nick G. Duffield, Carsten Lund, Mikkel Thorup

Proceedings of the 5th Internet Measurement Conference, 2005

2004

Flow sampling under hard resource constraints.

Nick G. Duffield, Carsten Lund, Mikkel Thorup

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2004

Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications.

Yin Zhang, Sumeet Singh, Subhabrata Sen, Nick G. Duffield, Carsten Lund

Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, 2004

2003

An information-theoretic approach to traffic matrix estimation.

Yin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho

Proceedings of the ACM SIGCOMM 2003 Conference on Applications, 2003

Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure.

Nick G. Duffield, Carsten Lund

Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

2002

Properties and prediction of flow statistics from sampled packet streams.

Nick G. Duffield, Carsten Lund, Mikkel Thorup

Proceedings of the 2nd ACM SIGCOMM Internet Measurement Workshop, 2002

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

Charging from sampled network usage.

Nick G. Duffield, Carsten Lund, Mikkel Thorup

Proceedings of the 1st ACM SIGCOMM Internet Measurement Workshop, 2001

2000

NetScope: traffic engineering for IP networks.

Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford

IEEE Netw., 2000

Alternation in interaction.

Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram

Comput. Complex., 2000

1999

Competitive On-Line Algorithms for Distributed Data Management.

Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan

SIAM J. Comput., 1999

Paging Against a Distribution and IP Networking.

Carsten Lund, Steven J. Phillips, Nick Reingold

J. Comput. Syst. Sci., 1999

1998

Proof verification and the hardness of approximation problems.

Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy

Electron. Colloquium Comput. Complex., 1998

1997

Random Debaters and the Hardness of Approximating Stochastic Functions.

Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor

SIAM J. Comput., 1997

On Bounded Queries and Approximation.

Richard Chang, William I. Gasarch, Carsten Lund

SIAM J. Comput., 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 the Hardness of Computing the Permanent of Random Matrices.

Uriel Feige, Carsten Lund

Comput. Complex., 1997

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

Balanced Allocations for Tree-Like Inputs.

Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven J. Phillips, Nick Reingold

Inf. Process. Lett., 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

Adaptive Hodling Policies for IP over ATM Networks.

Carsten Lund, Steven J. Phillips, Nick Reingold

Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994

On the Hardness of Approximating Minimization Problems.

Carsten Lund, Mihalis Yannakakis

J. ACM, 1994

The Power of Adaptiveness and Additional Queries in Random-Self-Reductions.

Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman

Comput. Complex., 1994

Efficient probabilistic checkable proofs and applications to approximation.

Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Linear Programs for Randomized On-Line Algorithms.

Carsten Lund, Nick Reingold

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

IP over connection-oriented networks and distributional paging

Carsten Lund, Steven J. Phillips, Nick Reingold

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

On-Line Distributed Data Management.

Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan

Proceedings of the Algorithms, 1994

1993

Interactive Proof Systems and Alternating Time-Space Complexity.

Lance Fortnow, Carsten Lund

Theor. Comput. Sci., 1993

Complexity Results for Pomset Languages.

Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund

SIAM J. Discret. Math., 1993

On the Communication Complexity of Zero-Knowledge Proofs.

Joan Boyar, Carsten Lund, René Peralta

J. Cryptol., 1993

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.

Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Efficient probabilistically checkable proofs and applications to approximations.

Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

The Approximation of Maximum Subgraph Problems.

Carsten Lund, Mihalis Yannakakis

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Algebraic Methods for Interactive Proof Systems.

Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan

J. ACM, 1992

Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols.

László Babai, Lance Fortnow, Carsten Lund

Comput. Complex., 1992

On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract)

Uriel Feige, Carsten Lund

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Power of interaction.

Carsten Lund

ACM Distinguished dissertations, MIT Press, ISBN: 978-0-262-12170-5, 1992

1991

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.

Joan Boyar, Katalin Friedl, Carsten Lund

J. Cryptol., 1991

Non-Deterministic Exponential Time has Two-Prover Interactive Protocols.

László Babai, Lance Fortnow, Carsten Lund

Comput. Complex., 1991