Rohit Gurjar

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 40

Top Topics

Totally Unimodular

Social Choice Theory

Bipartite Graph

Parallel Algorithm

Top Venues

Electron. Colloquium Comput. Complex.

ACM Trans. Comput. Theory

SIAM J. Comput.

Publications

Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar, Swaprava Nath, Rohit Vaish
Fair Interval Scheduling of Indivisible Chores. CoRR (2024)
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
Border Complexity of Symbolic Determinant under Rank One Restriction. CoRR (2023)
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
Border Complexity of Symbolic Determinant under Rank One Restriction. Electron. Colloquium Comput. Complex. (2023)
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
Border Complexity of Symbolic Determinant Under Rank One Restriction. CCC (2023)
Sumanta Ghosh, Rohit Gurjar, Roshan Raj
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision. SODA (2022)
Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf
The Complexity of Poset Games. J. Graph Algorithms Appl. 26 (1) (2022)
Sumanta Ghosh, Rohit Gurjar
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision. APPROX-RANDOM (2021)
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
Bipartite Perfect Matching is in Quasi-NC. SIAM J. Comput. 50 (3) (2021)
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. SIAM J. Comput. 50 (2) (2021)
Sumanta Ghosh, Rohit Gurjar
Matroid Intersection: A pseudo-deterministic parallel reduction from search to weighted-decision. Electron. Colloquium Comput. Complex. 28 (2021)
Rohit Gurjar, Nisheeth K. Vishnoi
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). SIAM J. Discret. Math. 35 (3) (2021)
Zeyu Guo, Rohit Gurjar
Improved Explicit Hitting-Sets for ROABPs. APPROX-RANDOM (2020)
Rohit Gurjar, Thomas Thierauf
Linear Matroid Intersection is in Quasi-NC. Comput. Complex. 29 (2) (2020)
Rohit Gurjar, Ben Lee Volk
Pseudorandom Bits for Oblivious Branching Programs. ACM Trans. Comput. Theory 12 (2) (2020)
Rohit Gurjar, Rajat Rathi
Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization. ICALP (2020)
Manindra Agrawal, Rohit Gurjar, Thomas Thierauf
Impossibility of Derandomizing the Isolation Lemma for all Families. Electron. Colloquium Comput. Complex. 27 (2020)
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
A deterministic parallel algorithm for bipartite perfect matching. Commun. ACM 62 (3) (2019)
Rohit Gurjar, Nisheeth K. Vishnoi
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). SODA (2019)
Rohit Gurjar, Nisheeth K. Vishnoi
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). CoRR (2018)
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. ICALP (2018)
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. Electron. Colloquium Comput. Complex. 24 (2017)
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
Guest Column: Parallel Algorithms for Perfect Matching. SIGACT News 48 (1) (2017)
Rohit Gurjar, Ben Lee Volk
Pseudorandom Bits for Oblivious Branching Programs. Electron. Colloquium Comput. Complex. 24 (2017)
Rohit Gurjar, Arpita Korwar, Nitin Saxena
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. Theory Comput. 13 (1) (2017)
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. CoRR (2017)
Rohit Gurjar, Ben Lee Volk
Pseudorandom Bits for Oblivious Branching Programs. CoRR (2017)
Rohit Gurjar, Thomas Thierauf
Linear matroid intersection is in quasi-NC. STOC (2017)
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. Comput. Complex. 26 (4) (2017)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf
Exact Perfect Matching in Complete Graphs. ACM Trans. Comput. Theory 9 (2) (2017)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
Planarizing Gadgets for Perfect Matching Do Not Exist. ACM Trans. Comput. Theory 8 (4) (2016)
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
Bipartite perfect matching is in quasi-NC. STOC (2016)
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
Bipartite Perfect Matching is in quasi-NC. CoRR (2016)
Rohit Gurjar, Arpita Korwar, Nitin Saxena
Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs. Computational Complexity Conference (2016)
Rohit Gurjar, Arpita Korwar, Nitin Saxena
Identity Testing for constant-width, and commutative, read-once oblivious ABPs. Electron. Colloquium Comput. Complex. 23 (2016)
Rohit Gurjar, Thomas Thierauf
Linear Matroid Intersection is in quasi-NC. Electron. Colloquium Comput. Complex. 23 (2016)
Rohit Gurjar, Arpita Korwar, Nitin Saxena
Identity Testing for constant-width, and commutative, read-once oblivious ABPs. CoRR (2016)
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. STACS (2016)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44 (3) (2015)
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs. Computational Complexity Conference (2015)
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
Bipartite Perfect Matching is in quasi-NC. Electron. Colloquium Comput. Complex. 22 (2015)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. CoRR (2014)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. Electron. Colloquium Comput. Complex. 21 (2014)
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs. CoRR (2014)
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
Deterministic Identity Testing for Sum of Read Once ABPs. Electron. Colloquium Comput. Complex. 21 (2014)
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
-free Bipartite Graphs. Electron. Colloquium Comput. Complex. 21 (2014)
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
Deterministic Identity Testing for Sum of Read Once ABPs. CoRR (2014)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf
Exact Perfect Matching in Complete Graphs. Electron. Colloquium Comput. Complex. 20 (2013)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for low-distance multilinear depth-3. CoRR (2013)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for low-distance multilinear depth-3. Electron. Colloquium Comput. Complex. 20 (2013)
Stephen A. Fenner, Rohit Gurjar, Arpita Korwar, Thomas Thierauf
On Two-Level Poset Games. Electron. Colloquium Comput. Complex. 20 (2013)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
Planarizing Gadgets for Perfect Matching Do Not Exist. MFCS (2012)
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
Planarizing Gadgets for Perfect Matching do not Exist. Electron. Colloquium Comput. Complex. 18 (2011)