Proceedings of the 35th Annual ACM Symposium on Theory of Computing: San Diego, CA ; June 9 - 11, 2003
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
ACM Press
2003
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XII, 728 S. graph. Darst. |
| ISBN: | 1581136749 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV017224376 | ||
| 003 | DE-604 | ||
| 005 | 20040205 | ||
| 007 | t| | ||
| 008 | 030617s2003 xx d||| |||| 10||| eng d | ||
| 020 | |a 1581136749 |9 1-58113-674-9 | ||
| 035 | |a (OCoLC)635054468 | ||
| 035 | |a (DE-599)BVBBV017224376 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G |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 35 |d 2003 |c San Diego, Calif. |j Verfasser |0 (DE-588)10068490-7 |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the 35th Annual ACM Symposium on Theory of Computing |b San Diego, CA ; June 9 - 11, 2003 |c STOC 2003 |
| 246 | 1 | 3 | |a Proceedings |
| 246 | 1 | 3 | |a STOC 03 |
| 264 | 1 | |a New York, NY |b ACM Press |c 2003 | |
| 300 | |a XII, 728 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 2003 |z San Diego Calif. |2 gnd-content | |
| 689 | 0 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 0 | |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=010380833&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-010380833 | |
Datensatz im Suchindex
| _version_ | 1820867921655627776 |
|---|---|
| adam_text |
Table
of
Contents
Conference Organization
&
Program Committee
.
χ
Sponsors
&
Supporters
.
χ
Reviewers
.xi
Session
1
A Chair: Ashwin Nayak
•
Hidden Translation and Orbit Coset in Quantum Computing
.1
K. Friedl, G. Ivanyos (Hungarian Academy of Sciences),
F. Magniez, M.
Santha (CNRS-LRI),
P. Sen
(Université Paris-Sud)
•
Classical Deterministic Complexity of Edmonds' Problem
and Quantum Entanglement
.10
L. Gurvits (Los Alamos National Laboratory)
•
Adiabatic Quantum State Generation and Statistical Zero Knowledge
.20
D. Aharonov (Hebrew University), A. Ta-Shma (Tel Aviv University)
Session
1
В
Chair: Rafail
Ostrovsky
•
Better Streaming Algorithms for Clustering Problems
.30
M. Charikar (Princeton University), L. O'Callaghan (Stanford Univesity), R. Panigrahy (Cisco Systems)
•
Approximation Algorithms for Hierarchical Location Problems
.40
C. G. Plaxton (University of Texas at Austin)
•
Approximation Schemes for Clustering Problems
.50
W. Fernandez
de
la
Vega
(Université Paris-Sud), M.
Karpinski (University of Bonn),
C.
Kenyon (Ecole Polytechnique), Y.
Rąbani (Technion-IIT)
Session 2A Chair:
Leonard Schulman
•
Exponential Algorithmic Speedup by a Quantum Walk
.59
A. M. Childs (Massachusetts Institute of Technology),
R. Cieve
(University of Calgary),
E. Deotto, E.
Farhi (Massachusetts Institute of Technology), S.
Gutmann
(Northeastern University),
D. A. Spielman (Massachusetts Institute of Technology)
•
Quantum Time-Space Tradeoffs for Sorting
.69
H. Klauck (Institute for Advanced Study)
•
On the Power of Quantum Fingerprinting
.77
A. C.-C. Yao (Princeton University)
Session 2B Chair: Aravind Srinivasan
•
Management of Multi-Queue Switches in QoS Networks
.82
Y. Azar, Y.
Richter
(Tel-Aviv University)
•
Constant Factor Approximation of Vertex-Cuts in Planar Graphs
.90
E. Amir, R. Krauthgamer, S. Rao (University of California at Berkeley)
•
The Online Set Cover Problem
.100
N.
Alon (Tel-Aviv University), B. Awerbuch (Johns Hopkins University).
Y. Azar
(Tel-Ar iv
University),
N. Buchbinder,
J.
S.
Naor (Technion)
Session
ЗА
Chair:
Luca
Trevisan
•
Exponential Lower Bound for 2-Query Locally Decodable Codes
via a Quantum Argument
.106
I. Kerenidis (University of California at Berkeley), R.
de
Wolf (CWI, INS4)
•
Optimal Probabilistic Fingerprint Codes
.116
G.
Tardos (Rényi
Institute)
• Linear
Time Encodable and List Decodable Codes
.126
V. Guruswami (University of Washington), P.
Indyk
(Massachusetts Institute of Technology)
•
Reconstructing Curves in Three (and Higher) Dimensional Space from Noisy Data.
136
D. Coppersmith (IBM T. J. Watson Research Center), M. Sudan (Massachusetts Institute of Technology)
Session 3B Chair: Samir Khuller
•
Short Path Queries in Planar Graphs in Constant Time
.143
Ł. Kowalik,
M. Kurowski
(Warsaw University)
•
Integer Priority Queues with Decrease Key in Constant Time
and the Single Source Shortest Paths Problem
.149
M. Thorup (AT&TLabs
-
Research)
•
A New Approach to Dynamic All Pairs Shortest Paths
.159
C. Demetrescu, G. F.
Italiano
(Università dì Roma)
•
A
Fast Algorithm for Computing
Steiner
Edge Connectivity
.167
R. Cole (New York University), R. Hariharan (Indian Institute of Science)
Session 4A Chair:
Luca
Trevisan
•
The Computational Complexity of Some Julia Sets
.177
R. Rettinger, K.
Weihrauch (Fern Universität
Hagen)
•
Time-Space Tradeoff Lower Bounds for Integer Multiplication
and Graphs of Arithmetic Functions
.186
M.
Sauerhoff,
P. Woelfel
(Universität
Dortmund)
Session 4B Chair: Avrim Blum
•
Boosting in the Presence of Noise
.196
A. Kalai (Massachusetts Institute of Technology), R. A. Servedio (Columbia University)
•
Learning Juntas
.206
E. Mossel
(University of California at Berkeley), R. O'Donnell (Massachusetts Institute of Technology),
R. A. Servedio (Columbia University)
Session 5A Chair: Leonard Schulman
•
Generating Random Regular Graphs
.213
J. H. Kim (Microsoft Research), V.
H. Vu
(University of California at San Diego)
•
The Threshold for Random k-SAT is 2k In 2-O(k)
.223
D. Achlioptas (Microsoft Research), Y. Peres (University of California at Berkeley)
•
Random Knapsack in Expected Polynomial Time
.232
R.
Beier
ι
Max-Planck-lnstitiitfitr
Informatik),
B. Vöcking
(Universität Dortmund)
Session 5B
Chain Sanjeev Khanna
• Server
Scheduling in the
Lp Norm:
A Rising Tide
Lifts All
Boat.
242
N. Bansal (Carnegie Mellon
University),
K. Pruhs
(University of Pittsburgh)
•
Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
.251
C. Georgiou. A. Russell (University of Connecticut).
A. A. Shvartsman (University of Connecticut. Massachusetts Institute of Technology)
•
A Tight Time Lower Bound for Space-Optimal Implementations
of Multi-Writer Snapshots
.259
P. Fatourou (University ofloannina). F. Fich (University of Toronto), E. Ruppert (York University)
Session 6A Chair: Santosh Vempala
•
Randomly Coloring Graphs of Girth at Least Five
.269
T. P. Hayes /University of Chicago)
•
Evolving Sets and Mixing
.279
B. Morris, Y. Peres (University of California at Berkeley)
•
Modified Log-Sobolev Inequalities, Mixing and Hypercontractivity
.287
S. Bobkov
(University of Minnesota), P. Tetali (Georgia Institute of Technology)
Session 6B Chair: Michel Goemans
•
On the Fractal Behavior of TCP
.297
A. Gilbert, H. Karloff (AT&TLabs
-
Research)
•
On the Limits of Cache-Obliviousness
.307
G. S.
Brodai,
R.
Fagerberg
(University ofAarhus)
•
A Sublinear
Algorithm for Weakly Approximating Edit Distance
.316
T.
Batu
(University of Pennsylvania), F. Ergim (Case Western Reserve University),
J.
Kilián
(NEC Laboratories America),
A. Magen
(University of Toronto),
S. Raskhodnikova (Massachusetts Institute of Technology), R.
Rubinfeld
(NEC Laboratories America),
R.
Sami (Yale
University)
Session 7A Chair: Sanjeev Arora
•
New Degree Bounds for Polynomial Threshold Functions
.325
R. O'Donnell (Massachusetts Institute of Technology), R. A. Servedio (Columbia University)
•
Sampling Lower Bounds via Information Theory
.335
Z. Bar-Yossef (IBM
Almadén
Research Center)
•
Some 3CNF Properties Are Hard to Test
.345
E. Ben-Sasson (Harvard University, Massachusetts Institute of Technologies),
P. Harsha, S. Raskhodnikova (Massachusetts Institute of Technology)
•
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds
.355
V. Kabanets, R. Impagliazzo (University of California at San Diego)
Session 7B Chair: Michel Goemans
•
Simpler and Better Approximation Algorithms for Network Design
.365
A. Gupta (Carnegie Mellon University), A. Kumar (Lucent Bell Laboratories),
T. Roughgarden (Cornell University)
•
Meet and Merge: Approximation Algorithms for Confluent Flows
.373
J. Chen, R. Rajaraman (Northeastern University), R.
Sundaram
(Akamai Technologies)
•
Optimal Oblivious Routing in Polynomial Time
.383
Y. Azar
(Tel Aviv University), E. Cohen (AT&TResearch Laboratories),
A. Fiat, H. Kaplan (Tel Aviv University), H.
Räcke
(Paderborn
University)
•
Primal-Dual Meets Local Search: Approximating MST's
with
Nonuniform
Degree Bounds
.389
J.
Könemann,
R.
Ravi (Carnegie Mellon
Universit}-)
Session 8A Chair: Rafail
Ostrovsky
•
The Worst-case Behavior of Schnorr's Algorithm Approximating
the Shortest Nonzero Vector in a Lattice
.396
M. Ajtai (IBM
Almadén
Research Center)
•
New Lattice Based Cryptographic Constructions
.407
0. Regev (Institute for Advanced Study)
•
Lower Bounds on the Efficiency of Encryption and Digital Signature Schemes
.417
R.
Gennaro
(IBM T. J. Watson Research Center), Y. Gertner (University of Pennsylvania).
J. Katz (University of Maryland)
•
Non-interactive and Reusable Non-malleable Commitment Schemes
426
1.
Damgard
(University of Aarhus). J. Groth (CRYPTOMAThICA S)
Session
8В
Chair: Santosh Vempala
•
The Intrinsic Dimensionality of Graphs
.438
R. Krauthgamer, J. R. Lee (University of California at Berkeley)
•
A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics
.448
J. Fakcharoenphol, S. Rao, K. Talwar (University of California at Berkeley)
•
On Average Distortion of Embedding Metrics into the Line and into L1
.456
Y. Rabinovich (University of Haifa)
•
On Metric Ramsey-Type Phenomena
.463
Y. Bartal,
N.
Liniai,
M.
Mendel (Hebrew University), A. Naor (Microsoft Research)
Session 9A Chair:
Günter Rote
•
Touring a Sequence of Polygons
.473
M. Dror, A. Efrat (The University of Arizona), A. Lubiw (University of Waterloo),
J. S. B. Mitchell (Stony Brook University)
•
Well-Separated Pair Decomposition for the Unit-Disk Graph Metric
and its Applications
.483
J.
Gao
(Stanford University), L. Zhang (Hewlett-PackardLaboratories)
•
Alpha-Shapes and Flow Shapes are Homotopy Equivalent
.493
T. K. Dey
(The Ohio State University), J. Giesen, M. John
(ΕΤΗ
Zurich)
Session 9B Chair: Avrim Blum
•
Reducing Truth-telling Online Mechanisms to Online Optimization
.503
B. Awerbuch (Johns Hopkins University),
Y. Azar
(Tel-Aviv University),
A. Meyerson (Carnegie Mellon University)
•
Near-Optimal Network Design with Selfish Agents
.511
E. Anshelevich, A. Dasgupta, E.
Tardos,
T. Wexler
(Cornell University)
•
Pricing Network Edges for Heterogeneous Selfish Users
.521
R. Cole, Y. Dodis (New York University), T. Roughgarden (Cornell University)
Session
1
0A Chair: David Eppstein
•
Sublinear
Geometric Algorithms
.531
B. Chazelle (Princeton University
&
NEC Laboratories America, Inc.), D. Liu (Princeton University),
A. Magen
(University of Toronto)
•
Distinct Distances in Three and Higher Dimensions
.541
B. Aronov «Polytechnic University),
J. Pach
(City College, New York University),
M. Shark (Hungarian Academy of Sciences), G.
Tardos (Rényi
Institute)
•
Cutting Triangular Cycles of Lines in Space
.547
B. Aronov (Polytechnic University), V.
Kołtun
(University of California at Berkeley),
M. Sharir (Tel Aviv University, New York University)
Session 10B Chair: Sanjeev Khanna
•
OPT versus LOAD in Dynamic Storage Allocation
.556
A. L.
Buchsbaum.
H.
Karloff
(AT&TLabs
-
Research),
С
Kenyon
(Ecole Polytechnique),
N. Reingold.
M.
Thorup (AT&TLabs - Research)
•
Consistent Load Balancing Via Spread Minimization
.565
R.
Kleinberg
(Massachusetts Institute of Technology),
T. Leighton (Akamai Technologies, Massachusetts Institute of Technology)
•
A Stochastic Process on the Hypercube with Applications
to Peer-to-Peer Networks
.575
M.
Adler
(University of Massachusetts), E. Halperin,
R. M.
Karp
(University of California at Berkeley),
V. V'. Vazirani (Georgia Institute of Technology)
SeSSIOn
11
A Chair: Sanjeev Arora
•
Polylogarithmic Inapproximability
.585
E. Halperin, R. Krauthgamer (University of California at Berkeley)
•
A New Multilayered
PCP
and the Hardness of Hypergraph Vertex Cover
.595
I. Dinur (NEC Research Institute), V. Guruswami (University of Washington), S. Khot (Princeton University),
O. Regev (Institute for Advanced Study)
•
Extractors: Optimal up to Constant Factors
.602
C.-J.
Lu (Academia
Sinica),
О.
Reingold (AT&TLabs - Research), S. Vadhan (Harvard
University),
A. Wigderson (Hebrew University)
•
Randomness-efficient Low Degree Tests and Short PCPs via Epsilon-Biased Sets
.612
E. Ben-Sasson (Harvard University, Massachusetts Institute of Technology),
M. Sudan (Massachusetts Institute of Technology), S. Vadhan (Harvard University),
A. Wigderson (Hebrew University)
Session
11
В
Chair: Samir Khuller
•
Uniform Hashing in Constant Time and Linear Space
.622
A. Östlin,
R. Pagh
(IT University of Copenhagen)
•
Almost Random Graphs with Simple Hash Functions
.629
M. Dietzfelbinger
(Universität Ilmenau),
P. Woelfel
(Universität
Dortmund)
•
Dynamic Rectangular Intersection with Priorities
.639
H. Kaplan, E. Molad (Tel Aviv University),
R. E.
Tarjan
(Princeton University
&
Hewlett Packard Laboratories)
•
Space Efficient Dynamic Stabbing with Fast Queries
.649
M. Thorap (AT&TLabs
-
Research)
Session 12A Chair: Ashwin Nayak
•
Lower Bounds on the Amount of Randomness in Private Computation
.659
A. Gál
(University of Texas at Austin),
A. Rosén
(Technion)
•
Cell-Probe Lower Bounds for the Partial Match Problem
.667
T. S. Jayram (IBM
Almadén
Research Center), S. Khot (Princeton University),
R. Kumar (IBM
Almadén
Research Center), Y.
Rąbani
(Technion, Israel Institute of Technology)
•
Two Applications of Information Complexity
.673
T. S. Jayram, R. Kumar, D. Sivakumar (IBM
Almadén
Research Center)
•
Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions
.683
Y. Lindell (IBM
T.
J. Watson Research)
Session 12B Chair: Michel Goemans
•
Approximate Counting by Dynamic Programming
693
M. Dyer (University of Leeds)
•
Testing Subgraphs in Directed Graphs ?00
N.
Alon, A. Shapira (Tel-Aviv University)
•
On the Sample Size of /r-Restricted Min-Wise Independent Permutations
and Other
Я
-Wise Distributions
.
7l°
T. Itoh (Tokyo Institute of Technology), Y. Takei (Nagaoka University of Technology).
J.
Tarai
(University of Electro-Communications)
•
A Proof of Alon's Second Eigenvalue Conjecture 7-°
J. Friedman (University of British Columbia)
Author Index
.725 |
| any_adam_object | 1 |
| author_corporate | Symposium on Theory of Computing San Diego, Calif |
| author_corporate_role | aut |
| author_facet | Symposium on Theory of Computing San Diego, Calif |
| author_sort | Symposium on Theory of Computing San Diego, Calif |
| building | Verbundindex |
| bvnumber | BV017224376 |
| classification_rvk | SS 1800 |
| classification_tum | DAT 500f |
| ctrlnum | (OCoLC)635054468 (DE-599)BVBBV017224376 |
| 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">BV017224376</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040205</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">030617s2003 xx d||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1581136749</subfield><subfield code="9">1-58113-674-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)635054468</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV017224376</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-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">35</subfield><subfield code="d">2003</subfield><subfield code="c">San Diego, Calif.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)10068490-7</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the 35th Annual ACM Symposium on Theory of Computing</subfield><subfield code="b">San Diego, CA ; June 9 - 11, 2003</subfield><subfield code="c">STOC 2003</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 03</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">ACM Press</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XII, 728 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">2003</subfield><subfield code="z">San Diego Calif.</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="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=010380833&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-010380833</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 2003 San Diego Calif. gnd-content |
| genre_facet | Konferenzschrift 2003 San Diego Calif. |
| id | DE-604.BV017224376 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:16:10Z |
| institution | BVB |
| institution_GND | (DE-588)10068490-7 (DE-588)1222-1 |
| isbn | 1581136749 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-010380833 |
| oclc_num | 635054468 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM DE-83 |
| owner_facet | DE-91G DE-BY-TUM DE-83 |
| physical | XII, 728 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | ACM Press |
| record_format | marc |
| spelling | Symposium on Theory of Computing 35 2003 San Diego, Calif. Verfasser (DE-588)10068490-7 aut Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 STOC 2003 Proceedings STOC 03 New York, NY ACM Press 2003 XII, 728 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 2003 San Diego Calif. gnd-content Theoretische Informatik (DE-588)4196735-5 s DE-604 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=010380833&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 Theoretische Informatik (DE-588)4196735-5 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)1071861417 |
| title | Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 |
| title_alt | Proceedings STOC 03 |
| title_auth | Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 |
| title_exact_search | Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 |
| title_full | Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 STOC 2003 |
| title_fullStr | Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 STOC 2003 |
| title_full_unstemmed | Proceedings of the 35th Annual ACM Symposium on Theory of Computing San Diego, CA ; June 9 - 11, 2003 STOC 2003 |
| title_short | Proceedings of the 35th Annual ACM Symposium on Theory of Computing |
| title_sort | proceedings of the 35th annual acm symposium on theory of computing san diego ca june 9 11 2003 |
| title_sub | San Diego, CA ; June 9 - 11, 2003 |
| topic | Theoretische Informatik (DE-588)4196735-5 gnd |
| topic_facet | Theoretische Informatik Konferenzschrift 2003 San Diego Calif. |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=010380833&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumontheoryofcomputingsandiegocalif proceedingsofthe35thannualacmsymposiumontheoryofcomputingsandiegocajune9112003 AT associationforcomputingmachinery proceedingsofthe35thannualacmsymposiumontheoryofcomputingsandiegocajune9112003 AT symposiumontheoryofcomputingsandiegocalif proceedings AT associationforcomputingmachinery proceedings AT symposiumontheoryofcomputingsandiegocalif stoc03 AT associationforcomputingmachinery stoc03 |