Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Expanders from symmetric codes
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Expansion of product replacement graphs
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Explicit constructions of selectors and related combinatorial structures, with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Extracting all the randomness and reducing the error in Trevisan's extractors
Journal of Computer and System Sciences - STOC 1999
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Extractors: optimal up to constant factors
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
SIGACT news complexity theory column 51
ACM SIGACT News
Computing separable functions via gossip
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Compression of samplable sources
Computational Complexity
Combinatorial construction of locally testable codes
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Undirected connectivity in log-space
Journal of the ACM (JACM)
Towards a Study of Low-Complexity Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Short PCPPs verifiable in polylogarithmic time with O(1) queries
Annals of Mathematics and Artificial Intelligence
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Information and Computation
An introduction to randomness extractors
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
A sample of samplers: a computational perspective on sampling
Studies in complexity and cryptography
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Basic facts about expander graphs
Studies in complexity and cryptography
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
On the error parameter of dispersers
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Extracting kolmogorov complexity with applications to dimension zero-one laws
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Improving the alphabet-size in high noise, almost optimal rate list decodable codes
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Perfectly secure password protocols in the bounded retrieval model
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Near-Optimal expanding generator sets for solvable permutation groups
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On the role of expander graphs in key predistribution schemes for wireless sensor networks
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
Publicly verifiable proofs of sequential work
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Journal of the ACM (JACM)
Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...