| 2013 |
|---|
| 68 | On the Tradeoff between Stability and Fit. Edith Cohen, Graham Cormode, Nick G. Duffield, Carsten Lund. CoRR (abs/1302.2137) (2013). Web SearchBibTeXDownload |
| 2011 |
|---|
| 67 | Efficient Stream Sampling for Variance-Optimal Estimation of Subset Sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. SIAM J. Comput. (40): 1402-1431 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 66 | Flowroute: inferring forwarding table updates using passive flow-level measurements. Amogh Dhamdhere, Lee Breslau, Nick G. Duffield, Cheng Ee, Alexandre Gerber, Carsten Lund, Subhabrata Sen. Internet Measurement Conference 2010, 315-321. Web SearchBibTeXDownload |
| 2009 |
|---|
| 65 | Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PVLDB (2): 431-442 (2009). Web SearchBibTeXDownload |
| 64 | 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, 219-230. Web SearchBibTeXDownload |
| 63 | Stream sampling for variance-optimal estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. SODA 2009, 1255-1264. Cited by 2Web SearchBibTeXDownload |
| 2008 |
|---|
| 62 | Variance optimal sampling based estimation of subset sums. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. CoRR (abs/0803.0473) (2008). Cited by 3Web SearchBibTeXDownload |
| 61 | Scalable VPN routing via relaying. Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan Pei, Subhabrata Sen. SIGMETRICS 2008, 61-72. Cited by 7Web SearchBibTeXDownload |
| 60 | Confident estimation for multistage measurement sampling and aggregation. Edith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup. SIGMETRICS 2008, 109-120. Cited by 1Web SearchBibTeXDownload |
| 2007 |
|---|
| 59 | Algorithms and estimators for accurate summarization of internet traffic. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. Internet Measurement Comference 2007, 265-278. Cited by 8Web SearchBibTeXDownload |
| 58 | Priority sampling for estimation of arbitrary subset sums. Nick G. Duffield, Carsten Lund, Mikkel Thorup. J. ACM (54) (2007). Cited by 11Web SearchBibTeXDownload |
| 57 | Sketching unaggregated data streams for subpopulation-size queries. Edith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup. PODS 2007, 253-262. Cited by 10Web SearchBibTeXDownload |
| 2005 |
|---|
| 56 | Sampling to estimate arbitrary subset sums. Nick G. Duffield, Carsten Lund, Mikkel Thorup. CoRR (abs/cs/0509026) (2005). Cited by 6Web SearchBibTeXDownload |
| 55 | 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. (13): 947-960 (2005). Cited by 33Web SearchBibTeXDownload |
| 54 | Estimating flow distributions from sampled flow statistics. Nick G. Duffield, Carsten Lund, Mikkel Thorup. IEEE/ACM Trans. Netw. (13): 933-946 (2005). Cited by 200Web SearchBibTeXDownload |
| 53 | Learn more, sample less: control of volume and variance in network measurement. Nick G. Duffield, Carsten Lund, Mikkel Thorup. IEEE Transactions on Information Theory (51): 1756-1775 (2005). Cited by 86Web SearchBibTeXDownload |
| 52 | Optimal Combination of Sampled Network Measurements. Nick G. Duffield, Carsten Lund, Mikkel Thorup. Internet Measurment Conference 2005, 91-104. Cited by 14Web SearchBibTeXDownload |
| 51 | Estimating arbitrary subset sums with few probes. Noga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup. PODS 2005, 317-325. Cited by 20Web SearchBibTeXDownload |
| 50 | Packet classification in large ISPs: design and evaluation of decision tree classifiers. Edith Cohen, Carsten Lund. SIGMETRICS 2005, 73-84. Cited by 28Web SearchBibTeXDownload |
| 2004 |
|---|
| 49 | Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. Yin Zhang, Sumeet Singh, Subhabrata Sen, Nick G. Duffield, Carsten Lund. Internet Measurement Conference 2004, 101-114. Cited by 56Web SearchBibTeXDownload |
| 48 | Flow sampling under hard resource constraints. Nick G. Duffield, Carsten Lund, Mikkel Thorup. SIGMETRICS 2004, 85-96. Cited by 68Web SearchBibTeXDownload |
| 2003 |
|---|
| 47 | Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure. Nick G. Duffield, Carsten Lund. Internet Measurement Comference 2003, 179-191. Cited by 61Web SearchBibTeXDownload |
| 46 | An information-theoretic approach to traffic matrix estimation. Yin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho. SIGCOMM 2003, 301-312. Cited by 195Web SearchBibTeXDownload |
| 45 | Estimating flow distributions from sampled flow statistics. Nick G. Duffield, Carsten Lund, Mikkel Thorup. SIGCOMM 2003, 325-336. Cited by 200Web SearchBibTeXDownload |
| 2002 |
|---|
| 44 | Properties and prediction of flow statistics from sampled packet streams. Nick G. Duffield, Carsten Lund, Mikkel Thorup. Internet Measurement Workshop 2002, 159-171. Cited by 160Web SearchBibTeXDownload |
| 2001 |
|---|
| 43 | 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. (9): 265-280 (2001). Cited by 424Web SearchBibTeXDownload |
| 42 | Charging from sampled network usage. Nick G. Duffield, Carsten Lund, Mikkel Thorup. Internet Measurement Workshop 2001, 245-256. Cited by 153Web SearchBibTeXDownload |
| 2000 |
|---|
| 41 | Alternation in interaction. Marcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram. Computational Complexity (9): 202-246 (2000). Cited by 16Web SearchBibTeXDownload |
| 40 | Deriving traffic demands for operational IP networks: methodology and experience. Anja Feldmann, Albert G. Greenberg, Carsten Lund, Nick Reingold, Jennifer Rexford, Fred True. SIGCOMM 2000, 257-270. Cited by 424Web SearchBibTeXDownload |
| 1999 |
|---|
| 39 | Paging Against a Distribution and IP Networking. Carsten Lund, Steven Phillips, Nick Reingold. J. Comput. Syst. Sci. (58): 222-232 (1999). Cited by 8Web SearchBibTeXDownload |
| 38 | Competitive On-Line Algorithms for Distributed Data Management. Carsten Lund, Nick Reingold, Jeffery Westbrook, Dicky C. K. Yan. SIAM J. Comput. (28): 1086-1111 (1999). Cited by 19Web SearchBibTeXDownload |
| 1998 |
|---|
| 37 | Proof verification and the hardness of approximation problems. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. Electronic Colloquium on Computational Complexity (ECCC) (5) (1998). Cited by 1198Web SearchBibTeXDownload |
| 36 | Proof Verification and the Hardness of Approximation Problems. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. J. ACM (45): 501-555 (1998). Cited by 1208Web SearchBibTeXDownload |
| 1997 |
|---|
| 35 | On the Hardness of Computing the Permanent of Random Matrices. Uriel Feige, Carsten Lund. Computational Complexity (6): 101-132 (1997). Cited by 40Web SearchBibTeXDownload |
| 34 | 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. (63): 79-83 (1997). Cited by 26Web SearchBibTeXDownload |
| 33 | On Bounded Queries and Approximation. Richard Chang, William I. Gasarch, Carsten Lund. SIAM J. Comput. (26): 188-209 (1997). Cited by 16Web SearchBibTeXDownload |
| 32 | Random Debaters and the Hardness of Approximating Stochastic Functions. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. SIAM J. Comput. (26): 369-400 (1997). Cited by 56Web SearchBibTeXDownload |
| 1995 |
|---|
| 31 | Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. Chicago J. Theor. Comput. Sci. (1995) (1995). Cited by 11Web SearchBibTeXDownload |
| 30 | An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. Srinivasan Keshav, Carsten Lund, Steven Phillips, Nick Reingold, Huzur Saran. IEEE Journal on Selected Areas in Communications (13): 1371-1382 (1995). Cited by 58Web SearchBibTeXDownload |
| 29 | Adaptive Hodling Policies for IP over ATM Networks. Carsten Lund, Steven Phillips, Nick Reingold. INFOCOM 1995, 80-87. Cited by 14Web SearchBibTeX |
| 28 | Balanced Allocations for Tree-Like Inputs. Andrei Z. Broder, Alan M. Frieze, Carsten Lund, Steven Phillips, Nick Reingold. Inf. Process. Lett. (55): 329-332 (1995). Cited by 8Web SearchBibTeXDownload |
| 1994 |
|---|
| 27 | The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman. Computational Complexity (4): 158-174 (1994). Cited by 19Web SearchBibTeXDownload |
| 26 | On-Line Distributed Data Management. Carsten Lund, Nick Reingold, Jeffery Westbrook, Dicky C. K. Yan. ESA 1994, 202-214. Cited by 52Web SearchBibTeXDownload |
| 25 | IP over connection-oriented networks and distributional paging. Carsten Lund, Steven Phillips, Nick Reingold. FOCS 1994, 424-434. Cited by 29Web SearchBibTeXDownload |
| 24 | On the Hardness of Approximating Minimization Problems. Carsten Lund, Mihalis Yannakakis. J. ACM (41): 960-981 (1994). Cited by 756Web SearchBibTeXDownload |
| 23 | Linear Programs for Randomized On-Line Algorithms. Carsten Lund, Nick Reingold. SODA 1994, 382-391. Cited by 19Web SearchBibTeXDownload |
| 22 | Efficient probabilistic checkable proofs and applications to approximation. Mihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell. STOC 1994, 820. Web SearchBibTeXDownload |
| 21 | Random Debaters and the Hardness of Approximating Stochastic Functions. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. Structure in Complexity Theory Conference 1994, 280-293. Cited by 56Web SearchBibTeXDownload |
| 20 | Alternation in Interaction. Marcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram. Structure in Complexity Theory Conference 1994, 294-303. Web SearchBibTeXDownload |
| 1993 |
|---|
| 19 | The Approximation of Maximum Subgraph Problems. Carsten Lund, Mihalis Yannakakis. ICALP 1993, 40-51. Cited by 92Web SearchBibTeXDownload |
| 18 | On the Communication Complexity of Zero-Knowledge Proofs. Joan Boyar, Carsten Lund, René Peralta. J. Cryptology (6): 65-85 (1993). Cited by 15Web SearchBibTeXDownload |
| 17 | Complexity Results for Pomset Languages. Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund. SIAM J. Discrete Math. (6): 432-442 (1993). Cited by 17Web SearchBibTeXDownload |
| 16 | Efficient probabilistically checkable proofs and applications to approximations. Mihir Bellare, Shafi Goldwasser, Carsten Lund, A. Russeli. STOC 1993, 294-304. Cited by 275Web SearchBibTeXDownload |
| 15 | Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. Anne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor. STOC 1993, 305-314. Cited by 51Web SearchBibTeXDownload |
| 14 | On the hardness of approximating minimization problems. Carsten Lund, Mihalis Yannakakis. STOC 1993, 286-293. Web SearchBibTeXDownload |
| 13 | Interactive Proof Systems and Alternating Time-Space Complexity. Lance Fortnow, Carsten Lund. Theor. Comput. Sci. (113): 55-73 (1993). Cited by 15Web SearchBibTeXDownload |
| 1992 |
|---|
| 12 | Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. László Babai, Lance Fortnow, Carsten Lund. Computational Complexity (2): 374 (1992). Web SearchBibTeXDownload |
| 11 | Proof Verification and Hardness of Approximation Problems. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy. FOCS 1992, 14-23. Web SearchBibTeXDownload |
| 10 | Algebraic Methods for Interactive Proof Systems. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan. J. ACM (39): 859-868 (1992). Cited by 404Web SearchBibTeXDownload |
| 9 | On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract). Uriel Feige, Carsten Lund. STOC 1992, 643-654. Web SearchBibTeXDownload |
| 8 | The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Joan Feigenbaum, Lance Fortnow, Carsten Lund, Daniel A. Spielman. Structure in Complexity Theory Conference 1992, 338-346. Cited by 19Web SearchBibTeXDownload |
| 1991 |
|---|
| 7 | Complexity Results for POMSET Languages. Joan Feigenbaum, Jeremy A. Kahn, Carsten Lund. CAV 1991, 343-353. Web SearchBibTeXDownload |
| 6 | Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. László Babai, Lance Fortnow, Carsten Lund. Computational Complexity (1): 3-40 (1991). Cited by 491Web SearchBibTeXDownload |
| 5 | Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. Joan Boyar, Katalin Friedl, Carsten Lund. J. Cryptology (4): 185-206 (1991). Cited by 53Web SearchBibTeXDownload |
| 4 | Interactive Proof Systems and Alternating Time-Space Complexity. Lance Fortnow, Carsten Lund. STACS 1991, 263-274. Cited by 15Web SearchBibTeXDownload |
| 1990 |
|---|
| 3 | Algebraic Methods for Interactive Proof Systems. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan. FOCS 1990, 2-10. Cited by 404Web SearchBibTeXDownload |
| 2 | Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols. László Babai, Lance Fortnow, Carsten Lund. FOCS 1990, 16-25. Web SearchBibTeXDownload |
| 1989 |
|---|
| 1 | Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. Joan Boyar, Katalin Friedl, Carsten Lund. EUROCRYPT 1989, 155-172. Cited by 53Web SearchBibTeXDownload |
