Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990
Gespeichert in:
| Körperschaft: | |
|---|---|
| Format: | Tagungsbericht Buch |
| Sprache: | Undetermined |
| Veröffentlicht: |
New York, NY
ACM Press
1990
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV004311109 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 910408s1990 |||| 10||| undod | ||
| 020 | |a 0897913612 |9 0-89791-361-2 | ||
| 035 | |a (OCoLC)260221906 | ||
| 035 | |a (DE-599)BVBBV004311109 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | |a und | ||
| 049 | |a DE-12 |a DE-739 |a DE-20 |a DE-91G | ||
| 084 | |a SS 1990 |0 (DE-625)143427: |2 rvk | ||
| 111 | 2 | |a Symposium on Theory of Computing |n 22 |d 1990 |c Baltimore, Md. |j Verfasser |0 (DE-588)1220648-9 |4 aut | |
| 245 | 1 | 0 | |a Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing |b Baltimore, Md., May 14 - 16, 1990 |
| 264 | 1 | |a New York, NY |b ACM Press |c 1990 | |
| 300 | |a VIII, 574 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |y 1990 |z Baltimore Md. |2 gnd-content | |
| 689 | 0 | 0 | |a Informatik |0 (DE-588)4026894-9 |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=002680708&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002680708 | ||
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102/DAT 500f 2001 B 503-1990 |
|---|---|
| DE-BY-TUM_katkey | 1005731 |
| DE-BY-TUM_local_keycode | ko |
| DE-BY-TUM_media_number | 040020316374 |
| _version_ | 1816711860991295488 |
| adam_text | TWENTY-SECOND ANNUAL ACM SYMPOSIUM ON
THEORY OF COMPUTING
BALTIMORE, MARYLAND
May
14 - 16, 1990
TABLE OF CONTENTS
Monday Morning, May
14, 1990
SESSION
1
Chaired by Ian Munro
BLASTING Through the Information Theoretic Barrier with FUSION TREES
M. L.
Fredman
and D. E. Willard
.........................................................1
On the Dynamic Finger Conjecture for Splay Trees
R. Cole
...................................................................................8
Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences
R. Sundar and R. E.
Tarjan
.............................................................18
The Information Theory Bound is Tight for Selection in a Heap
G.
N.
Frederickson
.......................................................................26
Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines
J. A. La
Poutré
..........................................................................34
SESSION
2
Chaired by Manfred Warmuth
Optimal Randomized Algorithms for Local Sorting and Set-maxima
W. Goddard, V. King and L. Schulman
..................................................45
On the Necessity of Occam Algorithms
R. Board and L. Pitt
.....................................................................54
Learning Boolean Functions in an Infinite Attribute Space
A
.
Blum
.................................................................................64
Self-Testing/Correcting with Applications to Numerical Problems
M. Blum,
M. Luby,
and R.
Rubinfeld.....................................................73
Coherent Functions and Program Checkers
A. C.-C. Yao
............................................................................84
Monday Afternoon, May
14, 1990
SESSION
3
Chaired by Baruch Awerbuch
The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks
S. Even and S. Rajsbaum
................................................................95
The Wakeup Problem
M. J. Fischer, S.
Moran,
S.
Rudich and G.
Taubenfeld..................................106
How to Distribute a Dictionary in a Complete Network
M. Dietzfelbinger and F. Meyer
auf der Heide...........................................117
Computing
with Unreliable Information
U.
Feige,
D. Peleg,
P. Raghavan
and
E. Upfal
...........................................128
Efficient Robust Parallel Computations
Z. M. Kedem, K.
V. Palem
and P. G. Spimkis
..........................................138
SESSION
4
Chaired by John
Reif
On-line Algorithms for Path Selection in a Nonblocking Network
5.
Arora, T. Leighton and B. Maggs
....................................................149
Optimal Disk I/O with Parallel Block Transfer
J. S.
Vitter
and E. A. M. Shriver
.......................................................159
Deterministic Sampling
-
A New Technique for Fast Pattern Matching
U. Vishkin
..............................................................................170
Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms
for Planar Digraphs
M.-Y.
Kao
and P.
N.
Klein
.............................................................181
Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers
R. Cypher and
C. G.
Plaxton
...........................................................193
Tuesday Morning, May
15, 1990
SESSION
5
Chaired by Dexter
Kozen
Pseudorandum Generators for Space-Bounded Computation
N.
Nisan
...............................................................................204
Small-bias Probability Spaces: Efficient Constructions and Applications
J. Naor and M. Naor
...................................................................213
The Analysis of Closed Hashing under Limited Randomness
J. P. Schmidt and A.
Siegel............................................................ .224
The Computational Complexity of Universal Hashing
Y. Mansour,
N.
Nisan and P. Tiwari
...................................................235
Not All Keys Can be Hashed in Constant Time
J. Gil, F. Meyer
auf der Heide
and A. Wigderson
.......................................244
SESSION
β
Chaired by
Janos
Simon
A Technique for Lower Bounding the Cover Time
D. Zuckerman
..........................................................................254
Approximate Inclusion-Exclusion
TV.
Liniai
and
N.
Nisan
.................................................................260
Towards Optimal Simulations of Formulas by Bounded-Width Programs
R. Cieve
................................................................................271
Functions with Bounded Symmetric Communication Complexity and Circuits with Mod
m
Gates
M. Szegedy
.............................................................................278
Monotone Circuits for Matching Require Linear Depth
R. Raz
and A. Wigderson
...............................................................287
Tuesday Afternoon, May
15, 1990
SESSION
7
Chaired by Bernard Chazelle
A Separator Theorem for Graphs with an Excluded Minor and its Applications
N.
Alon, P. Seymour and R. Thomas
...................................................293
Separators in Two and Three Dimensions
G. L. Miller and W. Thurston
..........................................................300
Leighton-Rao Might be Practical: Faster Approximation Algorithms for Concurrent Flow
with Uniform Capacities
P. Klein,
С
Stein and
É.
Tardos
.......................................................310
Output Sensitive Construction of Levels and Voronoi Diagrams in Rd of Order
1
to
к
К.
Mulmuley
...........................................................................322
Solving Query-Retrieval Problems by Compacting Voronoi Diagrams
A. Aggarwal, M.
Hansen
and T. Leighton
...............................................331
Quantitative Steinitz s Theorems with Applications to Multifingered Grasping
D. G. Kirkpatrick, B. Mishra and
С. К.
Yap
............................................341
SESSION
8
Chaired by Harold Gabow
An Optimal Algorithm for On-line Bipartite Matching
R. M.
Karp, U.
V. Vazirani and V. V. Vazirani
.........................................352
Online Algorithms for Locating Checkpoints
M. Bern, D. H. Greene, A. Raghunathan and M. Sudan
.................................359
Random Walks on Weighted Graphs, and Applications to On-line Algorithms
D. Coppersmith, P. Doyle, P. Raghavan and M. Snir
....................................369
On the Power of Randomization in Online Algorithms
5.
Ben-David, A. Borodin, R.
Karp,
G.
Tardos
and A. Wigderson
.......................379
Wednesday Morning, May
16, 1990
SESSION
9
Chaired by Oded
Goldreich
One-Way Functions are Necessary and Sufficient for Secure Signatures
J.
Rompei
..............................................................................387
Pseudo-Random Generators under Uniform Assumptions
J.
Hastad
...............................................................................395
The Discrete Log is Very Discreet
A. W.
Schrift
and A. Shamir
...........................................................405
Witness Indistinguishable and Witness Hiding Protocols
U.
Feige
and A. Shamir
.................................................................416
Public-key Cryptosystems
Provably
Secure against Chosen Ciphertext Attacks
M. Naor and M. Yung
..................................................................427
SESSION
10
Chaired by Ronald Fagin
On the Complexity of Local Search
С
H.
Papadimitńou,
A. A. Schäffer
and M. Yannakakis
................................438
Quantifiers and Approximation
A. Panconesi and D. Ranjan
............................................................446
On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
M. Ogiwara and O. Watanabe
..........................................................457
The Undecidability of the Semi-unification Problem
A. J. Kfoury, J. Tiuryn and P. Urzyczyn
...............................................468
Decidability of the Multiplicity Equivalence of Multitape Finite Automata
T. Harju and J.
Karhumăki
.............................................................477
Wednesday Afternoon, May
16, 1990
SESSION
11
Chaired by Oded
Goldreich
Perfect Zero-Knowledge in Constant Rounds
M. Bellare, S.
Micali
and R.
Ostrovsky
..................................................482
The (True) Complexity of Statistical Zero Knowledge
M. Bellare, S.
Micali
and R.
Ostrovsky
..................................................494
The Round Complexity of Secure Protocols
D. Beaver, S.
Micali
and P. Rogaway
...................................................503
Efficient Computation on Oblivious RAMs
R.
Ostrovsky
............................................................................514
SESSION
12
Chaired by Fan Chung
Computing in Quotient Groups
W. M.
Kantor
and
E. M. Lub
..........................................................524
On the Decidability of Sparse Univariate Polynomial Interpolation
A. Borodin and P. Tiwari
..............................................................535
Searching for Primitive Roots in Finite Fields
V. Shoup
...............................................................................546
On the Complexity of Computing
a Gröbner
Basis for the Radical of a Zero Dimensional Ideal
Y.
N.
Lakshman
........................................................................555
The Number Field Sieve
A. K. Lenstra,
П.
W. Lenstra, Jr., M. S. Manasse and J. M. Pollard
....................564
AUTHOR INDEX
........................................................................573
|
| any_adam_object | 1 |
| author_corporate | Symposium on Theory of Computing Baltimore, Md |
| author_corporate_role | aut |
| author_facet | Symposium on Theory of Computing Baltimore, Md |
| author_sort | Symposium on Theory of Computing Baltimore, Md |
| building | Verbundindex |
| bvnumber | BV004311109 |
| classification_rvk | SS 1990 |
| ctrlnum | (OCoLC)260221906 (DE-599)BVBBV004311109 |
| discipline | Informatik |
| format | Conference Proceeding Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01440nam a2200337 c 4500</leader><controlfield tag="001">BV004311109</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910408s1990 |||| 10||| undod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0897913612</subfield><subfield code="9">0-89791-361-2</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)260221906</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004311109</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=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SS 1990</subfield><subfield code="0">(DE-625)143427:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="111" ind1="2" ind2=" "><subfield code="a">Symposium on Theory of Computing</subfield><subfield code="n">22</subfield><subfield code="d">1990</subfield><subfield code="c">Baltimore, Md.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)1220648-9</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing</subfield><subfield code="b">Baltimore, Md., May 14 - 16, 1990</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">ACM Press</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VIII, 574 S.</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">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">1990</subfield><subfield code="z">Baltimore Md.</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="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=002680708&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002680708</subfield></datafield></record></collection> |
| genre | (DE-588)1071861417 Konferenzschrift 1990 Baltimore Md. gnd-content |
| genre_facet | Konferenzschrift 1990 Baltimore Md. |
| id | DE-604.BV004311109 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-25T17:16:24Z |
| institution | BVB |
| institution_GND | (DE-588)1220648-9 (DE-588)1222-1 |
| isbn | 0897913612 |
| language | Undetermined |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002680708 |
| oclc_num | 260221906 |
| open_access_boolean | |
| owner | DE-12 DE-739 DE-20 DE-91G DE-BY-TUM |
| owner_facet | DE-12 DE-739 DE-20 DE-91G DE-BY-TUM |
| physical | VIII, 574 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| publisher | ACM Press |
| record_format | marc |
| spellingShingle | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990 Informatik (DE-588)4026894-9 gnd |
| subject_GND | (DE-588)4026894-9 (DE-588)1071861417 |
| title | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990 |
| title_auth | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990 |
| title_exact_search | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990 |
| title_full | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990 |
| title_fullStr | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990 |
| title_full_unstemmed | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing Baltimore, Md., May 14 - 16, 1990 |
| title_short | Proceedings of the Twenty Second Annual ACM Symposium on Theory of Computing |
| title_sort | proceedings of the twenty second annual acm symposium on theory of computing baltimore md may 14 16 1990 |
| title_sub | Baltimore, Md., May 14 - 16, 1990 |
| topic | Informatik (DE-588)4026894-9 gnd |
| topic_facet | Informatik Konferenzschrift 1990 Baltimore Md. |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=002680708&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT symposiumontheoryofcomputingbaltimoremd proceedingsofthetwentysecondannualacmsymposiumontheoryofcomputingbaltimoremdmay14161990 AT associationforcomputingmachinery proceedingsofthetwentysecondannualacmsymposiumontheoryofcomputingbaltimoremdmay14161990 |