stoc1995.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1995</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>27. <a href="index.html">STOC</a> 1995:
Las Vegas,
NV,
USA</h1> Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA.
ACM 1995 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/STOC27">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/stoc/STOC27,
title = {Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA},
booktitle = {STOC},
publisher = {ACM},
year = {1995},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<ul>
<li><a name="KhullerR95" href="../../indices/a-tree/k/Khuller:Samir.html">Samir Khuller</a>, <a href="../../indices/a-tree/r/Raghavachari:Balaji.html">Balaji Raghavachari</a>:
<br><b>Improved approximation algorithms for uniform connectivity problems.
</b>1-10<br><a href="http://doi.acm.org/10.1145/225058.225066"><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/KhullerR95">BibTeX</a></font>
<li><a name="Karger95" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>:
<br><b>A randomized fully polynomial time approximation scheme for the all terminal network reliability problem.
</b>11-17<br><a href="http://doi.acm.org/10.1145/225058.225069"><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/Karger95">BibTeX</a></font>
<li><a name="KargerP95" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>:
<br><b>Adding multiple cost constraints to combinatorial optimization problems, with applications to multicommodity flows.
</b>18-25<br><a href="http://doi.acm.org/10.1145/225058.225073"><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/KargerP95">BibTeX</a></font>
<li><a name="KleinbergT95" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>:
<br><b>Approximations for the disjoint paths problem in high-diameter planar networks.
</b>26-35<br><a href="http://doi.acm.org/10.1145/225058.225075"><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/KleinbergT95">BibTeX</a></font>
<li><a name="FranklinY95" href="../../indices/a-tree/f/Franklin:Matthew_K=.html">Matthew K. Franklin</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>:
<br><b>Secure hypergraphs: privacy from partial broadcast (Extended Abstract).
</b>36-44<br><a href="http://doi.acm.org/10.1145/225058.225077"><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/FranklinY95">BibTeX</a></font>
<li><a name="BellareGG95" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>:
<br><b>Incremental cryptography and application to virus protection.
</b>45-56<br><a href="http://doi.acm.org/10.1145/225058.225080"><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/BellareGG95">BibTeX</a></font>
<li><a name="BellareR95" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/r/Rogaway:Phillip.html">Phillip Rogaway</a>:
<br><b>Provably secure session key distribution: the three party case.
</b>57-66<br><a href="http://doi.acm.org/10.1145/225058.225084"><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/BellareR95">BibTeX</a></font>
<li><a name="Yao95" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>:
<br><b>Security of quantum protocols against coherent measurements.
</b>67-75<br><a href="http://doi.acm.org/10.1145/225058.225085"><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/Yao95">BibTeX</a></font>
<li><a name="LovaszW95" href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>, <a href="../../indices/a-tree/w/Winkler:Peter.html">Peter Winkler</a>:
<br><b>Efficient stopping rules for Markov chains.
</b>76-82<br><a href="http://doi.acm.org/10.1145/225058.225086"><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/LovaszW95">BibTeX</a></font>
<li><a name="RabaniRS95" href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>, <a href="../../indices/a-tree/r/Rabinovich:Yuri.html">Yuri Rabinovich</a>, <a href="../../indices/a-tree/s/Sinclair:Alistair.html">Alistair Sinclair</a>:
<br><b>A computational view of population genetics.
</b>83-92<br><a href="http://doi.acm.org/10.1145/225058.225088"><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/RabaniRS95">BibTeX</a></font>
<li><a name="KaplanT95" href="../../indices/a-tree/k/Kaplan:Haim.html">Haim Kaplan</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>:
<br><b>Persistent lists with catenation via recursive slow-down.
</b>93-102<br><a href="http://doi.acm.org/10.1145/225058.225090"><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/KaplanT95">BibTeX</a></font>
<li><a name="MiltersenNSW95" href="../../indices/a-tree/m/Miltersen:Peter_Bro.html">Peter Bro Miltersen</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/s/Safra:Shmuel.html">Shmuel Safra</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>On data structures and asymmetric communication complexity.
</b>103-111<br><a href="http://doi.acm.org/10.1145/225058.225093"><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/MiltersenNSW95">BibTeX</a></font>
<li><a name="DiaconisS95" href="../../indices/a-tree/d/Diaconis:Persi.html">Persi Diaconis</a>, <a href="../../indices/a-tree/s/Saloff=Coste:Laurent.html">Laurent Saloff-Coste</a>:
<br><b>What do we know about the Metropolis algorithm?
</b>112-129<br><a href="http://doi.acm.org/10.1145/225058.225095"><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/DiaconisS95">BibTeX</a></font>
<li><a name="Ponzio95" href="../../indices/a-tree/p/Ponzio:Stephen.html">Stephen Ponzio</a>:
<br><b>A lower bound for integer multiplication with read-once branching programs.
</b>130-139<br><a href="http://doi.acm.org/10.1145/225058.225098"><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/Ponzio95">BibTeX</a></font>
<li><a name="NisanT95" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>:
<br><b>Symmetric logspace is closed under complement.
</b>140-146<br><a href="http://doi.acm.org/10.1145/225058.225101"><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/NisanT95">BibTeX</a></font>
<li><a name="EdmondsP95" href="../../indices/a-tree/e/Edmonds:Jeff.html">Jeff Edmonds</a>, <a href="../../indices/a-tree/p/Poon:Chung_Keung.html">Chung Keung Poon</a>:
<br><b>A nearly optimal time-space lower bound for directed <i>st</i>-connectivity on the NNJAG model.
</b>147-156<br><a href="http://doi.acm.org/10.1145/225058.225103"><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/EdmondsP95">BibTeX</a></font>
<li><a name="HartI95" href="../../indices/a-tree/h/Hart:William_E=.html">William E. Hart</a>, <a href="../../indices/a-tree/i/Istrail:Sorin.html">Sorin Istrail</a>:
<br><b>Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract).
</b>157-168<br><a href="http://doi.acm.org/10.1145/225058.225106"><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/HartI95">BibTeX</a></font>
<li><a name="KosarajuD95" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>, <a href="../../indices/a-tree/d/Delcher:Arthur_L=.html">Arthur L. Delcher</a>:
<br><b>Large-scale assembly of DNA strings and space-efficient construction of suffix trees.
</b>169-177<br><a href="http://doi.acm.org/10.1145/225058.225108"><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/KosarajuD95">BibTeX</a></font>
<li><a name="HannenhalliP95" href="../../indices/a-tree/h/Hannenhalli:Sridhar.html">Sridhar Hannenhalli</a>, <a href="../../indices/a-tree/p/Pevzner:Pavel_A=.html">Pavel A. Pevzner</a>:
<br><b>Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals.
</b>178-189<br><a href="http://doi.acm.org/10.1145/225058.225112"><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/HannenhalliP95">BibTeX</a></font>
<li><a name="HellersteinPRW95" href="../../indices/a-tree/h/Hellerstein:Lisa.html">Lisa Hellerstein</a>, <a href="../../indices/a-tree/p/Pillaipakkamnatt:Krishnan.html">Krishnan Pillaipakkamnatt</a>, <a href="../../indices/a-tree/r/Raghavan:Vijay_V=.html">Vijay V. Raghavan</a>, <a href="../../indices/a-tree/w/Wilkins:Dawn.html">Dawn Wilkins</a>:
<br><b>How many queries are needed to learn?
</b>190-199<br><a href="http://doi.acm.org/10.1145/225058.225114"><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/HellersteinPRW95">BibTeX</a></font>
<li><a name="KarpinskiM95" href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>, <a href="../../indices/a-tree/m/Macintyre:Angus.html">Angus Macintyre</a>:
<br><b>Polynomial bounds for VC dimension of sigmoidal neural networks.
</b>200-208<br><a href="http://doi.acm.org/10.1145/225058.225118"><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/KarpinskiM95">BibTeX</a></font>
<li><a name="KivinenW95" href="../../indices/a-tree/k/Kivinen:Jyrki.html">Jyrki Kivinen</a>, <a href="../../indices/a-tree/w/Warmuth:Manfred_K=.html">Manfred K. Warmuth</a>:
<br><b>Additive versus exponentiated gradient updates for linear prediction.
</b>209-218<br><a href="http://doi.acm.org/10.1145/225058.225121"><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/KivinenW95">BibTeX</a></font>
<li><a name="BshoutyT95" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>, <a href="../../indices/a-tree/t/Tamon:Christino.html">Christino Tamon</a>:
<br><b>On the Fourier spectrum of monotone functions (Extended Abstract).
</b>219-228<br><a href="http://doi.acm.org/10.1145/225058.225125"><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/BshoutyT95">BibTeX</a></font>
<li><a name="RaghavanU95" 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>Stochastic contention resolution with short delays.
</b>229-237<br><a href="http://doi.acm.org/10.1145/225058.225129"><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/RaghavanU95">BibTeX</a></font>
<li><a name="AdlerCMR95" href="../../indices/a-tree/a/Adler:Micah.html">Micah Adler</a>, <a href="../../indices/a-tree/c/Chakrabarti:Soumen.html">Soumen Chakrabarti</a>, <a href="../../indices/a-tree/m/Mitzenmacher:Michael.html">Michael Mitzenmacher</a>, <a href="../../indices/a-tree/r/Rasmussen:Lars_Eilstrup.html">Lars Eilstrup Rasmussen</a>:
<br><b>Parallel randomized load balancing (Preliminary Version).
</b>238-247<br><a href="http://doi.acm.org/10.1145/225058.225131"><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/AdlerCMR95">BibTeX</a></font>
<li><a name="Harchol-BalterW95" href="../../indices/a-tree/h/Harchol=Balter:Mor.html">Mor Harchol-Balter</a>, <a href="../../indices/a-tree/w/Wolfe:David.html">David Wolfe</a>:
<br><b>Bounding delays in packet-routing networks.
</b>248-257<br><a href="http://doi.acm.org/10.1145/225058.225133"><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/Harchol-BalterW95">BibTeX</a></font>
<li><a name="MansourP95" 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>:
<br><b>Many-to-one packet routing on grids (Extended Abstract).
</b>258-267<br><a href="http://doi.acm.org/10.1145/225058.225136"><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/MansourP95">BibTeX</a></font>
<li><a name="Srinivasan95" href="../../indices/a-tree/s/Srinivasan:Aravind.html">Aravind Srinivasan</a>:
<br><b>Improved approximations of packing and covering problems.
</b>268-276<br><a href="http://doi.acm.org/10.1145/225058.225138"><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/Srinivasan95">BibTeX</a></font>
<li><a name="AwerbuchABV95" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>, <a href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>:
<br><b>Improved approximation guarantees for minimum-weight <i>k</i>-trees and prize-collecting salesmen.
</b>277-283<br><a href="http://doi.acm.org/10.1145/225058.225139"><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/AwerbuchABV95">BibTeX</a></font>
<li><a name="AroraKK95" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>:
<br><b>Polynomial time approximation schemes for dense instances of <i>NP</i>-hard problems.
</b>284-293<br><a href="http://doi.acm.org/10.1145/225058.225140"><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/AroraKK95">BibTeX</a></font>
<li><a name="BlumCV95" 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/v/Vempala:Santosh.html">Santosh Vempala</a>:
<br><b>A constant-factor approximation for the <i>k</i>-MST problem in the plane.
</b>294-302<br><a href="http://doi.acm.org/10.1145/225058.225143"><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/BlumCV95">BibTeX</a></font>
<li><a name="BeameCEIP95" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>, <a href="../../indices/a-tree/e/Edmonds:Jeff.html">Jeff Edmonds</a>, <a href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>:
<br><b>The relative complexity of NP search problems.
</b>303-314<br><a href="http://doi.acm.org/10.1145/225058.225147"><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/BeameCEIP95">BibTeX</a></font>
<li><a name="GradelM95" href="../../indices/a-tree/g/Gr=auml=del:Erich.html">Erich Grädel</a>, <a href="../../indices/a-tree/m/Meer:Klaus.html">Klaus Meer</a>:
<br><b>Descriptive complexity theory over the real numbers.
</b>315-324<br><a href="http://doi.acm.org/10.1145/225058.225151"><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/GradelM95">BibTeX</a></font>
<li><a name="Wang95" href="../../indices/a-tree/w/Wang:Jie.html">Jie Wang</a>:
<br><b>Average-case completeness of a word problem for groups.
</b>325-334<br><a href="http://doi.acm.org/10.1145/225058.225153"><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/Wang95">BibTeX</a></font>
<li><a name="CuckerKKLW95" href="../../indices/a-tree/c/Cucker:Felipe.html">Felipe Cucker</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>, <a href="../../indices/a-tree/k/Koiran:Pascal.html">Pascal Koiran</a>, <a href="../../indices/a-tree/l/Lickteig:Thomas.html">Thomas Lickteig</a>, <a href="../../indices/a-tree/w/Werther:Kai.html">Kai Werther</a>:
<br><b>On real Turing machines that toss coins.
</b>335-342<br><a href="http://doi.acm.org/10.1145/225058.225155"><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/CuckerKKLW95">BibTeX</a></font>
<li><a name="AgarwalRT95" href="../../indices/a-tree/a/Agarwal:Pankaj_K=.html">Pankaj K. Agarwal</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/t/Tamaki:Hisao.html">Hisao Tamaki</a>:
<br><b>Motion planning for a steering-constrained robot through moderate obstacles.
</b>343-352<br><a href="http://doi.acm.org/10.1145/225058.225158"><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/AgarwalRT95">BibTeX</a></font>
<li><a name="KavrakiLMR95" href="../../indices/a-tree/k/Kavraki:Lydia_E=.html">Lydia E. Kavraki</a>, <a href="../../indices/a-tree/l/Latombe:Jean=Claude.html">Jean-Claude Latombe</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>:
<br><b>Randomized query processing in robot path planning (Extended Abstract).
</b>353-362<br><a href="http://doi.acm.org/10.1145/225058.225159"><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/KavrakiLMR95">BibTeX</a></font>
<li><a name="AlurCY95" href="../../indices/a-tree/a/Alur:Rajeev.html">Rajeev Alur</a>, <a href="../../indices/a-tree/c/Courcoubetis:Costas.html">Costas Courcoubetis</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>:
<br><b>Distinguishing tests for nondeterministic and probabilistic machines.
</b>363-372<br><a href="http://doi.acm.org/10.1145/225058.225161"><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/AlurCY95">BibTeX</a></font>
<li><a name="HenzingerKPV95" href="../../indices/a-tree/h/Henzinger:Thomas_A=.html">Thomas A. Henzinger</a>, <a href="../../indices/a-tree/k/Kopke:Peter_W=.html">Peter W. Kopke</a>, <a href="../../indices/a-tree/p/Puri:Anuj.html">Anuj Puri</a>, <a href="../../indices/a-tree/v/Varaiya:Pravin.html">Pravin Varaiya</a>:
<br><b>What's decidable about hybrid automata?
</b>373-382<br><a href="http://doi.acm.org/10.1145/225058.225162"><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/HenzingerKPV95">BibTeX</a></font>
<li><a name="Pulleyblank95" href="../../indices/a-tree/p/Pulleyblank:William_R=.html">William R. Pulleyblank</a>:
<br><b>Two Steiner tree packing problems (Extended Abstract).
</b>383-387<br><a href="http://doi.acm.org/10.1145/225058.225163"><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/Pulleyblank95">BibTeX</a></font>
<li><a name="Spielman95" href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>:
<br><b>Linear-time encodable and decodable error-correcting codes.
</b>388-397<br><a href="http://doi.acm.org/10.1145/225058.225165"><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/Spielman95">BibTeX</a></font>
<li><a name="KaltofenS95" href="../../indices/a-tree/k/Kaltofen:Erich.html">Erich Kaltofen</a>, <a href="../../indices/a-tree/s/Shoup:Victor.html">Victor Shoup</a>:
<br><b>Subquadratic-time factoring of polynomials over finite fields.
</b>398-406<br><a href="http://doi.acm.org/10.1145/225058.225166"><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/KaltofenS95">BibTeX</a></font>
<li><a name="Ergun95" href="../../indices/a-tree/e/Erg=uuml=n:Funda.html">Funda Ergün</a>:
<br><b>Testing multivariate linear functions: overcoming the generator bottleneck.
</b>407-416<br><a href="http://doi.acm.org/10.1145/225058.225167"><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/Ergun95">BibTeX</a></font>
<li><a name="AnderssonHP95" href="../../indices/a-tree/a/Andersson:Arne.html">Arne Andersson</a>, <a href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>, <a href="../../indices/a-tree/p/Petersson:Ola.html">Ola Petersson</a>:
<br><b>A tight lower bound for searching a sorted array.
</b>417-426<br><a href="http://doi.acm.org/10.1145/225058.225171"><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/AnderssonHP95">BibTeX</a></font>
<li><a name="AnderssonHNR95" 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/n/Nilsson:Stefan.html">Stefan Nilsson</a>, <a href="../../indices/a-tree/r/Raman:Rajeev.html">Rajeev Raman</a>:
<br><b>Sorting in linear time?
</b>427-436<br><a href="http://doi.acm.org/10.1145/225058.225173"><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/AnderssonHNR95">BibTeX</a></font>
<li><a name="KahaleLMPSS95" href="../../indices/a-tree/k/Kahale:Nabil.html">Nabil Kahale</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/Ma:Yuan.html">Yuan Ma</a>, <a href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>, <a href="../../indices/a-tree/s/Suel:Torsten.html">Torsten Suel</a>, <a href="../../indices/a-tree/s/Szemer=eacute=di:Endre.html">Endre Szemerédi</a>:
<br><b>Lower bounds for sorting networks.
</b>437-446<br><a href="http://doi.acm.org/10.1145/225058.225178"><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/KahaleLMPSS95">BibTeX</a></font>
<li><a name="Raz95" href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>:
<br><b>A parallel repetition theorem.
</b>447-456<br><a href="http://doi.acm.org/10.1145/225058.225181"><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/Raz95">BibTeX</a></font>
<li><a name="FeigeK95" 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>Impossibility results for recycling random bits in two-prover proof systems.
</b>457-468<br><a href="http://doi.acm.org/10.1145/225058.225183"><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/FeigeK95">BibTeX</a></font>
<li><a name="AielloBV95" href="../../indices/a-tree/a/Aiello:William.html">William Aiello</a>, <a href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/v/Venkatesan:Ramarathnam.html">Ramarathnam Venkatesan</a>:
<br><b>Knowledge on the average-perfect, statistical and logarithmic.
</b>469-478<br><a href="http://doi.acm.org/10.1145/225058.225186"><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/AielloBV95">BibTeX</a></font>
<li><a name="SaksSZ95" href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/s/Srinivasan:Aravind.html">Aravind Srinivasan</a>, <a href="../../indices/a-tree/z/Zhou:Shiyu.html">Shiyu Zhou</a>:
<br><b>Explicit dispersers with polylog degree.
</b>479-488<br><a href="http://doi.acm.org/10.1145/225058.225188"><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/SaksSZ95">BibTeX</a></font>
<li><a name="AryaDMSS95" href="../../indices/a-tree/a/Arya:Sunil.html">Sunil Arya</a>, <a href="../../indices/a-tree/d/Das:Gautam.html">Gautam Das</a>, <a href="../../indices/a-tree/m/Mount:David_M=.html">David M. Mount</a>, <a href="../../indices/a-tree/s/Salowe:Jeffrey_S=.html">Jeffrey S. Salowe</a>, <a href="../../indices/a-tree/s/Smid:Michiel_H=_M=.html">Michiel H. M. Smid</a>:
<br><b>Euclidean spanners: short, thin, and lanky.
</b>489-498<br><a href="http://doi.acm.org/10.1145/225058.225191"><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/AryaDMSS95">BibTeX</a></font>
<li><a name="GalilY95" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/y/Yu:Xiangdong.html">Xiangdong Yu</a>:
<br><b>Short length versions of Menger's theorem (Extended Abstract).
</b>499-508<br><a href="http://doi.acm.org/10.1145/225058.225267"><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/GalilY95">BibTeX</a></font>
<li><a name="DinitzN95" href="../../indices/a-tree/d/Dinitz:Yefim.html">Yefim Dinitz</a>, <a href="../../indices/a-tree/n/Nutov:Zeev.html">Zeev Nutov</a>:
<br><b>A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance.
</b>509-518<br><a href="http://doi.acm.org/10.1145/225058.225268"><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/DinitzN95">BibTeX</a></font>
<li><a name="HenzingerK95" href="../../indices/a-tree/h/Henzinger:Monika_Rauch.html">Monika Rauch Henzinger</a>, <a href="../../indices/a-tree/k/King:Valerie.html">Valerie King</a>:
<br><b>Randomized dynamic graph algorithms with polylogarithmic time per operation.
</b>519-527<br><a href="http://doi.acm.org/10.1145/225058.225269"><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/HenzingerK95">BibTeX</a></font>
<li><a name="DolevKKP95" href="../../indices/a-tree/d/Dolev:Shlomi.html">Shlomi Dolev</a>, <a href="../../indices/a-tree/k/Kranakis:Evangelos.html">Evangelos Kranakis</a>, <a href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>:
<br><b>Bubbles: adaptive routing scheme for high-speed dynamic networks (Extended Abstract).
</b>528-537<br><a href="http://doi.acm.org/10.1145/225058.225270"><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/DolevKKP95">BibTeX</a></font>
<li><a name="AfekDT95" href="../../indices/a-tree/a/Afek:Yehuda.html">Yehuda Afek</a>, <a href="../../indices/a-tree/d/Dauber:Dalia.html">Dalia Dauber</a>, <a href="../../indices/a-tree/t/Touitou:Dan.html">Dan Touitou</a>:
<br><b>Wait-free made fast (Extended Abstract).
</b>538-547<br><a href="http://doi.acm.org/10.1145/225058.225271"><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/AfekDT95">BibTeX</a></font>
<li><a name="GhoshLMMPRRTZ95" href="../../indices/a-tree/g/Ghosh:Bhaskar.html">Bhaskar Ghosh</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/Maggs:Bruce_M=.html">Bruce M. Maggs</a>, <a href="../../indices/a-tree/m/Muthukrishnan:S=.html">S. Muthukrishnan</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>, <a href="../../indices/a-tree/r/Richa:Andr=eacute=a_W=.html">Andréa W. Richa</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>:
<br><b>Tight analyses of two local load balancing algorithms.
</b>548-558<br><a href="http://doi.acm.org/10.1145/225058.225272"><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/GhoshLMMPRRTZ95">BibTeX</a></font>
<li><a name="KushilevitzOR95" href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>, <a href="../../indices/a-tree/r/Ros=eacute=n:Adi.html">Adi Rosén</a>:
<br><b>Log-space polynomial end-to-end communication.
</b>559-568<br><a href="http://doi.acm.org/10.1145/225058.225273"><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/KushilevitzOR95">BibTeX</a></font>
<li><a name="GoldmannH95" href="../../indices/a-tree/g/Goldmann:Mikael.html">Mikael Goldmann</a>, <a href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>:
<br><b>Monotone circuits for connectivity have depth (log n)<sup>2-o(1)</sup> (Extended Abstract).
</b>569-574<br><a href="http://doi.acm.org/10.1145/225058.225274"><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/GoldmannH95">BibTeX</a></font>
<li><a name="BonetPR95" href="../../indices/a-tree/b/Bonet:Maria_Luisa.html">Maria Luisa Bonet</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>, <a href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>:
<br><b>Lower bounds for cutting planes proofs with small coefficients.
</b>575-584<br><a href="http://doi.acm.org/10.1145/225058.225275"><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/BonetPR95">BibTeX</a></font>
<li><a name="BealsNT95" href="../../indices/a-tree/b/Beals:Robert.html">Robert Beals</a>, <a href="../../indices/a-tree/n/Nishino:Tetsuro.html">Tetsuro Nishino</a>, <a href="../../indices/a-tree/t/Tanaka:Keisuke.html">Keisuke Tanaka</a>:
<br><b>More on the complexity of negation-limited circuits.
</b>585-595<br><a href="http://doi.acm.org/10.1145/225058.225276"><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/BealsNT95">BibTeX</a></font>
<li><a name="KremerNR95" href="../../indices/a-tree/k/Kremer:Ilan.html">Ilan Kremer</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>:
<br><b>On randomized one-round communication complexity.
</b>596-605<br><a href="http://doi.acm.org/10.1145/225058.225277"><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/KremerNR95">BibTeX</a></font>
<li><a name="CanettiI95" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/i/Irani:Sandy.html">Sandy Irani</a>:
<br><b>Bounding the power of preemption in randomized scheduling.
</b>606-615<br><a href="http://doi.acm.org/10.1145/225058.225278"><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/CanettiI95">BibTeX</a></font>
<li><a name="Bar-NoyCKMS95" href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>, <a href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</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/s/Schieber:Baruch.html">Baruch Schieber</a>:
<br><b>Bandwidth allocation with preemption.
</b>616-625<br><a href="http://doi.acm.org/10.1145/225058.225279"><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/Bar-NoyCKMS95">BibTeX</a></font>
<li><a name="FiatK95" href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>:
<br><b>Randomized and multipointer paging with locality of reference.
</b>626-634<br><a href="http://doi.acm.org/10.1145/225058.225280"><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/FiatK95">BibTeX</a></font>
<li><a name="Feige95" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>:
<br><b>Randomized graph products, chromatic numbers, and Lovasz theta-function.
</b>635-640<br><a href="http://doi.acm.org/10.1145/225058.225281"><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/Feige95">BibTeX</a></font>
<li><a name="BorchersD95" href="../../indices/a-tree/b/Borchers:Al.html">Al Borchers</a>, <a href="../../indices/a-tree/d/Du:Ding=Zhu.html">Ding-Zhu Du</a>:
<br><b>The k-Steiner ratio in graphs.
</b>641-649<br><a href="http://doi.acm.org/10.1145/225058.225282"><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/BorchersD95">BibTeX</a></font>
<li><a name="RaschleS95" href="../../indices/a-tree/r/Raschle:Thomas.html">Thomas Raschle</a>, <a href="../../indices/a-tree/s/Simon:Klaus.html">Klaus Simon</a>:
<br><b>Recognition of graphs with threshold dimension two.
</b>650-661<br><a href="http://doi.acm.org/10.1145/225058.225283"><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/RaschleS95">BibTeX</a></font>
<li><a name="Eppstein95" href="../../indices/a-tree/e/Eppstein:David.html">David Eppstein</a>:
<br><b>Geometric lower bounds for parametric matroid optimization.
</b>662-671<br><a href="http://doi.acm.org/10.1145/225058.225284"><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/Eppstein95">BibTeX</a></font>
<li><a name="AmatoGR95" href="../../indices/a-tree/a/Amato:Nancy_M=.html">Nancy M. Amato</a>, <a href="../../indices/a-tree/g/Goodrich:Michael_T=.html">Michael T. Goodrich</a>, <a href="../../indices/a-tree/r/Ramos:Edgar_A=.html">Edgar A. Ramos</a>:
<br><b>Computing faces in segment and simplex arrangements (Preliminary Version).
</b>672-682<br><a href="http://doi.acm.org/10.1145/225058.225285"><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/AmatoGR95">BibTeX</a></font>
<li><a name="MillerTTW95" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/t/Talmor:Dafna.html">Dafna Talmor</a>, <a href="../../indices/a-tree/t/Teng:Shang=Hua.html">Shang-Hua Teng</a>, <a href="../../indices/a-tree/w/Walkington:Noel.html">Noel Walkington</a>:
<br><b>A Delaunay based numerical method for three dimensions: generation, formulation, and partition.
</b>683-692<br><a href="http://doi.acm.org/10.1145/225058.225286"><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/MillerTTW95">BibTeX</a></font>
<li><a name="FerraginaG95" href="../../indices/a-tree/f/Ferragina:Paolo.html">Paolo Ferragina</a>, <a href="../../indices/a-tree/g/Grossi:Roberto.html">Roberto Grossi</a>:
<br><b>A fully-dynamic data structure for external substring search (Extended Abstract).
</b>693-702<br><a href="http://doi.acm.org/10.1145/225058.225287"><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/FerraginaG95">BibTeX</a></font>
<li><a name="FarachT95" href="../../indices/a-tree/f/Farach:Martin.html">Martin Farach</a>, <a href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>:
<br><b>String matching in Lempel-Ziv compressed strings.
</b>703-712<br><a href="http://doi.acm.org/10.1145/225058.225288"><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/FarachT95">BibTeX</a></font>
<li><a name="CzumajGGPP95" href="../../indices/a-tree/c/Czumaj:Artur.html">Artur Czumaj</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/g/Gasieniec:Leszek.html">Leszek Gasieniec</a>, <a href="../../indices/a-tree/p/Park:Kunsoo.html">Kunsoo Park</a>, <a href="../../indices/a-tree/p/Plandowski:Wojciech.html">Wojciech Plandowski</a>:
<br><b>Work-time-optimal parallel algorithms for string problems.
</b>713-722<br><a href="http://doi.acm.org/10.1145/225058.225289"><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/CzumajGGPP95">BibTeX</a></font>
<li><a name="NisanW95" 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>On the complexity of bilinear forms: dedicated to the memory of Jacques Morgenstern.
</b>723-732<br><a href="http://doi.acm.org/10.1145/225058.225290"><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/NisanW95">BibTeX</a></font>
<li><a name="Chazelle95" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>:
<br><b>Lower bounds for off-line range searching.
</b>733-740<br><a href="http://doi.acm.org/10.1145/225058.225291"><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/Chazelle95">BibTeX</a></font>
<li><a name="Pan95" href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>:
<br><b>Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros.
</b>741-750<br><a href="http://doi.acm.org/10.1145/225058.225292"><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/Pan95">BibTeX</a></font>
<li><a name="Reif95" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>:
<br><b>Work efficient parallel solution of Toeplitz systems and polynomial GCD.
</b>751-761<br><a href="http://doi.acm.org/10.1145/225058.225293"><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/Reif95">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: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>
SIGMOD News
