( en | de | ru )

 

Disambiguation of "Gurjar, Rohit"

Author of the publication

copydeleteadd this publication to your clipboard
Linear Matroid Intersection is in quasi-NC.

, and . Electron. Colloquium Comput. Complex., (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

Fractional Linear Matroid Matching is in quasi-NC., , and . Electron. Colloquium Comput. Complex., (2024)Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization., and . ICALP, volume 168 of LIPIcs, page 61:1-61:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Pseudorandom Bits for Oblivious Branching Programs., and . CoRR, (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)On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)., and . SIAM J. Discret. Math., 35 (3): 1688-1705 (2021)Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs., , , and . STACS, volume 47 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs., , and . CCC, volume 50 of LIPIcs, page 29:1-29:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision., and . APPROX-RANDOM, volume 207 of LIPIcs, page 41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A deterministic parallel algorithm for bipartite perfect matching., , and . Commun. ACM, 62 (3): 109-115 (2019)