| Publication | Date of Publication | Type |
|---|
Finding the KT partition of a weighted graph in near-linear time
| 2024-08-22 | Paper |
scientific article; zbMATH DE number 7789149 (Why is no real title available?)
Theory of Computing | 2024-01-16 | Paper |
scientific article; zbMATH DE number 7788397 (Why is no real title available?)
| 2024-01-15 | Paper |
Around the log-rank conjecture
Israel Journal of Mathematics | 2023-10-12 | Paper |
On the cut dimension of a graph
| 2023-07-12 | Paper |
Quantum complexity of minimum cut
| 2023-07-12 | Paper |
scientific article; zbMATH DE number 7561509 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561557 (Why is no real title available?)
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559121 (Why is no real title available?)
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559094 (Why is no real title available?)
| 2022-07-18 | Paper |
A composition theorem for randomized query complexity
| 2020-11-25 | Paper |
scientific article; zbMATH DE number 7204275 (Why is no real title available?)
| 2020-05-26 | Paper |
Query Complexity
| 2020-03-04 | Paper |
Quadratically tight relations for randomized query complexity
Theory of Computing Systems | 2020-02-27 | Paper |
Improved quantum query algorithms for triangle finding and associativity testing
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Quadratically tight relations for randomized query complexity
Lecture Notes in Computer Science | 2018-11-28 | Paper |
Separations in query complexity based on pointer functions
Journal of the ACM | 2018-05-17 | Paper |
On the sum-of-squares degree of symmetric quadratic functions
| 2017-10-10 | Paper |
Separations in query complexity based on pointer functions
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Information-theoretic approximations of the nonnegative rank
Computational Complexity | 2017-07-28 | Paper |
Some upper and lower bounds on PSD-rank
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
The cover number of a matrix and its algorithmic applications
| 2017-03-22 | Paper |
Improved quantum query algorithms for triangle detection and associativity testing
Algorithmica | 2017-03-03 | Paper |
New bounds on the classical and quantum communication complexity of some graph properties
| 2017-01-26 | Paper |
Hellinger volume and number-on-the-forehead communication complexity
Journal of Computer and System Sciences | 2016-06-13 | Paper |
Query complexity in expectation
Automata, Languages, and Programming | 2015-10-27 | Paper |
Fooling-sets and rank
European Journal of Combinatorics | 2015-06-02 | Paper |
The approximate rank of a matrix and its algorithmic applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Quantum Query Complexity of State Conversion
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Learning graph based quantum query algorithms for finding constant-size subgraphs
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Rank and fooling set size
| 2013-10-28 | Paper |
A strong direct product theorem for quantum query complexity
Computational Complexity | 2013-07-19 | Paper |
All Schatten spaces endowed with the Schur product are \(Q\)-algebras
Journal of Functional Analysis | 2011-12-14 | Paper |
Disjointness is hard in the multiparty number-on-the-forehead model
Computational Complexity | 2011-02-18 | Paper |
Composition theorems in communication complexity
Automata, Languages and Programming | 2010-09-07 | Paper |
Lower bounds in communication complexity
Foundations and Trends in Theoretical Computer Science | 2010-02-08 | Paper |
scientific article; zbMATH DE number 5485488 (Why is no real title available?)
| 2009-01-05 | Paper |
Product Theorems Via Semidefinite Programming
Automata, Languages and Programming | 2008-08-28 | Paper |
Optimal Quantum Adversary Lower Bounds for Ordered Search
Automata, Languages and Programming | 2008-08-28 | Paper |
Kolmogorov Complexity with Error
STACS 2006 | 2008-03-19 | Paper |
The quantum adversary method and classical formula size power bounds
Computational Complexity | 2007-11-05 | Paper |
A New Rank Technique for Formula Size Lower Bounds
STACS 2007 | 2007-09-03 | Paper |
Language compression and pseudorandom generators
Computational Complexity | 2006-02-08 | Paper |
Resource bounded symmetry of information revisited
Theoretical Computer Science | 2005-12-06 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Arithmetical definability over finite structures
MLQ | 2003-07-31 | Paper |
How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony
Open Systems & Information Dynamics | 2002-08-21 | Paper |
