15 citations · 73 across the 25 of their papers we have counts for
4 papers · 1 filter
Smoothed Analysis of the Expected Number of Maximal Points in Two Dimensions
Josep Diaz, Mordecai Golin
The {\em Maximal} points in a set S are those that aren't {\em dominated} by any other point in S. Such points arise in multiple application settings in which they are called by a…
Dynamic Trees with Almost-Optimal Access Cost
Mordecai Golin, John Iacono, Stefan Langerman +2
An optimal binary search tree for an access sequence on elements is a static tree that minimizes the total search cost. Constructing perfectly optimal binary search trees is expens…
Minmax-Regret -Sink Location on a Dynamic Tree Network with Uniform Capacities
Mordecai J. Golin, Sai Sandeep
A dynamic flow network with uniform capacity is a graph in which at most units of flow can enter an edge in one time unit. If flow enters a vertex faster than it can le…
Minmax Centered k-Partitioning of Trees and Applications to Sink Evacuation with Dynamic Confluent Flows
Di Chen, Mordecai J. Golin
Let be a tree with associated costs on its subtrees. A minmax -partition of is a partition into subtrees, minimizing the maximum cost of a subtree over all pos…