The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carsten Lund: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  57. Algorithms and estimators for accurate summarization of internet traffic. [Citation Graph (, )][DBLP]


  58. Modeling and understanding end-to-end class of service policies in operational networks. [Citation Graph (, )][DBLP]


  59. Confident estimation for multistage measurement sampling and aggregation. [Citation Graph (, )][DBLP]


  60. Scalable VPN routing via relaying. [Citation Graph (, )][DBLP]


  61. Stream sampling for variance-optimal estimation of subset sums. [Citation Graph (, )][DBLP]


  62. Sampling to estimate arbitrary subset sums [Citation Graph (, )][DBLP]


  63. Variance optimal sampling based estimation of subset sums [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002