| Publication | Date of Publication | Type |
|---|
Improved monotonicity testers via hypercube embeddings
| 2024-09-25 | Paper |
Rounding via low dimensional embeddings
| 2024-09-25 | Paper |
Communication and information complexity
International Congress of Mathematicians | 2024-03-22 | Paper |
New separations results for external information
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Optimal tiling of the euclidean space using permutation-symmetric bodies
| 2023-07-12 | Paper |
Optimal Short-Circuit Resilient Formulas
Journal of the ACM | 2023-04-27 | Paper |
On the computational power of radio channels
| 2023-02-03 | Paper |
Improved Monotonicity Testers via Hypercube Embeddings
| 2022-11-16 | Paper |
scientific article; zbMATH DE number 7564410 (Why is no real title available?)
| 2022-07-27 | Paper |
An Invariance Principle for the Multi-slice, with Applications
| 2021-10-20 | Paper |
Semi-Direct Sum Theorem and Nearest Neighbor under ℓ∞
| 2021-08-04 | Paper |
A candidate for a strong separation of information and communication
| 2021-06-15 | Paper |
Information value of two-prover games
| 2021-06-15 | Paper |
Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs
SIAM Journal on Computing | 2020-10-29 | Paper |
Reliable communication over highly connected noisy networks
Distributed Computing | 2019-11-27 | Paper |
Hitting sets with near-optimal error for read-once branching programs
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Interactive compression to external information
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Finding endogenously formed communities
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The complexity of simulating Brownian motion
| 2019-05-06 | Paper |
Information complexity and applications.
Japanese Journal of Mathematics. 3rd Series | 2019-03-14 | Paper |
The Price of Uncertain Priors in Source Coding
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
SIAM Journal on Computing | 2018-12-19 | Paper |
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
Journal of the ACM | 2018-08-02 | Paper |
Interpolating between truthful and non-truthful mechanisms for combinatorial auctions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
ETH hardness for densest-\(k\)-subgraph with perfect completeness
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Coding for Interactive Communication Correcting Insertions and Deletions
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Network coding in undirected graphs is either very helpful or not helpful at all
| 2018-05-03 | Paper |
Tight space-noise tradeoffs in computing the ergodic measure
Sbornik: Mathematics | 2018-04-06 | Paper |
On simultaneous two-player combinatorial auctions
| 2018-03-15 | Paper |
Information complexity is computable
| 2017-12-19 | Paper |
Coding for interactive communication correcting insertions and deletions
| 2017-12-19 | Paper |
Nash equilibria in perturbation-stable games
Theory of Computing | 2017-11-14 | Paper |
Interactive information complexity
SIAM Review | 2017-11-09 | Paper |
Interactive information and coding theory
| 2017-11-06 | Paper |
Approximating the best Nash equilibrium in \(n^{o(\log n)}\)-time breaks the exponential time hypothesis
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Parallel algorithms for select and partition with noisy comparisons
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Communication lower bounds for statistical estimation problems via a distributed data processing inequality
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Constant-rate coding for multiparty interactive communication is impossible
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Reliable communication over highly connected noisy networks
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
Strategyproof mechanisms for competitive influence in networks
Algorithmica | 2017-07-07 | Paper |
Simulating noisy channel interaction (extended abstract)
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Information Equals Amortized Communication
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
On the convergence of the Hegselmann-Krause system
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
Toward coding for maximum errors in interactive communication
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
SIAM Journal on Computing | 2017-03-10 | Paper |
Search using queries on indistinguishable items
| 2017-01-30 | Paper |
Information lower bounds via self-reducibility
Theory of Computing Systems | 2017-01-18 | Paper |
A discrepancy lower bound for information complexity
Algorithmica | 2016-11-29 | Paper |
Towards deterministic tree code constructions
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Noise vs computational intractability in dynamics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | 2016-10-07 | Paper |
Optimal provision-after-wait in healthcare
Mathematics of Operations Research | 2016-04-15 | Paper |
On information complexity in the broadcast model
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing | 2016-03-23 | Paper |
Interactive Information Complexity
SIAM Journal on Computing | 2015-11-25 | Paper |
Pebbles and branching programs for tree evaluation
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
An interactive information odometer and applications
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Small value parallel repetition for general games
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Stability in large matching markets with complementarities
Operations Research | 2014-11-26 | Paper |
Inapproximability of NP-complete variants of Nash equilibrium
Theory of Computing | 2014-10-06 | Paper |
Pseudorandom generators for regular branching programs
SIAM Journal on Computing | 2014-09-18 | Paper |
How to compress interactive communication
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
An information complexity approach to extended formulations
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
From information to exact communication
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Information Equals Amortized Communication
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
The Grothendieck Constant is Strictly Smaller than Krivine's Bound
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Public vs private coin in bounded-round information
Automata, Languages, and Programming | 2014-07-01 | Paper |
Towards coding for maximum errors in interactive communication
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Interactive information complexity
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Thurston equivalence to a rational map is decidable
| 2014-03-25 | Paper |
The Grothendieck constant is strictly smaller than Krivine's bound
Forum of Mathematics, Pi | 2014-03-11 | Paper |
How to compress interactive communication
SIAM Journal on Computing | 2013-09-25 | Paper |
Direct product via round-preserving compression
Automata, Languages, and Programming | 2013-08-06 | Paper |
Information Lower Bounds via Self-reducibility
Computer Science – Theory and Applications | 2013-06-14 | Paper |
The rate of convergence of the walk on spheres algorithm
Geometric and Functional Analysis. GAFA | 2013-02-04 | Paper |
A discrepancy lower bound for information complexity
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Fractional pebbling and thrifty branching programs
| 2012-10-24 | Paper |
Computability of Brolin-Lyubich measure
Communications in Mathematical Physics | 2011-12-13 | Paper |
Inapproximability of NP-Complete Variants of Nash Equilibrium
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Space-efficient counting in graphs on surfaces
Computational Complexity | 2011-02-18 | Paper |
Monotonicity and implementability
Econometrica | 2010-11-17 | Paper |
Position Auctions with Budgets: Existence and Uniqueness
The B.E. Journal of Theoretical Economics | 2010-10-18 | Paper |
Polylogarithmic independence fools \(\mathrm{AC}^{0}\) circuits
Journal of the ACM | 2010-08-09 | Paper |
Noisy sorting without resampling
| 2010-08-06 | Paper |
On computational complexity of Siegel Julia sets
Communications in Mathematical Physics | 2010-07-19 | Paper |
Constructing locally connected non-computable Julia sets
Communications in Mathematical Physics | 2010-01-11 | Paper |
Branching Programs for Tree Evaluation
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Derandomization of Euclidean Random Walks
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Computability of Julia sets
| 2009-02-05 | Paper |
Constructing non-computable Julia sets
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
On the computational complexity of the Riemann mapping
Arkiv för Matematik | 2008-09-03 | Paper |
Filled Julia sets with empty interior are computable
Foundations of Computational Mathematics | 2008-09-02 | Paper |
Computability of Julia sets
Algorithms and Computation in Mathematics | 2008-07-10 | Paper |
Mafia: A theoretical study of players and coalitions in a partial information environment
The Annals of Applied Probability | 2008-07-01 | Paper |
The complexity of properly learning simple concept classes
Journal of Computer and System Sciences | 2007-11-30 | Paper |
Termination of Integer Linear Programs
Computer Aided Verification | 2007-09-05 | Paper |
Parabolic Julia sets are polynomial time computable
Nonlinearity | 2006-09-25 | Paper |
Non-computable Julia sets
Journal of the American Mathematical Society | 2006-05-17 | Paper |
On computability of Julia sets: answers to questions of Milnor and Shub
| 2006-04-07 | Paper |
Computing over the reals: foundations for scientific computing.
| 2006-03-13 | Paper |
scientific article; zbMATH DE number 2209873 (Why is no real title available?)
| 2005-09-28 | Paper |
Chebyshev systems and estimation theory for discrete distributions.
Statistics & Probability Letters | 2003-05-07 | Paper |
A Monte Carlo algorithm for a lottery problem
Monte Carlo Methods and Applications | 2001-07-12 | Paper |
