Abhijeet Sahu
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
This paper reviews advanced AI-based solutions, specifically combining LLMs and RL, to create dynamic and cost-effective network and device-level cyber deception strategies for contested environments.
This paper presents four novel parallel algorithms for maintaining a rooted spanning forest in dynamic graphs, achieving a throughput of 2 million insertions and 1.4 million deletions per second.
Papers
Fully Dynamic Rooted Spanning Tree on GPU
This paper presents four novel parallel algorithms for maintaining a rooted spanning forest in dynamic graphs, achieving a throughput of 2 million insertions and 1.4 million deletions per second.