Proceedings of the 34th Annual ACM Symposium on Theory of Computing: Montreal, Quebec, Canada ; May 19 - 21, 2002
Saved in:
| Corporate Author: | |
|---|---|
| Format: | Conference Proceeding Book |
| Language: | English |
| Published: |
New York, NY
ACM Press
2002
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XV, 824 S. Ill., graph. Darst. |
| ISBN: | 1581134959 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV014622128 | ||
| 003 | DE-604 | ||
| 005 | 20050906 | ||
| 007 | t| | ||
| 008 | 020809s2002 xx ad|| |||| 10||| eng d | ||
| 020 | |a 1581134959 |9 1-58113-495-9 | ||
| 035 | |a (OCoLC)634950762 | ||
| 035 | |a (DE-599)BVBBV014622128 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-739 |a DE-91G |a DE-634 |a DE-83 | ||
| 084 | |a SS 1800 |0 (DE-625)143376: |2 rvk | ||
| 084 | |a DAT 500f |2 stub | ||
| 111 | 2 | |a Symposium on Theory of Computing |n 34 |d 2002 |c Montréal |j Verfasser |0 (DE-588)10042756-X |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the 34th Annual ACM Symposium on Theory of Computing |b Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| 246 | 1 | 3 | |a Proceedings |
| 246 | 1 | 3 | |a STOC 02 |
| 264 | 1 | |a New York, NY |b ACM Press |c 2002 | |
| 300 | |a XV, 824 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 |
| 650 | 0 | 7 | |a Datenverarbeitung |0 (DE-588)4011152-0 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 2002 |z Montréal |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Datenverarbeitung |0 (DE-588)4011152-0 |D s |
| 689 | 1 | |5 DE-604 | |
| 710 | 2 | |a Association for Computing Machinery |e Sonstige |0 (DE-588)1222-1 |4 oth | |
| 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=009938392&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009938392 | |
Record in the Search Index
| _version_ | 1820867921623121920 |
|---|---|
| adam_text |
Table
of
Contents
Conference Organization
.xii
Reviewers
.xiii
Sponsors
.xv
Sunday, May
19, 2002
Session
1
A (Chair: Rao Kosaraju)
•
Recognizing String Graphs in NP
.1
Marcus Schaefer, Eric Sedgwick, and Daniel
Štefankovič
•
Dynamic Subgraph Connectivity with Geometric Applications
.7
Timothy M. Chan
•
New Results on Monotone Dualization and Generating Hypergraph Transversals
.14
Thomas
Eiter, Georg Gottlob,
and Kazuhisa Makino
•
Combinatorial Optimization Problems in Self-Assembly
.23
Leonard Adleman, Qi Cheng, Ashish Goel, Ming-Deh Huang, David
Kempe,
Pablo Moisset
de Espanes,
and Paul
Wilhelm Karl
Rothemund
Session
1
В
(Chair: Michael Mitzenmacher)
•
The Importance of Being Biased
.33
Irit Dinur
and Shmuel
Safra
•
On the Advantage over a Random Assignment
.43
Johan Hastad
and
S. Venkatesh
•
The Complexity of Choosing an H-Colouring (Nearly) Uniformly at Random
.53
Leslie Ann Goldberg, Steven
Kelk,
and Mike Paterson
•
Random Sampling in Residual Graphs
.63
David R.
Karger
and Matthew S.
Levine
Session 2A (Chair: John
Reif)
•
On the Complexity of Equilibria
.67
Xiaotie Deng,
Christos
Papadimitriou, and Shmuel
Safra
•
Competitive Generalized Auctions
.72
Amos Fiat, Andrew V. Goldberg, Jason D.
Hartline,
and Anna R.
Karlin
•
Competitive Recommendation Systems
.82
Petros Drineas, Iordanis Kerenidis, and Prabhakar Raghavan
Session 2B (Chair: Paul Spirakis)
•
The Glauber Dynamics on the Colourings of a Graph with High Girth
and Maximum Degree
.91
Michael Molloy
•
Clairvoyant
Scheduling of Random Walks
.99
Peter
Gács
•
Solving Convex Programs by Random Walks
.109
Dimitris Bertsimas and Santosh Vempala
Knuth
Prize Plenary Talk
•
The Joy of Theory
.116
Christas
Papadimitriou
Session
ЗА
(Chair: Michael Mitzenmacher)
•
Improved
Decrementai
Algorithms for Maintaining Transitive Closure
and All-pairs Shortest Paths
.117
Surender Baswana, Ramesh Hariharan, and Sandeep Sen
•
Lower Bounds and Competitive Algorithms for On-Line Scheduling
of Unit-Size Tasks to Related Machines
.124
Spyros Kontogiannis
•
On Randomized Online Scheduling
.134
Susanne Albers
Session 3B (Chair: Alan Borodin)
•
On the Complexity of Matrix Product
.144
Ran
Raz
•
Near-Optimal Sparse Fourier Representations via Sampling
.152
A. C. Gilbert, S. Guha, P.
Indyk,
S.
Muthukrishnan, and M. Strauss
•
Fitting Algebraic Curves to Noisy Data
.162
Sanjeev Arora and Subhash Knot
Session 4A (Chair: Gary Miller)
•
A New Average Case Analysis for Completion Time Scheduling
.170
Mark Scharbrodt, Thomas Schickinger, and
Angelika
Steger
•
A Unified Analysis of Hot Video Schedulers
.179
Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, and Wai
-На
Wong
•
Optimal Rate-based Scheduling on Multiprocessors
.189
Anand Srinivasan and James H. Anderson
Session 4B (Chair Paul Spirakis)
•
Almost All Graphs with Average Degree
4
are
3-Colorable
.199
Dimitris Achlioptas and Cristopher Moore
•
Models and Thresholds for Random Constraint Satisfaction Problems
.209
Michael Molloy
•
Remiers
Inequality and
Tardos'
Conjecture
.218
Clifford Smyth
Monday, May
20, 2002
Session 5A (Chair: Alan Borodin)
•
Clifford Algebras and Approximating the Permanent
.222
Steve
Chien,
Lars
Rasmussen,
and Alistair Sinclair
•
Random Sampling and Approximation of MAX-CSP Problems
.232
Noga
Alón,
W.
Fernandez
de la Vega,
Ravi Karman, and
Marek
Karpinski
•
A
Polynomial-time Algorithm to Approximately Count Contingency Tables
when the Number of Rows is Constant
.240
Mary Cryan and Martin Dyer
•
Approximate Clustering via Core-Sets
.250
Mihai
Bãdoiu, Sariel
Har-Peled, and
Piotr Indyk
Session 5B (Chair: Michael Mitzenmacher)
•
On Paging with Locality of Reference
.258
Susanne Albers,
Lene
M. Favrholdt, and Oliver Giel
•
Cache-Oblivious Priority
Queue
and Graph Algorithm
Applications
.268
Lars Arge, Michael
Α.
Bender, Erik
D.
Demaine,
Bryan
Holland-Minkley, and J.
Ian
Munro
•
Average Case Analysis for Batched Disk Scheduling
and Increasing Sub-sequences
.277
E.
Bachmat
•
Selfish Traffic Allocation for Server Farms
.287
Artur Czumaj, Piotr
Krysta,
and
Berthold Vöcking
Session 6A (Chair: Satish Rao)
•
Approximation Schemes for Preemptive Weighted Flow Time
.297
Chandra Chekuri and Sanjeev Khanna
•
Approximation Algorithms for Minimum-Cost k-Vertex Connected Subgraphs
.306
Joseph Cheriyan, Santosh Vempala, and Adrian
Vetta
•
Equitable Cost Allocations via Primal-Dual-Type Algorithms
.313
Kamal Jain and
Vij
ay V. Vazirani
Session 6B (Chair: Sam Buss)
•
2-Round Zero Knowledge and Proof Auditors
.322
Cynthia Dwork and Larry Stockmeyer
•
Concurrent Zero-Knowledge With Timing, Revisited
.332
Oded
Goldreich
•
Tight Security Proofs for the Bounded-Storage Model
.341
Stefan Dziembowski and
Ueli Maurer
vu
Session 7A
(Chair:
Mikkel
Thorup)
•
Hardness Results for Approximate Hypergraph Coloring
.351
Subhash Khot
•
Space Lower Bounds for Distance Approximation in the Data Stream Model
.360
Michael Saks and Xiaodong Sun
•
Approximate Counting
ofinversions
in a Data Stream
.370
Miklós
Ajtai, T. S. Jayram, Ravi Kumar, and D. Sivakumar
•
Similarity Estimation Techniques from Rounding Algorithms
.3 80
Moses S. Charikar
•
Fast, Small-Space Algorithms for Approximate Histogram Maintenance
.389
Anna
С
Gilbert, Sudipto Guha,
Piotr Indyk,
Yannis Kotidis, S. Muthukrishnan, and Martin J. Strauss
Session 7B (Chair: Gary Miller)
•
Stability of Load Balancing Algorithms in Dynamic Adversarial Systems
.399
Elliot Anshelevich, David
Kempe,
and
Jon Kleinberg
•
Tradeoffs in Probabilistic Packet Marking for IP Traceback
.407
Micah
Adler
•
Crawling on Web Graphs
.419
Colin Cooper and Alan Frieze
•
The Price of Anarchy is Independent of the Network Topology
.428
Tim Roughgarden
•
Combinatorial Logarithmic Approximation Algorithm
for Directed Telephone Broadcast Problem
.438
Michael Elkin and Guy Kortsarz
Session 8A (Chair: Sam Buss)
•
An Exponential Separation between Regular and General Resolution
.448
Michael Alekhnovich,
Jan Johannsen,
Toniann
Pitassi, and Alasdair Urquhart
•
Size Space Tradeoffs for Resolution
.457
Eli Ben-Sasson
•
Exact Learning of DNF Formulas using DNF Hypotheses
.465
Lisa
Hellerstein
and Vijay Raghavan
•
Monotonicity
Testing over General
Poset
Domains
.474
Eldar
Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt
Rubinfeld,
and Alex Samorodnitsky
Session 8B (Chair: Pankaj Agarwal)
•
Strict Polynomial-time in Simulation and Extraction
.484
Boaz Barak and Yehuda Lindell
•
Universally Composable Two-Party and Multi-Party Secure Computation
.494
Ran
Canetti,
Yehuda Lindell, Rafail
Ostrovsky,
and
Amit Sahai
•
The Invasiveness of Off-line Memory Checking
.504
Miklós
Ajtai
•
On the Composition of Authenticated Byzantine Agreement
.514
Yehuda Lindell, Anna Lysyanskaya, and
Tal
Rabin
•
Wait-Free Consensus with Infinite Arrivals
.524
James Aspnes, Gauri Shah, and Jatin Shah
Tuesday, May
21, 2002
Session 9A (Joint Session with Complexity
2002)
(Chain Sam Buss)
•
Relations between Average Case Complexity and Approximation Complexity
.534
Uriel
Feige
•
Vertex Cover on 4-regular Hyper-graphs is Hard to Approximate Within
2-ε
.544
Jonas Holmerin
•
Resolution Lower Bounds for the Weak Pigeonhole Principle
.553
Ran
Raz
•
Hard Examples for Bounded Depth
Frege
.563
Eli Ben-Sasson
Session 9B (Chair:
Mikkel
Thorup)
•
Meldable Heaps and Boolean Union-Find.
.573
Haim Kaplan, Nira Shafrir, and Robert E.
Tarjan
•
Optimal Finger Search Trees in the Pointer Machine
.583
Gerth Stalting
Brodai,
George Lagogiannis,
Christos
Makris,
Athanasios Tsakalidis, and
Kostas Tsichlas
•
Verifying Candidate Matches in Sparse and Wildcard Matching
.592
Richard Cole and Ramesh Hariharan
•
Deterministic Sorting in O(n log log n) Time and Linear Space
.602
Yijie Han
Session 10A (Joint Session With Complexity
2002)
(Chair: Anne Condon)
•
Improved Cryptographic Hash Functions with Worst-case/Average-case
Connection
.609
Daniele Micciancio
•
Algorithmic Derandomization via Complexity Theory
.619
D. Sivakumar
•
Pseudo-Random Generators for All Hardnesses
.627
Christopher Umans
Session
1
0B (Chair: John
Reif)
•
Quantum Lower Bound for the Collision Problem
.635
Scott Aaronson
•
Secure Multi-party Quantum Computation
.643
Claude Crépeau,
Daniel Gottesman, and Adam Smith
•
Polynomial-Time Quantum Algorithms for Pell's Equation
and the Principal Ideal Problem
.653
Sean
Hallgren
ix
Session 11
A
(Joint Session
with Complexity
2002)
(Chair:
Michael Saks)
•
Randomness Conductors and Constant-Degree Lossless Expanders
.659
Michael Capalbo, Omer
Reingold,
Salii
Vadhan,
and
Avi
Wigderson
•
Expanders from Symmetric Codes
.669
Roy Meshulam and
Avi
Wigderson
•
The Complexity of Approximating Entropy
.678
Tugkan
Batu,
Sanjoy Dasgupta, Ravi Kumar, and Ronitt
Rubinfeld
•
Time-Space Tradeoffs, Multiparty Communication Complexity,
and Nearest-Neighbor Problems
.688
Paul
Bearne
and Erik
Vee
•
On Communication over an Entanglement-Assisted Quantum Channel
.698
Ashwin Nayak and Julia Salzman
Session
11
В
(Chair: Pankaj Agarwal)
•
Girth and Euclidean Distortion
.705
Nathan
Liniai,
Avner Magen,
and Assaf Naor
•
Computing the
Betti
Numbers of Arrangements
.712
Saugata
Basu
•
Space-Efficient Approximate Voronoi Diagrams
.721
Sunil Arya, Theocharis Malamatos, and David M. Mount
•
A New Greedy Approach for Facility Location Problems
.731
Kamal Jain, Mohammad Mahdian, and
Amin
Saberi
•
Finding Nearest Neighbors in Growth-restricted Metrics
.741
David R.
Karger
and Matthias Ruhl
Session 12A (Joint Session with Complexity
2002)
(Chair: Sam Buss)
•
Hardness Amplification Within NP
.751
Ryan O'Donnell
•
3-MANIFOLD KNOT GENUS is NP-complete
.761
Ian Agol, Joel
Hass,
and William Thurston
•
On the Power of Unique 2-Prover
1
-Round Games
.767
Subhash Khot
•
Learnability Beyond AC0
.776
Jeffrey C. Jackson, Adam R. Klivans, and
Rocco
A. Servedio
Session 12B (Chair: Rao Kosaraju)
•
Huffman Coding with Unequal Letter Costs
.785
Mordecai J. Golin, Claire Kenyon, and Neal E. Young
•
Approximating the Smallest Grammar: Kolmogorov Complexity
in Natural Models
.792
Moses Charikar, Eric Lehman, Ding Liu,
Rina
Panigrahy, Manoj Prabhakaran,
April
Rasala,
Amit
Sahai, and abhi shelat
•
Limits to List Decodability of Linear Codes
.802
Venkatesan Guruswami
•
Near-Optimal Linear-Time Codes for Unique Decoding
and New List-Decodable Codes Over Smaller Alphabets
.812
Venkatesan Guruswami and
Piotr Indyk
Author Index
.823-824 |
| any_adam_object | 1 |
| author_corporate | Symposium on Theory of Computing Montréal |
| author_corporate_role | aut |
| author_facet | Symposium on Theory of Computing Montréal |
| author_sort | Symposium on Theory of Computing Montréal |
| building | Verbundindex |
| bvnumber | BV014622128 |
| classification_rvk | SS 1800 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)634950762 (DE-599)BVBBV014622128 |
| 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">BV014622128</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20050906</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">020809s2002 xx ad|| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1581134959</subfield><subfield code="9">1-58113-495-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634950762</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014622128</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-739</subfield><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">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">34</subfield><subfield code="d">2002</subfield><subfield code="c">Montréal</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)10042756-X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the 34th Annual ACM Symposium on Theory of Computing</subfield><subfield code="b">Montreal, Quebec, Canada ; May 19 - 21, 2002</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 02</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">ACM Press</subfield><subfield code="c">2002</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 824 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="650" ind1="0" ind2="7"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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">2002</subfield><subfield code="z">Montréal</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="689" ind1="1" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="710" ind1="2" ind2=" "><subfield code="a">Association for Computing Machinery</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)1222-1</subfield><subfield code="4">oth</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=009938392&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-009938392</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2002 Montréal gnd-content |
| genre_facet | Konferenzschrift 2002 Montréal |
| id | DE-604.BV014622128 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:16:09Z |
| institution | BVB |
| institution_GND | (DE-588)10042756-X (DE-588)1222-1 |
| isbn | 1581134959 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009938392 |
| oclc_num | 634950762 |
| open_access_boolean | |
| owner | DE-20 DE-739 DE-91G DE-BY-TUM DE-634 DE-83 |
| owner_facet | DE-20 DE-739 DE-91G DE-BY-TUM DE-634 DE-83 |
| physical | XV, 824 S. Ill., graph. Darst. |
| publishDate | 2002 |
| publishDateSearch | 2002 |
| publishDateSort | 2002 |
| publisher | ACM Press |
| record_format | marc |
| spelling | Symposium on Theory of Computing 34 2002 Montréal Verfasser (DE-588)10042756-X aut Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 Proceedings STOC 02 New York, NY ACM Press 2002 XV, 824 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2002 Montréal gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 Datenverarbeitung (DE-588)4011152-0 s Association for Computing Machinery Sonstige (DE-588)1222-1 oth Digitalisierung TU Muenchen application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009938392&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 Theoretische Informatik (DE-588)4196735-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4011152-0 (DE-588)1071861417 |
| title | Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| title_alt | Proceedings STOC 02 |
| title_auth | Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| title_exact_search | Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| title_full | Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| title_fullStr | Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| title_full_unstemmed | Proceedings of the 34th Annual ACM Symposium on Theory of Computing Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| title_short | Proceedings of the 34th Annual ACM Symposium on Theory of Computing |
| title_sort | proceedings of the 34th annual acm symposium on theory of computing montreal quebec canada may 19 21 2002 |
| title_sub | Montreal, Quebec, Canada ; May 19 - 21, 2002 |
| topic | Theoretische Informatik (DE-588)4196735-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd |
| topic_facet | Theoretische Informatik Datenverarbeitung Konferenzschrift 2002 Montréal |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009938392&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumontheoryofcomputingmontreal proceedingsofthe34thannualacmsymposiumontheoryofcomputingmontrealquebeccanadamay19212002 AT associationforcomputingmachinery proceedingsofthe34thannualacmsymposiumontheoryofcomputingmontrealquebeccanadamay19212002 AT symposiumontheoryofcomputingmontreal proceedings AT associationforcomputingmachinery proceedings AT symposiumontheoryofcomputingmontreal stoc02 AT associationforcomputingmachinery stoc02 |