Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: Symposium on Theory of Computing San Diego, Calif (VerfasserIn)
Format: Tagungsbericht Buch
Sprache:English
Veröffentlicht: New York, NY ACM Press 1993
Schlagworte:
Online-Zugang:Inhaltsverzeichnis
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000 c 4500
001 BV008042921
003 DE-604
005 19940113
007 t|
008 930719s1993 xx d||| |||| 10||| engod
020 |a 0897915917  |9 0-89791-591-7 
035 |a (OCoLC)263271756 
035 |a (DE-599)BVBBV008042921 
040 |a DE-604  |b ger  |e rakddb 
041 0 |a eng 
049 |a DE-91G  |a DE-739  |a DE-20  |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 25  |d 1993  |c San Diego, Calif.  |j Verfasser  |0 (DE-588)3017226-3  |4 aut 
245 1 0 |a Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing  |b San Diego, California May 16 - 18, 1993 
264 1 |a New York, NY  |b ACM Press  |c 1993 
300 |a IX, 812 S.  |b graph. Darst. 
336 |b txt  |2 rdacontent 
337 |b n  |2 rdamedia 
338 |b nc  |2 rdacarrier 
500 |a Literaturangaben 
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 1993  |z San Diego Calif.  |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 
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=005291821&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA  |3 Inhaltsverzeichnis 
943 1 |a oai:aleph.bib-bvb.de:BVB01-005291821 

Datensatz im Suchindex

_version_ 1822408350276517888
adam_text TWENTY-FIFTH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING SAN DIEGO, CALIFORNIA May 16-18, 1993 TABLE OF CONTENTS Sunday, May 16, 1993 SESSION SIA: Chaired by Pravili Vaidya Some Complexity Issues on the Simply Connected Regions of the Two-Dimensional Plane A. Chou, К. Ко .1 Quantum Complexity Theory E. Bernstein, U. Varirani .11 Thermodynamics of Computation and Information Distance С H. Bennett, P. Gács, M. Li, P. Vitányi, W. Żurek .21 SESSION SIB: Chaired by David Peleg Fully Polynomial Byzantine Agreement in r-l- / Rounds ./. Garay, Y. Moses .31 Fast Asynchronous Byzantine Agreement with Optimal Resilience R. Canetti, ľ. Rabin .42 Asynchronous Secure Computation M. Ben-Or, R. Canetti, О. Goldreich.52 SESSION Ѕ2Л: Chaired by Pravin Vaidya к One-Way Heads Cannot Do String-Matching T.Jiang, M.Li .62 A Theory of Parameterized Pattern Matching: Algorithms and Applications B. Baker .71 Multiple Matching of Rectangular Patterns R. Idury, A. Schäffer.81 SESSION S2B: Chaired by David Peleg Generalized FLP Impossibility Result for ŕ-Resilient Asynchronous Computations E. Borowsky, E. Gafni .91 Wait-Free k-set Agreement is Impossible: 'The 'Topology of Public Knowledge M. Saks, F. Zaharoglou .101 The Asynchronous Computability Theorem for ¿-Resilient Tasks M. Herlihy, N. Shavit . Ill SESSION ЅЗЛ: (haired by Michael Goodrich Linear Programming Without the Matrix C. Papadimitriou, /I/. Yannakakis .121 Comparison-Based Search in the Presence of Errors R. Borgstrom, S. Kosaraju .130 Л Robust Model for Finding Optimal Evolutionary Trees M. Tarach, S. Kannan, T. Warnow .137 Maximum ¿-Chains in Planar Point Sets: Combinatorial Structure and Algorithms S.Felsne^L. Wernisch . 146 SESSION S3B: Chaired by Anna Karlin Lower Bounds for Randomized Mutual Exclusion E. Kushilevitz, У. Mansour, M. Rabin, D. Zuckerman .154 Competitive Distributed File Allocation B. Awerbuch, Y. Bartal, A. Fiat .164 Contention in Shared Memory Algorithms C. Dwork, M. Herlihy, O. Waarts .174 What Can be Computed Locally? M. Naor, L. Stockmeyer .184 SESSION S4A: Chaired by Michael Goodrich Reinventing the Wheel: An Optimal Data Structure for Connectivity Queries R. Cohen, G. DiBattista, A. Kanevsky, R. Tamassia .194 Locality Based Graph Coloring M. Szegedy, S. Vishwanathan .201 Separator Based Sparsification for Dynamic Planar Graph Algorithms D. Eppstein, Z. Galií, G. Italiano, 7. Spencer .208 Polynomial Space Polynomial Delay Algorithms for Listing Families of Graphs L. Goldberg .218 A Linear Time Algorithm for Finding Tree-Decompositions of Small Treewidth H. Bodlaender .226 SESSION S4B: Chaired by Andrew C.-C. Yao More Deterministic Simulation in Logspace N. ¡Visan, D. Zuckerman .235 Expanders that Beat the Eigenvalue Bound: Explicit Construction and Applications A. Wigderson, D. Zuckerman .245 The Biased Coin Problem R. Boppana, B. Narayanan .252 Efficient Construction of a Small Hitting Set for Combinatorial Rectangles in High Dimension N. Liniai, M. Luby, M. Saks, D. Zuckerman .258 Constructing Small Sample Spaces Satisfying Given Constraints D. Koller, N.Megiddo.268 Monday, May 17, 1993 PLENARY SESSION. Chaired by David Johnson Mapping the Genone: Some Combinatorial Problems Arising in Molecular Biology R.M. Karp .278 SESSION S5A: Chaired by Richard Beigel On the Hardness of Approximating Minimization Problems C. Lund, M. Yannakakis .286 Efficient Probabilistically Checkable Proofs and Applications to Approximation M. Bellare, S. Goldwasser, С. Lund, Α. Russell.294 Probabilistically Checkable Debate Systems and Approximation Algorithms for PSPACE-IIard Functions A. Condon, J. Feigenbaum, С, Lund, P. Shoř .305 SESSION S5B: Chaired by Avrim Blum Efficient learning of Typical Finite Automata from Random Walks Y. Freund, M. Kearns, D. Ron, R. Rubinfeld, R. Schapire, L. Sellie .315 Finiteness Results for Sigmoidal "Neural" Networks A. Macintyre, E. Sontag . 325 Hounds for the Computational Power and I-earning Complexity of Analog Neural Sets W.Maass .335 SESSION Ѕ6Л: Chaired by Michael Paterson Proportionate Progress: Λ Notion of Fairness in Resource Allocation S. Baruah, N. Cohen, G. Plaxton, D. Varvel .345 Self-Routing Superconcentrators N. Pippenger .355 Space-Efficient Scheduling of Multithreaded Computations R. Blunwfe, C. Leiserson .362 SESSION ЅбВ: Chaired by Avrim Blum Cryptographic Hardness of Distribution-Specific Learning M.Kharitonov .372 How to Use Expert Advice N. Cesa-Bianchi, Y. Freund, D. Haussler, D. Hclmbold, R. Schapire, M. Warmuth .382 Efficient Noise-Tolerant Learning from Statistical Queries M.Kearns .392 SESSION S7A: Chaired by Chce Yap Online Load Balancing and Network Flow S.Phillips, .1. Westbrook .402 Markov Chains, Computer Proofs, and Average-Case Analysis of Best Fit Bin Packing E. Cqffman, D. Johnson, P. Shor, R. Weber .412 On-Line Algorithms for Cache Sharing M. Bern, D. Greene, A. Raghunathan .422 Angles of Planar Triangular Graphs G. Di Battista, L. Vismara .431 SESSION S7B: Chaired by Joe Kilián Many Birds with One Stone: Multi-Objective Approximation Algorithms R. Ravi, M. Marathe, S. Ravi, D. Rosenkrantz, H. Hunt .438 A Parallel Approximation Algorithm for Positive Linear Programming M. Luby, N. Nisan .448 Randomness-Optimal Unique Element Isolation, with Applications to Perfect Matching and Related Problems 5. Chari, P. Rohatgi, A. Srinivasan .458 Decision Trees: Old and New Results R. Fleischer .468 SESSION Ѕ8Л: Chaired by ЛІок Aggarwal A Deterministic Algorithm for the Three-Dimensional Diameter Problem J. Matoušek, O. Schwarzkopf. .478 Matrix Searching with the Shortest Path Metric /. Hershberger, S. Suri .485 Improved Bounds on Weak Е -Nets for Convex Sets B. Chazelle, H. Edclsbrunncr, M. Grigni, L . Guibas, M. Sharir, E. Welzl.495 Pieccwise Linear Paths Among Convex Obstacles M. de Berg, J. Matoušek, O. Schwarzkopf .505 SESSION S8B: Chaired by Andrew C.-C. Yao Depth Reduction for Noncommutative Arithmetic Circuits E. Attender, J. Jiao .515 Modified Ranks of Tensors and the Size of Circuits P.Pudlak, V.Rbdl .523 Characterizing Non-Pcterministic Circuii Size M. Karchmer, A. W'gdcrsofl .532 Size-Depth Trade-Offs far Threshold Circuits R. Impagliazzo, R. Paturi, M· saks . 541 Simulating Threshold Circuits by Majority Circuits M. Goldmann, M. Karpinski. Tuesday, May 18, 1993 SESSION Ѕ9Л: Chair«! by ivficliael Paterson Multi-Scale Self-Stimulation; Д Technique for Reconfiguring Arrays with Faults R. Cole, B. M aggs, R- Sitarían .561 How Much Can Hardware Help Routing? A. Borodin, P. Raghavan, Ћ- Schieber, E. Upfal .573 Routing Permutations on Graphs via Matchings N. Alon, F. Chung, R. Graham .583 SESSION S9B: Chaired by paris Kannelakis Parametric Real-Time Reasoni^e R. Alm, T. Henzinger, м fardi .592 Constant Time Factors Do Matter N.Jones .602 Monotone Monadic SNI' and Constraint Satisfaction ľ. Feder, M. Varai .612 SESSION S ЮЛ: Chaired by ŕ»an«leep On-Line I,oad Balancing with Applications to Machine Scheduling and Virtual Circuit Routing J. Aspnes, V. Azar, A. natt 5. Plotkin, O. Waarts .623 Approximate Load Balancing о'1 Dynamic and Asynchronous Networks W. Aiello, B. A verbuch, β. M«gg.s, 5. Rao .632 Optimal Online Scheduling of parallel Jobs with Dependencies A. Feldmann, M. Kao, j ggflll, S. Ţeng .642 SESSION S I OB: Chaired by pavid Pelcg Time Optimal Self-Stabilizing Synchronization B. Averbuch, S. Kutten, γ, ¡\íansOUr, Β. Patt-Shamir, G. Varghese .652 Fast Perfect-information Leader-Election Protocol with Linear Immunity J. Cooper, N. Untiti .662 Cryptographic Defense Against Traffic Analysis C.Rackoff, D.Simon .672 SESSION SUA: Chaired by f. Тощ Leigh ton Excluded Minors, Network Decomposition, and Multicommodity Flow P. Klein, S. Plotkin, S. Hao. .682 Improved Bounds on the I\4ax4;low Min-Cut Ratio for Multicommodity Flows S. Plotkin, 11. Tardos. .691 Approximate Max-Flow Min-(Multi) Cut Theorems and Their Applications N. Garg, V. Vazirant, M. γα /tnakakis . 698 Л Primal-Dual Approximatif Aigorithjri for Generalized Steiner Network Problems D. Williamson, M. Сгоещат> M- Mihail, V. Vazirani .708 SESSION SMB: Chaired by ¡Martin Tompa Time-Space Trade-Offs for Undirected 57 -Connectivity on a JAG J. Edmonds .718 Short Random Walks on Graphs G. Barnes, U. Feige.728 Matchings in lattice Graphs C. Kenyon, D. Randall, A. Sinclair .738 Deterministic Coding for Interactive Communication L. Schulman .747 SESSION SI2A: Chaired by F. Tom An Õ(n2)A]gorithm for Minimum Cuts D. Karger, C.Stein.757 Finding Minimum-Quotient Cuts in Planar Graphs J.Park, C. Phillips .766 The Network Inhibition Problem C.Phillips .776 SESSION S12B: Chaired by Joe Kilián Checking Approximate Computations Over the Reals S. Ar, M. Blum, P. Gemmell, В. Codenotti .786 On the Generation of Multivariate Polynomials which are I lard to Factor A.Shamir .796 Counting Curves and Their Projections J. von zur Gathen, M. Karpinski, I. Shparlinski .805
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 BV008042921
classification_rvk SS 1993
classification_tum DAT 001f
ctrlnum (OCoLC)263271756
(DE-599)BVBBV008042921
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">BV008042921</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940113</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">930719s1993 xx d||| |||| 10||| engod</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0897915917</subfield><subfield code="9">0-89791-591-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)263271756</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008042921</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-91G</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</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">25</subfield><subfield code="d">1993</subfield><subfield code="c">San Diego, Calif.</subfield><subfield code="j">Verfasser</subfield><subfield code="0">(DE-588)3017226-3</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing</subfield><subfield code="b">San Diego, California May 16 - 18, 1993</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">ACM Press</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">IX, 812 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="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</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">1993</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">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="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&amp;doc_library=BVB01&amp;local_base=BVB01&amp;doc_number=005291821&amp;sequence=000002&amp;line_number=0001&amp;func_code=DB_RECORDS&amp;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-005291821</subfield></datafield></record></collection>
genre (DE-588)1071861417 Konferenzschrift 1993 San Diego Calif. gnd-content
genre_facet Konferenzschrift 1993 San Diego Calif.
id DE-604.BV008042921
illustrated Illustrated
indexdate 2025-01-27T13:20:37Z
institution BVB
institution_GND (DE-588)3017226-3
isbn 0897915917
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-005291821
oclc_num 263271756
open_access_boolean
owner DE-91G
DE-BY-TUM
DE-739
DE-20
DE-12
DE-83
owner_facet DE-91G
DE-BY-TUM
DE-739
DE-20
DE-12
DE-83
physical IX, 812 S. graph. Darst.
publishDate 1993
publishDateSearch 1993
publishDateSort 1993
publisher ACM Press
record_format marc
spelling Symposium on Theory of Computing 25 1993 San Diego, Calif. Verfasser (DE-588)3017226-3 aut
Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
New York, NY ACM Press 1993
IX, 812 S. graph. Darst.
txt rdacontent
n rdamedia
nc rdacarrier
Literaturangaben
Theoretische Informatik (DE-588)4196735-5 gnd rswk-swf
Informatik (DE-588)4026894-9 gnd rswk-swf
(DE-588)1071861417 Konferenzschrift 1993 San Diego Calif. gnd-content
Informatik (DE-588)4026894-9 s
DE-604
Theoretische Informatik (DE-588)4196735-5 s
Digitalisierung TU Muenchen application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005291821&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
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-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
title_auth Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
title_exact_search Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
title_full Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
title_fullStr Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
title_full_unstemmed Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing San Diego, California May 16 - 18, 1993
title_short Proceedings of the twenty-fifth annual ACM Symposium on the Theory of Computing
title_sort proceedings of the twenty fifth annual acm symposium on the theory of computing san diego california may 16 18 1993
title_sub San Diego, California May 16 - 18, 1993
topic Theoretische Informatik (DE-588)4196735-5 gnd
Informatik (DE-588)4026894-9 gnd
topic_facet Theoretische Informatik
Informatik
Konferenzschrift 1993 San Diego Calif.
url http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=005291821&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv AT symposiumontheoryofcomputingsandiegocalif proceedingsofthetwentyfifthannualacmsymposiumonthetheoryofcomputingsandiegocaliforniamay16181993