4 citations · 22 across the 15 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 3 cited
The update complexity of selection and related problems
Manoj Gupta, Yogish Sabharwal, Sandeep Sen
We present a framework for computing with input data specified by intervals, representing uncertainty in the values of the input parameters. To compute a solution, the algorithm ca…
cs.DS2011★ 3 cited
Fully dynamic maximal matching in O(log n) update time
Surender Baswana, Manoj Gupta, Sandeep Sen
We present an algorithm for maintaining maximal matching in a graph under addition and deletion of edges. Our data structure is randomized that takes O(log n) expected amortized ti…