Bipartite perfect matching is in quasi-NC S Fenner, R Gurjar, T Thierauf Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 107 | 2016 |

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 | 69 | 2015 |

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

Linear matroid intersection is in quasi-NC R Gurjar, T Thierauf Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 44 | 2017 |

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 | 32 | 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 | 20 | 2021 |

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 | 19 | 2017 |

Improved explicit hitting-sets for roabps Z Guo, R Gurjar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 16 | 2020 |

Planarizing gadgets for perfect matching do not exist R Gurjar, A Korwar, J Messner, S Straub, T Thierauf Mathematical Foundations of Computer Science 2012: 37th International …, 2012 | 16 | 2012 |

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 | 15 | 2016 |

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

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

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

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

Matroid intersection: A pseudo-deterministic parallel reduction from search to weighted-decision S Ghosh, R Gurjar Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2021 | 5 | 2021 |

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 | 4 | 2019 |

A deterministic parallel reduction from weighted matroid intersection search to decision S Ghosh, R Gurjar, R Raj Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 3 | 2022 |

Linearly representable submodular functions: An algebraic algorithm for minimization R Gurjar, R Rathi 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 3 | 2020 |

Planarizing gadgets for perfect matching do not exist R Gurjar, A Korwar, J Messner, S Straub, T Thierauf ACM Transactions on Computation Theory (TOCT) 8 (4), 1-15, 2016 | 3 | 2016 |

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