Carsten Lund

J. ACM, 2007

Sketching unaggregated data streams for subpopulation-size queries.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2007

Algorithms and estimators for accurate summarization of internet traffic.

[BibT_eX]

[DOI]

Proceedings of the 7th ACM SIGCOMM Internet Measurement Conference, 2007

2005

Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2005

Estimating flow distributions from sampled flow statistics.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2005

Learn more, sample less: control of volume and variance in network measurement.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2005

Sampling to estimate arbitrary subset sums

[BibT_eX]

[DOI]

CoRR, 2005

Packet classification in large ISPs: design and evaluation of decision tree classifiers.

[BibT_eX]

[DOI]

Edith Cohen

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2005

Estimating arbitrary subset sums with few probes.

[BibT_eX]

[DOI]

Proceedings of the Twenty-fourth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2005

Optimal Combination of Sampled Network Measurements.

[BibT_eX]

[DOI]

Proceedings of the 5th Internet Measurement Conference, 2005

2004

Flow sampling under hard resource constraints.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2004

Online identification of hierarchical heavy hitters: algorithms, evaluation, and applications.

[BibT_eX]

[DOI]

Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, 2004

2003

An information-theoretic approach to traffic matrix estimation.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGCOMM 2003 Conference on Applications, 2003

Predicting resource usage and estimation accuracy in an IP flow measurement collection infrastructure.

[BibT_eX]

[DOI]

Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference, 2003

2002

Properties and prediction of flow statistics from sampled packet streams.

[BibT_eX]

[DOI]

Proceedings of the 2nd ACM SIGCOMM Internet Measurement Workshop, 2002

2001

Deriving traffic demands for operational IP networks: methodology and experience.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2001

Charging from sampled network usage.

[BibT_eX]

[DOI]

Proceedings of the 1st ACM SIGCOMM Internet Measurement Workshop, 2001

2000

NetScope: traffic engineering for IP networks.

[BibT_eX]

[DOI]

IEEE Netw., 2000

Alternation in interaction.

[BibT_eX]

[DOI]

Comput. Complex., 2000

1999

Competitive On-Line Algorithms for Distributed Data Management.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Paging Against a Distribution and IP Networking.

[BibT_eX]

[DOI]

Steven J. Phillips

J. Comput. Syst. Sci., 1999

1998

Proof Verification and the Hardness of Approximation Problems.

[BibT_eX]

[DOI]

J. ACM, 1998

1997

Random Debaters and the Hardness of Approximating Stochastic Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

On Bounded Queries and Approximation.

[BibT_eX]

[DOI]

Richard Chang

William I. Gasarch

SIAM J. Comput., 1997

A Better Lower Bound on the Competitive Ratio of the Randomized 2-Server Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

On the Hardness of Computing the Permanent of Random Matrices.

[BibT_eX]

[DOI]

Uriel Feige

Comput. Complex., 1997

1995

An Empirical Evaluation of Virtual Circuit Holding Time Policies in IP-Over-ATM Networks.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 1995

Balanced Allocations for Tree-Like Inputs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Probabilistically Checkable Debate Systems and Nonapproximability of PSPACE-Hard Functions.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 1995

Adaptive Hodling Policies for IP over ATM Networks.

[BibT_eX]

[DOI]

Steven J. Phillips

Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994

On the Hardness of Approximating Minimization Problems.

[BibT_eX]

[DOI]

Mihalis Yannakakis

J. ACM, 1994

The Power of Adaptiveness and Additional Queries in Random-Self-Reductions.

[BibT_eX]

[DOI]

Comput. Complex., 1994

Efficient probabilistic checkable proofs and applications to approximation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Linear Programs for Randomized On-Line Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

IP over connection-oriented networks and distributional paging

[BibT_eX]

[DOI]

Steven J. Phillips

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

On-Line Distributed Data Management.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1994

1993

Interactive Proof Systems and Alternating Time-Space Complexity.

[BibT_eX]

[DOI]

Lance Fortnow

Theor. Comput. Sci., 1993

Complexity Results for Pomset Languages.

[BibT_eX]

[DOI]

Joan Feigenbaum

Jeremy A. Kahn

SIAM J. Discret. Math., 1993

On the Communication Complexity of Zero-Knowledge Proofs.

[BibT_eX]

[DOI]

Joan Boyar

René Peralta

J. Cryptol., 1993

Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Efficient probabilistically checkable proofs and applications to approximations.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

The Approximation of Maximum Subgraph Problems.

[BibT_eX]

[DOI]

Mihalis Yannakakis

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Algebraic Methods for Interactive Proof Systems.

[BibT_eX]

[DOI]

J. ACM, 1992

Addendum to Non-Deterministic Exponential Time has Two-Prover Interactive Protocols.

[BibT_eX]

[DOI]

László Babai

Lance Fortnow

Comput. Complex., 1992

On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract)

[BibT_eX]

[DOI]

Uriel Feige

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Power of interaction.

[BibT_eX]

ACM Distinguished dissertations, MIT Press, ISBN: 978-0-262-12170-5, 1992

1991

Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies.

[BibT_eX]

[DOI]

Joan Boyar

Katalin Friedl

J. Cryptol., 1991

Non-Deterministic Exponential Time has Two-Prover Interactive Protocols.

[BibT_eX]

[DOI]

László Babai

Lance Fortnow