• Publications
  • Influence
Mind the gap
The success of initiatives recently launched to help create more new treatments hinges on bridging the sociological divides that persist in drug discovery and development.
  • 865
  • 74
  • PDF
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
TLDR
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. Expand
  • 86
  • 12
  • PDF
The Locality of Distributed Symmetry Breaking
TLDR
We present new bounds on the locality of several classical symmetry breaking tasks in distributed networks. Expand
  • 197
  • 11
  • PDF
Threesomes, Degenerates, and Love Triangles
TLDR
The 3SUM problem is to decide, given a set of n real numbers, whether any three sum to zero. Expand
  • 70
  • 11
  • PDF
An optimal minimum spanning tree algorithm
TLDR
We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity.We present a deterministic algorithm to find aminimum spanning tree of a graph with <i>n</i> vertices and<i>m</i>. Expand
  • 255
  • 9
  • PDF
Linear-Time Approximation for Maximum Weight Matching
TLDR
We give an algorithm that computes a (1 − <i>ε</i>)-approximate maximum weight matching in <iÕ</i>(<i>mε</ i>√< i>n</i>) time, a bound that has resisted improvement despite decades of research. Expand
  • 154
  • 9
  • PDF
Additive spanners and (α, β)-spanners
An (α, β)-spanner of an unweighted graph <i>G</i> is a subgraph <i>H</i> that distorts distances in <i>G</i> up to a multiplicative factor of α and an additive term β. It is well known that any graphExpand
  • 80
  • 9
  • PDF
Fast algorithms for (max, min)-matrix multiplication and bottleneck shortest paths
TLDR
In this paper, we give a (max, min)-matrix multiplication algorithm running in time O(n(3+ω)/2) in graphs with real capacities assigned to edges/vertices. Expand
  • 65
  • 9
  • PDF
A new approach to all-pairs shortest paths on real-weighted graphs
  • Seth Pettie
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 26 January 2004
TLDR
We present a new all-pairs shortest path algorithm that works with real-weighted graphs in the traditional comparison-addition model. Expand
  • 158
  • 8
  • PDF
A simpler linear time 2/3-epsilon approximation for maximum weight matching
TLDR
We present two 2/3 e approximation algorithms for the maximum weight matching problem that run in time O(m log 1e;). Expand
  • 68
  • 7