On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements. - Deepanjan Kesh; Vidya Sagar Sharma (CALDAM, 2019)

The PSPACE-hardness of understanding neural circuits. - Vidya Sagar Sharma; Piyush Srivastava 001 (CoRR, 2020)

Counting Markov Equivalent Directed Acyclic Graphs Consistent with Background Knowledge. - Vidya Sagar Sharma (CoRR, 2022)

On the bitprobe complexity of two probe adaptive schemes. - Deepanjan Kesh; Vidya Sagar Sharma (Discret. Appl. Math., 2022)

Counting Background Knowledge Consistent Markov Equivalent Directed Acyclic Graphs. - Vidya Sagar Sharma (UAI, 2023)

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons. - Vidya Sagar Sharma (CoRR, 2023)

A Fixed-Parameter Tractable Algorithm for Counting Markov Equivalence Classes with the Same Skeleton. - Vidya Sagar Sharma (AAAI, 2024)