Publications

• Characterizing and Testing Principal Minor Equivalence of Matrices.
  with Abhranil Chatterjee, Sumanta Ghosh, Roshan Raj.
  Symposium on Theory of Computing (STOC) 2025

• Fractional Linear Matroid Matching is in quasi-NC
  with Taihei Oki, Roshan Raj
  European Symposium on Algorithms (ESA) 2024.

• Border Complexity of Symbolic Determinant Under Rank One Restriction
  with Abhranil Chatterjee, Sumanta Ghosh, Roshan Raj
  Computational Complexity Conference (CCC) 2023.

• The Complexity of Poset Games
  with Stephen A. Fenner, Daniel Grier, Arpita Korwar, and Thomas Thierauf
  Journal of Graph Algorithms and Applications 2022.

• A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision
  with Sumanta Ghosh and Roshan Raj
  ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022.

• Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision
  with Sumanta Ghosh
  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021.

• Improved Explicit Hitting-Sets for ROABPs
  with Zeyu Guo
  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020.

• Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization.
  with Rajat Rathi
  International Colloquium on Automata, Languages, and Programming, ICALP 2020.

• A Deterministic Parallel Algorithm for Bipartite Perfect Matching
  with Stephen A. Fenner, Thomas Thierauf
  'Research Highlights' in Communications of the ACM (CACM). March 2019.

• On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
  with Nisheeth Vishnoi
  ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019,
  SIAM Journal on Discrete Mathematics, 35(3), 1688--1705 (2021).

• Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
  with Thomas Thierauf, Nisheeth Vishnoi
  International Colloquium on Automata, Languages, and Programming (ICALP) 2018
  SIAM Journal of Computing 50(2): 636-661 (2021),

• Pseudorandom Bits for Oblivious Branching Programs
  with Ben Lee Volk
  ACM Transactions on Computation Theory 12(2): 8:1-8:12 (2020),

• Guest Column: Parallel Algorithms for Perfect Matching
  with Stephen A. Fenner, Thomas Thierauf
  ACM SIGACT news (ACM Special Interest Groups on Algorithms and Computation Theory), 2017

• Linear Matroid Intersection is in quasi-NC
  with Thomas Thierauf
  Symposium on Theory of Computing (STOC) 2017,
  Computational Complexity 29(2): 9 (2020)

• Identity Testing for constant-width, and commutative, read-once oblivious ABPs
  with Arpita Korwar, Nitin Saxena
  Computational Complexity Conference (CCC) 2016
  Invited to special issue of the journal Theory of Computing for CCC 2016

• Bipartite Perfect Matching is in quasi-NC
  with Stephen A. Fenner, Thomas Thierauf
  Symposium on Theory of Computing (STOC) 2016
  Invited to STOC 2016 special issue in SIAM Journal on Computing 2021

• Derandomizing Isolation Lemma for K33-free and K5-free Bipartite Graphs
  with Rahul Arora, Ashu Gupta, Raghunath Tewari
  International Symposium on Theoretical Aspects of Computer Science (STACS 2016)

• Deterministic Identity Testing for Sum of Read Once ABPs
  with Arpita Korwar, Nitin Saxena, Thomas Thierauf
  Computational Complexity Conference (CCC) 2015
  Journal of Computational Complexity 2016

• Hitting-sets for ROABP and Sum of Set-Multilinear Circuits
  with Manindra Agrawal, Arpita Korwar, Nitin Saxena
  SIAM Journal of Computing (SICOMP) 2015

• Exact Perfect Matching in Complete Graphs
  with Arpita Korwar, Jochen Messner, Thomas Thierauf
  ACM Transactions on Computation Theory (TOCT), 2017

• Planarizing Gadgets for Perfect Matching do not Exist
  with Arpita Korwar, Jochen Messner, Simon Straub, and Thomas Thierauf
  37th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2012.
  ACM Transactions on Computation Theory (TOCT), 2016