Rohit Gurjar
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
- [j6]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. Computational Complexity 26(4): 835-880 (2017) - [j5]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Guest Column: Parallel Algorithms for Perfect Matching. SIGACT News 48(1): 102-109 (2017) - [j4]Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. Theory of Computing 13(1): 1-21 (2017) - [j3]Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf:
Exact Perfect Matching in Complete Graphs. TOCT 9(2): 8:1-8:20 (2017) - [c6]
- [i20]Rohit Gurjar, Ben Lee Volk:
Pseudorandom Bits for Oblivious Branching Programs. CoRR abs/1708.02054 (2017) - [i19]Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. CoRR abs/1708.02222 (2017) - [i18]Rohit Gurjar, Ben Lee Volk:
Pseudorandom Bits for Oblivious Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 24: 122 (2017) - [i17]Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. Electronic Colloquium on Computational Complexity (ECCC) 24: 127 (2017) - 2016
- [j2]Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching Do Not Exist. TOCT 8(4): 14:1-14:15 (2016) - [c5]Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs. Conference on Computational Complexity 2016: 29:1-29:16 - [c4]Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari:
Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. STACS 2016: 10:1-10:15 - [c3]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite perfect matching is in quasi-NC. STOC 2016: 754-763 - [i16]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in quasi-NC. CoRR abs/1601.06319 (2016) - [i15]Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Identity Testing for constant-width, and commutative, read-once oblivious ABPs. CoRR abs/1601.08031 (2016) - [i14]Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Identity Testing for constant-width, and commutative, read-once oblivious ABPs. Electronic Colloquium on Computational Complexity (ECCC) 23: 9 (2016) - [i13]Rohit Gurjar, Thomas Thierauf:
Linear Matroid Intersection is in quasi-NC. Electronic Colloquium on Computational Complexity (ECCC) 23: 182 (2016) - 2015
- [j1]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44(3): 669-697 (2015) - [c2]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs. Conference on Computational Complexity 2015: 323-346 - [i12]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in quasi-NC. Electronic Colloquium on Computational Complexity (ECCC) 22: 177 (2015) - 2014
- [i11]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. CoRR abs/1406.7535 (2014) - [i10]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read Once ABPs. CoRR abs/1411.7341 (2014) - [i9]Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari:
Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs. CoRR abs/1411.7614 (2014) - [i8]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. Electronic Colloquium on Computational Complexity (ECCC) 21: 85 (2014) - [i7]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read Once ABPs. Electronic Colloquium on Computational Complexity (ECCC) 21: 158 (2014) - [i6]Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari:
Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs. Electronic Colloquium on Computational Complexity (ECCC) 21: 161 (2014) - 2013
- [i5]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for low-distance multilinear depth-3. CoRR abs/1312.1826 (2013) - [i4]Stephen A. Fenner, Rohit Gurjar, Arpita Korwar, Thomas Thierauf:
On Two-Level Poset Games. Electronic Colloquium on Computational Complexity (ECCC) 20: 19 (2013) - [i3]Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf:
Exact Perfect Matching in Complete Graphs. Electronic Colloquium on Computational Complexity (ECCC) 20: 112 (2013) - [i2]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for low-distance multilinear depth-3. Electronic Colloquium on Computational Complexity (ECCC) 20: 174 (2013) - 2012
- [c1]Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching Do Not Exist. MFCS 2012: 478-490 - 2011
- [i1]Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching do not Exist. Electronic Colloquium on Computational Complexity (ECCC) 18: 148 (2011)
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-01-17 20:55 CET by the dblp team