4 citations · 4 across the 3 of their papers we have counts for
5 papers
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem
V. Arvind, Samir Datta, Asif Khan +3
Let be a finite group given as input by its multiplication table. For a subset of and an element the Cayley Group Membership Problem (denoted CGM) is to check…
Linear Space Data Structures for Finite Groups with Constant Query-time
Bireswar Das, Anant Kumar, Shivdutt Sharma +1
A finite group of order can be represented by its Cayley table. In the word-RAM model the Cayley table of a group of order can be stored using words and can be use…
Dynamic Complexity of Group Problems
Samir Datta, Asif Khan, Shivdutt Sharma +2
Dynamic Complexity was introduced by Immerman and Patnaik PI97 in the nineties and has seen a resurgence of interest with the positive resolution of their conjecture on directed re…
Space Efficient Representations of Finite Groups
Bireswar Das, Shivdutt Sharma, P. R. Vaidyanathan
The Cayley table representation of a group uses words for a group of order and answers multiplication queries in time . It is interesting to…
Nearly Optimal Space Efficient Algorithm for Depth First Search
Jayesh Choudhari, Manoj Gupta, Shivdutt Sharma
We design a space-efficient algorithm for performing depth-first search traversal(DFS) of a graph in time using bits of space. While a normal DFS algorithm…