Technical Reports - Papers and Drafts
(in reverse chronological order).
You can also see -
my DBLP page,
CoRR Uploads and
ECCC uploads.
hellohellohello
- Energy and Output Patterns in Boolean Circuits
(with Kei Uchizawa) - On Separating Words Problem over Groups
(with Neha Kuntewar, Anoop S K M) - On Rotation Distance, Transpositions and Rank Bounded Trees
(with Anoop S K M) - On Alternation, VC-dimension and k-fold Union of Sets
(with Amit Kumar Roy) - On the Computational Power of Programs over BA_2 Monoid
(with Manasi Kulkarni, Janani Sundaresan) - Power of Decision Trees with Monotone Queries
(with Prashanth Amireddy, Sai Jayasurya) - On the Mystery of Negations in Circuits : Structure vs Power
(with Prashanth Amireddy, Sai Jayasurya) - On Pure Space vs Catalytic Space
(with Sagar Bisoyi, Krishnamoorthy Dinesh) - Sensitivity, Affine Transforms and Quantum Communication Complexity
[PDF]
(with Krishnamoorthy Dinesh) - New Bounds for Energy Complexity of Boolean Functions
[PDF]
(with Krishnamoorthy Dinesh, Samir Otiv) - Alternation, Sparsity and Sensitivity : Combinatorial Bounds and Exponential Gaps
[PDF]
(with Krishnamoorthy Dinesh) - Testing Equivalence of Polynomials under Scaling
[PDF]
(with Markus Blaser, Raghavendra Rao B V) - Space Complexity of Labelled Graph Reachability Problem
[PDF]
(with Vidhya Ramaswamy, K.S. Sunil) - Characterization and Lower Bounds for Branching Program Size using Projective Dimension
[PDF]
(with Krishnamoorthy Dinesh, Sajin Koroth) - Reversible Pebble Game on Trees
[PDF]
(with Balagopal Komarath, Saurabh Sawlani) - Comparator Circuits over Finite Bounded Posets
[PDF]
(with Balagopal Komarath, K.S. Sunil) - Polynomial Min/Max-weighted Reachability is in Unambiguous Logspace
[PDF]
(with Anant Dhayal, Saurabh Sawlani) - Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
[PDF]
(with Kristoffer Arnsfelt Hansen, Balagopal Komarath, Sven Skyum, Navid Talebanfard) - On the Complexity of L-reachability
[PDF]
(with Balagopal Komarath, K.S. Sunil) - Depth Lower bounds against Circuits with Sparse Orientation
[PDF]
(with Sajin Koroth) - Complexity of Testing Reachability in Matroids
[PDF]
(with Raghavendra Rao B V) - Arithmetic Circuit Lower Bounds via MaxRank
[PDF]
(with Mrinal Kumar, Gaurav Maheshwari) - Pebbling, Entropy and Branching Program Size Lower Bounds
[PDF]
(with Balagopal Komarath) - On Directed Tree Realizations of Degree Sets
[PDF]
(with Prasun Kumar, Saurabh Sawlani) - Isomorphism Testing of Read-once Functions and Polynomials
[PDF]
(with Raghavendra Rao B V) - On Isomorphism Testing of Groups with Normal Hall Subgroups
[PDF]
(with Youming Qiao, Bangsheng Tang) - Deterministic BlackBox Identity Testing Pi-ordered Algebraic Branching Programs
[PDF]
(with Maurice Jansen, Youming Qiao) - Limiting Negations in Bounded Treewidth and Upward Planar Circuits
[PDF]
(with Jing He, Hongyu Liang) - Balancing Bounded Treewidth Circuits
[PDF]
(with Maurice Jansen) - Deterministic Polynomial Identity Testing of Read-once Algebraic Branching Programs
[PDF]
(with Maurice Jansen, Youming Qiao) - On the Complexity of Matroid Isomorphism Problem
[PDF]
(with Raghavendra Rao B V) - Complexity Theoretic Aspects of Matrix Rank, Rigidity and Circuit Value
[PDF]
- Rigidity of a Simple Extended Lower Triangular Matrix
[PDF]
(with Meena Mahajan) - On the Thickness of Branching Programs
(with Meena Mahajan) - On the Complexity of Rank and Rigidity
[PDF]
(with Meena Mahajan) - Evaluating Monotone Circuits on Cylinders, Planes and Tori
[PDF]
(with Nutan Limaye, Meena Mahajan) - Refining Randomness and Applications to Derandomization(Survey)
Last update: Mon Apr 15 15:08:01 IST 2024