Personal tools
You are here: Home → dblp → db → conf → stoc → stoc1994.html
 

stoc1994.html

Click here to view the file or click here to download the file

Size 41.4 kB - File type text/html

File contents

<html><head><title>STOC 1994</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>26. <a href="index.html">STOC</a> 1994:
Montr&eacute;al,
Qu&eacute;bec,
Canada</h1> Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montr&eacute;al, Qu&eacute;bec, Canada.
 ACM 1994 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/STOC26">BibTeX</a></font>
 <pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/stoc/STOC26,
  title     = {Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory
               of Computing, 23-25 May 1994, Montr{\'e}al, Qu{\'e}bec,
               Canada},
  booktitle = {STOC},
  publisher = {ACM},
  year      = {1994},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
 
<ul>
<li><a name="ChungY94" href="../../indices/a-tree/c/Chung:Fan_R=_K=.html">Fan R. K. Chung</a>, <a href="../../indices/a-tree/y/Yau:S==T=.html">S.-T. Yau</a>:
<br><b>A near optimal algorithm for edge separators (preliminary version).
</b>1-8<br><a href="http://doi.acm.org/10.1145/195058.195077"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChungY94">BibTeX</a></font>

<li><a name="KleinT94" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>:
<br><b>A randomized linear-time algorithm for finding minimum spanning trees.
</b>9-15<br><a href="http://doi.acm.org/10.1145/195058.195084"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KleinT94">BibTeX</a></font>

<li><a name="Cohen94" href="../../indices/a-tree/c/Cohen:Edith.html">Edith Cohen</a>:
<br><b>Polylog-time and near-linear work approximation scheme for undirected shortest paths.
</b>16-26<br><a href="http://doi.acm.org/10.1145/195058.195089"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cohen94">BibTeX</a></font>

<li><a name="KleinRRS94" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>, <a href="../../indices/a-tree/h/Henzinger:Monika_Rauch.html">Monika Rauch Henzinger</a>, <a href="../../indices/a-tree/s/Subramanian:Sairam.html">Sairam Subramanian</a>:
<br><b>Faster shortest-path algorithms for planar graphs.
</b>27-37<br><a href="http://doi.acm.org/10.1145/195058.195092"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KleinRRS94">BibTeX</a></font>

<li><a name="TanakaN94" href="../../indices/a-tree/t/Tanaka:Keisuke.html">Keisuke Tanaka</a>, <a href="../../indices/a-tree/n/Nishino:Tetsuro.html">Tetsuro Nishino</a>:
<br><b>On the complexity of negation-limited Boolean networks.
</b>38-47<br><a href="http://doi.acm.org/10.1145/195058.195099"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/TanakaN94">BibTeX</a></font>

<li><a name="KrauseP94" href="../../indices/a-tree/k/Krause:Matthias.html">Matthias Krause</a>, <a href="../../indices/a-tree/p/Pudl=aacute=k:Pavel.html">Pavel Pudl&aacute;k</a>:
<br><b>On the computational power of depth 2 circuits with threshold and modulo gates.
</b>48-57<br><a href="http://doi.acm.org/10.1145/195058.195103"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KrauseP94">BibTeX</a></font>

<li><a name="JakobyRS94" href="../../indices/a-tree/j/Jakoby:Andreas.html">Andreas Jakoby</a>, <a href="../../indices/a-tree/r/Reischuk:R=uuml=diger.html">R&uuml;diger Reischuk</a>, <a href="../../indices/a-tree/s/Schindelhauer:Christian.html">Christian Schindelhauer</a>:
<br><b>Circuit complexity: from the worst case to the average case.
</b>58-67<br><a href="http://doi.acm.org/10.1145/195058.195106"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JakobyRS94">BibTeX</a></font>

<li><a name="Grolmusz94" href="../../indices/a-tree/g/Grolmusz:Vince.html">Vince Grolmusz</a>:
<br><b>A weight-size trade-off for circuits with MOD m gates.
</b>68-74<br><a href="http://doi.acm.org/10.1145/195058.195108"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Grolmusz94">BibTeX</a></font>

<li><a name="Chazelle94" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>:
<br><b>Computational geometry: a retrospective.
</b>75-94<br><a href="http://doi.acm.org/10.1145/195058.195110"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Chazelle94">BibTeX</a></font>

<li><a name="Pellegrini94" href="../../indices/a-tree/p/Pellegrini:Marco.html">Marco Pellegrini</a>:
<br><b>On point location and motion planning among simplices.
</b>95-104<br><a href="http://doi.acm.org/10.1145/195058.195112"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pellegrini94">BibTeX</a></font>

<li><a name="BergDS94" href="../../indices/a-tree/b/Berg:Mark_de.html">Mark de Berg</a>, <a href="../../indices/a-tree/d/Dobrindt:Katrin.html">Katrin Dobrindt</a>, <a href="../../indices/a-tree/s/Schwarzkopf:Otfried.html">Otfried Schwarzkopf</a>:
<br><b>On lazy randomized incremental construction.
</b>105-114<br><a href="http://doi.acm.org/10.1145/195058.195113"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BergDS94">BibTeX</a></font>

<li><a name="KalyanasundaramP94" href="../../indices/a-tree/k/Kalyanasundaram:Bala.html">Bala Kalyanasundaram</a>, <a href="../../indices/a-tree/p/Pruhs:Kirk.html">Kirk Pruhs</a>:
<br><b>Fault-tolerant scheduling.
</b>115-124<br><a href="http://doi.acm.org/10.1145/195058.195115"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KalyanasundaramP94">BibTeX</a></font>

<li><a name="KarlinNT94" href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/n/Nelson:Greg.html">Greg Nelson</a>, <a href="../../indices/a-tree/t/Tamaki:Hisao.html">Hisao Tamaki</a>:
<br><b>On the fault tolerance of the butterfly.
</b>125-133<br><a href="http://doi.acm.org/10.1145/195058.195117"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarlinNT94">BibTeX</a></font>

<li><a name="RaghavanU94" href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>:
<br><b>Efficient routing in all-optical networks.
</b>134-143<br><a href="http://doi.acm.org/10.1145/195058.195119"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RaghavanU94">BibTeX</a></font>

<li><a name="BrewerCL94" href="../../indices/a-tree/b/Brewer:Eric_A=.html">Eric A. Brewer</a>, <a href="../../indices/a-tree/c/Chong:Frederic_T=.html">Frederic T. Chong</a>, <a href="../../indices/a-tree/l/Leighton:Tom.html">Tom Leighton</a>:
<br><b>Scalable expanders: exploiting hierarchical random wiring.
</b>144-152<br><a href="http://doi.acm.org/10.1145/195058.195120"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BrewerCL94">BibTeX</a></font>

<li><a name="MacKenziePR94" href="../../indices/a-tree/m/MacKenzie:Philip_D=.html">Philip D. MacKenzie</a>, <a href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>, <a href="../../indices/a-tree/r/Rajaraman:Rajmohan.html">Rajmohan Rajaraman</a>:
<br><b>On contention resolution protocols and associated probabilistic phenomena.
</b>153-162<br><a href="http://doi.acm.org/10.1145/195058.195122"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MacKenziePR94">BibTeX</a></font>

<li><a name="BlumCCPRS94" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/c/Chalasani:Prasad.html">Prasad Chalasani</a>, <a href="../../indices/a-tree/c/Coppersmith:Don.html">Don Coppersmith</a>, <a href="../../indices/a-tree/p/Pulleyblank:William_R=.html">William R. Pulleyblank</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>:
<br><b>The minimum latency problem.
</b>163-171<br><a href="http://doi.acm.org/10.1145/195058.195125"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumCCPRS94">BibTeX</a></font>

<li><a name="FeigeK94" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>:
<br><b>Two prover protocols: low error at affordable rates.
</b>172-183<br><a href="http://doi.acm.org/10.1145/195058.195128"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeigeK94">BibTeX</a></font>

<li><a name="BellareS94" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>:
<br><b>Improved non-approximability results.
</b>184-193<br><a href="http://doi.acm.org/10.1145/195058.195129"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BellareS94">BibTeX</a></font>

<li><a name="PolishchukS94" href="../../indices/a-tree/p/Polishchuk:Alexander.html">Alexander Polishchuk</a>, <a href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>:
<br><b>Nearly-linear size holographic proofs.
</b>194-203<br><a href="http://doi.acm.org/10.1145/195058.195132"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PolishchukS94">BibTeX</a></font>

<li><a name="RazborovR94" href="../../indices/a-tree/r/Razborov:Alexander_A=.html">Alexander A. Razborov</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>:
<br><b>Natural proofs.
</b>204-213<br><a href="http://doi.acm.org/10.1145/195058.195134"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RazborovR94">BibTeX</a></font>

<li><a name="AwerbuchCS94" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/c/Cowen:Lenore.html">Lenore Cowen</a>, <a href="../../indices/a-tree/s/Smith:Mark_A=.html">Mark A. Smith</a>:
<br><b>Efficient asynchronous distributed symmetry breaking.
</b>214-223<br><a href="http://doi.acm.org/10.1145/195058.195136"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AwerbuchCS94">BibTeX</a></font>

<li><a name="YangA94" href="../../indices/a-tree/y/Yang:Jae=Heon.html">Jae-Heon Yang</a>, <a href="../../indices/a-tree/a/Anderson:James_H=.html">James H. Anderson</a>:
<br><b>Time bounds for mutual exclusion and related problems.
</b>224-233<br><a href="http://doi.acm.org/10.1145/195058.195139"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/YangA94">BibTeX</a></font>

<li><a name="OstrovskyRV94" href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>, <a href="../../indices/a-tree/r/Rajagopalan:Sridhar.html">Sridhar Rajagopalan</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>:
<br><b>Simple and efficient leader election in the full information model.
</b>234-242<br><a href="http://doi.acm.org/10.1145/195058.195141"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/OstrovskyRV94">BibTeX</a></font>

<li><a name="HerlihyS94" href="../../indices/a-tree/h/Herlihy:Maurice.html">Maurice Herlihy</a>, <a href="../../indices/a-tree/s/Shavit:Nir.html">Nir Shavit</a>:
<br><b>A simple constructive computability theorem for wait-free computation.
</b>243-252<br><a href="http://doi.acm.org/10.1145/195058.195144"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HerlihyS94">BibTeX</a></font>

<li><a name="BlumFJKMR94" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/f/Furst:Merrick_L=.html">Merrick L. Furst</a>, <a href="../../indices/a-tree/j/Jackson:Jeffrey_C=.html">Jeffrey C. Jackson</a>, <a href="../../indices/a-tree/k/Kearns:Michael_J=.html">Michael J. Kearns</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>:
<br><b>Weakly learning DNF and characterizing statistical query learning using Fourier analysis.
</b>253-262<br><a href="http://doi.acm.org/10.1145/195058.195147"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumFJKMR94">BibTeX</a></font>

<li><a name="AuerL94" href="../../indices/a-tree/a/Auer:Peter.html">Peter Auer</a>, <a href="../../indices/a-tree/l/Long:Philip_M=.html">Philip M. Long</a>:
<br><b>Simulating access to hidden information while learning.
</b>263-272<br><a href="http://doi.acm.org/10.1145/195058.195152"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AuerL94">BibTeX</a></font>

<li><a name="KearnsMRRSS94" href="../../indices/a-tree/k/Kearns:Michael_J=.html">Michael J. Kearns</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>, <a href="../../indices/a-tree/s/Schapire:Robert_E=.html">Robert E. Schapire</a>, <a href="../../indices/a-tree/s/Sellie:Linda.html">Linda Sellie</a>:
<br><b>On the learnability of discrete distributions.
</b>273-282<br><a href="http://doi.acm.org/10.1145/195058.195155"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KearnsMRRSS94">BibTeX</a></font>

<li><a name="ApsitisFS94" href="../../indices/a-tree/a/Apsitis:Kalvis.html">Kalvis Apsitis</a>, <a href="../../indices/a-tree/f/Freivalds:Rusins.html">Rusins Freivalds</a>, <a href="../../indices/a-tree/s/Smith:Carl_H=.html">Carl H. Smith</a>:
<br><b>Choosing a learning team: a topological approach.
</b>283-289<br><a href="http://doi.acm.org/10.1145/195058.195158"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ApsitisFS94">BibTeX</a></font>

<li><a name="Hariharan94" href="../../indices/a-tree/h/Hariharan:Ramesh.html">Ramesh Hariharan</a>:
<br><b>Optimal parallel suffix tree construction.
</b>290-299<br><a href="http://doi.acm.org/10.1145/195058.195162"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hariharan94">BibTeX</a></font>

<li><a name="SahinalpV94" href="../../indices/a-tree/s/Sahinalp:S=uuml=leyman_Cenk.html">S&uuml;leyman Cenk Sahinalp</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>:
<br><b>Symmetry breaking for suffix tree construction.
</b>300-309<br><a href="http://doi.acm.org/10.1145/195058.195164"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SahinalpV94">BibTeX</a></font>

<li><a name="Kosaraju94" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>:
<br><b>Real-time pattern matching and quasi-real-time construction of suffix trees (preliminary version).
</b>310-316<br><a href="http://doi.acm.org/10.1145/195058.195170"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kosaraju94">BibTeX</a></font>

<li><a name="AnderssonHHP94" href="../../indices/a-tree/a/Andersson:Arne.html">Arne Andersson</a>, <a href="../../indices/a-tree/h/Hagerup:Torben.html">Torben Hagerup</a>, <a href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan H&aring;stad</a>, <a href="../../indices/a-tree/p/Petersson:Ola.html">Ola Petersson</a>:
<br><b>The complexity of searching a sorted array of strings.
</b>317-325<br><a href="http://doi.acm.org/10.1145/195058.195175"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AnderssonHHP94">BibTeX</a></font>

<li><a name="AlonYZ94" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/y/Yuster:Raphael.html">Raphael Yuster</a>, <a href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>:
<br><b>Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs.
</b>326-335<br><a href="http://doi.acm.org/10.1145/195058.195179"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlonYZ94">BibTeX</a></font>

<li><a name="Odlyzko94" href="../../indices/a-tree/o/Odlyzko:Andrew_M=.html">Andrew M. Odlyzko</a>:
<br><b>Search for the maximum of a random walk.
</b>336-345<br><a href="http://doi.acm.org/10.1145/195058.195182"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Odlyzko94">BibTeX</a></font>

<li><a name="AlonK94" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/k/Kahale:Nabil.html">Nabil Kahale</a>:
<br><b>A spectral technique for coloring random 3-colorable graphs (preliminary version).
</b>346-355<br><a href="http://doi.acm.org/10.1145/195058.195187"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlonK94">BibTeX</a></font>

<li><a name="ImpagliazzoNW94" href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>Pseudorandomness for network algorithms.
</b>356-364<br><a href="http://doi.acm.org/10.1145/195058.195190"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ImpagliazzoNW94">BibTeX</a></font>

<li><a name="Kurshan94" href="../../indices/a-tree/k/Kurshan:Robert_P=.html">Robert P. Kurshan</a>:
<br><b>The complexity of verification.
</b>365-371<br><a href="http://doi.acm.org/10.1145/195058.195194"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kurshan94">BibTeX</a></font>

<li><a name="MansourNV94" href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>:
<br><b>Trade-offs between communication throughput and parallel time.
</b>372-381<br><a href="http://doi.acm.org/10.1145/195058.195199"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MansourNV94">BibTeX</a></font>

<li><a name="Hagerup94" href="../../indices/a-tree/h/Hagerup:Torben.html">Torben Hagerup</a>:
<br><b>Optimal parallel string algorithms: sorting, merging and computing the minimum.
</b>382-391<br><a href="http://doi.acm.org/10.1145/195058.195202"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hagerup94">BibTeX</a></font>

<li><a name="MaG94" href="../../indices/a-tree/m/Ma:Keju.html">Keju Ma</a>, <a href="../../indices/a-tree/g/Gathen:Joachim_von_zur.html">Joachim von zur Gathen</a>:
<br><b>The computational complexity of recognizing permutation functions.
</b>392-401<br><a href="http://doi.acm.org/10.1145/195058.195204"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MaG94">BibTeX</a></font>

<li><a name="KhullerRY94" href="../../indices/a-tree/k/Khuller:Samir.html">Samir Khuller</a>, <a href="../../indices/a-tree/r/Raghavachari:Balaji.html">Balaji Raghavachari</a>, <a href="../../indices/a-tree/y/Young:Neal_E=.html">Neal E. Young</a>:
<br><b>Low degree spanning trees of small weight.
</b>412-421<br><a href="http://doi.acm.org/10.1145/195058.195212"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KhullerRY94">BibTeX</a></font>

<li><a name="GoemansW94" href="../../indices/a-tree/g/Goemans:Michel_X=.html">Michel X. Goemans</a>, <a href="../../indices/a-tree/w/Williamson:David_P=.html">David P. Williamson</a>:
<br><b>.879-approximation algorithms for MAX CUT and MAX 2SAT.
</b>422-431<br><a href="http://doi.acm.org/10.1145/195058.195216"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoemansW94">BibTeX</a></font>

<li><a name="HalldorssonR94" href="../../indices/a-tree/h/Halld=oacute=rsson:Magn=uacute=s_M=.html">Magn&uacute;s M. Halld&oacute;rsson</a>, <a href="../../indices/a-tree/r/Radhakrishnan:Jaikumar.html">Jaikumar Radhakrishnan</a>:
<br><b>Greed is good: approximating independent sets in sparse and bounded-degree graphs.
</b>439-448<br><a href="http://doi.acm.org/10.1145/195058.195221"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HalldorssonR94">BibTeX</a></font>

<li><a name="AroraRV94" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>:
<br><b>Simulating quadratic dynamical systems is PSPACE-complete (preliminary version).
</b>459-467<br><a href="http://doi.acm.org/10.1145/195058.195231"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AroraRV94">BibTeX</a></font>

<li><a name="MaratheHSR94" href="../../indices/a-tree/m/Marathe:Madhav_V=.html">Madhav V. Marathe</a>, <a href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>, <a href="../../indices/a-tree/s/Stearns:Richard_Edwin.html">Richard Edwin Stearns</a>, <a href="../../indices/a-tree/r/Radhakrishnan:Venkatesh.html">Venkatesh Radhakrishnan</a>:
<br><b>Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version).
</b>468-477<br><a href="http://doi.acm.org/10.1145/195058.195233"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MaratheHSR94">BibTeX</a></font>

<li><a name="Sitharam94" href="../../indices/a-tree/s/Sitharam:Meera.html">Meera Sitharam</a>:
<br><b>Pseudorandom generators and learning algorithms for AC.
</b>478-486<br><a href="http://doi.acm.org/10.1145/195058.195236"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Sitharam94">BibTeX</a></font>

<li><a name="AwerbuchL94" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/l/Leighton:Tom.html">Tom Leighton</a>:
<br><b>Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks.
</b>487-496<br><a href="http://doi.acm.org/10.1145/195058.195238"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AwerbuchL94">BibTeX</a></font>

<li><a name="VavasisY94" href="../../indices/a-tree/v/Vavasis:Stephen_A=.html">Stephen A. Vavasis</a>, <a href="../../indices/a-tree/y/Ye:Yinyu.html">Yinyu Ye</a>:
<br><b>An accelerated interior point method whose running time depends only on A (extended abstract).
</b>512-521<br><a href="http://doi.acm.org/10.1145/195058.195248"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/VavasisY94">BibTeX</a></font>

<li><a name="SantisDFY94" href="../../indices/a-tree/s/Santis:Alfredo_De.html">Alfredo De Santis</a>, <a href="../../indices/a-tree/d/Desmedt:Yvo.html">Yvo Desmedt</a>, <a href="../../indices/a-tree/f/Frankel:Yair.html">Yair Frankel</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>:
<br><b>How to share a function securely.
</b>522-533<br><a href="http://doi.acm.org/10.1145/195058.195405"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SantisDFY94">BibTeX</a></font>

<li><a name="GoldreichOP94" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>, <a href="../../indices/a-tree/p/Petrank:Erez.html">Erez Petrank</a>:
<br><b>Computational complexity and knowledge complexity (extended abstract).
</b>534-543<br><a href="http://doi.acm.org/10.1145/195058.195406"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldreichOP94">BibTeX</a></font>

<li><a name="BenalohT94" href="../../indices/a-tree/b/Benaloh:Josh_Cohen.html">Josh Cohen Benaloh</a>, <a href="../../indices/a-tree/t/Tuinstra:Dwight.html">Dwight Tuinstra</a>:
<br><b>Receipt-free secret-ballot elections (extended abstract).
</b>544-553<br><a href="http://doi.acm.org/10.1145/195058.195407"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BenalohT94">BibTeX</a></font>

<li><a name="FeigeKN94" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>:
<br><b>A minimal model for secure computation (extended abstract).
</b>554-563<br><a href="http://doi.acm.org/10.1145/195058.195408"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeigeKN94">BibTeX</a></font>

<li><a name="GoldreichW94" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing.
</b>574-584<br><a href="http://doi.acm.org/10.1145/195058.195410"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldreichW94">BibTeX</a></font>

<li><a name="ChariRS94" href="../../indices/a-tree/c/Chari:Suresh.html">Suresh Chari</a>, <a href="../../indices/a-tree/r/Rohatgi:Pankaj.html">Pankaj Rohatgi</a>, <a href="../../indices/a-tree/s/Srinivasan:Aravind.html">Aravind Srinivasan</a>:
<br><b>Improved algorithms via approximations of probability distributions (extended abstract).
</b>584-592<br><a href="http://doi.acm.org/10.1145/195058.195411"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChariRS94">BibTeX</a></font>

<li><a name="AzarBKU94" href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>, <a href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>:
<br><b>Balanced allocations (extended abstract).
</b>593-602<br><a href="http://doi.acm.org/10.1145/195058.195412"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AzarBKU94">BibTeX</a></font>

<li><a name="Mulmuley94" href="../../indices/a-tree/m/Mulmuley:Ketan.html">Ketan Mulmuley</a>:
<br><b>Lower bounds for parallel linear programming and other problems.
</b>603-614<br><a href="http://doi.acm.org/10.1145/195058.195413"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Mulmuley94">BibTeX</a></font>

<li><a name="Yao94" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>:
<br><b>Decision tree complexity and Betti numbers.
</b>615-624<br><a href="http://doi.acm.org/10.1145/195058.195414"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao94">BibTeX</a></font>

<li><a name="Miltersen94" href="../../indices/a-tree/m/Miltersen:Peter_Bro.html">Peter Bro Miltersen</a>:
<br><b>Lower bounds for union-split-find related problems on random access machines.
</b>625-634<br><a href="http://doi.acm.org/10.1145/195058.195415"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miltersen94">BibTeX</a></font>

<li><a name="GrigorievKV94" href="../../indices/a-tree/g/Grigoriev:Dima.html">Dima Grigoriev</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>, <a href="../../indices/a-tree/v/Vorobjov:Nicolai.html">Nicolai Vorobjov</a>:
<br><b>Lower bounds on testing membership to a polyhedron by algebraic decision trees.
</b>635-644<br><a href="http://doi.acm.org/10.1145/195058.195418"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GrigorievKV94">BibTeX</a></font>

<li><a name="Wigderson94" href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>The amazing power of pairwise independence (abstract).
</b>645-647<br><a href="http://doi.acm.org/10.1145/195058.195420"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wigderson94">BibTeX</a></font>

<li><a name="Karger94" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>:
<br><b>Random sampling in cut, flow, and network design problems.
</b>648-657<br><a href="http://doi.acm.org/10.1145/195058.195422"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Karger94">BibTeX</a></font>

<li><a name="JiangSV94" href="../../indices/a-tree/j/Jiang:Tao.html">Tao Jiang</a>, <a href="../../indices/a-tree/s/Seiferas:Joel_I=.html">Joel I. Seiferas</a>, <a href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vit&aacute;nyi</a>:
<br><b>Two heads are better than two tapes.
</b>668-675<br><a href="http://doi.acm.org/10.1145/195058.195428"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JiangSV94">BibTeX</a></font>

<li><a name="CondonHPW94" href="../../indices/a-tree/c/Condon:Anne.html">Anne Condon</a>, <a href="../../indices/a-tree/h/Hellerstein:Lisa.html">Lisa Hellerstein</a>, <a href="../../indices/a-tree/p/Pottle:Samuel.html">Samuel Pottle</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>On the power of finite automata with both nondeterministic and probabilistic states (preliminary version).
</b>676-685<br><a href="http://doi.acm.org/10.1145/195058.195431"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CondonHPW94">BibTeX</a></font>

<li><a name="Rauch94" href="../../indices/a-tree/r/Rauch:Monika.html">Monika Rauch</a>:
<br><b>Improved data structures for fully dynamic biconnectivity.
</b>686-695<br><a href="http://doi.acm.org/10.1145/195058.195434"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rauch94">BibTeX</a></font>

<li><a name="Gabow94" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>:
<br><b>Efficient splitting off algorithms for graphs.
</b>696-705<br><a href="http://doi.acm.org/10.1145/195058.195436"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Gabow94">BibTeX</a></font>

<li><a name="Poutre94" href="../../indices/a-tree/p/Poutr=eacute=:Johannes_A=_La.html">Johannes A. La Poutr&eacute;</a>:
<br><b>Alpha-algorithms for incremental planarity testing (preliminary version).
</b>706-715<br><a href="http://doi.acm.org/10.1145/195058.195439"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Poutre94">BibTeX</a></font>

<li><a name="DinitzV94" href="../../indices/a-tree/d/Dinitz:Yefim.html">Yefim Dinitz</a>, <a href="../../indices/a-tree/v/Vainshtein:Alek.html">Alek Vainshtein</a>:
<br><b>The connectivity carcass of a vertex subset in a graph and its incremental maintenance.
</b>716-725<br><a href="http://doi.acm.org/10.1145/195058.195442"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DinitzV94">BibTeX</a></font>

<li><a name="PapadimitriouY94" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>:
<br><b>On complexity as bounded rationality (extended abstract).
</b>726-733<br><a href="http://doi.acm.org/10.1145/195058.195445"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PapadimitriouY94">BibTeX</a></font>

<li><a name="LiptonY94" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/y/Young:Neal_E=.html">Neal E. Young</a>:
<br><b>Simple strategies for large zero-sum games with applications to complexity theory.
</b>734-740<br><a href="http://doi.acm.org/10.1145/195058.195447"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LiptonY94">BibTeX</a></font>

<li><a name="FortnowW94" href="../../indices/a-tree/f/Fortnow:Lance.html">Lance Fortnow</a>, <a href="../../indices/a-tree/w/Whang:Duke.html">Duke Whang</a>:
<br><b>Optimality and domination in repeated games with bounded players.
</b>741-749<br><a href="http://doi.acm.org/10.1145/195058.195448"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FortnowW94">BibTeX</a></font>

<li><a name="KollerMS94" href="../../indices/a-tree/k/Koller:Daphne.html">Daphne Koller</a>, <a href="../../indices/a-tree/m/Megiddo:Nimrod.html">Nimrod Megiddo</a>, <a href="../../indices/a-tree/s/Stengel:Bernhard_von.html">Bernhard von Stengel</a>:
<br><b>Fast algorithms for finding randomized strategies in game trees.
</b>750-759<br><a href="http://doi.acm.org/10.1145/195058.195451"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KollerMS94">BibTeX</a></font>

<li><a name="JiangLW94" href="../../indices/a-tree/j/Jiang:Tao.html">Tao Jiang</a>, <a href="../../indices/a-tree/l/Lawler:Eugene_L=.html">Eugene L. Lawler</a>, <a href="../../indices/a-tree/w/Wang:Lusheng.html">Lusheng Wang</a>:
<br><b>Aligning sequences via an evolutionary tree: complexity and approximation.
</b>760-769<br><a href="http://doi.acm.org/10.1145/195058.195454"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JiangLW94">BibTeX</a></font>

<li><a name="MuthukrishnanP94" href="../../indices/a-tree/m/Muthukrishnan:S=.html">S. Muthukrishnan</a>, <a href="../../indices/a-tree/p/Palem:Krishna_V=.html">Krishna V. Palem</a>:
<br><b>Non-standard stringology: algorithms and complexity.
</b>770-779<br><a href="http://doi.acm.org/10.1145/195058.195457"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MuthukrishnanP94">BibTeX</a></font>

<li><a name="JacquetS94" href="../../indices/a-tree/j/Jacquet:Philippe.html">Philippe Jacquet</a>, <a href="../../indices/a-tree/s/Szpankowski:Wojciech.html">Wojciech Szpankowski</a>:
<br><b>A functional equation often arising in the analysis of algorithms (extended abstract).
</b>780-789<br><a href="http://doi.acm.org/10.1145/195058.195456"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JacquetS94">BibTeX</a></font>

<li><a name="RajagopalanS94" href="../../indices/a-tree/r/Rajagopalan:Sridhar.html">Sridhar Rajagopalan</a>, <a href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>:
<br><b>A coding theorem for distributed computation.
</b>790-799<br><a href="http://doi.acm.org/10.1145/195058.195462"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RajagopalanS94">BibTeX</a></font>

<li><a name="AlurAT94" href="../../indices/a-tree/a/Alur:Rajeev.html">Rajeev Alur</a>, <a href="../../indices/a-tree/a/Attiya:Hagit.html">Hagit Attiya</a>, <a href="../../indices/a-tree/t/Taubenfeld:Gadi.html">Gadi Taubenfeld</a>:
<br><b>Time-adaptive algorithms for synchronization.
</b>800-809<br><a href="http://doi.acm.org/10.1145/195058.195464"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlurAT94">BibTeX</a></font>

<li><a name="Patt-ShamirR94" href="../../indices/a-tree/p/Patt=Shamir:Boaz.html">Boaz Patt-Shamir</a>, <a href="../../indices/a-tree/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>:
<br><b>A theory of clock synchronization (extended abstract).
</b>810-819<br><a href="http://doi.acm.org/10.1145/195058.195466"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Patt-ShamirR94">BibTeX</a></font>

<li><a name="BellareGLR94" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/l/Lund:Carsten.html">Carsten Lund</a>, <a href="../../indices/a-tree/r/Russell:Alexander.html">Alexander Russell</a>:
<br><b>Efficient probabilistic checkable proofs and applications to approximation.
</b>820<br><a href="http://doi.acm.org/10.1145/195058.195467"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BellareGLR94">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> &#151; 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 &#169;</a> Sat May 16 23:43:11 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>
Document Actions
SIGMOD Record
SIGMOD Record