| Publication | Date of Publication | Type |
|---|
Depth-3 circuits for inner product
| 2024-12-03 | Paper |
Depth-3 circuits for inner product
Information and Computation | 2024-10-08 | Paper |
Communication complexity of collision
| 2024-08-22 | Paper |
Further collapses in TFNP
| 2024-07-05 | Paper |
Lower bounds for unambiguous automata via communication complexity
| 2024-06-24 | Paper |
Further collapses in \(\mathsf{TFNP}\)
SIAM Journal on Computing | 2024-05-24 | Paper |
scientific article; zbMATH DE number 7829301 (Why is no real title available?)
| 2024-04-09 | Paper |
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
SIAM Journal on Computing | 2023-12-19 | Paper |
scientific article; zbMATH DE number 7758330 (Why is no real title available?)
| 2023-10-31 | Paper |
On the power and limitations of branch and cut
| 2023-07-12 | Paper |
scientific article; zbMATH DE number 7711600 (Why is no real title available?)
| 2023-07-12 | Paper |
String Matching: Communication, Circuits, and Learning.
| 2023-02-03 | Paper |
scientific article; zbMATH DE number 7561747 (Why is no real title available?)
| 2022-07-21 | Paper |
Near-Optimal Communication Lower Bounds for Approximate Nash Equilibria
SIAM Journal on Computing | 2022-01-07 | Paper |
Automating cutting planes is NP-hard
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
scientific article; zbMATH DE number 7250163 (Why is no real title available?)
| 2020-09-22 | Paper |
Communication lower bounds via critical block sensitivity
SIAM Journal on Computing | 2018-11-07 | Paper |
Non-local probes do not help with many graph problems
| 2018-08-16 | Paper |
Linear-in-\(\varDelta \) lower bounds in the LOCAL model
Distributed Computing | 2018-01-17 | Paper |
scientific article; zbMATH DE number 6789270 (Why is no real title available?)
| 2017-10-10 | Paper |
Locally checkable proofs in distributed computing
Theory of Computing | 2016-12-21 | Paper |
Zero-information protocols and unambiguity in Arthur-Merlin communication
Algorithmica | 2016-11-29 | Paper |
Rectangles are nonnegative juntas
SIAM Journal on Computing | 2016-10-28 | Paper |
Communication complexity of set-disjointness for all probabilities
Theory of Computing | 2016-08-22 | Paper |
Separating OR, SUM, and XOR circuits
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Locally checkable proofs
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Linear-in-\(\Delta\) lower bounds in the LOCAL model
Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
Communication lower bounds via critical block sensitivity
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
What can be decided locally without identifiers?
Proceedings of the 2013 ACM symposium on Principles of distributed computing | 2015-03-02 | Paper |
No sublogarithmic-time approximation scheme for bipartite vertex cover
Distributed Computing | 2015-02-23 | Paper |
Randomized distributed decision
Distributed Computing | 2015-02-23 | Paper |
Lower bounds for local approximation
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Lower bounds for local approximation
Journal of the ACM | 2014-02-17 | Paper |
Search methods for tile sets in patterned DNA self-assembly
Journal of Computer and System Sciences | 2014-01-28 | Paper |
No sublogarithmic-time approximation scheme for bipartite vertex cover
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Synthesizing Minimal Tile Sets for Patterned DNA Self-assembly
Lecture Notes in Computer Science | 2011-01-28 | Paper |
