Unbiased bits from sources of weak randomness and probabilistic communication complexity
SIAM Journal on Computing - Special issue on cryptography
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Communication complexity and quasi randomness
SIAM Journal on Discrete Mathematics
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
The algorithmic aspects of the regularity lemma
Journal of Algorithms
On subsets of finite Abelian groups with no 3-term arithmetic progressions
Journal of Combinatorial Theory Series A
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
The BNS-chung criterion for multi-party communication complexity
Computational Complexity
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The regularity lemma and approximation schemes for dense problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Extracting Randomness Using Few Independent Sources
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Regularity lemma for k-uniform hypergraphs
Random Structures & Algorithms
Key agreement from weak bit agreement
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The counting lemma for regular k-uniform hypergraphs
Random Structures & Algorithms
Gowers uniformity, influence of variables, and PCPs
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
A variant of the hypergraph removal lemma
Journal of Combinatorial Theory Series A
Limits of dense graph sequences
Journal of Combinatorial Theory Series B
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Structure and Randomness in Combinatorics
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Pseudorandom Bits for Polynomials
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Inverse conjecture for the gowers norm is false
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Unconditional pseudorandom generators for low degree polynomials
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Sum of d Small-Bias Generators Fools Polynomials of Degree d
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Nondeterministic exponential time has two-prover interactive protocols
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Every Monotone Graph Property Is Testable
SIAM Journal on Computing
Kakeya Sets, New Mergers and Old Extractors
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Dense Subsets of Pseudorandom Sets
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Leakage-Resilient Cryptography
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution
CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
On the structure of cubic and quartic polynomials
Proceedings of the forty-second ACM symposium on Theory of computing
The maximum size of a Sidon set contained in a sparse random set of integers
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
Additive combinatorics is the branch of combinatorics where the objects of study are subsets of the integers or of other abelian groups, and one is interested in properties and patterns that can be expressed in terms of linear equations. More generally, arithmetic combinatorics deals with properties and patterns that can be expressed via additions and multiplications. In the past ten years, additive and arithmetic combinatorics have been extremely successful areas of mathematics, featuring a convergence of techniques from graph theory, analysis and ergodic theory. They have helped prove long-standing open questions in additive number theory, and they offer much promise of future progress. Techniques from additive and arithmetic combinatorics have found several applications in computer science too, to property testing, pseudorandomness, PCP constructions, lower bounds, and extractor constructions. Typically, whenever a technique from additive or arithmetic combinatorics becomes understood by computer scientists, it finds some application. Considering that there is still a lot of additive and arithmetic combinatorics that computer scientists do not understand (and, the field being very active, even more will be developed in the near future), there seems to be much potential for future connections and applications.