Sandeep Sen

1. Fully dynamic maximal matching in O(log n) update time
   2011/03/06 by Surender Baswana, Baswana, Surender, Manoj Gupta +3 · 4 citations
   Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Privacy-Preserving Technologies in Data
2. The update complexity of selection and related problems
   2011/08/29 by Manoj Kumar Gupta, Yogish Sabharwal, Gupta, Manoj +3 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Machine Learning and Algorithms #Optimization and Search Problems
3. The covert set-cover problem with application to Network Discovery
   2012/02/06 by Sandeep Sen, Sen, Sandeep, V. N. Muralidhara +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems