Sotabase

Career

· Researcher, California Institute of Technology (Caltech) Center for the Mathematics of Information (CMI)2024–
· Postdoctoral Researcher, California Institute of Technology2017–2018
· PhD, Computer Science and Engineering, Indian Institute of Technology Kanpur2010–2015
· B.Tech. & M.Tech. Dual Degree, Computer Science and Engineering, Indian Institute of Technology Kanpur2005–2010

Publications (38)

Bipartite perfect matching is in quasi-NC
Symposium on the Theory of Computing · 2016
91
cited
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
SIAM journal on computing (Print) · 2014
59
cited
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs
Computational Complexity · 2014
40
cited
Linear Matroid Intersection is in Quasi-NC
Computational Complexity · 2017
34
cited
Mid-Air Drawing of Curves on 3D Surfaces in Virtual Reality
ACM Transactions on Graphics · 2021
31
cited
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
Theory of Computing · 2016
24
cited
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
Electron. Colloquium Comput. Complex. · 2017
20
cited
A deterministic parallel algorithm for bipartite perfect matching
Communications of the ACM · 2019
19
cited
Improved Explicit Hitting-Sets for ROABPs
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2020
17
cited
Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs
Symposium on Theoretical Aspects of Computer Science · 2014
13
cited
Exact Perfect Matching in Complete Graphs
Electron. Colloquium Comput. Complex. · 2017
13
cited
Planarizing Gadgets for Perfect Matching Do Not Exist
International Symposium on Mathematical Foundations of Computer Science · 2012
13
cited
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision
Algorithmica · 2022
7
cited
Guest Column: Parallel Algorithms for Perfect Matching
SIGA · 2017
7
cited
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques · 2021
5
cited
Pseudorandom Bits for Oblivious Branching Programs
Electron. Colloquium Comput. Complex. · 2017
5
cited
Deterministic Identity Testing for Sum of Read Once ABPs
Electron. Colloquium Comput. Complex. · 2014
4
cited
Hitting-sets for low-distance multilinear depth-3
Electron. Colloquium Comput. Complex. · 2013
4
cited
Impossibility of Derandomizing the Isolation Lemma for all Families
Electron. Colloquium Comput. Complex. · 2020
3
cited
Matching in Planar Graphs
2010
2
cited
Sotabase