Carsten Lund - RankMe

73 papers A* 25A 9Journal 34Unranked 4

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	On the Tradeoff between Stability and Fit. ACM Trans. Algorithms Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund
2014	J	`jnl`	Algorithms and estimators for summarization of unaggregated data streams. J. Comput. Syst. Sci. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2013	J	`jnl`	On the Tradeoff between Stability and Fit CoRR Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund
2011	J	`jnl`	Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. SIAM J. Comput. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2010	A	`conf`	Flowroute: inferring forwarding table updates using passive flow-level measurements. Internet Measurement Conference Amogh Dhamdhere, Lee Breslau, Nick G. Duffield, Cheng Tien Ee, Alexandre Gerber, Carsten Lund, Subhabrata Sen
2009	J	`jnl`	Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Proc. VLDB Endow. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2009	—	`conf`	Darkstar: Using exploratory data mining to raise the bar on network reliability and performance. DRCN Charles R. Kalmanek, Ihui Ge, Seungjoon Lee, Carsten Lund, Dan Pei, Joseph Seidel, Jacobus E. van der Merwe, Jennifer Ates
2009	A*	`conf`	Modeling and understanding end-to-end class of service policies in operational networks. SIGCOMM Yu-Wei Eric Sung, Carsten Lund, Mark Lyn, Sanjay G. Rao, Subhabrata Sen
2009	A*	`conf`	Stream sampling for variance-optimal estimation of subset sums. SODA Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2008	A*	`conf`	Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup
2008	A*	`conf`	Scalable VPN routing via relaying. SIGMETRICS Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan Pei, Subhabrata Sen
2008	J	`jnl`	Variance optimal sampling based estimation of subset sums CoRR Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	A	`conf`	Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Conference Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2007	J	`jnl`	Priority sampling for estimation of arbitrary subset sums. J. ACM Nick G. Duffield, Carsten Lund, Mikkel Thorup
2007	A*	`conf`	Sketching unaggregated data streams for subpopulation-size queries. PODS Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup
2005	A*	`conf`	Estimating arbitrary subset sums with few probes. PODS Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	J	`jnl`	Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw. Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	J	`jnl`	Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach. IEEE/ACM Trans. Netw. Yin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho
2005	J	`jnl`	Learn more, sample less: control of volume and variance in network measurement. IEEE Trans. Inf. Theory Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	A	`conf`	Optimal Combination of Sampled Network Measurements. Internet Measurement Conference Nick G. Duffield, Carsten Lund, Mikkel Thorup
2005	A*	`conf`	Packet classification in large ISPs: design and evaluation of decision tree classifiers. SIGMETRICS Edith Cohen, Carsten Lund
2005	J	`jnl`	Sampling to estimate arbitrary subset sums CoRR Nick G. Duffield, Carsten Lund, Mikkel Thorup
2004	A*	`conf`	Flow sampling under hard resource constraints. SIGMETRICS Nick G. Duffield, Carsten Lund, Mikkel Thorup
2004	A	`conf`	Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. Internet Measurement Conference Yin Zhang, Sumeet Singh, Subhabrata Sen, Nick G. Duffield, Carsten Lund
2003	A*	`conf`	An information-theoretic approach to traffic matrix estimation. SIGCOMM Yin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho
2003	A*	`conf`	Estimating flow distributions from sampled flow statistics. SIGCOMM Nick G. Duffield, Carsten Lund, Mikkel Thorup
2003	A	`conf`	Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure. Internet Measurement Conference Nick G. Duffield, Carsten Lund
2002	A	`conf`	Properties and prediction of flow statistics from sampled packet streams. Internet Measurement Workshop Nick G. Duffield, Carsten Lund, Mikkel Thorup
2001	A	`conf`	Charging from sampled network usage. Internet Measurement Workshop Nick G. Duffield, Carsten Lund, Mikkel Thorup
2001	J	`jnl`	Deriving traffic demands for operational IP networks: methodology and experience. IEEE/ACM Trans. Netw. Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford, Fred True
2000	J	`jnl`	Alternation in interaction. Comput. Complex. Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram
2000	A*	`conf`	Deriving traffic demands for operational IP networks: methodology and experience. SIGCOMM Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford, Fred True
2000	J	`jnl`	NetScope: traffic engineering for IP networks. IEEE Netw. Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford
1999	J	`jnl`	Competitive On-Line Algorithms for Distributed Data Management. SIAM J. Comput. Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan
1999	J	`jnl`	Paging Against a Distribution and IP Networking. J. Comput. Syst. Sci. Carsten Lund, Steven J. Phillips, Nick Reingold
1998	J	`jnl`	Proof Verification and the Hardness of Approximation Problems. J. ACM Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
1998	J	`jnl`	Proof verification and the hardness of approximation problems. Electron. Colloquium Comput. Complex. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
1997	J	`jnl`	A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. Inf. Process. Lett. Marek Chrobak, Lawrence L. Larmore, Carsten Lund, Nick Reingold
1997	J	`jnl`	On Bounded Queries and Approximation. SIAM J. Comput. Richard Chang, William I. Gasarch, Carsten Lund
1997	J	`jnl`	On the Hardness of Computing the Permanent of Random Matrices. Comput. Complex. Uriel Feige, Carsten Lund
1997	J	`jnl`	Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM J. Comput. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
1995	A*	`conf`	Adaptive Hodling Policies for IP over ATM Networks. INFOCOM Carsten Lund, Steven J. Phillips, Nick Reingold
1995	J	`jnl`	An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. IEEE J. Sel. Areas Commun. Srinivasan Keshav, Carsten Lund, Steven J. Phillips, Nick Reingold, Huzur Saran
1995	J	`jnl`	Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven J. Phillips, Nick Reingold
1995	J	`jnl`	Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chic. J. Theor. Comput. Sci. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
1994	—	`conf`	Alternation in Interaction. SCT Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram
1994	A*	`conf`	Efficient probabilistic checkable proofs and applications to approximation. STOC Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell
1994	A*	`conf`	IP over connection-oriented networks and distributional paging FOCS Carsten Lund, Steven J. Phillips, Nick Reingold
1994	A*	`conf`	Linear Programs for Randomized On-Line Algorithms. SODA Carsten Lund, Nick Reingold
1994	J	`jnl`	On the Hardness of Approximating Minimization Problems. J. ACM Carsten Lund, Mihalis Yannakakis
1994	A	`conf`	On-Line Distributed Data Management. ESA Carsten Lund, Nick Reingold, Jeffery R. Westbrook, Dicky C. K. Yan
1994	—	`conf`	Random Debaters and the Hardness of Approximating Stochastic Functions. SCT Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
1994	J	`jnl`	The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Comput. Complex. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
1993	J	`jnl`	Complexity Results for Pomset Languages. SIAM J. Discret. Math. Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund
1993	A*	`conf`	Efficient probabilistically checkable proofs and applications to approximations. STOC Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell
1993	J	`jnl`	Interactive Proof Systems and Alternating Time-Space Complexity. Theor. Comput. Sci. Lance Fortnow, Carsten Lund
1993	J	`jnl`	On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptol. Joan Boyar, Carsten Lund, René Peralta
1993	A*	`conf`	On the hardness of approximating minimization problems. STOC Carsten Lund, Mihalis Yannakakis
1993	A*	`conf`	Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor
1993	A*	`conf`	The Approximation of Maximum Subgraph Problems. ICALP Carsten Lund, Mihalis Yannakakis
1992	J	`jnl`	Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Comput. Complex. László Babai, Lance Fortnow, Carsten Lund
1992	J	`jnl`	Algebraic Methods for Interactive Proof Systems. J. ACM Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
1992	A*	`conf`	On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) STOC Uriel Feige, Carsten Lund
1992	—	`book`	Power of interaction. Carsten Lund
1992	A*	`conf`	Proof Verification and Hardness of Approximation Problems FOCS Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy
1992	—	`conf`	The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. SCT Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman
1991	A*	`conf`	Complexity Results for POMSET Languages. CAV Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund
1991	A	`conf`	Interactive Proof Systems and Alternating Time-Space Complexity. STACS Lance Fortnow, Carsten Lund
1991	J	`jnl`	Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Comput. Complex. László Babai, Lance Fortnow, Carsten Lund
1991	J	`jnl`	Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptol. Joan Boyar, Katalin Friedl, Carsten Lund
1990	A*	`conf`	Algebraic Methods for Interactive Proof Systems FOCS Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
1990	A*	`conf`	Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols FOCS László Babai, Lance Fortnow, Carsten Lund
1989	A*	`conf`	Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT Joan Boyar, Katalin Friedl, Carsten Lund