Rohit Gurjar

Orcid: 0000-0002-8623-0872

According to our database1, Rohit Gurjar authored at least 32 papers between 2011 and 2024.

Collaborative distances:

Timeline

2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
5
1
1
4
2
1
4
1
1
3
3
1
2
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision.
Algorithmica, April, 2024

Fractional Linear Matroid Matching is in quasi-NC.
Electron. Colloquium Comput. Complex., 2024

Characterizing and Testing Principal Minor Equivalence of Matrices.
Electron. Colloquium Comput. Complex., 2024

Geometric Bipartite Matching is in NC.
CoRR, 2024

Fair Interval Scheduling of Indivisible Chores.
CoRR, 2024

Parallel Complexity of Geometric Bipartite Matching.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

Fair Scheduling of Indivisible Chores.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Border Complexity of Symbolic Determinant under Rank One Restriction.
Electron. Colloquium Comput. Complex., 2023

2022
The Complexity of Poset Games.
J. Graph Algorithms Appl., 2022

2021
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes).
SIAM J. Discret. Math., 2021

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces.
SIAM J. Comput., 2021

Bipartite Perfect Matching is in Quasi-NC.
SIAM J. Comput., 2021

Matroid Intersection: A pseudo-deterministic parallel reduction from search to weighted-decision.
Electron. Colloquium Comput. Complex., 2021

2020
Impossibility of Derandomizing the Isolation Lemma for all Families.
Electron. Colloquium Comput. Complex., 2020

Linear Matroid Intersection is in Quasi-NC.
Comput. Complex., 2020

Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

Improved Explicit Hitting-Sets for ROABPs.
Proceedings of the Approximation, 2020

2019
A deterministic parallel algorithm for bipartite perfect matching.
Commun. ACM, 2019

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

Guest Column: Parallel Algorithms for Perfect Matching.
SIGACT News, 2017

Pseudorandom Bits for Oblivious Branching Programs.
Electron. Colloquium Comput. Complex., 2017

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs.
Comput. Complex., 2017

2016
Identity Testing for constant-width, and commutative, read-once oblivious ABPs.
Electron. Colloquium Comput. Complex., 2016

Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits.
SIAM J. Comput., 2015

2014
Deterministic Identity Testing for Sum of Read Once ABPs.
Electron. Colloquium Comput. Complex., 2014

Derandomizing Isolation Lemma for K<sub>3,3</sub>-free and K<sub>5</sub>-free Bipartite Graphs.
Electron. Colloquium Comput. Complex., 2014

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

2013
Exact Perfect Matching in Complete Graphs.
Electron. Colloquium Comput. Complex., 2013

On Two-Level Poset Games.
Electron. Colloquium Comput. Complex., 2013

Hitting-sets for low-distance multilinear depth-3.
Electron. Colloquium Comput. Complex., 2013

2011
Planarizing Gadgets for Perfect Matching do not Exist.
Electron. Colloquium Comput. Complex., 2011


  Loading...