Rohit Gurjar

Orcid: 0000-0002-8623-0872

According to our database¹, Rohit Gurjar authored at least 34 papers between 2012 and 2025.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2025

2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs.

[BibT_eX]

[DOI]

Rohit Gurjar

Kilian Rothmund

Thomas Thierauf

Electron. Colloquium Comput. Complex., 2025

Characterizing and Testing Principal Minor Equivalence of Matrices.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation.

[BibT_eX]

[DOI]

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

Geometric Bipartite Matching is in NC.

[BibT_eX]

[DOI]

Sujoy Bhore

Sarfaraz Equbal

Rohit Gurjar

CoRR, 2024

Fair Interval Scheduling of Indivisible Chores.

[BibT_eX]

[DOI]

CoRR, 2024

Parallel Complexity of Geometric Bipartite Matching.

[BibT_eX]

[DOI]

Sujoy Bhore

Sarfaraz Equbal

Rohit Gurjar

Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Fractional Linear Matroid Matching Is in Quasi-NC.

[BibT_eX]

[DOI]

Rohit Gurjar

Taihei Oki

Roshan Raj

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Fair Scheduling of Indivisible Chores.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023

Border Complexity of Symbolic Determinant Under Rank One Restriction.

[BibT_eX]

[DOI]

Proceedings of the 38th Computational Complexity Conference, 2023

2022

The Complexity of Poset Games.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2022

A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision.

[BibT_eX]

[DOI]

Sumanta Ghosh

Rohit Gurjar

Roshan Raj

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision.

[BibT_eX]

[DOI]

Sumanta Ghosh

Rohit Gurjar

Proceedings of the Approximation, 2021

2020

Impossibility of Derandomizing the Isolation Lemma for all Families.

[BibT_eX]

[DOI]

Manindra Agrawal

Rohit Gurjar

Thomas Thierauf

Electron. Colloquium Comput. Complex., 2020

Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization.

[BibT_eX]

[DOI]

Rohit Gurjar

Rajat Rathi

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Improved Explicit Hitting-Sets for ROABPs.

[BibT_eX]

[DOI]

Zeyu Guo

Rohit Gurjar

Proceedings of the Approximation, 2020

2019

A deterministic parallel algorithm for bipartite perfect matching.

[BibT_eX]

[DOI]

Stephen A. Fenner

Rohit Gurjar

Thomas Thierauf

Commun. ACM, 2019

On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes).

[BibT_eX]

[DOI]

Rohit Gurjar

Nisheeth K. Vishnoi

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces.

[BibT_eX]

[DOI]

Rohit Gurjar

Thomas Thierauf

Nisheeth K. Vishnoi

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs.

[BibT_eX]

[DOI]

Rohit Gurjar

Arpita Korwar

Nitin Saxena

Theory Comput., 2017

Guest Column: Parallel Algorithms for Perfect Matching.

[BibT_eX]

[DOI]

Stephen A. Fenner

Rohit Gurjar

Thomas Thierauf

SIGACT News, 2017

Pseudorandom Bits for Oblivious Branching Programs.

[BibT_eX]

[DOI]

Rohit Gurjar

Ben Lee Volk

Electron. Colloquium Comput. Complex., 2017

Linear matroid intersection is in quasi-NC.

[BibT_eX]

[DOI]

Rohit Gurjar

Thomas Thierauf

Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

2016

Bipartite perfect matching is in quasi-NC.

[BibT_eX]

[DOI]

Stephen A. Fenner

Rohit Gurjar

Thomas Thierauf

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs.

[BibT_eX]

[DOI]

Rohit Gurjar

Arpita Korwar

Nitin Saxena

Proceedings of the 31st Conference on Computational Complexity, 2016

2015

Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs.

[BibT_eX]

[DOI]

Proceedings of the 30th Conference on Computational Complexity, 2015

2014

Deterministic Identity Testing for Sum of Read Once ABPs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Derandomizing Isolation Lemma for K<sub>3,3</sub>-free and K<sub>5</sub>-free Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Hitting-sets for ROABP and Sum of Set-Multilinear circuits.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2014

Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Exact Perfect Matching in Complete Graphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

On Two-Level Poset Games.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

Hitting-sets for low-distance multilinear depth-3.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2013

2012

Planarizing Gadgets for Perfect Matching Do Not Exist.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Rohit Gurjar

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...