Exact lower time bounds for computing Boolean functions on CREW PRAMs
Journal of Computer and System Sciences
Simple and efficient leader election in the full information model
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Lower bounds for leader election and collective coin-flipping in the perfect information model
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A theorem on sensitivity and applications in private computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
New Imperfect Random Source with Applications to Coin-Flipping
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Computing Boolean Functions from Multiple Faulty Copies of Input Bits
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Spectral Bounds on General Hard Core Predicates
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
On Learning Monotone Boolean Functions under the Uniform Distribution
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Noncryptographic Selection Protocols
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Noise stability of functions with low in.uences invariance and optimality
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Every decision tree has an in.uential variable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Bounds on the Fourier coefficients of the weighted sum function
Information Processing Letters
A note on the Harris-Kesten Theorem
European Journal of Combinatorics
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Average Binary Long-Lived Consensus: Quantifying the Stabilizing Role Played by Memory
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
Improved Bounds for Testing Juntas
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
Electronic Notes in Theoretical Computer Science (ENTCS)
Decision trees and influences of variables over product probability spaces
Combinatorics, Probability and Computing
Variable Influences in Conjunctive Normal Forms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Players' Effects Under Limited Independence
Mathematics of Operations Research
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
Theoretical Computer Science
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and 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
Boolean derivatives with application to edge detection for imaging systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Synchronization of boolean dynamical systems: a spectral characterization
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
On the influences of variables on boolean functions in product spaces
Combinatorics, Probability and Computing
Measuring the influence of the kth largest variable on functions over the unit hypercube
MDAI'10 Proceedings of the 7th international conference on Modeling decisions for artificial intelligence
Measuring the interactions among variables of functions over the unit hypercube
MDAI'10 Proceedings of the 7th international conference on Modeling decisions for artificial intelligence
Journal of Combinatorial Theory Series A
The Computational Hardness of Estimating Edit Distance
SIAM Journal on Computing
Almost isoperimetric subsets of the discrete cube
Combinatorics, Probability and Computing
Tracing data errors with view-conditioned causality
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Quantum one-way communication can be exponentially stronger than classical communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
The optimal strategy for the average long-lived consensus
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
The Fourier entropy-influence conjecture for certain classes of Boolean functions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
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
Submodular functions are noise stable
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Learning juntas in the presence of noise
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Average long-lived memoryless consensus: the three-value case
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
On derandomization and average-case complexity of monotone functions
Theoretical Computer Science
Nearly optimal sparse fourier transform
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Pseudorandom generators with long stretch and low locality from random local one-way functions
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A new exponential separation between quantum and classical one-way communication complexity
Quantum Information & Computation
Approximately strategy-proof voting
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Survey: Randomly colouring graphs (a combinatorial view)
Computer Science Review
A simple reduction from a biased measure on the discrete cube to the uniform measure
European Journal of Combinatorics
Communication: Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width
Discrete Applied Mathematics
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
An invariance principle for polytopes
Journal of the ACM (JACM)
Scalable sampling methodology for logic simulation: reduced-ordered Monte Carlo
Proceedings of the International Conference on Computer-Aided Design
Sensitivity of Boolean formulas
European Journal of Combinatorics
Sparsest cut on quotients of the hypercube
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Sparsest cut on quotients of the hypercube
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Majority is stablest: discrete and SoS
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
FANCI: identification of stealthy malicious logic using boolean functional analysis
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
A composition theorem for the fourier entropy-influence conjecture
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On the structure of boolean functions with small spectral norm
Proceedings of the 5th conference on Innovations in theoretical computer science
Locally testable codes and cayley graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Improved Approximation of Linear Threshold Functions
Computational Complexity
Inferring Boolean functions via higher-order correlations
Computational Statistics
Majority dynamics and aggregation of information in social networks
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |
Methods from harmonic analysis are used to prove some general theorems on Boolean functions. These connections with harmonic analysis viewed by the authors are very promising; besides the results on Boolean functions they enable them to prove theorems on the rapid mixing of the random walk on the cube and in the extremal theory of finite sets.