Planarizing Gadgets for Perfect Matching do not Exist. - Rohit Gurjar; Arpita Korwar; Jochen Messner; Simon Straub; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2011)

Hitting-sets for low-distance multilinear depth-3. - Manindra Agrawal; Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2013)

On Two-Level Poset Games. - Stephen A. Fenner; Rohit Gurjar; Arpita Korwar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2013)

Exact Perfect Matching in Complete Graphs. - Rohit Gurjar; Arpita Korwar; Jochen Messner; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2013)

Deterministic Identity Testing for Sum of Read Once ABPs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2014)

Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. - Manindra Agrawal; Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (SIAM J. Comput., 2015)

Identity Testing for constant-width, and commutative, read-once oblivious ABPs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2016)

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001; Thomas Thierauf (Comput. Complex., 2017)

Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (Theory Comput., 2017)

The Complexity of Poset Games. - Stephen A. Fenner; Daniel Grier; Rohit Gurjar; Arpita Korwar; Thomas Thierauf (J. Graph Algorithms Appl., 2022)