Carsten Lund Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2009
65Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYu-Wei Eric Sung, Carsten Lund, Mark Lyn, Sanjay G. Rao, Subhabrata Sen: Modeling and understanding end-to-end class of service policies in operational networks. SIGCOMM 2009: 219-230
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Stream sampling for variance-optimal estimation of subset sums. SODA 2009: 1255-1264
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets. PVLDB 2(1): 431-442 (2009)
2008
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Carsten Lund, Mikkel Thorup: Confident estimation for multistage measurement sampling and aggregation. SIGMETRICS 2008: 109-120
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChanghoon Kim, Alexandre Gerber, Carsten Lund, Dan Pei, Subhabrata Sen: Scalable VPN routing via relaying. SIGMETRICS 2008: 61-72
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Variance optimal sampling based estimation of subset sums CoRR abs/0803.0473: (2008)
2007
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Algorithms and estimators for accurate summarization of internet traffic. Internet Measurement Comference 2007: 265-278
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Nick G. Duffield, Haim Kaplan, Carsten Lund, Mikkel Thorup: Sketching unaggregated data streams for subpopulation-size queries. PODS 2007: 253-262
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Priority sampling for estimation of arbitrary subset sums. J. ACM 54(6): (2007)
2005
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Optimal Combination of Sampled Network Measurements. Internet Measurment Conference 2005: 91-104
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNoga Alon, Nick G. Duffield, Carsten Lund, Mikkel Thorup: Estimating arbitrary subset sums with few probes. PODS 2005: 317-325
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEdith Cohen, Carsten Lund: Packet classification in large ISPs: design and evaluation of decision tree classifiers. SIGMETRICS 2005: 73-84
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Sampling to estimate arbitrary subset sums CoRR abs/cs/0509026: (2005)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick 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)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Estimating flow distributions from sampled flow statistics. IEEE/ACM Trans. Netw. 13(5): 933-946 (2005)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYin 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)
2004
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYin 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
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Flow sampling under hard resource constraints. SIGMETRICS 2004: 85-96
2003
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund: Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure. Internet Measurement Comference 2003: 179-191
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYin Zhang, Matthew Roughan, Carsten Lund, David L. Donoho: An information-theoretic approach to traffic matrix estimation. SIGCOMM 2003: 301-312
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Estimating flow distributions from sampled flow statistics. SIGCOMM 2003: 325-336
2002
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Properties and prediction of flow statistics from sampled packet streams. Internet Measurement Workshop 2002: 159-171
2001
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLNick G. Duffield, Carsten Lund, Mikkel Thorup: Charging from sampled network usage. Internet Measurement Workshop 2001: 245-256
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnja 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)
2000
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnja 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
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcos A. Kiwi, Carsten Lund, Daniel A. Spielman, Alexander Russell, Ravi Sundaram: Alternation in interaction. Computational Complexity 9(3-4): 202-246 (2000)
1999
39no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Steven Phillips, Nick Reingold: Paging Against a Distribution and IP Networking. J. Comput. Syst. Sci. 58(1): 222-232 (1999)
38no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten 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)
1998
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSanjeev 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)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy: Proof Verification and the Hardness of Approximation Problems. J. ACM 45(3): 501-555 (1998)
1997
35no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUriel Feige, Carsten Lund: On the Hardness of Computing the Permanent of Random Matrices. Computational Complexity 6(2): 101-132 (1997)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek 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)
33no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLRichard Chang, William I. Gasarch, Carsten Lund: On Bounded Queries and Approximation. SIAM J. Comput. 26(1): 188-209 (1997)
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne 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)
1995
31no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Steven Phillips, Nick Reingold: Adaptive Hodling Policies for IP over ATM Networks. INFOCOM 1995: 80-87
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne 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)
29no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSrinivasan 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)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAndrei 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)
1994
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Nick Reingold, Jeffery Westbrook, Dicky C. K. Yan: On-Line Distributed Data Management. ESA 1994: 202-214
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Steven Phillips, Nick Reingold: IP over connection-oriented networks and distributional paging FOCS 1994: 424-434
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Nick Reingold: Linear Programs for Randomized On-Line Algorithms. SODA 1994: 382-391
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihir Bellare, Shafi Goldwasser, Carsten Lund, Alexander Russell: Efficient probabilistic checkable proofs and applications to approximation. STOC 1994: 820
23no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne 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
22no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcos A. Kiwi, Carsten Lund, Alexander Russell, Daniel A. Spielman, Ravi Sundaram: Alternation in Interaction. Structure in Complexity Theory Conference 1994: 294-303
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan 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)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Mihalis Yannakakis: On the Hardness of Approximating Minimization Problems. J. ACM 41(5): 960-981 (1994)
1993
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Mihalis Yannakakis: The Approximation of Maximum Subgraph Problems. ICALP 1993: 40-51
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Mihalis Yannakakis: On the hardness of approximating minimization problems. STOC 1993: 286-293
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMihir Bellare, Shafi Goldwasser, Carsten Lund, A. Russeli: Efficient probabilistically checkable proofs and applications to approximations. STOC 1993: 294-304
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnne Condon, Joan Feigenbaum, Carsten Lund, Peter W. Shor: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions. STOC 1993: 305-314
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Boyar, Carsten Lund, René Peralta: On the Communication Complexity of Zero-Knowledge Proofs. J. Cryptology 6(2): 65-85 (1993)
14no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Feigenbaum, Jeremy A. Kahn, Carsten Lund: Complexity Results for Pomset Languages. SIAM J. Discrete Math. 6(3): 432-442 (1993)
13no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLance Fortnow, Carsten Lund: Interactive Proof Systems and Alternating Time-Space Complexity. Theor. Comput. Sci. 113(1): 55-73 (1993)
1992
12no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, Mario Szegedy: Proof Verification and Hardness of Approximation Problems FOCS 1992: 14-23
11no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLUriel Feige, Carsten Lund: On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) STOC 1992: 643-654
10no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan 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
9no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLászló Babai, Lance Fortnow, Carsten Lund: Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity 2: 374 (1992)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems. J. ACM 39(4): 859-868 (1992)
1991
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Feigenbaum, Jeremy A. Kahn, Carsten Lund: Complexity Results for POMSET Languages. CAV 1991: 343-353
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLance Fortnow, Carsten Lund: Interactive Proof Systems and Alternating Time-Space Complexity. STACS 1991: 263-274
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLászló Babai, Lance Fortnow, Carsten Lund: Non-Deterministic Exponential Time has Two-Prover Interactive Protocols. Computational Complexity 1: 3-40 (1991)
4no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. J. Cryptology 4(3): 185-206 (1991)
1990
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLászló Babai, Lance Fortnow, Carsten Lund: Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols FOCS 1990: 16-25
2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLCarsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan: Algebraic Methods for Interactive Proof Systems FOCS 1990: 2-10
1989
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Boyar, Katalin Friedl, Carsten Lund: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. EUROCRYPT 1989: 155-172

Coauthor Index

1Noga Alon [55]
2Sanjeev Arora [12] [36] [37]
3László Babai [3] [5] [9]
4Mihir Bellare [17] [24]
5Joan Boyar [1] [4] [15]
6Andrei Z. Broder [28]
7Richard Chang [33]
8Marek Chrobak [34]
9Edith Cohen [54] [58] [59] [60] [62] [63] [64]
10Anne Condon [16] [23] [30] [32]
11David L. Donoho [46] [50]
12Nick G. Duffield [43] [44] [45] [47] [48] [49] [51] [52] [53] [55] [56] [57] [58] [59] [60] [62] [63] [64]
13Uriel Feige [11] [35]
14Joan Feigenbaum [7] [10] [14] [16] [21] [23] [30] [32]
15Anja Feldmann [41] [42]
16Lance Fortnow [2] [3] [5] [6] [8] [9] [10] [13] [21]
17Katalin Friedl [1] [4]
18Alan M. Frieze [28]
19William I. Gasarch [33]
20Alexandre Gerber [61]
21Shafi Goldwasser [17] [24]
22Albert G. Greenberg [41] [42]
23Jeremy A. Kahn [7] [14]
24Haim Kaplan [58] [59] [60] [63] [64]
25Howard J. Karloff [2] [8]
26Srinivasan Keshav [29]
27Changhoon Kim [61]
28Marcos A. Kiwi [22] [40]
29Lawrence L. Larmore [34]
30Mark Lyn [65]
31Rajeev Motwani [12] [36] [37]
32Noam Nisan [2] [8]
33Dan Pei [61]
34René Peralta [15]
35Steven Phillips [26] [28] [29] [31] [39]
36Sanjay G. Rao [65]
37Nick Reingold [25] [26] [27] [28] [29] [31] [34] [38] [39] [41] [42]
38Jennifer Rexford [41] [42]
39Matthew Roughan [46] [50]
40A. Russeli [17]
41Alexander Russell [22] [24] [40]
42Huzur Saran [29]
43Subhabrata Sen [49] [61] [65]
44Peter W. Shor [16] [23] [30] [32]
45Sumeet Singh [49]
46Daniel A. Spielman [10] [21] [22] [40]
47Madhu Sudan [12] [36] [37]
48Ravi Sundaram [22] [40]
49Yu-Wei Eric Sung [65]
50Mario Szegedy [12] [36] [37]
51Mikkel Thorup [43] [44] [45] [48] [51] [52] [53] [55] [56] [57] [58] [59] [60] [62] [63] [64]
52Fred True [41] [42]
53Jeffery Westbrook [27] [38]
54Dicky C. K. Yan [27] [38]
55Mihalis Yannakakis [18] [19] [20]
56Yin Zhang [46] [49] [50]

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)