303 citations · 351 across the 13 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.DS2011★ 2 cited
Lower Bounds for the Average and Smoothed Number of Pareto Optima
Navin Goyal, Luis Rademacher
Smoothed analysis of multiobjective 0-1 linear optimization has drawn considerable attention recently. The number of Pareto-optimal solutions (i.e., solutions with the property tha…
cs.DS2011
On Dynamic Optimality for Binary Search Trees
Navin Goyal, Manoj Gupta
Does there exist O(1)-competitive (self-adjusting) binary search tree (BST) algorithms? This is a well-studied problem. A simple offline BST algorithm GreedyFuture was proposed ind…