Proceedings of the thirty second annual ACM Symposium on Theory of Computing: Portland, Oregon May 21 - 23
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
New York
ACM Press
2000
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | IX, 755 S. graph. Darst. |
| ISBN: | 1581131844 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV012944229 | ||
| 003 | DE-604 | ||
| 005 | 20030220 | ||
| 007 | t| | ||
| 008 | 000117s2000 xx d||| |||| 10||| eng d | ||
| 020 | |a 1581131844 |9 1-58113-184-4 | ||
| 035 | |a (OCoLC)313558564 | ||
| 035 | |a (DE-599)BVBBV012944229 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |a DE-634 |a DE-83 | ||
| 084 | |a SS 1800 |0 (DE-625)143376: |2 rvk | ||
| 084 | |a 68-06 |2 msc | ||
| 084 | |a DAT 500f |2 stub | ||
| 111 | 2 | |a Symposium on Theory of Computing |n 32 |d 2000 |c Portland, Or. |j Verfasser |0 (DE-588)3047210-6 |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the thirty second annual ACM Symposium on Theory of Computing |b Portland, Oregon May 21 - 23 |
| 246 | 1 | 3 | |a STOC 2000 |
| 264 | 1 | |a New York |b ACM Press |c 2000 | |
| 300 | |a IX, 755 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Theoretische Informatik |0 (DE-588)4196735-5 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2000 |z Portland Or. |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m Digitalisierung TU Muenchen |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008813527&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-008813527 | |
Datensatz im Suchindex
| _version_ | 1820867918366244864 |
|---|---|
| adam_text |
Proceedings of the Thirty-Second Annual ACM Symposium on Theory
of Computing
May
21-23, 2000,
Portland, Oregon, USA
TABLE OF CONTENTS
Sunday, May
21, 2000
Session 1A
Extractors and pseudo-random generators with optimal seed length
.1
Russell Impagliazzo,
Ronen
Shaltiel, and
Avi
Wigderson
Pseudo-random functions and factoring
.11
Moni
Naor, Omer
Reingold,
and Alon Rosen
Satisfiability of equations in free groups is in PSPACE
.21
Claudio
Gutierrez
Setting
2
variables at a time yields a new lower bound for random 3-SAT
.28
Dimitris Achlioptas
Sessions IB
A new algorithmic approach to the general
Lovász
Local Lemma with applications to scheduling
and satisfiability problems
.38
Artur Czumaj
and Christian
Scheideler
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume
.48
Leonid Gurvits and Alex Samorodnitsky
Randomized metarounding
.58
Robert Carr and Santosh Vempala
Isomorphism testing for embeddable graphs through definability
.63
Martin Grohe
Session 2A
Circuit minimization problem
.73
Valentine Kabanets and Jin- Yi
Cai
On the efficiency of local decoding procedures for error-correcting codes
.80
Jonathan Katz and
Luca
Trevisan
Statistical mechanics, three-dimensionality and NP-completeness
.87
Sorin Istrail
Session 2B
A combinatorial, strongly polynomial-time algorithm for minimizing
submodular
functions
.97
Santoru Iwata and Lisa Fleischer and
Santom Fujishige
Improved algorithms for
submodular
function minimization and
submodular
flow
.107
Lisa Fleischer and
Šatoru
Iwata
On dual minimum cost flow algorithms
.117
Jens Vygen
Invited Session
Some Problems Related to Content Distribution
Tom Leighton, Department of Mathematics, MIT, and Akamai Technologies
Session
ЗА
On the approximability of the traveling salesman problem
.126
Christos
H Papadimitriou
and Santosh Vempala
Approximating the domatic number
.134
Uriel
Feige,
Magnus
M
Halldórsson,
and Guy Kortsarz
The value of strong inapproximability results for clique
.144
Aravind Srinivasan
Sessions 3B
Compression using efficient multicasting
.153
Micah
Adler
and Tom Leighton
The small-world phenomenon: an algorithmic perspective
.163
Jon Kleinberg
A random graph model for massive graphs
.171
William Aiello, Fan Chung, and Linyuan
Lu
Session 4A
List decoding algorithms for certain concatenated codes
.181
Venkatesan Guruswami and Madhu Sudan
A PCP
characterization of NP with optimal amortized query complexity
.191
Alex Samorodnitsky and
Luca
Trevisan
On transformations of interactive proofs that preserve the prover's complexity
.200
Salii
Vadhan
Sessions 4B
On the sum-of-squares algorithm for bin packing
.208
Janos
Csirik, David
S
Johnson, Claire Kenyon, James
В
Orlin, Peter
W
Shor, and Richard
R
Weber
Sharing the cost of multicast transmissions
.218
Joan
Feigenbaum, Christos Papadimitriou,
and Scott Shenker
The risk profile problem for stock portfolio optimization
.228
Ming- Yang
Kao
and Andreas Nolte and Stephen
R
Tate
Monday, May
22, 2000
Session 5A
Resettable zero-knowledge
.235
Ran
Canetti.
Oded
Goldreich, Shafi Goldwasser
and Silvio
Micali
Complete characterization of security notions for probabilistic private-key encryption
.245
Jonathan Katz and
Moti
Yung
On zero-knowledge proofs: "from membership to decision"
.255
Giovanni
Di Crescenze,
Kouichi Sakurai, and
Moti
Yung
Finding smooth integers in short intervals using CRT decoding
.265
Dan Boneh
Sessions 5B
Smoothing and cleaning up slivers
.273
Herbert Edelsbrunner, Xiang-Yang Li, Garry Miller, Andreas Stathopoulos, Dafna Talmor, Shang-Hua
Teng,
Alper Üngör,
and Noel
Walkington
Hard-potato routing
.278
Costas
Busch, Maurice Herlihy, and Roger Wattenhofer
Approximation
algorithms for geometric shortest path problems
.286
Lyudmil
Aleksandrov,
Anil Maheshwari, and
Jörg-Rüdiger
Sack
Improved approximations of crossings in graph drawings and VLSI layout areas
.296
Guy Even. Sudipto Guha, and Baruch
Schieber
Sessions 6A
On
the decidability of accessibility problems
.306
Rajeev Motwani,
Rina
Panigrahy, Vijay Saraswat, and Suresh Venkatasubramanian
More general completeness theorems for secure two-party computation
.316
Joe
Kilián
On the complexity of verifiable secret sharing and multiparty computation
.325
Ronald Cramer, Ivan
Damgard,
and Stefan Dziembowski
Session 6B
Tight(er) worst-case bounds on dynamic searching and priority queues
.335
Arne Andersson
and
Mikkel
Thorup
Near-optimal fully-dynamic graph connectivity
.343
Mikkel
Thorup
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs
.351
Meena Mahajan and
Kosturi
R Varadarajan
Session 7A
Space complexity in propositional calculus
.358
Michael Alekhnovich, Eli Ben-Sasson, Alexander A Razborov, and
Avi
Wigderson
A new proof of the weak pigeonhole principle
.368
Alexis
Maciel,
Toniann
Pitassi, and Alan
R
Woods
Higher lower bounds on monotone size
.378
Danny Harnik and Ran
Raz
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
.388
Omer Barkol and Yuval
Rąbani
Sessions 7B
Compressed suffix arrays and suffix trees with applications to text indexing and string matching
.397
Roberto
Grossi
and Jeffrey Scott
Vitter
Faster suffix tree construction with missing suffix links
.407
Richard Cole and Ramesh Hariharan
Approximate nearest neighbors and sequence comparison with block operations
.416
S
Muthukrishnan and Suleyman Cenk Sahinalp
Near optimal multiple alignment within a band in polynomial time
.425
Ming Li, Bin Ma, and Lusheng Wang
Sessions 8A
Noise-tolerant learning, the parity problem, and the statistical query model
.435
Avrim Blum, Adam
К
alai,
and Hal
Wasserman
More theory revision with queries
.441
Judy Goldsmith and Robert
H
Sloan
Are bitvectors optimal?
.449
H
Buhrman,
P
В
Miitersen,
J Radhakrishnan, and
S Venkatesh
Sessions 8B
The program-size complexity of self-assembled squares
.459
Paul
W
К
Rothemund and Erik Winfree
Shortest path queries in planar graphs
.469
Danny
Z
Chen and Jinhui Xu
How tall is a tree?
.479
Bruce Reed
vu
Tuesday, May
23, 2000
Session 9A
Random walks with "back buttons"
.484
Ronald Fagin, Anna
Karlin,
Jon Kleinberg,
Prabhakar Raghavan, Sridhar Rajagopalan, Ronitt
Rubinfeld,
Madhu Sudan, and Andrew Tomkins
From partial consistency to global broadcast
.494
Matthias Fitzi and
Ueli Maurer
Connectivity and inference problems for temporal networks
.504
David
Kempe,
Jon Kleinberg,
and
Amit
Kumar
Strictly non-blocking WDM cross-connects for heterogeneous networks
.514
April
Rasala
and Gordon Wilfong
Sessions 9B
Finding long paths and cycles in sparse Hamiltonian graphs
.524
Tomas Feder,
Rajeev Motwani, and Carlos
Subi
Approximating the minimum bisection size
.530
Uriel
Feige,
Robert Krauthgamer, and Kobbi Nissim
A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees
.537
J
Könemann
and
R
Ravi
Clustering for edge-cost minimization
.547
Leonard
J Schulman
Sessions
10
A
Exact computation of the inertia of symmetric integer matrices
.556
Steven Fortune
б
-optimization
schemes and L-bit precision: alternative perspectives in combinatorial optimization
.565
James
В
Orlin, Andreas
S
Schulz,
and Sudipta Sengupta
Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation
. 573
Vadim
Olshevsky and
Amin
Shokrollahi
Session 10B
Query strategies for priced information
.582
Moses Charikar, Ron Fagin, Venkatesan Guruswami,
Jon Kleinberg,
Prabhakar Raghavan, and
Amit Sahai
A guessing game and randomized online algorithms
.592
Steven
S
Seiden
Computing the median with uncertainty
.602
Tomas Feder,
Rajeev Motwani,
Rina
Panigrahy, Chris Olston, and Jennifer
Widom
Session
11
A
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
.608
Alexei Kitaev and John Watrous
Rapid sampling through quantum computing
.618
Lov K
Grover
Normal subgroup reconstruction and quantum computation using group representations
.627
Sean
Hallgren,
Alexander Russell, and Amnon Ta-Shma
Quantum lower bounds by quantum arguments
.636
Andris Ambainis
On quantum and probabilistic communication: Las Vegas and one-way protocols
.644
Hartmut Klauck
Sessions 11B
A constant factor approximation algorithm for a class of classification problems
.652
Anupam Gupta and
Eva Tardos
Polynomial-time approximation scheme for data broadcast
.659
Claire Kenyon, Nicolas Schabanel, and Neal Young
Approximating
permanents
of complex matrices
.667
Martin
Fürer
Combining fairness with throughput: Online routing with multiple objectives
.670
Ashish Goel, Adam Meyerson, and Serge PlotMn
Improvements in throughput maximization for real-time scheduling
.680
Piotr Berman
and
Bhaskar DasGupta
Session 12A
Self-testing of universal and fault-tolerant sets of quantum gates
.688
Wim
van Dam, Frederic
Magniez,
Michele Mosca,
and
Miklos Santha
Computing with highly mixed states
.697
Andris
Ambainis, Leonard
J
Schulman, and Umesh V Vazirani
Quantum bit escrow
.705
Dorit
Aharonov, Amnon Ta-Shma, Umesh Vazirani and Andrew
С
Yao
A proof of security of quantum key distribution
.715
Eli Biham, Michel Boyer,
P
Oscar Boykin,
Tal Mor,
and Vwani Roychowdhury
Sessions 12B
Better algorithms for unfair metrical task systems and applications
.725
Amos Fiat and Manor Mendel
A unified approach to approximating resource allocation and scheduling
.735
Amotz
Bar-Noy,
Reuven Bar- Yehuda,
Ari
Freund,
Joseph (Seffi) Naor, and Baruch
Schieber
Balanced allocations: the heavily loaded case
.745
Petra Berenbrink,
Artur Czumaj, Angelika
Steger, and
Berthold Vöckmg
Author
Index
.755 |
| any_adam_object | 1 |
| author_corporate | Symposium on Theory of Computing Portland, Or |
| author_corporate_role | aut |
| author_facet | Symposium on Theory of Computing Portland, Or |
| author_sort | Symposium on Theory of Computing Portland, Or |
| building | Verbundindex |
| bvnumber | BV012944229 |
| classification_rvk | SS 1800 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)313558564 (DE-599)BVBBV012944229 |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV012944229</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030220</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">000117s2000 xx d||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1581131844</subfield><subfield code="9">1-58113-184-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)313558564</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV012944229</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 1800</subfield><subfield code="0">(DE-625)143376:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 500f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Symposium on Theory of Computing</subfield><subfield code="n">32</subfield><subfield code="d">2000</subfield><subfield code="c">Portland, Or.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)3047210-6</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the thirty second annual ACM Symposium on Theory of Computing</subfield><subfield code="b">Portland, Oregon May 21 - 23</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">STOC 2000</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">ACM Press</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 755 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">2000</subfield><subfield code="z">Portland Or.</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung TU Muenchen</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008813527&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-008813527</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2000 Portland Or. gnd-content |
| genre_facet | Konferenzschrift 2000 Portland Or. |
| id | DE-604.BV012944229 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:16:06Z |
| institution | BVB |
| institution_GND | (DE-588)3047210-6 |
| isbn | 1581131844 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-008813527 |
| oclc_num | 313558564 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-634 DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-634 DE-83 |
| physical | IX, 755 S. graph. Darst. |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | ACM Press |
| record_format | marc |
| spelling | Symposium on Theory of Computing 32 2000 Portland, Or. Verfasser (DE-588)3047210-6 aut Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 STOC 2000 New York ACM Press 2000 IX, 755 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2000 Portland Or. gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Digitalisierung TU Muenchen application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008813527&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
| title | Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 |
| title_alt | STOC 2000 |
| title_auth | Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 |
| title_exact_search | Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 |
| title_full | Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 |
| title_fullStr | Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 |
| title_full_unstemmed | Proceedings of the thirty second annual ACM Symposium on Theory of Computing Portland, Oregon May 21 - 23 |
| title_short | Proceedings of the thirty second annual ACM Symposium on Theory of Computing |
| title_sort | proceedings of the thirty second annual acm symposium on theory of computing portland oregon may 21 23 |
| title_sub | Portland, Oregon May 21 - 23 |
| topic | Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Theoretische Informatik Konferenzschrift 2000 Portland Or. |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=008813527&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumontheoryofcomputingportlandor proceedingsofthethirtysecondannualacmsymposiumontheoryofcomputingportlandoregonmay2123 AT symposiumontheoryofcomputingportlandor stoc2000 |