Sciweavers

29 search results - page 2 / 6
» siamcomp 2000
Sort
View
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 4 months ago
Robust Plane Sweep for Intersecting Segments
In this paper, we reexamine in the framework of robust computation the Bentley
Jean-Daniel Boissonnat, Franco P. Preparata
SIAMCOMP
2000
69views more  SIAMCOMP 2000»
13 years 4 months ago
A Finite State Version of the Kraft--McMillan Theorem
The main result is a finite-state version of the Kraft
Frédérique Bassino, Marie-Pierre B&e...
SIAMCOMP
2000
106views more  SIAMCOMP 2000»
13 years 4 months ago
Computationally Sound Proofs
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Silvio Micali
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 4 months ago
The Complexity of the A B C Problem
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
Jin-yi Cai, Richard J. Lipton, Yechezkel Zalcstein
SIAMCOMP
2000
90views more  SIAMCOMP 2000»
13 years 4 months ago
From Gene Trees to Species Trees
This paper studies various algorithmic issues in reconstructing a species tree from gene trees under the duplication and the mutation cost model. This is a fundamental problem in c...
Bin Ma, Ming Li, Louxin Zhang