973 search results - page 188 / 195 » New Bounds on Crossing Numbers |
CG
2004
Springer
14 years 5 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
PARA
1995
Springer
13 years 12 months ago
1995
Springer
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
AAMAS
2008
Springer
13 years 8 months ago
2008
Springer
As the scale and scope of distributed and multi-agent systems grow, it becomes increasingly important to design and manage the participants' interactions. The potential for b...