( en | de | ru )

 

Disambiguation of "Gurjar, Rohit"

Author of the publication

copydeleteadd this publication to your clipboard
Bipartite perfect matching is in quasi-NC.

, , and . STOC, page 754-763. ACM, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Rohit Sinha

Rohit Gupta

Rohit Ghai

Rohit Soni

Rohit Datta

 

Other publications of authors with the same name

Pseudorandom Bits for Oblivious Branching Programs., and . TOCT, 12 (2): 8:1-8:12 (2020)Pseudorandom Bits for Oblivious Branching Programs., and . Electron. Colloquium Comput. Complex., (2017)A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision., , and . SODA, page 1013-1035. SIAM, (2022)Border Complexity of Symbolic Determinant Under Rank One Restriction., , , and . CCC, volume 264 of LIPIcs, page 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)A deterministic parallel algorithm for bipartite perfect matching., , and . Commun. ACM, 62 (3): 109-115 (2019)Impossibility of Derandomizing the Isolation Lemma for all Families., , and . Electron. Colloquium Comput. Complex., (2020)Improved Explicit Hitting-Sets for ROABPs., and . APPROX-RANDOM, volume 176 of LIPIcs, page 4:1-4:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision., , and . Algorithmica, 86 (4): 1057-1079 (April 2024)Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits., , , and . SIAM J. Comput., 44 (3): 669-697 (2015)Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs., , , and . Electron. Colloquium Comput. Complex., (2014)