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

stoc1993.html

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

Size 45.6 kB - File type text/html

File contents

<html><head><title>STOC 1993</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>25. <a href="index.html">STOC</a> 1993</h1> Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993.
 ACM 1993 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/STOC25">BibTeX</a></font>
 <pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/stoc/STOC25,
  title     = {Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory
               of Computing, 1993},
  booktitle = {STOC},
  publisher = {ACM},
  year      = {1993},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
 
<ul>
<li><a name="ChouK93" href="../../indices/a-tree/c/Chou:Arthur_W=.html">Arthur W. Chou</a>, <a href="../../indices/a-tree/k/Ko:Ker=I.html">Ker-I Ko</a>:
<br><b>Some complexity issues on the simply connected regions of the two-dimensional plane.
</b>1-10<br><a href="http://doi.acm.org/10.1145/167088.167093"><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/ChouK93">BibTeX</a></font>

<li><a name="BernsteinV93" href="../../indices/a-tree/b/Bernstein:Ethan.html">Ethan Bernstein</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>:
<br><b>Quantum complexity theory.
</b>11-20<br><a href="http://doi.acm.org/10.1145/167088.167097"><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/BernsteinV93">BibTeX</a></font>

<li><a name="BennettGLVZ93" href="../../indices/a-tree/b/Bennett:Charles_H=.html">Charles H. Bennett</a>, <a href="../../indices/a-tree/g/G=aacute=cs:P=eacute=ter.html">P&eacute;ter G&aacute;cs</a>, <a href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>, <a href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vit&aacute;nyi</a>, <a href="../../indices/a-tree/z/Zurek:Wojciech_H=.html">Wojciech H. Zurek</a>:
<br><b>Thermodynamics of computation and information distance.
</b>21-30<br><a href="http://doi.acm.org/10.1145/167088.167098"><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/BennettGLVZ93">BibTeX</a></font>

<li><a name="GarayM93" href="../../indices/a-tree/g/Garay:Juan_A=.html">Juan A. Garay</a>, <a href="../../indices/a-tree/m/Moses:Yoram.html">Yoram Moses</a>:
<br><b>Fully polynomial Byzantine agreement in t+1 rounds.
</b>31-41<br><a href="http://doi.acm.org/10.1145/167088.167101"><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/GarayM93">BibTeX</a></font>

<li><a name="CanettiR93" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/r/Rabin:Tal.html">Tal Rabin</a>:
<br><b>Fast asynchronous Byzantine agreement with optimal resilience.
</b>42-51<br><a href="http://doi.acm.org/10.1145/167088.167105"><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/CanettiR93">BibTeX</a></font>

<li><a name="Ben-OrCG93" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>, <a href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>:
<br><b>Asynchronous secure computation.
</b>52-61<br><a href="http://doi.acm.org/10.1145/167088.167109"><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/Ben-OrCG93">BibTeX</a></font>

<li><a name="JiangL93" href="../../indices/a-tree/j/Jiang:Tao.html">Tao Jiang</a>, <a href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>:
<br><b>k one-way heads cannot do string-matching.
</b>62-70<br><a href="http://doi.acm.org/10.1145/167088.167111"><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/JiangL93">BibTeX</a></font>

<li><a name="Baker93" href="../../indices/a-tree/b/Baker:Brenda_S=.html">Brenda S. Baker</a>:
<br><b>A theory of parameterized pattern matching: algorithms and applications.
</b>71-80<br><a href="http://doi.acm.org/10.1145/167088.167115"><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/Baker93">BibTeX</a></font>

<li><a name="IduryS93" href="../../indices/a-tree/i/Idury:Ramana_M=.html">Ramana M. Idury</a>, <a href="../../indices/a-tree/s/Sch=auml=ffer:Alejandro_A=.html">Alejandro A. Sch&auml;ffer</a>:
<br><b>Multiple matching of rectangular patterns.
</b>81-90<br><a href="http://doi.acm.org/10.1145/167088.167116"><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/IduryS93">BibTeX</a></font>

<li><a name="BorowskyG93" href="../../indices/a-tree/b/Borowsky:Elizabeth.html">Elizabeth Borowsky</a>, <a href="../../indices/a-tree/g/Gafni:Eli.html">Eli Gafni</a>:
<br><b>Generalized FLP impossibility result for t-resilient asynchronous computations.
</b>91-100<br><a href="http://doi.acm.org/10.1145/167088.167119"><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/BorowskyG93">BibTeX</a></font>

<li><a name="SaksZ93" href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/z/Zaharoglou:Fotios.html">Fotios Zaharoglou</a>:
<br><b>Wait-free k-set agreement is impossible: the topology of public knowledge.
</b>101-110<br><a href="http://doi.acm.org/10.1145/167088.167122"><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/SaksZ93">BibTeX</a></font>

<li><a name="HerlihyS93" 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>The asynchronous computability theorem for t-resilient tasks.
</b>111-120<br><a href="http://doi.acm.org/10.1145/167088.167125"><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/HerlihyS93">BibTeX</a></font>

<li><a name="PapadimitriouY93" 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>Linear programming without the matrix.
</b>121-129<br><a href="http://doi.acm.org/10.1145/167088.167127"><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/PapadimitriouY93">BibTeX</a></font>

<li><a name="BorgstromK93" href="../../indices/a-tree/b/Borgstrom:Ryan_S=.html">Ryan S. Borgstrom</a>, <a href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>:
<br><b>Comparison-based search in the presence of errors.
</b>130-136<br><a href="http://doi.acm.org/10.1145/167088.167129"><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/BorgstromK93">BibTeX</a></font>

<li><a name="FarachKW93" href="../../indices/a-tree/f/Farach:Martin.html">Martin Farach</a>, <a href="../../indices/a-tree/k/Kannan:Sampath.html">Sampath Kannan</a>, <a href="../../indices/a-tree/w/Warnow:Tandy.html">Tandy Warnow</a>:
<br><b>A robust model for finding optimal evolutionary trees.
</b>137-145<br><a href="http://doi.acm.org/10.1145/167088.167132"><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/FarachKW93">BibTeX</a></font>

<li><a name="FelsnerW93" href="../../indices/a-tree/f/Felsner:Stefan.html">Stefan Felsner</a>, <a href="../../indices/a-tree/w/Wernisch:Lorenz.html">Lorenz Wernisch</a>:
<br><b>Maximum k-chains in planar point sets: combinatorial structure and algorithms.
</b>146-153<br><a href="http://doi.acm.org/10.1145/167088.167136"><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/FelsnerW93">BibTeX</a></font>

<li><a name="KushilevitzMRZ93" href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/r/Rabin:Michael_O=.html">Michael O. Rabin</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>:
<br><b>Lower bounds for randomized mutual exclusion.
</b>154-163<br><a href="http://doi.acm.org/10.1145/167088.167139"><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/KushilevitzMRZ93">BibTeX</a></font>

<li><a name="AwerbuchBF93" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>, <a href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>:
<br><b>Competitive distributed file allocation.
</b>164-173<br><a href="http://doi.acm.org/10.1145/167088.167142"><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/AwerbuchBF93">BibTeX</a></font>

<li><a name="DworkHW93" href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/h/Herlihy:Maurice.html">Maurice Herlihy</a>, <a href="../../indices/a-tree/w/Waarts:Orli.html">Orli Waarts</a>:
<br><b>Contention in shared memory algorithms.
</b>174-183<br><a href="http://doi.acm.org/10.1145/167088.167145"><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/DworkHW93">BibTeX</a></font>

<li><a name="NaorS93" href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>:
<br><b>What can be computed locally?
</b>184-193<br><a href="http://doi.acm.org/10.1145/167088.167149"><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/NaorS93">BibTeX</a></font>

<li><a name="CohenBKT93" href="../../indices/a-tree/c/Cohen:Robert_F=.html">Robert F. Cohen</a>, <a href="../../indices/a-tree/b/Battista:Giuseppe_Di.html">Giuseppe Di Battista</a>, <a href="../../indices/a-tree/k/Kanevsky:Arkady.html">Arkady Kanevsky</a>, <a href="../../indices/a-tree/t/Tamassia:Roberto.html">Roberto Tamassia</a>:
<br><b>Reinventing the wheel: an optimal data structure for connectivity queries.
</b>194-200<br><a href="http://doi.acm.org/10.1145/167088.167152"><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/CohenBKT93">BibTeX</a></font>

<li><a name="SzegedyV93" href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>, <a href="../../indices/a-tree/v/Vishwanathan:Sundar.html">Sundar Vishwanathan</a>:
<br><b>Locality based graph coloring.
</b>201-207<br><a href="http://doi.acm.org/10.1145/167088.167156"><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/SzegedyV93">BibTeX</a></font>

<li><a name="EppsteinGIS93" href="../../indices/a-tree/e/Eppstein:David.html">David Eppstein</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/i/Italiano:Giuseppe_F=.html">Giuseppe F. Italiano</a>, <a href="../../indices/a-tree/s/Spencer:Thomas_H=.html">Thomas H. Spencer</a>:
<br><b>Separator based sparsification for dynamic planar graph algorithms.
</b>208-217<br><a href="http://doi.acm.org/10.1145/167088.167159"><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/EppsteinGIS93">BibTeX</a></font>

<li><a name="Goldberg93" href="../../indices/a-tree/g/Goldberg:Leslie_Ann.html">Leslie Ann Goldberg</a>:
<br><b>Polynomial space polynomial delay algorithms for listing families of graphs.
</b>218-225<br><a href="http://doi.acm.org/10.1145/167088.167160"><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/Goldberg93">BibTeX</a></font>

<li><a name="Bodlaender93" href="../../indices/a-tree/b/Bodlaender:Hans_L=.html">Hans L. Bodlaender</a>:
<br><b>A linear time algorithm for finding tree-decompositions of small treewidth.
</b>226-234<br><a href="http://doi.acm.org/10.1145/167088.167161"><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/Bodlaender93">BibTeX</a></font>

<li><a name="NisanZ93" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>:
<br><b>More deterministic simulation in logspace.
</b>235-244<br><a href="http://doi.acm.org/10.1145/167088.167162"><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/NisanZ93">BibTeX</a></font>

<li><a name="WigdersonZ93" href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>:
<br><b>Expanders that beat the eigenvalue bound: explicit construction and applications.
</b>245-251<br><a href="http://doi.acm.org/10.1145/167088.167163"><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/WigdersonZ93">BibTeX</a></font>

<li><a name="BoppanaN93" href="../../indices/a-tree/b/Boppana:Ravi_B=.html">Ravi B. Boppana</a>, <a href="../../indices/a-tree/n/Narayanan:Babu_O=.html">Babu O. Narayanan</a>:
<br><b>The biased coin problem.
</b>252-257<br><a href="http://doi.acm.org/10.1145/167088.167164"><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/BoppanaN93">BibTeX</a></font>

<li><a name="LinialLSZ93" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>:
<br><b>Efficient construction of a small hitting set for combinatorial rectangles in high dimension.
</b>258-267<br><a href="http://doi.acm.org/10.1145/167088.167166"><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/LinialLSZ93">BibTeX</a></font>

<li><a name="KollerM93" href="../../indices/a-tree/k/Koller:Daphne.html">Daphne Koller</a>, <a href="../../indices/a-tree/m/Megiddo:Nimrod.html">Nimrod Megiddo</a>:
<br><b>Constructing small sample spaces satisfying given constraints.
</b>268-277<br><a href="http://doi.acm.org/10.1145/167088.167168"><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/KollerM93">BibTeX</a></font>

<li><a name="Karp93" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>:
<br><b>Mapping the genome: some combinatorial problems arising in molecular biology.
</b>278-285<br><a href="http://doi.acm.org/10.1145/167088.167170"><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/Karp93">BibTeX</a></font>

<li><a name="LundY93" href="../../indices/a-tree/l/Lund:Carsten.html">Carsten Lund</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>:
<br><b>On the hardness of approximating minimization problems.
</b>286-293<br><a href="http://doi.acm.org/10.1145/167088.167172"><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/LundY93">BibTeX</a></font>

<li><a name="BellareGLR93" 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/Russeli:A=.html">A. Russeli</a>:
<br><b>Efficient probabilistically checkable proofs and applications to approximations.
</b>294-304<br><a href="http://doi.acm.org/10.1145/167088.167174"><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/BellareGLR93">BibTeX</a></font>

<li><a name="CondonFLS93" href="../../indices/a-tree/c/Condon:Anne.html">Anne Condon</a>, <a href="../../indices/a-tree/f/Feigenbaum:Joan.html">Joan Feigenbaum</a>, <a href="../../indices/a-tree/l/Lund:Carsten.html">Carsten Lund</a>, <a href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>:
<br><b>Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.
</b>305-314<br><a href="http://doi.acm.org/10.1145/167088.167190"><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/CondonFLS93">BibTeX</a></font>

<li><a name="FreundKRRSS93" href="../../indices/a-tree/f/Freund:Yoav.html">Yoav Freund</a>, <a href="../../indices/a-tree/k/Kearns:Michael_J=.html">Michael J. Kearns</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>Efficient learning of typical finite automata from random walks.
</b>315-324<br><a href="http://doi.acm.org/10.1145/167088.167191"><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/FreundKRRSS93">BibTeX</a></font>

<li><a name="MacintyreS93" href="../../indices/a-tree/m/Macintyre:Angus.html">Angus Macintyre</a>, <a href="../../indices/a-tree/s/Sontag:Eduardo_D=.html">Eduardo D. Sontag</a>:
<br><b>Finiteness results for sigmoidal "neural" networks.
</b>325-334<br><a href="http://doi.acm.org/10.1145/167088.167192"><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/MacintyreS93">BibTeX</a></font>

<li><a name="Maass93" href="../../indices/a-tree/m/Maass:Wolfgang.html">Wolfgang Maass</a>:
<br><b>Bounds for the computational power and learning complexity of analog neural nets.
</b>335-344<br><a href="http://doi.acm.org/10.1145/167088.167193"><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/Maass93">BibTeX</a></font>

<li><a name="BaruahCPV93" href="../../indices/a-tree/b/Baruah:Sanjoy_K=.html">Sanjoy K. Baruah</a>, <a href="../../indices/a-tree/c/Cohen:N=_K=.html">N. K. Cohen</a>, <a href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>, <a href="../../indices/a-tree/v/Varvel:Donald_A=.html">Donald A. Varvel</a>:
<br><b>Proportionate progress: a notion of fairness in resource allocation.
</b>345-354<br><a href="http://doi.acm.org/10.1145/167088.167194"><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/BaruahCPV93">BibTeX</a></font>

<li><a name="Pippenger93" href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>:
<br><b>Self-routing superconcentrators.
</b>355-361<br><a href="http://doi.acm.org/10.1145/167088.167195"><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/Pippenger93">BibTeX</a></font>

<li><a name="BlumofeL93" href="../../indices/a-tree/b/Blumofe:Robert_D=.html">Robert D. Blumofe</a>, <a href="../../indices/a-tree/l/Leiserson:Charles_E=.html">Charles E. Leiserson</a>:
<br><b>Space-efficient scheduling of multithreaded computations.
</b>362-371<br><a href="http://doi.acm.org/10.1145/167088.167196"><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/BlumofeL93">BibTeX</a></font>

<li><a name="Kharitonov93" href="../../indices/a-tree/k/Kharitonov:Michael.html">Michael Kharitonov</a>:
<br><b>Cryptographic hardness of distribution-specific learning.
</b>372-381<br><a href="http://doi.acm.org/10.1145/167088.167197"><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/Kharitonov93">BibTeX</a></font>

<li><a name="Cesa-BianchiFHHSW93" href="../../indices/a-tree/c/Cesa=Bianchi:Nicol=ograve=.html">Nicol&ograve; Cesa-Bianchi</a>, <a href="../../indices/a-tree/f/Freund:Yoav.html">Yoav Freund</a>, <a href="../../indices/a-tree/h/Helmbold:David_P=.html">David P. Helmbold</a>, <a href="../../indices/a-tree/h/Haussler:David.html">David Haussler</a>, <a href="../../indices/a-tree/s/Schapire:Robert_E=.html">Robert E. Schapire</a>, <a href="../../indices/a-tree/w/Warmuth:Manfred_K=.html">Manfred K. Warmuth</a>:
<br><b>How to use expert advice.
</b>382-391<br><a href="http://doi.acm.org/10.1145/167088.167198"><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/Cesa-BianchiFHHSW93">BibTeX</a></font>

<li><a name="Kearns93" href="../../indices/a-tree/k/Kearns:Michael_J=.html">Michael J. Kearns</a>:
<br><b>Efficient noise-tolerant learning from statistical queries.
</b>392-401<br><a href="http://doi.acm.org/10.1145/167088.167200"><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/Kearns93">BibTeX</a></font>

<li><a name="PhillipsW93" href="../../indices/a-tree/p/Phillips:Steven.html">Steven Phillips</a>, <a href="../../indices/a-tree/w/Westbrook:Jeffery.html">Jeffery Westbrook</a>:
<br><b>Online load balancing and network flow.
</b>402-411<br><a href="http://doi.acm.org/10.1145/167088.167201"><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/PhillipsW93">BibTeX</a></font>

<li><a name="CoffmanJSW93" href="../../indices/a-tree/c/Coffman_Jr=:Edward_G=.html">Edward G. Coffman Jr.</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>, <a href="../../indices/a-tree/w/Weber:Richard_R=.html">Richard R. Weber</a>:
<br><b>Markov chains, computer proofs, and average-case analysis of best fit bin packing.
</b>412-421<br><a href="http://doi.acm.org/10.1145/167088.167203"><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/CoffmanJSW93">BibTeX</a></font>

<li><a name="BernGR93" href="../../indices/a-tree/b/Bern:Marshall_W=.html">Marshall W. Bern</a>, <a href="../../indices/a-tree/g/Greene:Daniel_H=.html">Daniel H. Greene</a>, <a href="../../indices/a-tree/r/Raghunathan:Arvind.html">Arvind Raghunathan</a>:
<br><b>On-line algorithms for cache sharing.
</b>422-430<br><a href="http://doi.acm.org/10.1145/167088.167205"><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/BernGR93">BibTeX</a></font>

<li><a name="BattistaV93" href="../../indices/a-tree/b/Battista:Giuseppe_Di.html">Giuseppe Di Battista</a>, <a href="../../indices/a-tree/v/Vismara:Luca.html">Luca Vismara</a>:
<br><b>Angles of planar triangular graphs.
</b>431-437<br><a href="http://doi.acm.org/10.1145/167088.167207"><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/BattistaV93">BibTeX</a></font>

<li><a name="RaviMRRH93" href="../../indices/a-tree/r/Ravi:R=.html">R. Ravi</a>, <a href="../../indices/a-tree/m/Marathe:Madhav_V=.html">Madhav V. Marathe</a>, <a href="../../indices/a-tree/r/Ravi:S=_S=.html">S. S. Ravi</a>, <a href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>, <a href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>:
<br><b>Many birds with one stone: multi-objective approximation algorithms.
</b>438-447<br><a href="http://doi.acm.org/10.1145/167088.167209"><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/RaviMRRH93">BibTeX</a></font>

<li><a name="LubyN93" href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>:
<br><b>A parallel approximation algorithm for positive linear programming.
</b>448-457<br><a href="http://doi.acm.org/10.1145/167088.167211"><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/LubyN93">BibTeX</a></font>

<li><a name="ChariRS93" 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>Randomness-optimal unique element isolation, with applications to perfect matching and related problems.
</b>458-467<br><a href="http://doi.acm.org/10.1145/167088.167213"><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/ChariRS93">BibTeX</a></font>

<li><a name="Fleischer93" href="../../indices/a-tree/f/Fleischer:Rudolf.html">Rudolf Fleischer</a>:
<br><b>Decision trees: old and new results.
</b>468-477<br><a href="http://doi.acm.org/10.1145/167088.167216"><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/Fleischer93">BibTeX</a></font>

<li><a name="MatousekS93" href="../../indices/a-tree/m/Matousek:Jir=iacute=.html">Jir&iacute; Matousek</a>, <a href="../../indices/a-tree/s/Schwarzkopf:Otfried.html">Otfried Schwarzkopf</a>:
<br><b>A deterministic algorithm for the three-dimensional diameter problem.
</b>478-484<br><a href="http://doi.acm.org/10.1145/167088.167217"><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/MatousekS93">BibTeX</a></font>

<li><a name="HershbergerS93" href="../../indices/a-tree/h/Hershberger:John.html">John Hershberger</a>, <a href="../../indices/a-tree/s/Suri:Subhash.html">Subhash Suri</a>:
<br><b>Matrix searching with the shortest path metric.
</b>485-494<br><a href="http://doi.acm.org/10.1145/167088.167220"><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/HershbergerS93">BibTeX</a></font>

<li><a name="ChazelleEGGSW93" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>, <a href="../../indices/a-tree/g/Grigni:Michelangelo.html">Michelangelo Grigni</a>, <a href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>, <a href="../../indices/a-tree/w/Welzl:Emo.html">Emo Welzl</a>:
<br><b>Improved bounds on weak epsilon-nets for convex sets.
</b>495-504<br><a href="http://doi.acm.org/10.1145/167088.167222"><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/ChazelleEGGSW93">BibTeX</a></font>

<li><a name="BergMS93" href="../../indices/a-tree/b/Berg:Mark_de.html">Mark de Berg</a>, <a href="../../indices/a-tree/m/Matousek:Jir=iacute=.html">Jir&iacute; Matousek</a>, <a href="../../indices/a-tree/s/Schwarzkopf:Otfried.html">Otfried Schwarzkopf</a>:
<br><b>Piecewise linear paths among convex obstacles.
</b>505-514<br><a href="http://doi.acm.org/10.1145/167088.167224"><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/BergMS93">BibTeX</a></font>

<li><a name="AllenderJ93" href="../../indices/a-tree/a/Allender:Eric.html">Eric Allender</a>, <a href="../../indices/a-tree/j/Jiao:Jia.html">Jia Jiao</a>:
<br><b>Depth reduction for noncommutative arithmetic circuits.
</b>515-522<br><a href="http://doi.acm.org/10.1145/167088.167226"><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/AllenderJ93">BibTeX</a></font>

<li><a name="PudlakR93" href="../../indices/a-tree/p/Pudl=aacute=k:Pavel.html">Pavel Pudl&aacute;k</a>, <a href="../../indices/a-tree/r/R=ouml=dl:Vojtech.html">Vojtech R&ouml;dl</a>:
<br><b>Modified ranks of tensors and the size of circuits.
</b>523-531<br><a href="http://doi.acm.org/10.1145/167088.167228"><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/PudlakR93">BibTeX</a></font>

<li><a name="KarchmerW93" href="../../indices/a-tree/k/Karchmer:Mauricio.html">Mauricio Karchmer</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>Characterizing non-deterministic circuit size.
</b>532-540<br><a href="http://doi.acm.org/10.1145/167088.167230"><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/KarchmerW93">BibTeX</a></font>

<li><a name="ImpagliazzoPS93" href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/p/Paturi:Ramamohan.html">Ramamohan Paturi</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>:
<br><b>Size-depth trade-offs for threshold circuits.
</b>541-550<br><a href="http://doi.acm.org/10.1145/167088.167233"><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/ImpagliazzoPS93">BibTeX</a></font>

<li><a name="GoldmannK93" href="../../indices/a-tree/g/Goldmann:Mikael.html">Mikael Goldmann</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>:
<br><b>Simulating threshold circuits by majority circuits.
</b>551-560<br><a href="http://doi.acm.org/10.1145/167088.167234"><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/GoldmannK93">BibTeX</a></font>

<li><a name="ColeMS93" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/m/Maggs:Bruce_M=.html">Bruce M. Maggs</a>, <a href="../../indices/a-tree/s/Sitaraman:Ramesh_K=.html">Ramesh K. Sitaraman</a>:
<br><b>Multi-scale self-simulation: a technique for reconfiguring arrays with faults.
</b>561-572<br><a href="http://doi.acm.org/10.1145/167088.167235"><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/ColeMS93">BibTeX</a></font>

<li><a name="BorodinRSU93" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>:
<br><b>How much can hardware help routing?
</b>573-582<br><a href="http://doi.acm.org/10.1145/167088.167237"><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/BorodinRSU93">BibTeX</a></font>

<li><a name="AlonCG93" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/c/Chung:Fan_R=_K=.html">Fan R. K. Chung</a>, <a href="../../indices/a-tree/g/Graham:Ronald_L=.html">Ronald L. Graham</a>:
<br><b>Routing permutations on graphs via matchings.
</b>583-591<br><a href="http://doi.acm.org/10.1145/167088.167239"><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/AlonCG93">BibTeX</a></font>

<li><a name="AlurHV93" href="../../indices/a-tree/a/Alur:Rajeev.html">Rajeev Alur</a>, <a href="../../indices/a-tree/h/Henzinger:Thomas_A=.html">Thomas A. Henzinger</a>, <a href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>:
<br><b>Parametric real-time reasoning.
</b>592-601<br><a href="http://doi.acm.org/10.1145/167088.167242"><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/AlurHV93">BibTeX</a></font>

<li><a name="Jones93" href="../../indices/a-tree/j/Jones:Neil_D=.html">Neil D. Jones</a>:
<br><b>Constant time factors do matter.
</b>602-611<br><a href="http://doi.acm.org/10.1145/167088.167244"><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/Jones93">BibTeX</a></font>

<li><a name="FederV93" href="../../indices/a-tree/f/Feder:Tom=aacute=s.html">Tom&aacute;s Feder</a>, <a href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>:
<br><b>Monotone monadic SNP and constraint satisfaction.
</b>612-622<br><a href="http://doi.acm.org/10.1145/167088.167245"><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/FederV93">BibTeX</a></font>

<li><a name="AspnesAFPW93" href="../../indices/a-tree/a/Aspnes:James.html">James Aspnes</a>, <a href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>, <a href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>, <a href="../../indices/a-tree/w/Waarts:Orli.html">Orli Waarts</a>:
<br><b>On-line load balancing with applications to machine scheduling and virtual circuit routing.
</b>623-631<br><a href="http://doi.acm.org/10.1145/167088.167248"><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/AspnesAFPW93">BibTeX</a></font>

<li><a name="AielloAMR93" href="../../indices/a-tree/a/Aiello:William.html">William Aiello</a>, <a href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/m/Maggs:Bruce_M=.html">Bruce M. Maggs</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>:
<br><b>Approximate load balancing on dynamic and asynchronous networks.
</b>632-641<br><a href="http://doi.acm.org/10.1145/167088.167250"><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/AielloAMR93">BibTeX</a></font>

<li><a name="FeldmannKST93" href="../../indices/a-tree/f/Feldmann:Anja.html">Anja Feldmann</a>, <a href="../../indices/a-tree/k/Kao:Ming=Yang.html">Ming-Yang Kao</a>, <a href="../../indices/a-tree/s/Sgall:Jiri.html">Jiri Sgall</a>, <a href="../../indices/a-tree/t/Teng:Shang=Hua.html">Shang-Hua Teng</a>:
<br><b>Optimal online scheduling of parallel jobs with dependencies.
</b>642-651<br><a href="http://doi.acm.org/10.1145/167088.167254"><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/FeldmannKST93">BibTeX</a></font>

<li><a name="AwerbuchKMPV93" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/k/Kutten:Shay.html">Shay Kutten</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/p/Patt=Shamir:Boaz.html">Boaz Patt-Shamir</a>, <a href="../../indices/a-tree/v/Varghese:George.html">George Varghese</a>:
<br><b>Time optimal self-stabilizing synchronization.
</b>652-661<br><a href="http://doi.acm.org/10.1145/167088.167256"><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/AwerbuchKMPV93">BibTeX</a></font>

<li><a name="CooperL93" href="../../indices/a-tree/c/Cooper:Jason.html">Jason Cooper</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>:
<br><b>Fast perfection-information leader-election protocol with linear immunity.
</b>662-671<br><a href="http://doi.acm.org/10.1145/167088.167258"><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/CooperL93">BibTeX</a></font>

<li><a name="RackoffS93" href="../../indices/a-tree/r/Rackoff:Charles.html">Charles Rackoff</a>, <a href="../../indices/a-tree/s/Simon:Daniel_R=.html">Daniel R. Simon</a>:
<br><b>Cryptographic defense against traffic analysis.
</b>672-681<br><a href="http://doi.acm.org/10.1145/167088.167260"><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/RackoffS93">BibTeX</a></font>

<li><a name="KleinPR93" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>:
<br><b>Excluded minors, network decomposition, and multicommodity flow.
</b>682-690<br><a href="http://doi.acm.org/10.1145/167088.167261"><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/KleinPR93">BibTeX</a></font>

<li><a name="PlotkinT93" href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">&Eacute;va Tardos</a>:
<br><b>Improved bounds on the max-flow min-cut ratio for multicommodity flows.
</b>691-697<br><a href="http://doi.acm.org/10.1145/167088.167263"><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/PlotkinT93">BibTeX</a></font>

<li><a name="GargVY93" href="../../indices/a-tree/g/Garg:Naveen.html">Naveen Garg</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>:
<br><b>Approximate max-flow min-(multi)cut theorems and their applications.
</b>698-707<br><a href="http://doi.acm.org/10.1145/167088.167266"><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/GargVY93">BibTeX</a></font>

<li><a name="WilliamsonGMV93" href="../../indices/a-tree/w/Williamson:David_P=.html">David P. Williamson</a>, <a href="../../indices/a-tree/g/Goemans:Michel_X=.html">Michel X. Goemans</a>, <a href="../../indices/a-tree/m/Mihail:Milena.html">Milena Mihail</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>:
<br><b>A primal-dual approximation algorithm for generalized Steiner network problems.
</b>708-717<br><a href="http://doi.acm.org/10.1145/167088.167268"><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/WilliamsonGMV93">BibTeX</a></font>

<li><a name="Edmonds93" href="../../indices/a-tree/e/Edmonds:Jeff.html">Jeff Edmonds</a>:
<br><b>Time-space trade-offs for undirected st-connectivity on a JAG.
</b>718-727<br><a href="http://doi.acm.org/10.1145/167088.167272"><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/Edmonds93">BibTeX</a></font>

<li><a name="BarnesF93" href="../../indices/a-tree/b/Barnes:Greg.html">Greg Barnes</a>, <a href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>:
<br><b>Short random walks on graphs.
</b>728-737<br><a href="http://doi.acm.org/10.1145/167088.167275"><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/BarnesF93">BibTeX</a></font>

<li><a name="KenyonRS93" href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/r/Randall:Dana.html">Dana Randall</a>, <a href="../../indices/a-tree/s/Sinclair:Alistair.html">Alistair Sinclair</a>:
<br><b>Matchings in lattice graphs.
</b>738-746<br><a href="http://doi.acm.org/10.1145/167088.167278"><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/KenyonRS93">BibTeX</a></font>

<li><a name="Schulman93" href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>:
<br><b>Deterministic coding for interactive communication.
</b>747-756<br><a href="http://doi.acm.org/10.1145/167088.167279"><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/Schulman93">BibTeX</a></font>

<li><a name="KargerS93" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/s/Stein:Clifford.html">Clifford Stein</a>:
<br><b>An O~(n<sup>2</sup>) algorithm for minimum cuts.
</b>757-765<br><a href="http://doi.acm.org/10.1145/167088.167281"><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/KargerS93">BibTeX</a></font>

<li><a name="ParkP93" href="../../indices/a-tree/p/Park:James_K=.html">James K. Park</a>, <a href="../../indices/a-tree/p/Phillips:Cynthia_A=.html">Cynthia A. Phillips</a>:
<br><b>Finding minimum-quotient cuts in planar graphs.
</b>766-775<br><a href="http://doi.acm.org/10.1145/167088.167284"><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/ParkP93">BibTeX</a></font>

<li><a name="Phillips93" href="../../indices/a-tree/p/Phillips:Cynthia_A=.html">Cynthia A. Phillips</a>:
<br><b>The network inhibition problem.
</b>776-785<br><a href="http://doi.acm.org/10.1145/167088.167286"><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/Phillips93">BibTeX</a></font>

<li><a name="ArBCG93" href="../../indices/a-tree/a/Ar:Sigal.html">Sigal Ar</a>, <a href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/c/Codenotti:Bruno.html">Bruno Codenotti</a>, <a href="../../indices/a-tree/g/Gemmell:Peter.html">Peter Gemmell</a>:
<br><b>Checking approximate computations over the reals.
</b>786-795<br><a href="http://doi.acm.org/10.1145/167088.167288"><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/ArBCG93">BibTeX</a></font>

<li><a name="Shamir93" href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>:
<br><b>On the generation of multivariate polynomials which are hard to factor.
</b>796-804<br><a href="http://doi.acm.org/10.1145/167088.167291"><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/Shamir93">BibTeX</a></font>

<li><a name="GathenKS93" href="../../indices/a-tree/g/Gathen:Joachim_von_zur.html">Joachim von zur Gathen</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>, <a href="../../indices/a-tree/s/Shparlinski:Igor.html">Igor Shparlinski</a>:
<br><b>Counting curves and their projections.
</b>805-812<br><a href="http://doi.acm.org/10.1145/167088.167292"><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/GathenKS93">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