Proceedings of the 36th Annual ACM Symposium on Theory of Computing: Chicago, Illinois, USA, June 13 - 15, 2004
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | English |
| Veröffentlicht: |
New York
ACM
2004
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XVII, 646 S. graph. Darst. |
| ISBN: | 1581138520 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV019311954 | ||
| 003 | DE-604 | ||
| 005 | 20040915 | ||
| 007 | t| | ||
| 008 | 040602s2004 xx d||| |||| 10||| eng d | ||
| 020 | |a 1581138520 |9 1-58113-852-0 | ||
| 035 | |a (OCoLC)634952654 | ||
| 035 | |a (DE-599)BVBBV019311954 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 | ||
| 111 | 2 | |a Symposium on Theory of Computing |n 36 |d 2004 |c Chicago, Ill. |j Verfasser |0 (DE-588)10086789-3 |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the 36th Annual ACM Symposium on Theory of Computing |b Chicago, Illinois, USA, June 13 - 15, 2004 |
| 246 | 1 | 3 | |a STOC 2004 |
| 264 | 1 | |a New York |b ACM |c 2004 | |
| 300 | |a XVII, 646 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 856 | 4 | 2 | |m OEBV Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012779723&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-012779723 | |
Datensatz im Suchindex
| _version_ | 1820868114171035648 |
|---|---|
| adam_text |
IMAGE 1
FOREWORD . .
.
IX
STOC 2004 CONFERENCE AWARDS
.
X
STOC 2004 CONFERENCE ORGANIZATION
.
XI
REVIEWERS
.
XII
SPONSORS & SUPPORTERS
.
XVII
SESSION 1A
ROBUST PCPS OF PROXIMITY, SHORTER PCPS AND APPLICATIONS TO CODING
. 1
E. BEN-SASSON (HARVIRU' UIIIVEMITY), 0. GOLDREICH (WEIZMTMN INSTITRRLE
OF'SCIENCR), P. HARSHA, M . SUDAN (MASSACH~AETT INSTITUTE OF TECHNOLOGG,
S. VADHAN (HCRR-VARD UNIVETAITY)
* A NEW PCP OUTER VERIFIER WITH APPLICATIONS TO HOMOGENEOUS LINEAR
EQUATIONS AND MAX-BISECTION
.
I 1
J. HAMERIN (ROJD INSTITUTE OF TECHNOLOGV), S . KHOT (GCORGIA IRTSFITUTE
OJ'TCCHNOLOGY)
A ASYMMETRIC K-CENTER IS LOG* N-HARD TO APPROXIMATE
.
2 1
J. CHUZHOY (TECHNION), S. GUHA (UNIVERSITY OF PENN.YYLVANIA), E.
HALPERIN (U17IVET:SITY O F CAL(JBRNIR~ AT BERKELEY), S . KHANNA
(UNIVERSI(P OJ'PENN.S.VLVANIU), G. KORTSARZ (RUTGERS UNIVERSIQ), J. NAOR
(TECHNION)
. NEW HARDNESS RESULTS FOR CONGESTION
MINIMIZATION AND MACHINE SCHEDULING 28 J. CHUZHOY, J. NAOR (TECHNION)
SESSION 1 B ON THE PERFORMANCE OF GREEDY ALGORITHMS IN PACKET BUFFERING
. 35
S. ALBERS, M. SCHMIDT (ALBERT-LUDWIGS-UNIVERSITAT FREIBURG)
* ADAPTIVE ROUTING WITH END-TO-END FEEDBACK: DISTRIBUTED LEARNING AND
GEOMETRIC APPROACHES
.
45
B. AWERBUCH (JOHNS HOPKINS UNIVERSITY), R. D. KLEINBERG (MASSACHUSETTS
INSTITZRTE OF'TECHNOLOG)~)
* KNOW THY NEIGHBOR'S NEIGHBOR: THE POWER OF LOOKAHEAD IN RANDOMIZED P2P
NETWORKS . 54 G. S. MANKU (STANFBRD UNIVERSILY), M. NAOR, U
. WIEDER (PVEIZMANN INSTITTLTE OFSCIENCE)
* THE ZERO-ONE PRINCIPLE FOR SWITCHING NETWORKS
.
64
Y. AZAR, Y. RICHTER (TEL-AVIV UNIVERSITY)
SESSION 2A
.
APPROXIMATING THE CUT-NORM VIA GROTHENDIECK'S INEQUALITY 72
N. ALAN (TEL-AVIV UNIVERSITY), A. NAOR (MICROSOFT RESEARCH)
NEARLY-LINEAR TIME ALGORITHMS FOR GRAPH PARTITIONING, GRAPH
SPARSIFICATION, AND SOLVING LINEAR SYSTEMS
.
81
D. A. SPIELMAN (MASSACHZRSETTS INSTITUTE OJ'TECHNOLOGY), S.-H. TENG
(BOSTON U N I V E R S I ~ )
SESSION 2 8 DICTIONARY MATCHING AND INDEXING WITH ERRORS AND DON'T CARES
. 91
R. COLE, L.-A. GOTTLIEB (NEW YORK UNIVERSILY), M . LEWENSTEIN (BAR-ILAN
UNIVERSITY)
. SORTING AND SEARCHING IN THE PRESENCE OF MEMORY
FAULTS (WITHOUT REDUNDANCY) 101 I. FINOCCHI, G, F. ITALIANO (UNIVERSITD
DEGLI STZRDI DI ROMA)
III
IMAGE 2
SESSION 3 INVITED TALK: QUANTUM ALGORITHMS A DECADE AFTER SHOR
.
11 1
A. AMBAINIS ( H ~ S T I T Z R T C F I ~ A L / L J L I I ? L ' E ~ S ~ I
I C ( V )
SESSION 4A GRAPH ENTROPY AND QUANTUM SORTING PROBLEMS
. .
. 112
A. C'.-C. YAO (PRINCVFON IJRIVERXITY)
MULTILINEAR FORMULAS AND SKEPTICISM OF QUANTUM COMPUTING
. 118
S. AASONSON (U~IVCT:SIP (?FCIDIFI)RTLI(~ ( I ( B ~ R K E I Q )
EXPONENTIAL SEPARATION OF QUANTUM AND CLASSICAL ONE-WAY COMMUNICATION
COMPLEXITY . 128 Z. BNR-YOSSEF, T. S. JAYRAM (IBMABNRRCLEN
RESEARCH CENTER), I . KESENIDIS (UNIVERSIN, QFCA/IJBIVIRR AT BERKELEY)
SESSION 4B APPROXIMATION ALGORITHM FOR K-NODE CONNECTED SUBGRAPHS VIA
CRITICAL GRAPHS . 138 G. KORTSARZ (RLRTGERS
UNIVRR:VI&)), Z. NUTOV (THE OPEN UNIVEI:SIO!)
SOLVING FRACTIONAL PACKING PROBLEMS IN 0* (117) ITERATIONS
. 146
D. RIENSTOCK, G. IYCNGAR (COLURNBIU UNIVERSITJ,) * THE ALL-OR-NOTHING
MULTICOMMODITY FLOW PROBLEM
.
156
C. CHEKURE (L~~CCWT BELL LCRHS), S . KHANNA (UNIVERSITY
QFPENN.SYLVC:NIU), F. B. SHEPHERD (LZLCCWT BELL LUBS)
SESSION 5A
. - APPROXIMATION ALGORITHMS FOR DEADLINE-TSP AND VEHICLE
ROUTING WITH TIME-WINDOWS 166 N. BANSAL, A. BLUM, S. CHAWLA (CTRRNC~GIE
MELLON UNIVETSILY), A. MEYERSON (URRIVCWITY OF CDIFHRNITR AT LOS
ANGELES) * ESTIMATING THE WEIGHT OF METRIC MINIMUM SPANNING TREES IN
SUBLINEAR-TIME . 175
A. CZUMAJ (NEW JEI:SEY INSTITZ~FE OF T T R C H T D O ~ ) , C. SAHLER
(UNIVERSITY O F'PUDERBOUN)
= A FULLY DYNAMIC REACHABILITY ALGORITHM FOR DIRECTED GRAPHS
WITH AN ALMOST LINEAR UPDATE TIME
.
184
L. RODITTY, U. ZWICK (TEL-AVIV UNIVERSITY)
SESSION 5B USING NONDETERMINISM TO AMPLIFY HARDNESS
. .
. 192
A. HEALY, S. VADHAN, E. VIOLA ( H A N W D U~NIVERSILY)
VISIBLY PUSHDOWN LANGUAGES
.
202
R. ALUR, P. MADHUSUDM (UNIVERSITY OJ'PENNSYLVANIU)
. LINEAR
FPT REDUCTIONS AND COMPUTATIONAL LOWER BOUNDS 212
J. CHEN, X. I-IUANG (TE.UCRS A&M UNIVERSI@}, I . A. KANJ (DEPAUL
UNIVERSITYL, G. XIA (TEXM A& M UNIVERSIO))
SESSION 6 - BEST PAPER EXPANDER FLOWS, GEOMETRIC EMBEDDINGS AND GRAPH
PARTITIONING . 222
S. ARORA (PRINCETON UNIVERXI~), S. RAO, U. VAZIRANI (UNIVERSITY OF
CALIJBRNIA AT BERKELEY)
IMAGE 3
SESSION 7A
BOUNDED-CONCURRENT SECURE MULTI-PARTY COMPUTATION WITH A DISHONEST
MAJORITY . 232 R. PASS (ROVAL INSTITUTC~
R!F'TECHNOLOGV)
* NEW NOTIONS OF SECURITY: ACHIEVING UNIVERSAL COMPOSABILITY WITHOUT
TRUSTED SETUP . 242 M. PRABHAKARAN, A. SAHAI (PRINWTON
UNIVMSIFL;L
COMPLETENESS IN TWO-PARTY SECURE COMPUTATION - A COMPUTATIONAL VIEW
. 252 D. HARNIK, M. NAOR, 0. RCINGOLD
(WEIZ~NANN INSTITLRTEJ, A. ROSCN (I\//CRSSOCH~ACTT.S IN~TITUTC'
R!F'T~'~'HNOIOGY)
.
BATCH CODES AND THEIR APPLICATIONS 262
Y. ISHAI, E. KUSHILEVITZ (TECHNION), R. OSTROVSKY (UNIVCRSI[V
C?F'C-DI/IWWICZ R L F LOS ANGE/C .SJ, A. SAHAI (PRINCETON UNIVERSIP)
SESSION 7B
.
* LOW DISTORTION MAPS BETWEEN POINT SETS 272
C. KENYON (KCOLE POLYTECHNIQUE, PRRLCZISEAR/), Y . RABANI
(TECHNION-LSR.UE1 INSTITZITE OF TEC'HNOK~GY AND CORNELL UNIVERSITY), A.
SINC LAIR (UNIVEI-SI~ OF CCRLIFIMIIU ~ R T BERKELEY)
. BYPASSING THE EMBEDDING:
ALGORITHMS FOR LOW DIMENSIONAL METRICS 28 1
K. TALWAR (UNIVERSI~) QF CCRL~FARNIN UT BEDCELEY)
* ON CORESETS FOR K-MEANS AND K-MEDIAN CLUSTERING
.
29 1
S. HAR-PELED, S. MAZUNIDAR (UNIVE~SIRY ~$I/LINOIS)
* ISOTOPIC IMPLICIT SURFACE MESHING
.
3 0 1
J.-D. BOISSONNAT (INRIA), D. COHCN-STEINER (DRILIE UNIVERSITYL, G.
VEGTER (INSTITZRTE,FOR MCDWMCRTICS AND CONQUTING SCIENCE, RUG. THE
NETHERFUNDS)
SESSION 8A
HIT-AND-RUN FROM A CORNER
.
3 10
L. LOVHSZ (MICROSOFI RESEARCH), S. VEMPALA (MNSSC~CHERSETTS IT~STITT~TE
QF TECHNOLOGY)
* A SIMPLE POLYNOMIAL-TIME RESCALING ALGORITHM FOR SOLVING LINEAR
PROGRAMS . 3 I5 J. DUNAGAN (MICROSOFT
RESEARCH), S. VCMPALA (MASSACHISETTS INSTITUTE QF TECHNO LO^)
SESSION 8
COLLECTIVE ASYNCHRONOUS READING WITH POLYLOGARITHMIC WORST-CASE OVERHEAD
. 32 1 B. S. CHLEBUS (UNIVERSITY OF COLORADO
AT DENVER), D. R. KOWALSKI (MAX-PLANCK-INSTITZ~TFIIR INFORNMTIK AND
UNIWERSYTET WARSZAWSKI), A. A. SHVARTSMAN (UNIVERSITY OF CONNECTICUT)
UNCONDITIONAL LOWER BOUNDS ON THE TIME-APPROXIMATION TRADEOFFS FOR THE
DISTRIBUTED MINIMUM SPANNING TREE PROBLEM
.
331
M. ELKIN (YALE UNIVERSTTYL
SESSION 9
INVITED TALK: NETWORK GAMES
.
341
E. TARDOS (CORNELL UNIVERSITY)
IMAGE 4
SESSION 4 OA
TYPICAL PROPERTIES OF WINNERS AND LOSERS IN DISCRETE OPTIMIZATION
. 343
R. BEIER (MRRS-PL~RWCK-IR~.SI~~~T,/IIR INFORTNATIK), B. VOCKING
(UNIVCRSILIIT DORTMZMD)
- PRIMAL-DUAL ALGORITHMS FOR DETERMINISTIC INVENTORY PROBLEMS
. 353
R. LEVI, R. IIOUNDY, D. B. SHRNOYS ( C B M ~ L L UNIVERSITY)
. MULTI-PROCESSOR SCHEDULING TO MINIMIZE FLOW TIME
WITH * RESOURCE AUGMENTATION 363 C. CLEKURI (LUCENT BELL LRRBS), A.
GOEL (STMFBRD UNIV~RSITY)), S, KHAMLA (UNIVERSITY OJ'PENNSYLVANIU), A. K
UMAR ( I ~ D T M INSTITZ ~ T E OF TC~CHNOLOV, N W DC~HLI)
SESSION 406
. ALGORITHMS FOR
DYNAMIC GEOMETRIC PROBLEMS OVER DATA STREAMS 373
P. INDYK (CSAIL MIT)
. * SUBLINEAR ALGORITHMS FOR
TESTING MONOTONE AND UNIMODAL DISTRIBUTIONS 381
T. BAHL (UNIWL:VI[\~ ~ ~ ' T L X C I S ) , R. KUMAR (IBMALNMDEN RESEARCH
CENTER), R. RUBINFELD (HDASSACHUVETT.S INSTITUTE OF TECHNOLOGY)
* THE DIFFICULTY OF TESTING FOR ISOMORPHISM AGAINST A GRAPH THAT IS
GIVEN IN ADVANCE . 391 E. FISCHER (TKHNION - ISNIP/
IMTITCRTE OJ'TCCHRIOLOG~,)
SESSION 11A
AN APPROXIMATE KONIG'S THEOREM FOR EDGE-COLORING WEIGHTED BIPARTITE
GRAPHS . 398 J. R. CORRCA, M. X. GOEINANS
(M~~,S.SRRCH~R.SETT.S IMTITZITE OF TECHNOLOGY)
FINDING PATHS AND CYCLES OF SUPERPOLYLOGARITHMIC LENGTH
. 407
H. N. GABOW (UNIWRSIP OF COLORNDO AT BOULCKY)
BOOSTED SAMPLING: APPROXIMATION ALGORITHMS FOR STOCHASTIC OPTIMIZATION
. 417 A. GUPTA (CIRRNEGIE MELLON
UNIVC~SIP), M . PB1 (CORNELL UNIVERSIV), R. RAVI, A. SINHA (CARNEGIE
&FELLON UNIVERSITY)
SESSION 14 B
. -
DERANDOMIZING HOMOMORPHISM TESTING IN GENERAL GROUPS 427
A. SHPILKA (WEIZMANN INSTITUTE OFSCIENCE), A. WIGDERSON (INSTITUTE FOR
ADVANCED STUDY)
.
BETTER EXTRACTORS FOR BETTER CODES? 436
V. GURUSWAMI (UNIVERSIT?, OF WASHINGTON)
.
. A NEW FAMILY OF CAYLEY
EXPANDERS (7) . 445
E. ROZENMAN, A. SHALEV (HEBREW UNIVERSITY), A. WIGDERSON (INSTITUTE FOR
ADVANCED STUDY)
SESSION 12 - BEST STUDENT PAPER
SPECTRAL PARTITIONING, EIGENVALUE BOUNDS, AND CIRCLE PACKINGS
.
FOR GRAPHS OF BOUNDED GENUS . . 455
J. A. KELNER (MASSACHUSETTS IMTIHRTE OF TECHNOLOGY)
SESSION 13 - BEST STUDENT PAPER
LOWER BOUNDS FOR LOCAL SEARCH BY QUANTUM ARGUMENTS . . . . . . . . . . .
. . . . . . . . . . . . . . . . . . . . 465
S. AARONSON (UNIVERSITY OF CNL~ORNIA AT BERKELEY)
IMAGE 5
SESSION D4A COUNTING COMPLEXITY CLASSES FOR NUMERIC COMPUTATIONS II:
ALGEBRAIC AND SEMIALGEBRAIC SETS
.
475
P. BIIRGISSER (PAC/ERT~ORN UNIVERSITY), F. CUCKER (CITY UNIVERSITY
QFHOWG K'ONG)
A CONJECTURE ABOUT POLYNOMIAL TIME COMPUTABLE LATTICE-LATTICE FUNCTIONS
. 486 M. AJTAI (IBMAHAU'EN RC.SEURC/Z
CENTW) =
QUANTUM AND CLASSICAL QUERY COMPLEXITIES OF LOCAL SEARCH ARE
POLYNOMIALLY RELATED . 494 M. SANTHA (UNIVECSITD
PARIS-SUD), M. SZEGEDY {KUTGCRS UNIVCR:SI@)
THE QUANTUM ADIABATIC OPTIMIZATION ALGORITHM AND LOCAL MINIMA
. . . 502
B. W. REICHARDT (UNIVERSITY OF CCRLIJBRNIU TIT BERH-ELE-V)
SESSION 14B = AUCTION ALGORITHMS FOR MARKET EQUILIBRIUM
.
5 11
R. GARG (IBMINDIA R E S ~ ~ I R C H LRRB), S. KAPOOR (ILLINOIS INSTITUTE
O F ' T E C H N O L O ~ )
THE SPENDING CONSTRAINT MODEL FOR MARKET EQUILIBRIUM: ALGORITHMIC,
EXISTENCE AND UNIQUENESS RESULTS
.
5 19
N. R. DEVANUR, V. V. VAZIRANI (GEORGIA IRWTITUTE OF'7'ECHNOLOGY)
* (ALMOST) TIGHT BOUNDS AND EXISTENCE THEOREMS FOR CONFLUENT FLOWS
. 529
J. CHEN (NORTHEASTERN UNIVERXILYL, R. D. KLEINBERG (MASSACHUSETTS
INSTITUTE OJ'TECHNOLOGV), L. LOVHSZ (MICROSOJL RESEURCH), R. RAJARAMAN,
R. SUNDARAM (NORTHEASTERN UNIVEI:SITY), A. VETTA (MCGIN UNIVERSITY)
* APPROXIMATE MAX-INTEGRAL-FLOWLMIN-MUTTICUT THEOREMS
.
539
K. OBATA (UNIVESITY OF'CAL~FORNIA AT BERKELEY)
SESSION 15A
LOWER BOUNDS FOR DYNAMIC CONNECTIVITY
.
546
M. P%TRAQCU, E. D. DEMAINE (MUSSACHUSETTS INSTITUTE OF'TECHNOLOG),)
LOWER BOUNDS FOR LINEAR DEGENERACY TESTING
.
554
N. AILON, B. CHAZELLE (PRINCETON UNIVERSITY)
SESSION 15B * A DECENTRALIZED ALGORITHM FOR SPECTRAL ANALYSIS
.
561
D. KERNPE (UNIVERSITY OF WNSHINGTON), F . MCSHENY (MICROSOJT RESEARCH
SVC)
USING MIXTURE MODELS FOR COLLABORATIVE FILTERING
.
569
J. KLEINBERG, M. SANDLER (CORNELL UNIVERSITYL
SESSION 16 INVITED TALK: DEPTH THROUGH BREADTH, OR WHY SHOULD WE ATTEND
TALKS IN OTHER AREAS? . 579 A. WIGDERSON (INSTITUTE FOR
ADVANCED STUDY)
SESSION 17A SHARP THRESHOLDS FOR MONOTONE PROPERTIES IN RANDOM GEOMETRIC
GRAPHS . 580 A. GOEL, S. RAI ( S T D
O R D UNIVERSITY), B. KRISLMAMACHARI (UNIVERSITY OFSOUTHERN CALIFORNIA)
THE TWO POSSIBLE VALUES OF THE CHROMATIC NUMBER OF A RANDOM GRAPH
. 587 D. ACHLIOPTAS, A. NAOR
(MICROSOFT RESEARCH) * ON SUMS OF INDEPENDENT RANDOM VARIABLES WITH
UNBOUNDED VARIANCE, AND ESTIMATING THE AVERAGE DEGREE IN A GRAPH
.
594
U. FEIGE (THE WEIZMANN INSTITUTE)
VII
IMAGE 6
SESSION 47B THE COMPLEXITY OF PURE NASH EQUILIBRIA
.
604
A. FABRIKANT, C. PAPADIMITRIOU, K. TALWAR (UNIVERSITY OF CULIFORNIA AT
BERKELEY)
. . COMPUTING NASH EQUILIBRIA FOR
SCHEDULING ON RESTRICTED PARALLEL LINKS . 613 M. GAIRING, T. LIICKING
(UIIVERSITY UF PUDERHORN), M. MAVRONICOLAS (UNIVERSI2Y OF CYPRUS), 8.
MONIEN (UNIVER,IRY OF PCRDRRHORN)
. RATIONAL SECRET SHARING AND
MULTIPARTY COMPUTATION: EXTENDED ABSTRACT 623
J . MALPERN (CORNCLL UNIVERSITY), V . TEAGUE (STANFORD UNIVERSITY)
SESSION 4 8 - BEST PAPER
. * MULTI-LINEAR FORMULAS FOR PERMANENT AND DETERMINANT
ARE OF SUPER-POLYNOMIAL SIZE 633 R. RAZ (WEIZMANN INSTITUTE (FSCIENCE)
.
AUTHOR INDEX 642
VIII |
| any_adam_object | 1 |
| author_corporate | Symposium on Theory of Computing Chicago, Ill |
| author_corporate_role | aut |
| author_facet | Symposium on Theory of Computing Chicago, Ill |
| author_sort | Symposium on Theory of Computing Chicago, Ill |
| building | Verbundindex |
| bvnumber | BV019311954 |
| classification_rvk | SS 2004 |
| ctrlnum | (OCoLC)634952654 (DE-599)BVBBV019311954 |
| 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">BV019311954</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040915</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">040602s2004 xx d||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1581138520</subfield><subfield code="9">1-58113-852-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)634952654</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019311954</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-739</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Symposium on Theory of Computing</subfield><subfield code="n">36</subfield><subfield code="d">2004</subfield><subfield code="c">Chicago, Ill.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)10086789-3</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the 36th Annual ACM Symposium on Theory of Computing</subfield><subfield code="b">Chicago, Illinois, USA, June 13 - 15, 2004</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">STOC 2004</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">ACM</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 646 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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">OEBV Datenaustausch</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=012779723&sequence=000001&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-012779723</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Konferenzschrift |
| id | DE-604.BV019311954 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T13:19:13Z |
| institution | BVB |
| institution_GND | (DE-588)10086789-3 |
| isbn | 1581138520 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-012779723 |
| oclc_num | 634952654 |
| open_access_boolean | |
| owner | DE-739 |
| owner_facet | DE-739 |
| physical | XVII, 646 S. graph. Darst. |
| publishDate | 2004 |
| publishDateSearch | 2004 |
| publishDateSort | 2004 |
| publisher | ACM |
| record_format | marc |
| spelling | Symposium on Theory of Computing 36 2004 Chicago, Ill. Verfasser (DE-588)10086789-3 aut Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 STOC 2004 New York ACM 2004 XVII, 646 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier (DE-588)1071861417 Konferenzschrift gnd-content OEBV Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012779723&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 |
| subject_GND | (DE-588)1071861417 |
| title | Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 |
| title_alt | STOC 2004 |
| title_auth | Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 |
| title_exact_search | Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 |
| title_full | Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 |
| title_fullStr | Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 |
| title_full_unstemmed | Proceedings of the 36th Annual ACM Symposium on Theory of Computing Chicago, Illinois, USA, June 13 - 15, 2004 |
| title_short | Proceedings of the 36th Annual ACM Symposium on Theory of Computing |
| title_sort | proceedings of the 36th annual acm symposium on theory of computing chicago illinois usa june 13 15 2004 |
| title_sub | Chicago, Illinois, USA, June 13 - 15, 2004 |
| topic_facet | Konferenzschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=012779723&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumontheoryofcomputingchicagoill proceedingsofthe36thannualacmsymposiumontheoryofcomputingchicagoillinoisusajune13152004 AT symposiumontheoryofcomputingchicagoill stoc2004 |