Science has marched on despite the appearance of the original "Figures of Merit" [18]. The purpose of this survey is to bring the community up to date on the most recent bounds, so that we may collaborate to improve them.

In Theoretical Computer Science it is customary to alphabetize the names of coauthor s on the title page of collaborative publications, and under the assumption that surnames are distributed uniformly over the alphabet, one would expect to see such collaborations as collaborative publications.Expand

This paper discusses the predictability of the sequence given only a constant proportion /spl alpha/ of the leading bits of the first few numbers generated, and shows that the rest of the sequences is predictable in polynomial time, almost always.Expand

In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into… Expand

This study is one of the earliest to report measured performance of a widely-used commercial simulator, running non-trivial designs on a popular parallel computing system.Expand

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science

1990

TLDR

It is proved that in either scenario low-dimensional arrays are surprisingly fault tolerant, and how to route, sort, and perform systolic algorithms for problems such as matrix multiplication in optimal time on faulty arrays is shown.Expand