stoc84.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1984</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head> <body> <table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td> <td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table> <h1>16. <a href="index.html">STOC</a> 1984</h1> Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1984, Washington, DC, USA. ACM 1984 <ul> <li><a name="HartS84" href="../../indices/a-tree/h/Hart:Sergiu.html">Sergiu Hart</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>: Probabilistic Temporal Logics for Finite and Bounded Models. 1-13 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HartS84">BibTeX</a></font> <li><a name="EmersonS84" href="../../indices/a-tree/e/Emerson:E=_Allen.html">E. Allen Emerson</a>, <a href="../../indices/a-tree/s/Sistla:A=_Prasad.html">A. Prasad Sistla</a>: Deciding Branching Time Logic. 14-24 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EmersonS84">BibTeX</a></font> <li><a name="Hennessy84" href="../../indices/a-tree/h/Hennessy:Matthew.html">Matthew Hennessy</a>: Modelling Fair Processes. 25-30 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hennessy84">BibTeX</a></font> <li><a name="DeganoM84" href="../../indices/a-tree/d/Degano:Pierpaolo.html">Pierpaolo Degano</a>, <a href="../../indices/a-tree/m/Montanari:Ugo.html">Ugo Montanari</a>: Liveness Properties as Convergence in Metric Spaces. 31-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DeganoM84">BibTeX</a></font> <li><a name="Gerth84" href="../../indices/a-tree/g/Gerth:Rob.html">Rob Gerth</a>: Transition Logic: How to Reason About Temporal Properties in a Compositional Way. 39-50 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Gerth84">BibTeX</a></font> <li><a name="BarringerKP84" href="../../indices/a-tree/b/Barringer:Howard.html">Howard Barringer</a>, <a href="../../indices/a-tree/k/Kuiper:Ruurd.html">Ruurd Kuiper</a>, <a href="../../indices/a-tree/p/Pnueli:Amir.html">Amir Pnueli</a>: Now You May Compose Temporal Logic Specifications. 51-63 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BarringerKP84">BibTeX</a></font> <li><a name="BilardiP84" href="../../indices/a-tree/b/Bilardi:Gianfranco.html">Gianfranco Bilardi</a>, <a href="../../indices/a-tree/p/Preparata:Franco_P=.html">Franco P. Preparata</a>: A Minimum Area VLSI Network for O(log n) Time Sorting. 64-70 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BilardiP84">BibTeX</a></font> <li><a name="Leighton84" href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>: Tight Bounds on the Complexity of Parallel Sorting. 71-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Leighton84">BibTeX</a></font> <li><a name="DurisGS84" href="../../indices/a-tree/d/Duris:Pavol.html">Pavol Duris</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/s/Schnitger:Georg.html">Georg Schnitger</a>: Lower Bounds on Communication Complexity. 81-91 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DurisGS84">BibTeX</a></font> <li><a name="Blum84" href="../../indices/a-tree/b/Blum:Norbert.html">Norbert Blum</a>: An Area-Maximum Edge Length Tradeoff for VLSI Layout. 92-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Blum84">BibTeX</a></font> <li><a name="BussS84" href="../../indices/a-tree/b/Buss:Jonathan_F=.html">Jonathan F. Buss</a>, <a href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>: On the Pagenumber of Planar Graphs. 98-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BussS84">BibTeX</a></font> <li><a name="Mirzaian84" href="../../indices/a-tree/m/Mirzaian:Andranik.html">Andranik Mirzaian</a>: Channel Routing in VLSI (Extended Abstract). 101-107 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Mirzaian84">BibTeX</a></font> <li><a name="Post84" href="../../indices/a-tree/p/Post:Mark_J=.html">Mark J. Post</a>: Minimum Spanning Ellipsoids. 108-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Post84">BibTeX</a></font> <li><a name="KimA84" href="../../indices/a-tree/k/Kim:Chul_E=.html">Chul E. Kim</a>, <a href="../../indices/a-tree/a/Anderson:Timothy_A=.html">Timothy A. Anderson</a>: Digital Disks and a Digital Compactness Measure. 117-124 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KimA84">BibTeX</a></font> <li><a name="Chazelle84" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>: Intersecting Is Easier than Sorting. 125-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Chazelle84">BibTeX</a></font> <li><a name="GabowBT84" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>, <a href="../../indices/a-tree/b/Bentley:Jon_Louis.html">Jon Louis Bentley</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Scaling and Related Techniques for Geometry Problems. 135-143 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GabowBT84">BibTeX</a></font> <li><a name="SharirS84" href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>, <a href="../../indices/a-tree/s/Schorr:Amir.html">Amir Schorr</a>: On Shortest Paths in Polyhedral Spaces. 144-153 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SharirS84">BibTeX</a></font> <li><a name="ColeSY84" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: On k-hulls and Related Problems. 154-166 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ColeSY84">BibTeX</a></font> <li><a name="FranzblauK84" href="../../indices/a-tree/f/Franzblau:Deborah_S=.html">Deborah S. Franzblau</a>, <a href="../../indices/a-tree/k/Kleitman:Daniel_J=.html">Daniel J. Kleitman</a>: An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals. 167-174 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FranzblauK84">BibTeX</a></font> <li><a name="Huang84" href="../../indices/a-tree/h/Huang:Ming=Deh_A=.html">Ming-Deh A. Huang</a>: Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields. 175-182 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Huang84">BibTeX</a></font> <li><a name="BachMS84" href="../../indices/a-tree/b/Bach:Eric.html">Eric Bach</a>, <a href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/s/Shallit:Jeffrey.html">Jeffrey Shallit</a>: Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract). 183-190 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BachMS84">BibTeX</a></font> <li><a name="KannanLL84" href="../../indices/a-tree/k/Kannan:Ravindran.html">Ravindran Kannan</a>, <a href="../../indices/a-tree/l/Lenstra:Arjen_K=.html">Arjen K. Lenstra</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>: Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers. 191-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KannanLL84">BibTeX</a></font> <li><a name="Coppersmith84" href="../../indices/a-tree/c/Coppersmith:Don.html">Don Coppersmith</a>: Evaluating Logarithms in GF(2^n). 201-207 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Coppersmith84">BibTeX</a></font> <li><a name="OngSS84" href="../../indices/a-tree/o/Ong:H=.html">H. Ong</a>, <a href="../../indices/a-tree/s/Schnorr:Claus=Peter.html">Claus-Peter Schnorr</a>, <a href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>: An Efficient Signature Scheme Based on Quadratic Equations. 208-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/OngSS84">BibTeX</a></font> <li><a name="OrlitskyE84" href="../../indices/a-tree/o/Orlitsky:Alon.html">Alon Orlitsky</a>, <a href="../../indices/a-tree/g/Gamal:Abbas_El.html">Abbas El Gamal</a>: Communication with Secrecy Constraints. 217-224 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/OrlitskyE84">BibTeX</a></font> <li><a name="DolevMMU84" href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/m/Maier:David.html">David Maier</a>, <a href="../../indices/a-tree/m/Mairson:Harry_G=.html">Harry G. Mairson</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Correcting Faults in Write-Once Memory. 225-229 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DolevMMU84">BibTeX</a></font> <li><a name="Vishkin84" href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Randomized Speed-Ups in Parallel Computation. 230-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vishkin84">BibTeX</a></font> <li><a name="Galil84" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: Optimal Parallel Algorithms for String Matching. 240-248 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Galil84">BibTeX</a></font> <li><a name="AwerbuchIS84" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/i/Israeli:Amos.html">Amos Israeli</a>, <a href="../../indices/a-tree/s/Shiloach:Yossi.html">Yossi Shiloach</a>: Finding Euler Circuits in Logarithmic Parallel Time. 249-257 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AwerbuchIS84">BibTeX</a></font> <li><a name="Upfal84" href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: A Probabilistic Relation between Desirable and Feasible Models of Parallel Computation (A Preliminary Version). 258-265 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Upfal84">BibTeX</a></font> <li><a name="KarpW84" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: A Fast Parallel Algorithm for the Maximal Independent Set Problem. 266-272 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpW84">BibTeX</a></font> <li><a name="Manber84" href="../../indices/a-tree/m/Manber:Udi.html">Udi Manber</a>: On Maintaining Dynamic Information in a Concurrent Environment (Preliminary Version). 273-278 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Manber84">BibTeX</a></font> <li><a name="BentleyJLMM84" href="../../indices/a-tree/b/Bentley:Jon_Louis.html">Jon Louis Bentley</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/McGeoch:Catherine_C=.html">Catherine C. McGeoch</a>, <a href="../../indices/a-tree/m/McGeoch:Lyle_A=.html">Lyle A. McGeoch</a>: Some Unexpected Expected Behavior Results for Bin Packing. 279-288 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BentleyJLMM84">BibTeX</a></font> <li><a name="KarpLM84" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/m/Marchetti=Spaccamela:Alberto.html">Alberto Marchetti-Spaccamela</a>: A Probabilistic Analysis of Multidimensional Bin Packing Problems. 289-298 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpLM84">BibTeX</a></font> <li><a name="KahnS84" href="../../indices/a-tree/k/Kahn:Jeff.html">Jeff Kahn</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: Every Poset Has a Good Comparison. 299-301 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KahnS84">BibTeX</a></font> <li><a name="Karmarkar84" href="../../indices/a-tree/k/Karmarkar:Narendra.html">Narendra Karmarkar</a>: A New Polynomial-Time Algorithm for Linear Programming. 302-311 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Karmarkar84">BibTeX</a></font> <li><a name="AdlerM84" href="../../indices/a-tree/a/Adler:Ilan.html">Ilan Adler</a>, <a href="../../indices/a-tree/m/Megiddo:Nimrod.html">Nimrod Megiddo</a>: A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension. 312-323 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AdlerM84">BibTeX</a></font> <li><a name="HochbaumS84" href="../../indices/a-tree/h/Hochbaum:Dorit_S=.html">Dorit S. Hochbaum</a>, <a href="../../indices/a-tree/s/Shmoys:David_B=.html">David B. Shmoys</a>: Powers of Graphs: A Powerful Approximation Technique for Bottleneck Problems. 324-333 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HochbaumS84">BibTeX</a></font> <li><a name="Gonnet84" href="../../indices/a-tree/g/Gonnet:Gaston_H=.html">Gaston H. Gonnet</a>: Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract). 334-341 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Gonnet84">BibTeX</a></font> <li><a name="Clarkson84" href="../../indices/a-tree/c/Clarkson:Kenneth_L=.html">Kenneth L. Clarkson</a>: Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract). 342-348 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Clarkson84">BibTeX</a></font> <li><a name="BlumerBEHM84" href="../../indices/a-tree/b/Blumer:Anselm.html">Anselm Blumer</a>, <a href="../../indices/a-tree/b/Blumer:J=.html">J. Blumer</a>, <a href="../../indices/a-tree/e/Ehrenfeucht:Andrzej.html">Andrzej Ehrenfeucht</a>, <a href="../../indices/a-tree/h/Haussler:David.html">David Haussler</a>, <a href="../../indices/a-tree/m/McConnell:Ross_M=.html">Ross M. McConnell</a>: Building a Complete Inverted File for a Set of Text Files in Linear Time. 349-358 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumerBEHM84">BibTeX</a></font> <li><a name="GoldbergM84" href="../../indices/a-tree/g/Goldberg:Andrew_V=.html">Andrew V. Goldberg</a>, <a href="../../indices/a-tree/m/Marchetti=Spaccamela:Alberto.html">Alberto Marchetti-Spaccamela</a>: On Finding the Exact Solution of a Zero-One Knapsack Problem. 359-368 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldbergM84">BibTeX</a></font> <li><a name="CuntoM84" href="../../indices/a-tree/c/Cunto:Walter.html">Walter Cunto</a>, <a href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>: Average Case Selection. 369-375 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CuntoM84">BibTeX</a></font> <li><a name="Miller84" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>: Finding Small Simple Cycle Separators for 2-Connected Planar Graphs. 376-382 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miller84">BibTeX</a></font> <li><a name="FredericksonS84" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>, <a href="../../indices/a-tree/s/Srinivas:Mandayam_A=.html">Mandayam A. Srinivas</a>: Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version). 383-390 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FredericksonS84">BibTeX</a></font> <li><a name="SlotB84" href="../../indices/a-tree/s/Slot:Cees_F=.html">Cees F. Slot</a>, <a href="../../indices/a-tree/b/Boas:Peter_van_Emde.html">Peter van Emde Boas</a>: On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space. 391-400 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SlotB84">BibTeX</a></font> <li><a name="Maass84" href="../../indices/a-tree/m/Maass:Wolfgang.html">Wolfgang Maass</a>: Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract). 401-408 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Maass84">BibTeX</a></font> <li><a name="Rougemont84" href="../../indices/a-tree/r/Rougemont:Michel_de.html">Michel de Rougemont</a>: Uniform Definability on Finite Structures with Successor. 409-417 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rougemont84">BibTeX</a></font> <li><a name="Harel84" href="../../indices/a-tree/h/Harel:David.html">David Harel</a>: A General Result on Infinite Trees and Its Applications (Preliminary Report). 418-427 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Harel84">BibTeX</a></font> <li><a name="Kozen84" href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>: Pebblings, Edgings, and Equational Logic. 428-435 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kozen84">BibTeX</a></font> <li><a name="Valiant84" href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: A Theory of the Learnable. 436-445 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Valiant84">BibTeX</a></font> <li><a name="VardiW84" href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>, <a href="../../indices/a-tree/w/Wolper:Pierre.html">Pierre Wolper</a>: Automata Theoretic Techniques for Modal Logics of Programs (Extended Abstract). 446-456 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/VardiW84">BibTeX</a></font> <li><a name="Ben-OrKR84" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>, <a href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: The Complexity of Elementary Algebra and Geometry (Preliminary Abstract). 457-464 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-OrKR84">BibTeX</a></font> <li><a name="Levin84" href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>: Problems, Complete in ``Average'' Instance. 465 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Levin84">BibTeX</a></font> <li><a name="Alt84" href="../../indices/a-tree/a/Alt:Helmut.html">Helmut Alt</a>: Comparison of Arithmetic Functions with Respect to Boolean Circuit Depth (Extended Abstract). 466-470 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Alt84">BibTeX</a></font> <li><a name="AjtaiB84" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>: A Theorem on Probabilistic Constant Depth Computations. 471-474 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AjtaiB84">BibTeX</a></font> <li><a name="Boppana84" href="../../indices/a-tree/b/Boppana:Ravi_B=.html">Ravi B. Boppana</a>: Threshold Functions and Bounded Depth Monotone Circuits. 475-479 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Boppana84">BibTeX</a></font> <li><a name="KlawePPY84" href="../../indices/a-tree/k/Klawe:Maria_M=.html">Maria M. Klawe</a>, <a href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>, <a href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: On Monotone Formulae with Restricted Depth (Preliminary Version). 480-487 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KlawePPY84">BibTeX</a></font> <li><a name="SleatorT84" href="../../indices/a-tree/s/Sleator:Daniel_Dominic.html">Daniel Dominic Sleator</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Amortized Efficiency of List Update Rules. 488-492 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SleatorT84">BibTeX</a></font> <li><a name="FredericksonL84" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>, <a href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>: The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring. 493-503 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FredericksonL84">BibTeX</a></font> <li><a name="DolevHS84" href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/h/Halpern:Joseph_Y=.html">Joseph Y. Halpern</a>, <a href="../../indices/a-tree/s/Strong:H=_Raymond.html">H. Raymond Strong</a>: On the Possibility and Impossibility of Achieving Clock Synchronization. 504-511 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DolevHS84">BibTeX</a></font> <li><a name="Willard84" href="../../indices/a-tree/w/Willard:Dan_E=.html">Dan E. Willard</a>: Log-Logarithmic Protocols for Resolving Ethernet and Semaphore Conflicts (Preliminary Report). 512-521 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Willard84">BibTeX</a></font> <li><a name="Awerbuch84" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>: An Efficient Network Synchronization Protocol. 522-525 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Awerbuch84">BibTeX</a></font> <li><a name="DolevHSS84" href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/h/Halpern:Joseph_Y=.html">Joseph Y. Halpern</a>, <a href="../../indices/a-tree/s/Simons:Barbara.html">Barbara Simons</a>, <a href="../../indices/a-tree/s/Strong:H=_Raymond.html">H. Raymond Strong</a>: A New Look at Fault Tolerant Network Routing. 526-535 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DolevHSS84">BibTeX</a></font> <li><a name="BroderDFS84" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/s/Simons:Barbara.html">Barbara Simons</a>: Efficient Fault Tolerant Routings in Networks. 536-541 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BroderDFS84">BibTeX</a></font> <li><a name="Vitanyi84" href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vitányi</a>: Distributed Elections in an Archimedean Ring of Processors (Preliminary Version). 542-547 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vitanyi84">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:43:10 2009 by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
