| Publication | Date of Publication | Type |
|---|
Approximation algorithms for LCS and LIS with truly improved running times
SIAM Journal on Computing | 2025-09-16 | Paper |
| Minor sparsifiers and the distributed Laplacian paradigm | 2025-08-13 | Paper |
| Fully dynamic s-t edge connectivity in subpolynomial time (extended abstract) | 2025-08-13 | Paper |
| Approximation algorithms for LCS and LIS with truly improved running times | 2025-08-12 | Paper |
| On the complexity of optimal lottery pricing and randomized mechanisms | 2025-08-05 | Paper |
| Faster canonical forms for strongly regular graphs | 2025-05-20 | Paper |
| Fully dynamic min-cut of superconstant size in subpolynomial time | 2024-11-28 | Paper |
| Universally-optimal distributed shortest paths and transshipment via graph-based _1-oblivious routing | 2024-07-19 | Paper |
| Faster isomorphism for p-groups of class 2 and exponent p | 2024-05-08 | Paper |
Approximating longest common subsequence in linear time: beating the \(\sqrt{n}\) barrier
SIAM Journal on Computing | 2022-08-25 | Paper |
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
SIAM Journal on Computing | 2022-05-31 | Paper |
Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Approximating LCS in Linear Time: Beating the √<i>n</i> Barrier
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Massively parallel approximation algorithms for edit distance and longest common subsequence
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
The query complexity of graph isomorphism: bypassing distribution testing lower bounds
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The complexity of optimal multidimensional pricing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Learning mixtures of structured distributions over discrete domains
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Numerical algorithms for the time-space tempered fractional Fokker-Planck equation
Advances in Difference Equations | 2018-12-07 | Paper |
The complexity of optimal multidimensional pricing for a unit-demand buyer
Games and Economic Behavior | 2018-07-12 | Paper |
Efficient massively parallel methods for dynamic programming
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Distinguishing properties and applications of higher order derivatives of Boolean functions
Information Sciences | 2016-07-08 | Paper |
Faster canonical forms for primitive coherent configurations (extended abstract)
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Efficient density estimation via piecewise polynomial approximation
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Multi-stage design for quasipolynomial-time isomorphism testing of Steiner 2-systems
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
The key-dependent attack on block ciphers
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Improved Integral Attacks on MISTY1
Selected Areas in Cryptography | 2009-12-09 | Paper |
