Bipartite perfect matching is in quasi-NC S Fenner, R Gurjar, T Thierauf SIAM Journal on Computing, STOC16-218-STOC16-235, 2019 | 80 | 2019 |

Hitting-sets for ROABP and sum of set-multilinear circuits M Agrawal, R Gurjar, A Korwar, N Saxena SIAM Journal on Computing 44 (3), 669-697, 2015 | 53 | 2015 |

Deterministic identity testing for sum of read-once oblivious arithmetic branching programs R Gurjar, A Korwar, N Saxena, T Thierauf computational complexity 26 (4), 835-880, 2017 | 45 | 2017 |

Linear matroid intersection is in quasi-NC R Gurjar, T Thierauf computational complexity 29 (2), 1-42, 2020 | 35 | 2020 |

Identity testing for constant-width, and any-order, read-once oblivious arithmetic branching programs R Gurjar, A Korwar, N Saxena arXiv preprint arXiv:1601.08031, 2016 | 21 | 2016 |

Isolating a vertex via lattices: Polytopes with totally unimodular faces R Gurjar, T Thierauf, NK Vishnoi SIAM Journal on Computing 50 (2), 636-661, 2021 | 15 | 2021 |

Identity Testing for constant-width, and commutative, read-once oblivious ABPs R Gurjar, A Korwar, N Saxena 31st Conference on Computational Complexity (CCC 2016), 2016 | 14 | 2016 |

A deterministic parallel algorithm for bipartite perfect matching S Fenner, R Gurjar, T Thierauf Communications of the ACM 62 (3), 109-115, 2019 | 10 | 2019 |

Derandomizing Isolation Lemma for -free and -free Bipartite Graphs R Arora, A Gupta, R Gurjar, R Tewari arXiv preprint arXiv:1411.7614, 2014 | 9 | 2014 |

Improved Explicit Hitting-Sets for ROABPs Z Guo, R Gurjar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 8 | 2020 |

Planarizing gadgets for perfect matching do not exist R Gurjar, A Korwar, J Messner, S Straub, T Thierauf International Symposium on Mathematical Foundations of Computer Science, 478-490, 2012 | 8 | 2012 |

Pseudorandom bits for oblivious branching programs R Gurjar, BL Volk ACM Transactions on Computation Theory (TOCT) 12 (2), 1-12, 2020 | 6 | 2020 |

Guest column: Parallel algorithms for perfect matching S Fenner, R Gurjar, T Thierauf ACM SIGACT News 48 (1), 102-109, 2017 | 6 | 2017 |

Exact perfect matching in complete graphs R Gurjar, A Korwar, J Messner, T Thierauf ACM Transactions on Computation Theory (TOCT) 9 (2), 1-20, 2017 | 3 | 2017 |

Derandomizing PIT for ROABP and Isolation Lemma for Special Graphs R Gurjar INDIAN INSTITUTE OF TECHNOLOGY KANPUR, 2015 | 3 | 2015 |

Hitting-sets for low-distance multilinear depth-3 M Agrawal, R Gurjar, A Korwar, N Saxena arXiv preprint arXiv:1312.1826, 2013 | 3 | 2013 |

Exact Perfect Matching in Complete Graphs. R Gurjar, A Korwar, J Messner, T Thierauf Electron. Colloquium Comput. Complex. 20, 112, 2013 | 3 | 2013 |

Impossibility of Derandomizing the Isolation Lemma for all Families. M Agrawal, R Gurjar, T Thierauf Electron. Colloquium Comput. Complex. 27, 98, 2020 | 1 | 2020 |

Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization R Gurjar, R Rathi 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 1 | 2020 |

On the number of circuits in regular matroids (with connections to lattices and codes) R Gurjar, NK Vishnoi Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 1 | 2019 |