Rohit Gurjar

发表

Extended Formulations for Polytopes of Regular Matroids pdf

Nisheeth K. Vishnoi, Rohit Gurjar, R. Gurjar, 2016, ArXiv.

On Two-Level Poset Games

Thomas Thierauf, Stephen A. Fenner, Rohit Gurjar, 2013, Electron. Colloquium Comput. Complex..

Linear Matroid Intersection is in Quasi-NC

Thomas Thierauf, Rohit Gurjar, 2020, Comput. Complex..

Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs

Raghunath Tewari, Rahul Arora, Rohit Gurjar, 2014, STACS.

Planarizing Gadgets for Perfect Matching Do Not Exist

Jochen Messner, Thomas Thierauf, Rohit Gurjar, 2012, MFCS.

Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs

Nitin Saxena, Rohit Gurjar, Arpita Korwar, 2016, Theory Comput..

Hitting-sets for low-distance multilinear depth-3 pdf

Nitin Saxena, Manindra Agrawal, Rohit Gurjar, 2013, Electron. Colloquium Comput. Complex..

Impossibility of Derandomizing the Isolation Lemma for all Families

Manindra Agrawal, Thomas Thierauf, Rohit Gurjar, 2020, Electron. Colloquium Comput. Complex..

TECHNOLOGY MODIFIED SIERPINSKI CARPET FRACTAL ANTENNA FOR WIRELESS APPLICATION

Rohit Gurjar, Abhay Kashyap, Avinash Verma, 2015 .

Linear Matroid Intersection is in Quasi-NC

Thomas Thierauf, Rohit Gurjar, T. Thierauf, 2017, computational complexity.

Bipartite perfect matching is in quasi-NC

Thomas Thierauf, Stephen A. Fenner, Rohit Gurjar, 2016, STOC.

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs

Nitin Saxena, Thomas Thierauf, Rohit Gurjar, 2014, computational complexity.

A deterministic parallel algorithm for bipartite perfect matching

Thomas Thierauf, Stephen A. Fenner, Rohit Gurjar, 2019, Commun. ACM.

Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs

Nitin Saxena, Rohit Gurjar, Arpita Korwar, 2016, Computational Complexity Conference.

Deterministic Identity Testing for Sum of Read Once ABPs

Nitin Saxena, Thomas Thierauf, Rohit Gurjar, 2014, Electron. Colloquium Comput. Complex..

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs

Nitin Saxena, Thomas Thierauf, Rohit Gurjar, 2016, computational complexity.

Matching in Planar Graphs

Rohit Gurjar, R. Gurjar, 2010 .

Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits pdf

Nitin Saxena, Manindra Agrawal, Rohit Gurjar, 2014, SIAM J. Comput..

Exact Perfect Matching in Complete Graphs

Jochen Messner, Thomas Thierauf, Rohit Gurjar, 2013, Electron. Colloquium Comput. Complex..

Planarizing Gadgets for Perfect Matching Do Not Exist

Jochen Messner, Thomas Thierauf, Rohit Gurjar, 2012, MFCS.

Identity Testing for constant-width, and commutative, read-once oblivious ABPs

Nitin Saxena, Rohit Gurjar, Arpita Korwar, 2016, Electron. Colloquium Comput. Complex..

On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) pdf

Nisheeth K. Vishnoi, Rohit Gurjar, R. Gurjar, 2018, SODA.

Guest Column: Parallel Algorithms for Perfect Matching

Thomas Thierauf, Stephen A. Fenner, Rohit Gurjar, 2017, SIGA.

Pseudorandom Bits for Oblivious Branching Programs

Rohit Gurjar, Ben lee Volk, 2017, Electron. Colloquium Comput. Complex..

INTERNATIONAL JOURNA L OF ENGINEERING SCI ENCES & RESEARCH TECHNOLOGY A New Class of Combined Bartlett -Blackman Window Family

Madhur Jain, Rohit Gurjar, Sandeep Kumar Arya, 2013 .

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

Nisheeth K. Vishnoi, Thomas Thierauf, Rohit Gurjar, 2017, Electron. Colloquium Comput. Complex..

Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization

Rohit Gurjar, Rajat Rathi, Rajat Rathi, 2020, ICALP.

Improved Explicit Hitting-Sets for ROABPs

Rohit Gurjar, Zeyu Guo, 2020, APPROX/RANDOM.

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

Nisheeth K. Vishnoi, Thomas Thierauf, Rohit Gurjar, 2021, SIAM J. Comput..

Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision

Rohit Gurjar, Sumanta Ghosh, Sumanta Ghosh, 2021, APPROX-RANDOM.

The Complexity of Poset Games

Thomas Thierauf, Stephen A. Fenner, Daniel Grier, 2022, J. Graph Algorithms Appl..

Mid-Air Drawing of Curves on 3D Surfaces in Virtual Reality

Adrien Bousseau, Tovi Grossman, Raghunath Tewari, 2021, ACM Trans. Graph..

On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)

Nisheeth K. Vishnoi, Rohit Gurjar, 2021, SIAM J. Discret. Math..

Bipartite Perfect Matching is in Quasi-NC

Thomas Thierauf, Stephen A. Fenner, Rohit Gurjar, 2021, SIAM J. Comput..