A new algorithm for finding a maximum matching in a general graph with special feature is that its only computationally non-trivial step is the inversion of a single integer matrix, the isolating lemma.Expand

A comparison of quick-sort and search problems, Voronoi diagrams of Hyperplanes, and the model of randomness: The number of faces and the expected structural and conflict change.Expand

The notion of a partially stable point in a reductive-group representation is introduced, which generalizes the notion of stability in geometric invariant theory due to Mumford and reduces fundamental lower bound problems in complexity theory to problems concerning infinitesimal neighborhoods of the orbits of partially stable points.Expand

This paper gives efficient, randomized algorithms for the following problems: (1) construction of levels of order 1 tok in an arrangement of hyperplanes in any dimension and (2) construction of… Expand

A randomized technique, called dynamic shuffling, is given for multidimensional dynamic search that yields the previously known randomized binary trees (treaps) and how to dynamize the randomized incremental algorithms so as to allow additions as well as deletions of objects.Expand

An efficient, randomized hidden surface removal algorithm, with the best time complexity so far, which provably holds for any input, regardless of the way in which faces are located in the scene.Expand

The foundational problems of Geometry (classification and GRH) and Complexity Theory (lower bounds and derandomization) share a common root difficulty that lies at the junction of these two fields, which is referred to as the GCT chasm.Expand

This paper shows that the matrix-based repeated squaring algorithm for the shortest path problem is optimal in the unbounded fan-in PRAM model without bit operations.Expand