Communications of the ACM
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
How to construct random functions
Journal of the ACM (JACM)
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits
IEEE Transactions on Computers
A guided tour of Chernoff bounds
Information Processing Letters
The computational complexity of universal hashing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximate inclusion-exclusion
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Polynomial size constant depth circuits with a limited number of negations
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Machine Learning
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the Fourier spectrum of monotone functions
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
Lower bounds for noisy Boolean decision trees
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On Restricted-Focus-of-Attention Learnability of Boolean Functions
Machine Learning - Special issue on the ninth annual conference on computational theory (COLT '96)
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
IEEE Transactions on Computers
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Uniform-distribution attribute noise learnability
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Implementation Issues in the Fourier Transform Algorithm
Machine Learning
SIGACT News complexity theory column 32
ACM SIGACT News
Circuit and decision tree complexity of some number theoretic problems
Information and Computation
MobiMine: monitoring the stock market from a PDA
ACM SIGKDD Explorations Newsletter
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Exact learning of DNF formulas using DNF hypotheses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hardness amplification within NP
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
On Pseudorandom Generators in NC
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximate Location of Relevant Variables under the Crossover Distribution
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Spectral Bounds on General Hard Core Predicates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Minimal Hardware Complexity of Pseudorandom Function Generators
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Computational Power of Boolean Decision Lists
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Hyper-Encryption and Everlasting Security
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Combinatorial Properties of Classes of Functions Hard to Compute in Constant Depth
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
On Learning Monotone DNF under Product Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Exploring Learnability between Exact and PAC
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
On the Derandomization of Constant Depth Circuits
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
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
New degree bounds for polynomial threshold functions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries
Annals of Mathematics and Artificial Intelligence
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Pseudorandom functions in TC0 and cryptographic limitations to proving lower bounds
Computational Complexity
On the noise sensitivity of monotone functions
Random Structures & Algorithms
IEEE Transactions on Knowledge and Data Engineering
Uniform-distribution attribute noise learnability
Information and Computation
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
Design Verification by Test Vectors and Arithmetic Transform Universal Test Set
IEEE Transactions on Computers
Learning intersections and thresholds of halfspaces
Journal of Computer and System Sciences - Special issue on FOCS 2002
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
Hardness amplification within NP
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On learning monotone DNF under product distributions
Information and Computation
Learning functions of k relevant variables
Journal of Computer and System Sciences - Special issue: STOC 2003
Testing monotone high-dimensional distributions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On obfuscating point functions
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Exact learning of DNF formulas using DNF hypotheses
Journal of Computer and System Sciences - Special issue on COLT 2002
Exploring learnability between exact and PAC
Journal of Computer and System Sciences - Special issue on COLT 2002
Agnostically Learning Halfspaces
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A practical generalization of Fourier-based learning
ICML '05 Proceedings of the 22nd international conference on Machine learning
Learning DNF from random walks
Journal of Computer and System Sciences - Special issue: Learning theory 2003
On the computational power of Boolean decision lists
Computational Complexity
Learning a circuit by injecting values
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
IEEE Transactions on Knowledge and Data Engineering
Bounds on the Fourier coefficients of the weighted sum function
Information Processing Letters
Separating Models of Learning from Correlated and Uncorrelated Data
The Journal of Machine Learning Research
Fourier analysis and large independent sets in powers of complete graphs
Journal of Combinatorial Theory Series B
Delegating computation: interactive proofs for muggles
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Agnostically learning decision trees
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Separations between Nondeterministic and Randomized Multiparty Communication
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Learning a circuit by injecting values
Journal of Computer and System Sciences
Efficient learning algorithms yield circuit lower bounds
Journal of Computer and System Sciences
A Simple Proof of Bazzi’s Theorem
ACM Transactions on Computation Theory (TOCT)
Decision trees and influences of variables over product probability spaces
Combinatorics, Probability and Computing
Ehrenfeucht-Fraïssé Games on Random Structures
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Variable Influences in Conjunctive Normal Forms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Testing Fourier Dimensionality and Sparsity
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Extracting propositions from trained neural networks
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Search techniques for Fourier-based learning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Neural network architecture selection: can function complexity help?
Neural Processing Letters
Polylogarithmic independence fools AC0 circuits
Journal of the ACM (JACM)
Extracting a simplified view of design functionality based on vector simulation
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
Circuit complexity of testing square-free numbers
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the average sensitivity of testing square-free numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Learning large-alphabet and analog circuits with value injection queries
COLT'07 Proceedings of the 20th annual conference on Learning theory
A lower bound for agnostically learning disjunctions
COLT'07 Proceedings of the 20th annual conference on Learning theory
Computing partial Walsh transform from the algebraic normal form of a Boolean function
IEEE Transactions on Information Theory
Cryptography with constant input locality
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing
Improved pseudorandom generators for depth 2 circuits
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Learning and lower bounds for AC0 with threshold gates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Poly-logarithmic independence fools bounded-depth boolean circuits
Communications of the ACM
Discrete Applied Mathematics
Hardness of Reconstructing Multivariate Polynomials over Finite Fields
SIAM Journal on Computing
Quantum lower bound for recursive Fourier sampling
Quantum Information & Computation
Locality of queries definable in invariant first-order logic with arbitrary built-in predicates
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Approximating the influence of monotone boolean functions in O(√n) query complexity
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Cryptography in constant parallel time
Cryptography in constant parallel time
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
On the degree of univariate polynomials over the integers
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Simple and practical algorithm for sparse Fourier transform
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Efficient learning algorithms yield circuit lower bounds
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Learning juntas in the presence of noise
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hardness results for agnostically learning low-degree polynomial threshold functions
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Separating models of learning from correlated and uncorrelated data
COLT'05 Proceedings of the 18th annual conference on Learning Theory
On the complexity of parallel hardness amplification for one-way functions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Nearly optimal sparse fourier transform
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Isomorphism testing of boolean functions computable by constant-depth circuits
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity
ACM Transactions on Computation Theory (TOCT)
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
When does greedy learning of relevant attributes succeed?: a fourier-based characterization
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
An invariance principle for polytopes
Journal of the ACM (JACM)
Evasiveness through a circuit lens
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
European Journal of Combinatorics
Gems in decision tree complexity revisited
ACM SIGACT News
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
Candidate weak pseudorandom functions in AC0 ○ MOD2
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.09 |