| Publication | Date of Publication | Type |
|---|
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Combining optimisation and simulation using logic-based Benders decomposition
European Journal of Operational Research | 2023-11-15 | Paper |
Logic-based Benders decomposition for wildfire suppression
Computers & Operations Research | 2023-11-13 | Paper |
| Active Set methods for solving large sample average approximations of chance constrained optimisation problems | 2023-07-23 | Paper |
Spatial Isolation Implies Zero Knowledge Even in a Quantum World
Journal of the ACM | 2022-03-31 | Paper |
scientific article; zbMATH DE number 7471587 (Why is no real title available?)
Theory of Computing | 2022-02-09 | Paper |
| Towards blackbox identity testing of log-variate circuits | 2021-07-28 | Paper |
A PSPACE construction of a hitting set for the closure of small algebraic circuits
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
scientific article; zbMATH DE number 7009617 (Why is no real title available?)
Theory of Computing | 2019-01-31 | Paper |
| Zero knowledge protocols from succinct constraint detection | 2018-01-19 | Paper |
Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
(available as arXiv preprint) | 2017-10-10 | Paper |
Proof complexity lower bounds from algebraic circuit complexity
(available as arXiv preprint) | 2017-10-10 | Paper |
Dimension Expanders via Rank Condensers
(available as arXiv preprint) | 2017-08-31 | Paper |
Succinct hitting sets and barriers to proving algebraic circuits lower bounds
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Column Generation and Lazy Constraints for solving the Liner Ship Fleet Repositioning Problem with cargo flows | 2016-03-08 | Paper |
| Disaggregated Benders Decomposition for solving a Network Maintenance Scheduling Problem | 2016-03-07 | Paper |
Hitting sets for multilinear read-once algebraic branching programs, in any order
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
On identity testing of tensors, low-rank recovery and compressed sensing
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Improved soundness for QMA with multiple provers
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
On the locality of codeword symbols in non-linear codes
Discrete Mathematics | 2014-03-20 | Paper |
Explicit Noether normalization for simultaneous conjugation via polynomial identity testing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2013-10-04 | Paper |
A survey of binary covering arrays
The Electronic Journal of Combinatorics | 2011-06-01 | Paper |
