Rohit Gurjar
Rohit Gurjar
Verified email at caltech.edu - Homepage
Title
Cited by
Cited by
Year
Bipartite perfect matching is in quasi-NC
S Fenner, R Gurjar, T Thierauf
SIAM Journal on Computing, STOC16-218-STOC16-235, 2019
642019
Hitting-sets for ROABP and sum of set-multilinear circuits
M Agrawal, R Gurjar, A Korwar, N Saxena
SIAM Journal on Computing 44 (3), 669-697, 2015
392015
Deterministic identity testing for sum of read-once oblivious arithmetic branching programs
R Gurjar, A Korwar, N Saxena, T Thierauf
computational complexity 26 (4), 835-880, 2017
352017
Linear matroid intersection is in quasi-NC
R Gurjar, T Thierauf
computational complexity 29 (2), 1-42, 2020
302020
Isolating a vertex via lattices: Polytopes with totally unimodular faces
R Gurjar, T Thierauf, NK Vishnoi
arXiv preprint arXiv:1708.02222, 2017
142017
Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs
R Gurjar, A Korwar, N Saxena
arXiv preprint arXiv:1601.08031, 2016
122016
Identity testing for constant-width, and commutative, read-once oblivious ABPs
R Gurjar, A Korwar, N Saxena
31st Conference on Computational Complexity (CCC 2016), 2016
102016
Derandomizing Isolation Lemma for -free and -free Bipartite Graphs
R Arora, A Gupta, R Gurjar, R Tewari
arXiv preprint arXiv:1411.7614, 2014
72014
Planarizing gadgets for perfect matching do not exist
R Gurjar, A Korwar, J Messner, S Straub, T Thierauf
International Symposium on Mathematical Foundations of Computer Science, 478-490, 2012
72012
A deterministic parallel algorithm for bipartite perfect matching
S Fenner, R Gurjar, T Thierauf
Communications of the ACM 62 (3), 109-115, 2019
62019
Pseudorandom bits for oblivious branching programs
R Gurjar, BL Volk
ACM Transactions on Computation Theory (TOCT) 12 (2), 1-12, 2020
52020
Guest column: Parallel algorithms for perfect matching
S Fenner, R Gurjar, T Thierauf
ACM SIGACT News 48 (1), 102-109, 2017
52017
Exact perfect matching in complete graphs
R Gurjar, A Korwar, J Messner, T Thierauf
ACM Transactions on Computation Theory (TOCT) 9 (2), 1-20, 2017
42017
Hitting-sets for low-distance multilinear depth-3
M Agrawal, R Gurjar, A Korwar, N Saxena
arXiv preprint arXiv:1312.1826, 2013
32013
Exact Perfect Matching in Complete Graphs.
R Gurjar, A Korwar, J Messner, T Thierauf
Electronic Colloquium on Computational Complexity (ECCC) 20, 112, 2013
32013
Planarizing gadgets for perfect matching do not exist
R Gurjar, A Korwar, J Messner, S Straub, T Thierauf
ACM Transactions on Computation Theory (TOCT) 8 (4), 1-15, 2016
22016
Derandomizing PIT for ROABP and Isolation Lemma for Special Graphs
R Gurjar
INDIAN INSTITUTE OF TECHNOLOGY KANPUR, 2015
22015
Improved Explicit Hitting-Sets for ROABPs
Z Guo, R Gurjar
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020
12020
Extended formulations for polytopes of regular matroids
R Gurjar, NK Vishnoi
arXiv preprint ArXiv:1701.00538, 2017
12017
On Two-Level Poset Games.
SA Fenner, R Gurjar, A Korwar, T Thierauf
Electronic Colloquium on Computational Complexity (ECCC) 20, 19, 2013
12013
The system can't perform the operation now. Try again later.
Articles 1–20