Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Booktitle=Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000)

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Extractors and pseudo-random generators with optimal seed length
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 1-10
Pseudo-random functions and factoring
Moni Naor, Omer Reingold, Alon Rosen
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 11-20
Satisfiability of equations in free groups is in PSPACE
Claudio Gutiérrez
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 21-27
Setting 2 variables at a time yields a new lower bound for random 3-SAT
Dimitris Achlioptas
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 28-37
A new algorithmic approach to the general Lovász local lemma with applications to scheduling and satisfiability problems
Artur Czumaj, Christian Scheideler
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 38-47
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
Leonid Gurvits, Alex Samorodnitsky
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 48-57
Randomized metarounding
Robert Carr, Santosh Vempala
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 58-62
Isomorphism testing for embeddable graphs through definability
Martin Grohe
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 63-72
Circuit minimization problem
Valentine Kabanets, Jin-Yi Cai
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 73-79
On the efficiency of local decoding procedures for error-correcting codes
Jonathan Katz, Luca Trevisan
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 80-86
Statistical mechanics, three-dimensionality and NP-completeness - I. Universality of intractability for the partition function of the Ising model across non-planar lattices
Sorin Istrail
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 87-96
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Satoru Iwata, Lisa Fleischer, Satoru Fujishige
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 97-106
Improved algorithms for submodular function minimization and submodular flow
Lisa Fleischer, Satoru Iwata
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 107-116
On dual minimum cost flow algorithms
Jens Vygen
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 117-125
On the approximability of the Traveling Salesman problem
Christos H. Papadimitriou, Santosh Vempala
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 126-133
Approximating the domatic number
Uriel Feige, Magnús M. Holldórsson, Guy Kortsarz
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 134-143
The value of strong inapproximability results for clique
Aravind Srinivasan
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 144-152
Compression using efficient multicasting
Micah Adler, Tom Leighton
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 153-162
The small-world phenomenon: An algorithmic perspective
Jon Kleinberg
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 163-170
A random graph model for massive graphs
William Aiello, Fan Chung, Linyuan Lu
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 171-180
List decoding algorithms for certain concatenated codes
Venkatesan Guruswami, Madhu Sudan
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 181-190
A PCP characterization of NP with optimal amortized query complexity
Alex Samorodnitsky, Luca Trevisan
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 191-199
On transformations of interactive proofs that preserve the prover's complexity
Salil Vadhan
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 200-207
On the sum-of-squares algorithm for bin packing
Janos Csirik, Davis S. Johnson, Claire Kenyon, James B. Orlin, Peter W. Shor, Richard R. Weber
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 208-217
Sharing the cost of multicast transmissions
Joan Feigenbaum, Christos Papadimitriou, Scott Shenker
Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC'2000 (Portland, Oregon, May 21-23, 2000), 2000, pp. 218-227

Seiten 1 2 3 4 >