Figures of merit: the sequel

@article{Tompa1990FiguresOM,
  title={Figures of merit: the sequel},
  author={Martin Tompa},
  journal={SIGACT News},
  year={1990},
  volume={21},
  pages={78-81}
}
  • M. Tompa
  • Published 1 November 1990
  • Education
  • SIGACT News
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. 
View on ACM
doi.org

Tables from this paper

References

SHOWING 1-10 OF 24 REFERENCES
Figures of merit
TLDR
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.
Time Bounds for Selection
Geometric Containment and Vector Dominance
Solving dense subset-sum problems by using analytical number theory
Linear Congruential Generators Do Not Produce Random Sequences
TLDR
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.
On two additive problems
Factoring polynomials with rational coefficients
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…
Faster Architectural Simulation through Parallelism
TLDR
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.
Asymptotically tight bounds for computing with faulty arrays of processors
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.
Algorithmics - theory and practice
Algorithmics: theory and practice , Algorithmics: theory and practice , مرکز فناوری اطلاعات و اطلاع رسانی کشاورزی
...
1
2
3
...