| Proof verification and the hardness of approximation problems S Arora, C Lund, R Motwani, M Sudan, M Szegedy Journal of the ACM (JACM) 45 (3), 501-555, 1998 | 3195 | 1998 |
| On the hardness of approximating minimization problems C Lund, M Yannakakis Journal of the ACM (JACM) 41 (5), 960-981, 1994 | 1501 | 1994 |
| Algebraic methods for interactive proof systems C Lund, L Fortnow, H Karloff, N Nisan Journal of the ACM (JACM) 39 (4), 859-868, 1992 | 1201 | 1992 |
| Non-deterministic exponential time has two-prover interactive protocols L Babai, L Fortnow, C Lund Computational complexity 1, 3-40, 1991 | 1065 | 1991 |
| Deriving traffic demands for operational IP networks: Methodology and experience A Feldmann, A Greenberg, C Lund, N Reingold, J Rexford, F True IEEE/ACM Transactions On Networking 9 (3), 265-279, 2001 | 531 | 2001 |
| Hardness of approximations S Arora, C Lund Approximation algorithms for NP-hard problems, 399-446, 1996 | 459 | 1996 |
| Efficient probabilistically checkable proofs and applications to approximations M Bellare, S Goldwasser, C Lund, A Russell Proceedings of the twenty-fifth annual ACM symposium on Theory of computing …, 1993 | 450 | 1993 |
| Estimating flow distributions from sampled flow statistics N Duffield, C Lund, M Thorup Proceedings of the 2003 conference on Applications, technologies …, 2003 | 412 | 2003 |
| An information-theoretic approach to traffic matrix estimation Y Zhang, M Roughan, C Lund, D Donoho Proceedings of the 2003 conference on Applications, technologies …, 2003 | 397 | 2003 |
| NetScope: Traffic engineering for IP networks A Feldmann, A Greenberg, C Lund, N Reingold, J Rexford IEEE Network 14 (2), 11-19, 2000 | 378 | 2000 |
| Properties and prediction of flow statistics from sampled packet streams N Duffield, C Lund, M Thorup Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment, 159-171, 2002 | 330 | 2002 |
| Deriving traffic demands for operational IP networks: Methodology and experience A Feldmann, A Greenberg, C Lund, N Reingold, J Rexford, F True Proceedings of the conference on Applications, Technologies, Architectures …, 2000 | 295 | 2000 |
| Charging from sampled network usage N Duffield, C Lund, M Thorup Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement, 245-256, 2001 | 268 | 2001 |
| Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications Y Zhang, S Singh, S Sen, N Duffield, C Lund Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, 101-114, 2004 | 263 | 2004 |
| The approximation of maximum subgraph problems C Lund, M Yannakakis International Colloquium on Automata, Languages, and Programming, 40-51, 1993 | 246 | 1993 |
| Learn more, sample less: control of volume and variance in network measurement N Duffield, C Lund, M Thorup IEEE Transactions on Information Theory 51 (5), 1756-1775, 2005 | 220 | 2005 |
| Estimating flow distributions from sampled flow statistics N Duffield, C Lund, M Thorup IEEE/ACM Transactions on Networking 13 (5), 933-946, 2005 | 177 | 2005 |
| Estimating point-to-point and point-to-multipoint traffic matrices: An information-theoretic approach Y Zhang, M Roughan, C Lund, DL Donoho IEEE/ACM Transactions on networking 13 (5), 947-960, 2005 | 171 | 2005 |
| Flow sampling under hard resource constraints N Duffield, C Lund, M Thorup ACM SIGMETRICS Performance Evaluation Review 32 (1), 85-96, 2004 | 156 | 2004 |
| Priority sampling for estimation of arbitrary subset sums N Duffield, C Lund, M Thorup Journal of the ACM (JACM) 54 (6), 32-es, 2007 | 139 | 2007 |