Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing: Montréal, Québec, Canada, May 23 - 25, 1994
Saved in:
| Corporate Author: | |
|---|---|
| Format: | Conference Proceeding Book |
| Language: | English |
| Published: |
New York, NY
ACM Press
1994
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | IX, 822 S. graph. Darst. |
| ISBN: | 0897916638 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV009838716 | ||
| 003 | DE-604 | ||
| 005 | 19941012 | ||
| 007 | t| | ||
| 008 | 941011s1994 xx d||| |||| 10||| eng d | ||
| 020 | |a 0897916638 |9 0-89791-663-8 | ||
| 035 | |a (OCoLC)263542250 | ||
| 035 | |a (DE-599)BVBBV009838716 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-739 |a DE-91G |a DE-12 |a DE-83 | ||
| 084 | |a DAT 001f |2 stub | ||
| 084 | |a 68Qxx |2 msc | ||
| 111 | 2 | |a Symposium on Theory of Computing |n 26 |d 1994 |c Montréal |j Verfasser |0 (DE-588)5112174-8 |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing |b Montréal, Québec, Canada, May 23 - 25, 1994 |c [program committee: Amihood Amir ...] |
| 264 | 1 | |a New York, NY |b ACM Press |c 1994 | |
| 300 | |a IX, 822 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 |
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1994 |z Montr'eal |2 gnd-content | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1994 |z Montréal |2 gnd-content | |
| 689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Theoretische Informatik |0 (DE-588)4196735-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Amir, Amihood |e Sonstige |4 oth | |
| 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=006515243&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006515243 | |
Record in the Search Index
| _version_ | 1820882547723206656 |
|---|---|
| adam_text |
Twenty-Sixth Annual ACM Symposium on
Theory of Computing
May
23-25, 1994,
Montréal (Québec),
Canada
Table of Contents
MONDAY, MAY
23, 1994
Session 1A: Chaired by Roberto Tamassia
A near optimal algorithm for edge separators
Fan R.K. Chung, S.T. Yau
.1
A randomized linear-time algorithm for
fìnding
minimum spanning trees
Philip Klein, Robert E.
Tarjan
.9
Polylog-time and near-linear work approximation scheme for undirected shortest paths
Edith Cohen
.16
Faster shortest-path algorithms for planar graphs
Philip Klein, Satish Rao,
Monika Rauch,
Sairam Subramanian
.27
Session IB: Chaired by Michael Saks
On the complexity of negation-limited boolean networks
Keisuke Tanaka, Tetsuro Nishino
.38
On the computational power of depth
2
circuits with threshold and modulo gates
Matthias
Krause,
Pavel Pudlak
.48
Circuit complexity: from the worst case to the average case
Andreas
Jakoby,
Rüdiger Reischuk,
Christian
Schindelhauer .58
A weight-size trade-off for circuits with MOD
m
gates
Vince Grolmusz
.68
Plenary Session
1:
Chaired by Michael T. Goodrich
Computational geometry: A Retrospective
Bernard Chazelle
.75
Session
2
A: Chaired by David Eppstein
On point location and motion planning among simplicies
Marco Pellegrini
.95
On lazy randomized incremental construction
Mark
de Berg, Katrin Dobrindt,
Otfried Schwarzkopf
.105
Session 2B: Chaired by Bruce Maggs
Fault-tolerant scheduling
Bala
Kalyanasundaram, Kirk R. Pruhs
.115
On the fault tolerance of the
butterñy
Anna R.
Karlin,
Greg Nelson, Hisao Tamaki
.125
Session
ЗА:
Chaired by Bruce Maggs
Efficient routing in all-optical networks
Prabhakar Raghavan, Eli Upfal
.134
Scalable expanders: exploiting hierarchical random wiring
Eric A. Brewer, Frederic T. Chong, Tom Leighton
.144
On contention resolution protocols and associated probabilistic phenomena
P.D.
MacKenzie,
CG.
Plaxton, R. Rajaraman
.153
The minimum latency problem
Avrim Blum,
Prasad
Chalasani, Don Coppersmith, Bill Pulleyblank, P. Raghavan, Madhu Sudan
.163
Session 3B: Chaired by Richard Beigel
Two
prover
protocols
-
low error at affordable rates
Uri
Feige,
Joe
Kilián
.172
Improved non-approxhnability results
Mihir
Bellare,
Madhu Sudan
.184
Nearly-linear size holographic proofs
Alexander Polishchuk, Daniel A. Spielman
.194
Natural proofs
Alexander A. Razborov, Steven Rudich
.204
Session 4A: Chaired by Richard Ladner
Efficient asynchronous distributed symmetry breaking
Baruch Awerbuch, Lenore J. Cowen, Mark A. Smith
.214
Time bounds for mutual exclusion and related problems
Jae-Heon Yang, James H. Anderson
.224
Simple and efficient leader election in the full information model
Rafail
Ostrovsky,
Sridhar Rajagopalan, Umesh Vazirani
.234
A simple constructive computability theorem for wait-free computation
Maurice Herlihy, Nir Shavit
.243
Session 4B: Chaired by Peter Shor
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
Avrim Blum, Merrick
Furst,
Jeffrey Jackson, Michael Kearns, Yishay Mansour, Steven Rudich
.253
Simulating access to hidden information while learning
Peter Auer, Philip M. Long
.263
On the learnability of discrete distributions
Michael Kearns, Yishay Mansour,
Dana Ron, Ronitt Rubinfeld,
Robert E. Schapire, Linda
Sellie
.273
Choosing a learning team:
a topologica!
approach
Kalvis
Apsïtis,
Rüsins
Freivalds,
Carl
H.
Smith .283
TUESDAY, MAY
24, 1994
Session 5A: Chaired by Amihood Amir
Optimal parallel suffix tree construction
Ramesh Hariharan
.290
Symmetry breaking for suffix tree construction
Suleyman Cenk Sahinalp,
Uzi
Vishkin
.300
Real-time pattern matching and quasi-real-time construction of suffix trees
S. Rao Kosaraju
.310
The complexity of searching a sorted array of strings
Arne Andersson, Torben Hagerup, Johan Hastad, Ola Petersson
.317
Session 5B:
Chaired
by David
Eppstein
Color-coding: a new method for
fínding
simple paths, cycles and other small subgraphs within large
graphs
Noga
Alón,
Raphael Yuster,
Uri
Zwick .326
Search for the maximum of a random walk
Andrew M. Odlyzko
.336
A spectral technique for coloring random
З-соіогаЬіе
graphs
Noga
Alón,
Nabil Kahale
.346
Pseudorandomness for network algorithms
Russel
Impagliazzo, Noam Nisan,
Avi
Wigderson
.356
Plenary Session
2:
Chaired by Joan
Feigenbaum
The complexity of
verifìcation
R.P. Kurshan
.365
Session 6A: Chaired by Vijaya Ramachandran
Trade-offs between communication throughput and parallel time
Yishay Mansour, Noam Nisan,
Uzi
Vishkin
.372
Optimal parallel string algorithms: sorting, merging and computing the minimum
Torben Hagerup.382
Session 6B: Chaired by Eric Bach
The computational complexity of recognizing permutation functions
Keju
Ma, Joachim
von zur
Gathen
.392
The independence of the modulo
ρ
counting principles
Miklos
Ajtai
.402
Session 7A: Chaired by Greg
Freder
ickson
Low degree spanning trees of small weight
Samir Khuller, Balaji Raghavachari, Neal Young
.412
.878-approximation
algorithms for MAX CUT and MAX 2SAT
Michel X. Goemans, David P. Williamson
.422
An O(log k) approximation algorithm for the
к
minimum spanning tree problem in the plane
Naveen
Garg, Dorit
S.
Hochbaum .432
Greed is good: approximating independent sets in sparse and bounded-degree graphs
Magnus
Halldórsson, Jaikumar
Radhakrishnan
.439
Session
ТВ:
Chaired by Richard Beigel
Beyond NP-completeness for problems of bounded width: hardness for the
W
hierarchy
Hans L. Bodlaender, Michael R. Fellows, Michael
T. Hallett
.449
Simulating quadratic dynamical Systems is PSPACE-complete
Sanjeev Arora, Yuval
Rąbani,
Umesh Vazirani
.459
Approximation schemes for PSPACE-complete problems for succinct
specifìcation
M.V.
Marathe,
H.B.
Hunt III, R.E. Stearns, V. Radhakrishnan
.468
Pseudorandom generators and learning algorithms for AC0
Meera Seetharam
.478
Session
8
A: Chaired by Greg Frederickson
Improved approximation algorithms for the multi-commodity now problem and local competitive routing
in dynamic networks
Baruch Awerbuch, Tom Leighton
.487
Derandomization through approximation: An NC algorithm for minimum cuts
David R.
Karger,
Rajeev Motwani
.497
On the k-server conjecture
Elias Koutsoupias, Christos
Papadimitriou
.507
An accelerated interior point method whose running time depends only on A
Stephen A. Vavasis, Yinyu Ye
.512
Session 8B: Chaired by Joan
Feigenbaum
How to share a function securely
Alfredo
De
Santis, Yvo Desmedt, Yair
Frankéi,
Moti
Yung
.522
Computational complexity and knowledge complexity
Oded
Goldreich,
Rafail
Ostrovsky,
Erez Petránk
.534
Receipt-free secret-ballot elections
Josh Benaloh, Dwight Tuinstra
.544
A minimal model for secure computation
Uri
Feige,
Joe
Kilián,
Moni
Naor .554
WEDNESDAY, MAY
25, 1994
Session 9A: Chaired by Eric Bach
On construction of k-wise independent random variables
Howard Karloff, Yishay Mansour
.564
Tiny families of functions with random properties: a quality-size trade-off for hashing
Oded
Goldreich,
Avi
Wigderson
.574
Improved algorithms via approximations of probability distributions
Suresh Chari, Pankaj Rohatgi, Aravind Srinivasan
.584
Balanced allocations
Yossi
Azar,
Andrei Z.
Broder,
Anna R.
Karlin,
Eli Upfal
.593
Session
9Đ:
Chaired by Richard
Karp
Lower bounds for parallel linear programming and other problems
Ketan Mulmuley
.603
Decision tree complexity and
Betti
numbers
Andrew C.-C. Yao
.615
Lower bounds for
union-sptit-ßnd
related problems on random access machines
Peter
Bro
Miitersen .
625
Lower bounds on testing membership to a polyhedron by algebraic decision trees
Dima
Grigoriev,
Marek
Karpinski, Nicolai Vorobjov .635
Plenary Session
3:
Chaired by Richard
Karp
The amazing power of pairwise independence
Avi
Wigderson
.645
Session 10A: Chaired by Vijaya Rarnachandran
Random sampling in cut, now, and network design problems
David R.
Karger .648
Augmenting undirected connectivity in 0{n3) time
Andras
A. Benczúr
.658
Session 10B: Chaired by Richard Ladner
Two heads are better than two tapes
Tao Jiang, Joel I.
Seiferas,
Paul M.B.
Vitányi
.668
On the power of finite automata with both nondeterministic and probabilistic states
Anne Condon, Lisa
Hellerstein,
Samuel Pottle,
Avi
Wigderson
.676
Session HA:
Chaired by Roberto Tamassia
Improved data structures for fully dynamic biconnectivity
Monika Rauch .686
Efficient splitting off algorithms for graphs
Harold
N.
Gabow
.696
Alpha-algorithms for incremental planarity testing
Johannes
A. La Poutré
.706
The connectivity carcass of a vertex subset in a graph and its incremental maintenance
Yefim Dinitz,
Alek
Vainshtein
.716
Session 11B: Chaired by Joan
Feigenbaum
On complexity as bounded rationality
Christos
H. Papadimitriou,
Mihalis Yannakakis
.726
Simple strategies for large zero-sum games with applications to complexity theory
Richard J. Lipton, Neal E. Young
.734
Optimality and domination in repeated games with bounded players
Lance Fortnow, Duke Whang
.741
Fast algorithms for
fìnding
randomized strategies in game trees
Daphne
Koller,
Nimrod
Megiddo, Bernhard
von Stengel .750
Session 12A:
Chaired by Amihood Amir
Aligning sequences via an evolutionary tree: complexity and approximation
Tao Jiang, Eugene Lawler, Lusheng Wang
.760
Non-standard stringology: algorithms and complexity
S. Muthukrishnan, Krishna
Palem
.770
A functional equation
oñen
arising in the analysis of algorithms on words
Philippe
Jacquet,
Wojciech Szpankowski
.780
Session 12B: Chaired by Baruch
Schieber
A coding theorem for distributed computation
Sridhar Rajagopalan, Leonard Schulman
.790
Time-adaptive algorithms for synchronization
Rajeev Alur, Hagit Attiya,
Gadi
Taubenfeld .800
A theory of clock synchronization
Boaz Patt-Shamir, Sergio Rajsbaum
.810
Errata: Efficient probabilistic checkable proofs and applications to approximation
M. Bellare, S.
Goldwasser,
С.
Lund,
Α.
Russell .820
Author index
.821 |
| 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 | BV009838716 |
| classification_rvk | SS 1994 |
| classification_tum | DAT 001f |
| ctrlnum | (OCoLC)263542250 (DE-599)BVBBV009838716 |
| 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">BV009838716</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19941012</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">941011s1994 xx d||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0897916638</subfield><subfield code="9">0-89791-663-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)263542250</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009838716</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</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-12</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 001f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Qxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Symposium on Theory of Computing</subfield><subfield code="n">26</subfield><subfield code="d">1994</subfield><subfield code="c">Montréal</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)5112174-8</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing</subfield><subfield code="b">Montréal, Québec, Canada, May 23 - 25, 1994</subfield><subfield code="c">[program committee: Amihood Amir ...]</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">ACM Press</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 822 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="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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">1994</subfield><subfield code="z">Montr'eal</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1994</subfield><subfield code="z">Montréal</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</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">Theoretische Informatik</subfield><subfield code="0">(DE-588)4196735-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Amir, Amihood</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</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=006515243&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-006515243</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1994 Montr'eal gnd-content (DE-588)1071861417 Konferenzschrift 1994 Montréal gnd-content |
| genre_facet | Konferenzschrift 1994 Montr'eal Konferenzschrift 1994 Montréal |
| id | DE-604.BV009838716 |
| illustrated | Illustrated |
| indexdate | 2025-01-10T17:08:38Z |
| institution | BVB |
| institution_GND | (DE-588)5112174-8 (DE-588)1222-1 |
| isbn | 0897916638 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006515243 |
| oclc_num | 263542250 |
| open_access_boolean | |
| owner | DE-20 DE-739 DE-91G DE-BY-TUM DE-12 DE-83 |
| owner_facet | DE-20 DE-739 DE-91G DE-BY-TUM DE-12 DE-83 |
| physical | IX, 822 S. graph. Darst. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| publisher | ACM Press |
| record_format | marc |
| spelling | Symposium on Theory of Computing 26 1994 Montréal Verfasser (DE-588)5112174-8 aut Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 [program committee: Amihood Amir ...] New York, NY ACM Press 1994 IX, 822 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf Informatik (DE-588)4026894-9 gnd rswk-swf (DE-588)1071861417 Konferenzschrift 1994 Montr'eal gnd-content (DE-588)1071861417 Konferenzschrift 1994 Montréal gnd-content Informatik (DE-588)4026894-9 s DE-604 Theoretische Informatik (DE-588)4196735-5 s Amir, Amihood Sonstige oth 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=006515243&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4196735-5 (DE-588)4026894-9 (DE-588)1071861417 |
| title | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 |
| title_auth | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 |
| title_exact_search | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 |
| title_full | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 [program committee: Amihood Amir ...] |
| title_fullStr | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 [program committee: Amihood Amir ...] |
| title_full_unstemmed | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing Montréal, Québec, Canada, May 23 - 25, 1994 [program committee: Amihood Amir ...] |
| title_short | Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing |
| title_sort | proceedings of the twenty sixth annual acm symposium on the theory of computing montreal quebec canada may 23 25 1994 |
| title_sub | Montréal, Québec, Canada, May 23 - 25, 1994 |
| topic | Theoretische Informatik (DE-588)4196735-5 gnd Informatik (DE-588)4026894-9 gnd |
| topic_facet | Theoretische Informatik Informatik Konferenzschrift 1994 Montr'eal Konferenzschrift 1994 Montréal |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006515243&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumontheoryofcomputingmontreal proceedingsofthetwentysixthannualacmsymposiumonthetheoryofcomputingmontrealquebeccanadamay23251994 AT amiramihood proceedingsofthetwentysixthannualacmsymposiumonthetheoryofcomputingmontrealquebeccanadamay23251994 AT associationforcomputingmachinery proceedingsofthetwentysixthannualacmsymposiumonthetheoryofcomputingmontrealquebeccanadamay23251994 |