Proceedings of the 33rd Annual ACM Symposium on Theory of Computing: Hersonissos, Crete, Greece, July 6 - 8, 2001
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
ACM Press
2001
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 757 S. Ill., graph. Darst. |
| ISBN: | 1581133499 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV014118393 | ||
| 003 | DE-604 | ||
| 005 | 20031215 | ||
| 007 | t| | ||
| 008 | 020129s2001 xx ad|| |||| 10||| eng d | ||
| 020 | |a 1581133499 |9 1-58113-349-9 | ||
| 035 | |a (OCoLC)615332254 | ||
| 035 | |a (DE-599)BVBBV014118393 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-91G |a DE-739 | ||
| 084 | |a DAT 500f |2 stub | ||
| 111 | 2 | |a Symposium on Theory of Computing |n 33 |d 2001 |c Chersonēsos |j Verfasser |0 (DE-588)10029947-7 |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the 33rd Annual ACM Symposium on Theory of Computing |b Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| 246 | 1 | 3 | |a Proceedings |
| 246 | 1 | 3 | |a STOC 01 |
| 264 | 1 | |a New York, NY |b ACM Press |c 2001 | |
| 300 | |a XII, 757 S. |b Ill., 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 2001 |z Limin Chersonisu |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=009673862&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009673862 | |
Datensatz im Suchindex
| _version_ | 1820868251590066176 |
|---|---|
| adam_text |
Table
of Contents
Conference Organization
.xi
Sponsors
.xii
Friday, July
6
Session 1A
Chair: Mihalis Yannakakis
•
Clustering to Minimize the Sum of Cluster Diameters
.1
Moses Charikar and
Rina
Panigrahy
•
Approximating Min-Sum k-Clustering in Metric Spaces
.11
Yair Bartal, Moses Charikar, and Danny
Raz
•
Local Search Heuristics fork-median and Facility Location Problems
.21
Vij
ay Arya, Naveen Garg, Rohit Khandekar, Adam Meyerson, Kamesh
Munagala,
and Vinayaka Pandit
•
Profit-Earning Facility Location
.30
Adam Meyerson
Session
1
В
Chair: Noam Nisan
•
One-Dimensional Quantum Walks
.37
Andris
Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, and John Watrous
•
Quantum Walks on Graphs
.50
Dorit
Aharonov,
Andris
Ambainis, Julia
Kempe,
and Umesh Vazirani
•
Quantum Algorithms for Solvable Groups
.60
John Watrous
•
Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem
.68
Michelangelo Grigni, Leonard Schulman, Monica Vazirani, and Umesh Vazirani
Session 2A
Chair: Paul Spirakis
•
Minimax Parametric Optimization Problems and Multi-dimensional
Parametric Searching
.75
Takeshi Tokuyama
•
Algorithms for Minimizing Weighted Flow Time
.84
Chandra Chekuri, Sanjeev Khanna, and An Zhu
•
Non-Clairvoyant Scheduling to Minimize the Average Flow Time on Single
and Parallel Machines
.94
Luca Becchetti
and
Stefano Leonardi
•
Stackelberg Scheduling Strategies
.104
Tim Roughgarden
Session
2В
Chair: Noam Nisan
•
Quantum Computers that Can be Simulated Classically in Polynomial Time
.114
Leslie G. Valiant
•
Interaction in Quantum Communication and the Complexity of Set Disjointness
.124
Hartmut
Klauck, Ashwin Nayak, Amnon Ta-Shma, and David Zuckerman
•
A New Protocol and Lower Bounds for Quantum Coin Flipping
.134
Andris Ambainis
•
Loss-less Condensers, Unbalanced Expanders, and Extractors
.143
Amnon Ta-Shma, Christopher Umans, and David Zuckerman
Session
ЗА
Chair:
Elias Koutsoupias
•
Conditions on Input Vectors for Consensus Solvability in Asynchronous
Distributed Systems
.153
Achour Mostefaoui, Sergio Rajsbaum, and Michel Raynal
•
Spatial Gossip and Resource Location Protocols
.163
David
Kempe,
Jon Kleinberg,
and Alan
Demers
•
(1+ε,
ß)-Spanner
Constructions for General Graphs
.
1
73
Michael Elkin and David Peleg
•
Approximate Distance Oracles
.183
Mikkel
Thorup and
Uri
Zwick
Session 3B
Chair: Russell Impagliazzo
•
Extractor Codes
.193
Amnon Ta-Shma and David Zuckerman
•
Excellent Nonlinear Codes from Modular Curves
.200
Noam D. Elkies
•
Sparse Polynomial Approximation in Finite Fields
.209
Igor E. Shparlinski
•
Randomness Efficient Identity Testing of Multivariate Polynomials
.216
Adam R. Klivans and Daniel A. Spielman
Session 4A
Chair:
Elias
Koutsoupias
•
Fully-Dynamic Min-Cut
.224
Mikkel
Thorup
•
Computing Crossing Numbers in Quadratic Time
.231
Martin Grohe
•
Euler
Paths in Series Parallel Graphs
.237
S. Rao Kosaraju
•
Decidability of String Graphs
.241
Marcus Schaefer and Daniel
Štefankovič
Session
4В
Chair: Sampath Kannan
•
Learning Mixtures of Arbitrary
Gaussiane
.247
Sanjeev Arora and Ravi Kannan
•
LearningDNFin Time
24"^ .258
Adam R. Klivans and
Rocco
A. Servedio
•
Sampling Algorithms: Lower Bounds and Applications
.266
Ziv Bar-Yossef, Ravi Kumar, and D. Sivakumar
•
Testing Metric Properties
.276
Michal
Parnas
and Dana Ron
•
Testing of Matrix Properties
.286
Eldar
Fischer and Ilan Newman
Saturday, July
7
Session 5A
Chair: Kurt Melhorn
•
Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually
Takes Polynomial Time
.296
Daniel A. Spielman and Shang-Hua
Teng
•
One Line and
n
Points
.306
Bernd
Gartner,
József
Solymosi,
Falk
Tschirschnitz,
Emo
Welzl, and Pavel Valtr
•
A Tight Bound for the Complexity of Voronoi Diagrams under Polyhedral
Convex Distance Functions in
3D.316
Christian Icking and Lihong Ma
•
Lower Bounds for Intersection Searching and Fractional Cascading in Higher Dimension
.322
Bernard Chazelle and Ding Liu
Session 5B
Chair: Russell Impagliazzo
•
Sharp Threshold and Scaling Window for the Integer Partitioning Problem
.330
Christian
Borgs,
Jennifer T.
Chayes,
and Boris Pittel
•
A Sharp Threshold in Proof Complexity
.337
Dimitris Achlioptas, Paul
Bearne,
and Michael Molloy
•
Regular Resolution Lower Bounds for the Weak Pigeonhole Principle
.347
Toniann
Pitassi and Ran
Raz
•
The Complexity of Analytic Tableaux
.356
Noriko H.
Arai,
Toniann
Pitassi, and Alasdair Urquhart
Session 6A
Chair: Kurt Melhorn
•
Applications of Approximation Algorithms to Cooperative Games
.364
Kamal Jain and Vijay V. Vazirani
•
Approximation Algorithms for Constrained Node Weighted
Steiner
Tree Problems
.
?73
Anna Moss and Yuval
Rąbani
•
A Constant Factor Approximation for the Single Sink Edge Installation Problem
.383
Sudipto Guha, Adam Meyerson, and Kamesh
Munagala
•
Provisioning a Virtual Private Network: A Network Design Problem for Multicommodity Flow.
389
Anupam Gupta,
Jon Kleinberg,
Amit
Kumar, Rajeev Rastogi, and Bulent
Yener
Session 6B
Chair: Russell Impagliazzo
•
Explicit Lower Bound of
4.5л
-
o(n) for Boolean Circuits
.399
Oded Lachish and Ran
Raz
•
Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates
.409
Ran
Raz
and Amir Shpilka
•
A Read-Once Branching Program Lower Bound of
Ω
(2Ґ4)
for Integer
Multiplication Using Universal Hashing
.419
Beate Bollig
and
Philipp Woelfel
•
On the Cell Probe Complexity of Membership and Perfect Hashing
.425
Rasmus Pagh
Session 7A
Chair: Chandra Chekuri
•
On the Integrality Ratio of
Semidefinite
Relaxations of MAX CUT
.433
Uriel
Feige
and Gideon Schechtman
•
Approximation Algorithms for
MAX-3-CUT
and Other Problems
via Complex
Semidefinite
Programming
.443
Michel X. Goemans and David P. Williamson
•
Non-approximability Results for Optimization Problems on Bounded Degree Instances
.453
Luca
Trevisan
•
Colouring Graphs When the Number of Colours is Nearly the Maximum Degree
.462
Michael Molloy and Bruce Reed
Session 7B
Chair: S. Muthukrishnan
•
Data-Streams and Histograms
.471
Sudipto Guha, Nick Koudas, and Kyuseok Shim
•
Optimal Static Range Reporting in One Dimension
.476
Stephen Alstrup, Gerth
Stolting Brodal,
and Theis
Rauhe
•
Biased Dictionaries with Fast Insert/Deletes
.483
Funda
Ergun, S. Cenk
Şahinalp,
Jonathan Sharp, and Rakesh K. Sinha
•
Anti-persistence: History Independent Data Structures
.492
Moni
Naor and Vanessa Teague
Session 8A
Chair:
Christos
Papadimitriou
•
Dynamic TCP Acknowledgement and Other Stories About e/(e-1)
.502
Anna R.
Karlin,
Claire Kenyon, and Dana Randall
•
The Price of Selfish Routing
.
510
Marios Mavronicolas and Paul Spirakis
•
Buffer Overflow Management in QoS Switches
.520
Alexander Kesselman, Zvi
Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch
Schieber,
and Maxim Sviridenko
•
Almost Optimal Permutation
Routing
on Hypercubes
.530
Berthold Vöcking
•
Online Server Allocation in a Server Farm via Benefit Task Systems
.540
T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch
Schieber,
and Maxim Sviridenko
Session 8B
Chair: Joan
Feigenbaum
•
Private Approximation of NP-hard Functions
.550
Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, and Kobbi Nissim
•
Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds
.560
Joe
Kilián
and
Erez Petránk
•
Black-Box Concurrent Zero-Knowledge Requires
Ω
(log
тђ
Rounds
.570
Ran
Canetti,
Joe
Kilián, Erez Petránk,
and
Alón
Rosen
•
The Round Complexity of Verifiable Secret Sharing and Secure Multicast
.580
Rosario
Gennaro,
Yuval Ishai, Eyal Kushilevitz, and
Tal
Rabin
•
Communication Preserving Protocols for Secure Function Evaluation
.590
Moni Naor
and Kobbi Nissim
Sunday, July
8
Session
9:
Plenary Invited Talk: Turing Award Lecture
Chair: Mihalis Yannakakis
•
Some Perspectives on Computational Complexity.
.600
Andrew Chi-Chih Yao
Session 10A
Chair: Prabhakar Raghavan
•
A Sieve Algorithm for the Shortest Lattice Vector Problem
.601
Miklós
Ajtai, Ravi Kumar, and D. Sivakumar
•
Fast Computation of Low Rank Matrix Approximations
.611
Dimitris Achlioptas and Frank McSherry
•
Spectral Analysis of Data
.619
Yossi
Azar,
Amos Fiat, Anna R.
Karlin,
Frank McSherry, and Jared
Saia
•
Optimal Outlier Removal in High-Dimensional Spaces
.627
John Dunagan and Santosh Vempala
•
Estimating True Evolutionary Distances Between Genomes
637
Li-San Wang and Tandy Warnow
Session 10B
Chair: Sampath
Karman
•
On Optimal Slicing of Parallel Programs
.647
Markus Müller-Olm
and Helmut
Seidl
•
When is the Evaluation of Conjunctive Queries Tractable?
657
Martin Grohe, Thomas Schwentick, and Luc Segoufin
•
The Complexity of Maximal Constraint Languages
.667
Andrei A. Bulatov, Andrei A. Krokhin, and Peter G. Jeavons
•
Quantitative Solution of Omega-Regular Games
.675
Luca de
Alfaro and Rupak Majumdar
•
Distribution Functions of Probabilistic Automata
.684
Farrokh Vatan
Session
11
A
Chair: Prabhakar Raghavan
•
Compatible Sequences and a Slow
Winkler
Percolation
.694
Peter
Gács
•
Edge Isoperimetry and Rapid Mixing on Matroids and Geometric Markov Chains
.704
Ravi Montenegro and Jun-Bae Son
•
A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix
with Non-Negative Entries
.712
Mark Jerrum, Alistair Sinclair, and Eric Vigoda
Session 11B
Chair: S. Muthukrishnan
•
Computing with Continuous-Time Liapunov Systems
.722
Jiř Šíma
and
Pekka
Orponen
•
Complex Tilings
.732
Bruno
Durand,
Leonid A. Levin, and Alexander Shen
•
Running Time and Program Size for Self-assembled Squares
.740
Leonard Adleman, Qi Cheng, Ashish Goel, and Ming-Deh Huang
Session
12 :
STOC-ICALP Plenary Invited Talks
Chair: Paul Spirakis
•
Algorithms, Games, and the Internet
.749
Christos
H. Papadimitriou
•
Automata, Circuits and Hybrids: Facets of Continuous Time
.754
Boris A. Trakhtenbrot
Author Index
.756 |
| any_adam_object | 1 |
| author_corporate | Symposium on Theory of Computing Chersonēsos |
| author_corporate_role | aut |
| author_facet | Symposium on Theory of Computing Chersonēsos |
| author_sort | Symposium on Theory of Computing Chersonēsos |
| building | Verbundindex |
| bvnumber | BV014118393 |
| classification_rvk | SS 2001 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)615332254 (DE-599)BVBBV014118393 |
| 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">BV014118393</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20031215</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">020129s2001 xx ad|| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1581133499</subfield><subfield code="9">1-58113-349-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)615332254</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014118393</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-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-739</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">33</subfield><subfield code="d">2001</subfield><subfield code="c">Chersonēsos</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)10029947-7</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the 33rd Annual ACM Symposium on Theory of Computing</subfield><subfield code="b">Hersonissos, Crete, Greece, July 6 - 8, 2001</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Proceedings</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">STOC 01</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">ACM Press</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 757 S.</subfield><subfield code="b">Ill., 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">2001</subfield><subfield code="z">Limin Chersonisu</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=009673862&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-009673862</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2001 Limin Chersonisu gnd-content |
| genre_facet | Konferenzschrift 2001 Limin Chersonisu |
| id | DE-604.BV014118393 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:21:24Z |
| institution | BVB |
| institution_GND | (DE-588)10029947-7 |
| isbn | 1581133499 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009673862 |
| oclc_num | 615332254 |
| open_access_boolean | |
| owner | DE-20 DE-91G DE-BY-TUM DE-739 |
| owner_facet | DE-20 DE-91G DE-BY-TUM DE-739 |
| physical | XII, 757 S. Ill., graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | ACM Press |
| record_format | marc |
| spelling | Symposium on Theory of Computing 33 2001 Chersonēsos Verfasser (DE-588)10029947-7 aut Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 Proceedings STOC 01 New York, NY ACM Press 2001 XII, 757 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2001 Limin Chersonisu 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=009673862&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
| title | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| title_alt | Proceedings STOC 01 |
| title_auth | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| title_exact_search | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| title_full | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| title_fullStr | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| title_full_unstemmed | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| title_short | Proceedings of the 33rd Annual ACM Symposium on Theory of Computing |
| title_sort | proceedings of the 33rd annual acm symposium on theory of computing hersonissos crete greece july 6 8 2001 |
| title_sub | Hersonissos, Crete, Greece, July 6 - 8, 2001 |
| topic | Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Theoretische Informatik Konferenzschrift 2001 Limin Chersonisu |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009673862&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumontheoryofcomputingchersonesos proceedingsofthe33rdannualacmsymposiumontheoryofcomputinghersonissoscretegreecejuly682001 AT symposiumontheoryofcomputingchersonesos proceedings AT symposiumontheoryofcomputingchersonesos stoc01 |