| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Carsten Lund Noga Alon , Nick G. Duffield , Carsten Lund, Mikkel Thorup : Estimating arbitrary subset sums with few probes. PODS 2005 : 317-325 Edith Cohen , Carsten Lund: Packet classification in large ISPs: design and evaluation of decision tree classifiers. SIGMETRICS 2005 : 73-84 Nick G. Duffield , Carsten Lund, Mikkel Thorup : Learn more, sample less: control of volume and variance in network measurement. IEEE Transactions on Information Theory 51 (5): 1756-1775 (2005) Nick G. Duffield , Carsten Lund, Mikkel Thorup : Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw. 13 (5): 933-946 (2005) Yin Zhang , Matthew Roughan , Carsten Lund, David L. Donoho : Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach. IEEE/ACM Trans. Netw. 13 (5): 947-960 (2005) Yin Zhang , Sumeet Singh , Subhabrata Sen , Nick G. Duffield , Carsten Lund: Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications. Internet Measurement Conference 2004 : 101-114 Nick G. Duffield , Carsten Lund, Mikkel Thorup : Flow sampling under hard resource constraints. SIGMETRICS 2004 : 85-96 Nick G. Duffield , Carsten Lund: Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure. Internet Measurement Comference 2003 : 179-191 Yin Zhang , Matthew Roughan , Carsten Lund, David L. Donoho : An information-theoretic approach to traffic matrix estimation. SIGCOMM 2003 : 301-312 Nick G. Duffield , Carsten Lund, Mikkel Thorup : Estimating flow distributions from sampled flow statistics. SIGCOMM 2003 : 325-336 Nick G. Duffield , Carsten Lund, Mikkel Thorup : Properties and prediction of flow statistics from sampled packet streams. Internet Measurement Workshop 2002 : 159-171 Nick G. Duffield , Carsten Lund, Mikkel Thorup : Charging from sampled network usage. Internet Measurement Workshop 2001 : 245-256 Anja Feldmann , Albert G. Greenberg , Carsten Lund, Nick Reingold , Jennifer Rexford , Fred True : Deriving traffic demands for operational IP networks: methodology and experience. IEEE/ACM Trans. Netw. 9 (3): 265-280 (2001) Anja Feldmann , Albert G. Greenberg , Carsten Lund, Nick Reingold , Jennifer Rexford , Fred True : Deriving traffic demands for operational IP networks: methodology and experience. SIGCOMM 2000 : 257-270 Marcos A. Kiwi , Carsten Lund, Daniel A. Spielman , Alexander Russell , Ravi Sundaram : Alternation in interaction. Computational Complexity 9 (3-4): 202-246 (2000) Carsten Lund, Steven Phillips , Nick Reingold : Paging Against a Distribution and IP Networking. J. Comput. Syst. Sci. 58 (1): 222-232 (1999) Carsten Lund, Nick Reingold , Jeffery Westbrook , Dicky C. K. Yan : Competitive On-Line Algorithms for Distributed Data Management. SIAM J. Comput. 28 (3): 1086-1111 (1999) Sanjeev Arora , Carsten Lund, Rajeev Motwani , Madhu Sudan , Mario Szegedy : Proof verification and the hardness of approximation problems. Electronic Colloquium on Computational Complexity (ECCC) 5 (8): (1998) Sanjeev Arora , Carsten Lund, Rajeev Motwani , Madhu Sudan , Mario Szegedy : Proof Verification and the Hardness of Approximation Problems. J. ACM 45 (3): 501-555 (1998) Uriel Feige , Carsten Lund: On the Hardness of Computing the Permanent of Random Matrices. Computational Complexity 6 (2): 101-132 (1997) Marek Chrobak , Lawrence L. Larmore , Carsten Lund, Nick Reingold : A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem. Inf. Process. Lett. 63 (2): 79-83 (1997) Richard Chang , William I. Gasarch , Carsten Lund: On Bounded Queries and Approximation. SIAM J. Comput. 26 (1): 188-209 (1997) Anne Condon , Joan Feigenbaum , Carsten Lund, Peter W. Shor : Random Debaters and the Hardness of Approximating Stochastic Functions. SIAM J. Comput. 26 (2): 369-400 (1997) Carsten Lund, Steven Phillips , Nick Reingold : Adaptive Hodling Policies for IP over ATM Networks. INFOCOM 1995 : 80-87 Anne Condon , Joan Feigenbaum , Carsten Lund, Peter W. Shor : Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions. Chicago J. Theor. Comput. Sci. 1995 : (1995) Srinivasan Keshav , Carsten Lund, Steven Phillips , Nick Reingold , Huzur Saran : An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks. IEEE Journal on Selected Areas in Communications 13 (8): 1371-1382 (1995) Andrei Z. Broder , Alan M. Frieze , Carsten Lund, Steven Phillips , Nick Reingold : Balanced Allocations for Tree-Like Inputs. Inf. Process. Lett. 55 (6): 329-332 (1995) Carsten Lund, Nick Reingold , Jeffery Westbrook , Dicky C. K. Yan : On-Line Distributed Data Management. ESA 1994 : 202-214 Carsten Lund, Steven Phillips , Nick Reingold : IP over connection-oriented networks and distributional paging FOCS 1994 : 424-434 Carsten Lund, Nick Reingold : Linear Programs for Randomized On-Line Algorithms. SODA 1994 : 382-391 Mihir Bellare , Shafi Goldwasser , Carsten Lund, Alexander Russell : Efficient probabilistic checkable proofs and applications to approximation. STOC 1994 : 820 Anne Condon , Joan Feigenbaum , Carsten Lund, Peter W. Shor : Random Debaters and the Hardness of Approximating Stochastic Functions. Structure in Complexity Theory Conference 1994 : 280-293 Marcos A. Kiwi , Carsten Lund, Alexander Russell , Daniel A. Spielman , Ravi Sundaram : Alternation in Interaction. Structure in Complexity Theory Conference 1994 : 294-303 Joan Feigenbaum , Lance Fortnow , Carsten Lund, Daniel A. Spielman : The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Computational Complexity 4 : 158-174 (1994) Carsten Lund, Mihalis Yannakakis : On the Hardness of Approximating Minimization Problems. J. ACM 41 (5): 960-981 (1994) Carsten Lund, Mihalis Yannakakis : The Approximation of Maximum Subgraph Problems. ICALP 1993 : 40-51 Carsten Lund, Mihalis Yannakakis : On the hardness of approximating minimization problems. STOC 1993 : 286-293 Mihir Bellare , Shafi Goldwasser , Carsten Lund, A. Russeli : Efficient probabilistically checkable proofs and applications to approximations. STOC 1993 : 294-304 Anne Condon , Joan Feigenbaum , Carsten Lund, Peter W. Shor : Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993 : 305-314 Joan Boyar , Carsten Lund, René Peralta : On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptology 6 (2): 65-85 (1993) Joan Feigenbaum , Jeremy A. Kahn , Carsten Lund: Complexity Results for Pomset Languages. SIAM J. Discrete Math. 6 (3): 432-442 (1993) Lance Fortnow , Carsten Lund: Interactive Proof Systems and Alternating Time-Space Complexity. Theor. Comput. Sci. 113 (1): 55-73 (1993) Sanjeev Arora , Carsten Lund, Rajeev Motwani , Madhu Sudan , Mario Szegedy : Proof Verification and Hardness of Approximation Problems FOCS 1992 : 14-23 Uriel Feige , Carsten Lund: On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) STOC 1992 : 643-654 Joan Feigenbaum , Lance Fortnow , Carsten Lund, Daniel A. Spielman : The Power of Adaptiveness and Additional Queries in Random-Self-Reductions. Structure in Complexity Theory Conference 1992 : 338-346 László Babai , Lance Fortnow , Carsten Lund: Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity 2 : 374 (1992) Carsten Lund, Lance Fortnow , Howard J. Karloff , Noam Nisan : Algebraic Methods for Interactive Proof Systems. J. ACM 39 (4): 859-868 (1992) Joan Feigenbaum , Jeremy A. Kahn , Carsten Lund: Complexity Results for POMSET Languages. CAV 1991 : 343-353 Lance Fortnow , Carsten Lund: Interactive Proof Systems and Alternating Time-Space Complexity. STACS 1991 : 263-274 László Babai , Lance Fortnow , Carsten Lund: Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity 1 : 3-40 (1991) Joan Boyar , Katalin Friedl , Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4 (3): 185-206 (1991) László Babai , Lance Fortnow , Carsten Lund: Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols FOCS 1990 : 16-25 Carsten Lund, Lance Fortnow , Howard J. Karloff , Noam Nisan : Algebraic Methods for Interactive Proof Systems FOCS 1990 : 2-10 Joan Boyar , Katalin Friedl , Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT 1989 : 155-172 1 [ 54 ] 2 [ 12 ] [ 36 ] [ 37 ] 3 [ 3 ] [ 5 ] [ 9 ] 4 [ 17 ] [ 24 ] 5 [ 1 ] [ 4 ] [ 15 ] 6 [ 28 ] 7 [ 33 ] 8 [ 34 ] 9 [ 53 ] 10 [ 16 ] [ 23 ] [ 30 ] [ 32 ] 11 [ 46 ] [ 50 ] 12 [ 43 ] [ 44 ] [ 45 ] [ 47 ] [ 48 ] [ 49 ] [ 51 ] [ 52 ] [ 54 ] 13 [ 11 ] [ 35 ] 14 [ 7 ] [ 10 ] [ 14 ] [ 16 ] [ 21 ] [ 23 ] [ 30 ] [ 32 ] 15 [ 41 ] [ 42 ] 16 [ 2 ] [ 3 ] [ 5 ] [ 6 ] [ 8 ] [ 9 ] [ 10 ] [ 13 ] [ 21 ] 17 [ 1 ] [ 4 ] 18 [ 28 ] 19 [ 33 ] 20 [ 17 ] [ 24 ] 21 [ 41 ] [ 42 ] 22 [ 7 ] [ 14 ] 23 [ 2 ] [ 8 ] 24 [ 29 ] 25 [ 22 ] [ 40 ] 26 [ 34 ] 27 [ 12 ] [ 36 ] [ 37 ] 28 [ 2 ] [ 8 ] 29 [ 15 ] 30 [ 26 ] [ 28 ] [ 29 ] [ 31 ] [ 39 ] 31 [ 25 ] [ 26 ] [ 27 ] [ 28 ] [ 29 ] [ 31 ] [ 34 ] [ 38 ] [ 39 ] [ 41 ] [ 42 ] 32 [ 41 ] [ 42 ] 33 [ 46 ] [ 50 ] 34 [ 17 ] 35 [ 22 ] [ 24 ] [ 40 ] 36 [ 29 ] 37 [ 49 ] 38 [ 16 ] [ 23 ] [ 30 ] [ 32 ] 39 [ 49 ] 40 [ 10 ] [ 21 ] [ 22 ] [ 40 ] 41 [ 12 ] [ 36 ] [ 37 ] 42 [ 22 ] [ 40 ] 43 [ 12 ] [ 36 ] [ 37 ] 44 [ 43 ] [ 44 ] [ 45 ] [ 48 ] [ 51 ] [ 52 ] [ 54 ] 45 [ 41 ] [ 42 ] 46 [ 27 ] [ 38 ] 47 [ 27 ] [ 38 ] 48 [ 18 ] [ 19 ] [ 20 ] 49 [ 46 ] [ 49 ] [ 50 ]  ©2006 Association for Computing Machinery |
