default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRohit Gurjar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision. Algorithmica 86(4): 1057-1079 (2024)- [c16]Yatharth Kumar, Sarfaraz Equbal, Rohit Gurjar, Swaprava Nath, Rohit Vaish:
Fair Scheduling of Indivisible Chores. AAMAS 2024: 2345-2347 - [c15]Rohit Gurjar, Taihei Oki, Roshan Raj:
Fractional Linear Matroid Matching Is in Quasi-NC. ESA 2024: 63:1-63:14 - [c14]Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar:
Parallel Complexity of Geometric Bipartite Matching. FSTTCS 2024: 12:1-12:15 - [i31]Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar, Swaprava Nath, Rohit Vaish:
Fair Interval Scheduling of Indivisible Chores. CoRR abs/2402.04353 (2024) - [i30]Rohit Gurjar, Taihei Oki, Roshan Raj:
Fractional Linear Matroid Matching is in quasi-NC. CoRR abs/2402.18276 (2024) - [i29]Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar:
Geometric Bipartite Matching is in NC. CoRR abs/2405.18833 (2024) - [i28]Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Characterizing and Testing Principal Minor Equivalence of Matrices. CoRR abs/2410.01961 (2024) - [i27]Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Characterizing and Testing Principal Minor Equivalence of Matrices. Electron. Colloquium Comput. Complex. TR24 (2024) - [i26]Rohit Gurjar, Taihei Oki, Roshan Raj:
Fractional Linear Matroid Matching is in quasi-NC. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c13]Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Border Complexity of Symbolic Determinant Under Rank One Restriction. CCC 2023: 2:1-2:15 - [i25]Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Border Complexity of Symbolic Determinant under Rank One Restriction. CoRR abs/2305.09973 (2023) - [i24]Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
Border Complexity of Symbolic Determinant under Rank One Restriction. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j13]Stephen A. Fenner, Daniel Grier
, Rohit Gurjar, Arpita Korwar, Thomas Thierauf:
The Complexity of Poset Games. J. Graph Algorithms Appl. 26(1): 1-14 (2022) - [c12]Sumanta Ghosh, Rohit Gurjar, Roshan Raj:
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision. SODA 2022: 1013-1035 - 2021
- [j12]Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. SIAM J. Comput. 50(2): 636-661 (2021) - [j11]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in Quasi-NC. SIAM J. Comput. 50(3) (2021) - [j10]Rohit Gurjar, Nisheeth K. Vishnoi:
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). SIAM J. Discret. Math. 35(3): 1688-1705 (2021) - [c11]Sumanta Ghosh, Rohit Gurjar:
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision. APPROX-RANDOM 2021: 41:1-41:16 - [i23]Sumanta Ghosh, Rohit Gurjar:
Matroid Intersection: A pseudo-deterministic parallel reduction from search to weighted-decision. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j9]Rohit Gurjar, Thomas Thierauf:
Linear Matroid Intersection is in Quasi-NC. Comput. Complex. 29(2): 9 (2020) - [j8]Rohit Gurjar, Ben Lee Volk:
Pseudorandom Bits for Oblivious Branching Programs. ACM Trans. Comput. Theory 12(2): 8:1-8:12 (2020) - [c10]Zeyu Guo, Rohit Gurjar:
Improved Explicit Hitting-Sets for ROABPs. APPROX-RANDOM 2020: 4:1-4:16 - [c9]Rohit Gurjar, Rajat Rathi:
Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization. ICALP 2020: 61:1-61:15 - [i22]Manindra Agrawal, Rohit Gurjar, Thomas Thierauf:
Impossibility of Derandomizing the Isolation Lemma for all Families. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j7]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
A deterministic parallel algorithm for bipartite perfect matching. Commun. ACM 62(3): 109-115 (2019) - [c8]Rohit Gurjar, Nisheeth K. Vishnoi:
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). SODA 2019: 861-880 - 2018
- [c7]Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. ICALP 2018: 74:1-74:14 - [i21]Rohit Gurjar, Nisheeth K. Vishnoi:
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). CoRR abs/1807.05164 (2018) - 2017
- [j6]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. Comput. Complex. 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 Comput. 13(1): 1-21 (2017) - [j3]Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf:
Exact Perfect Matching in Complete Graphs. ACM Trans. Comput. Theory 9(2): 8:1-8:20 (2017) - [c6]Rohit Gurjar, Thomas Thierauf:
Linear matroid intersection is in quasi-NC. STOC 2017: 821-830 - [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, Thomas Thierauf, Nisheeth K. Vishnoi:
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. Electron. Colloquium Comput. Complex. TR17 (2017) - [i17]Rohit Gurjar, Ben Lee Volk:
Pseudorandom Bits for Oblivious Branching Programs. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j2]Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf:
Planarizing Gadgets for Perfect Matching Do Not Exist. ACM Trans. Comput. Theory 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. CCC 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. Electron. Colloquium Comput. Complex. TR16 (2016) - [i13]Rohit Gurjar, Thomas Thierauf:
Linear Matroid Intersection is in quasi-NC. Electron. Colloquium Comput. Complex. TR16 (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. CCC 2015: 323-346 - [i12]Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf:
Bipartite Perfect Matching is in quasi-NC. Electron. Colloquium Comput. Complex. TR15 (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. Electron. Colloquium Comput. Complex. TR14 (2014) - [i7]Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari:
Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs. Electron. Colloquium Comput. Complex. TR14 (2014) - [i6]Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf:
Deterministic Identity Testing for Sum of Read Once ABPs. Electron. Colloquium Comput. Complex. TR14 (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]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for low-distance multilinear depth-3. Electron. Colloquium Comput. Complex. TR13 (2013) - [i3]Stephen A. Fenner, Rohit Gurjar, Arpita Korwar, Thomas Thierauf:
On Two-Level Poset Games. Electron. Colloquium Comput. Complex. TR13 (2013) - [i2]Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf:
Exact Perfect Matching in Complete Graphs. Electron. Colloquium Comput. Complex. TR13 (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. Electron. Colloquium Comput. Complex. TR11 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
