Lower bounds for sampling algorithms for estimating the average

Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Randomness-optimal sampling, extractors, and constructive leader election

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing

Fast approximate PCPs

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

Sampling algorithms: lower bounds and applications

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Sampling lower bounds via information theory

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

SIA: secure information aggregation in sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems

Fast approximate probabilistically checkable proofs

Information and Computation

SIA: Secure information aggregation in sensor networks

Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks

Hardness amplification proofs require majority

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Randomness-Efficient Sampling within NC1

Computational Complexity

Fully-Simulatable Oblivious Set Transfer

ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy

Local approximation of pagerank and reverse pagerank

Proceedings of the 17th ACM conference on Information and knowledge management

Lower Bounds for Swapping Arthur and Merlin

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

On the Randomness Complexity of Property Testing

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques

Algorithmic Aspects of Property Testing in the Dense Graphs Model

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Hardness Amplification Proofs Require Majority

SIAM Journal on Computing

Introduction to testing graph properties

Property testing

Algorithmic aspects of property testing in the dense graphs model

Property testing

Introduction to testing graph properties

Property testing

Algorithmic aspects of property testing in the dense graphs model

Property testing

Testing graph blow-up

Studies in complexity and cryptography

A sample of samplers: a computational perspective on sampling

Studies in complexity and cryptography

Introduction to testing graph properties

Studies in complexity and cryptography

Testing graph blow-Up

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques

Algorithmic Aspects of Property Testing in the Dense Graphs Model

SIAM Journal on Computing

Active learning in the non-realizable case

ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory

On approximation algorithms for data mining applications

Efficient Approximation and Online Algorithms

Social sampling

Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining

Estimating sum by weighted sampling

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming