FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
Consider a convex set P in IRd and a piecewise polynomial concave function F: P IR. Let A be an algorithm that given a point x IRd computes F(x) if x P, or returns a concave po...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
The main purpose of this paper is to promote the study of computational aspects, primarily the convergence rate, of nonlinear dynamical systems from a combinatorial perspective. W...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
In this paper, we analyze the fault tolerance of several bounded-degree networks that are commonly used for parallel computation. Among other things, we show that an N-node butterf...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
Wait-free implementations of shared objects tolerate the failure of processes, but not the failure of base objects from which they are implemented. We consider the problem of imple...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
The problem of evaluating the sign of the determinant of a small matrix arises in many geometric algorithms. Given an n