stoc1996.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1996</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>28. <a href="index.html">STOC</a> 1996: Philadephia, Pennsylvania, USA</h1> Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996. ACM, 1996, ISBN 0-89791-785-5 <h2>Session 1A</h2> <ul> <li><a name="KushilevitzLO96" href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>: <br><b>The Linear-Array Conjecture in Communication Complexity is False. </b>1-10<br><a href="http://doi.acm.org/10.1145/237814.237817"><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/KushilevitzLO96">BibTeX</a></font> <li><a name="Hastad96" href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>: <br><b>Testing of the Long Code and Hardness for Clique. </b>11-19<br><a href="http://doi.acm.org/10.1145/237814.237820"><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/Hastad96">BibTeX</a></font> <li><a name="AlonMS96" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/m/Matias:Yossi.html">Yossi Matias</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: <br><b>The Space Complexity of Approximating the Frequency Moments. </b>20-29<br><a href="http://doi.acm.org/10.1145/237814.237823"><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/AlonMS96">BibTeX</a></font> <li><a name="ChaudhuriR96" href="../../indices/a-tree/c/Chaudhuri:Shiva.html">Shiva Chaudhuri</a>, <a href="../../indices/a-tree/r/Radhakrishnan:Jaikumar.html">Jaikumar Radhakrishnan</a>: <br><b>Deterministic Restrictions in Circuit Complexity. </b>30-36<br><a href="http://doi.acm.org/10.1145/237814.237824"><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/ChaudhuriR96">BibTeX</a></font> </ul> <h2>Session 1B</h2> <ul> <li><a name="CheriyanT96" href="../../indices/a-tree/c/Cheriyan:Joseph.html">Joseph Cheriyan</a>, <a href="../../indices/a-tree/t/Thurimella:Ramakrishna.html">Ramakrishna Thurimella</a>: <br><b>Fast Algorithms for <i>k</i>-Shredders and <i>k</i>-Node Connectivity Augmentation (Extended Abstract). </b>37-46<br><a href="http://doi.acm.org/10.1145/237814.237826"><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/CheriyanT96">BibTeX</a></font> <li><a name="BenczurK96" href="../../indices/a-tree/b/Bencz=uacute=r:Andr=aacute=s_A=.html">András A. Benczúr</a>, <a href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>: <br><b>Approximating <i>s-t</i> Minimum Cuts in <i>Õ</i>(<i>n</i><sup>2</sup>) Time. </b>47-55<br><a href="http://doi.acm.org/10.1145/237814.237827"><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/BenczurK96">BibTeX</a></font> <li><a name="Karger96" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>: <br><b>Minimum Cuts in Near-Linear Time. </b>56-63<br><a href="http://doi.acm.org/10.1145/237814.237829"><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/Karger96">BibTeX</a></font> <li><a name="NagamochiI96" href="../../indices/a-tree/n/Nagamochi:Hiroshi.html">Hiroshi Nagamochi</a>, <a href="../../indices/a-tree/i/Ibaraki:Toshihide.html">Toshihide Ibaraki</a>: <br><b>Deterministic <i>Õ</i>(nm) Time Edge-Splitting in Undirected Graphs. </b>64-73<br><a href="http://doi.acm.org/10.1145/237814.237830"><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/NagamochiI96">BibTeX</a></font> </ul> <h2>Session 2A</h2> <ul> <li><a name="Naor96" href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: <br><b>Evaluation May Be Easier Than Generation (Extended Abstract). </b>74-83<br><a href="http://doi.acm.org/10.1145/237814.237833"><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/Naor96">BibTeX</a></font> <li><a name="Ogihara96" href="../../indices/a-tree/o/Ogihara:Mitsunori.html">Mitsunori Ogihara</a>: <br><b>The PL Hierarchy Collapses. </b>84-88<br><a href="http://doi.acm.org/10.1145/237814.237834"><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/Ogihara96">BibTeX</a></font> <li><a name="AfekMO96" href="../../indices/a-tree/a/Afek:Yehuda.html">Yehuda Afek</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/o/Ostfeld:Zvi.html">Zvi Ostfeld</a>: <br><b>Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract). </b>89-98<br><a href="http://doi.acm.org/10.1145/237814.237837"><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/AfekMO96">BibTeX</a></font> </ul> <h2>Session 2B</h2> <ul> <li><a name="Ajtai96" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>: <br><b>Generating Hard Instances of Lattice Problems (Extended Abstract). </b>99-108<br><a href="http://doi.acm.org/10.1145/237814.237838"><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/Ajtai96">BibTeX</a></font> <li><a name="Milenkovic96" href="../../indices/a-tree/m/Milenkovic:Victor.html">Victor Milenkovic</a>: <br><b>Translational Polygon Containment and Minimal Enclosure using Linear Programming Based Restriction. </b>109-118<br><a href="http://doi.acm.org/10.1145/237814.237840"><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/Milenkovic96">BibTeX</a></font> <li><a name="BernS96" href="../../indices/a-tree/b/Bern:Marshall_W=.html">Marshall W. Bern</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>: <br><b>Pushing Disks Together - The Continuous-Motion Case. </b>119-125<br><a href="http://doi.acm.org/10.1145/237814.237843"><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/BernS96">BibTeX</a></font> </ul> <h2>Session 3A</h2> <ul> <li><a name="BergadanoCV96" href="../../indices/a-tree/b/Bergadano:Francesco.html">Francesco Bergadano</a>, <a href="../../indices/a-tree/c/Catalano:Dario.html">Dario Catalano</a>, <a href="../../indices/a-tree/v/Varricchio:Stefano.html">Stefano Varricchio</a>: <br><b>Learning Sat-<i>k</i>-DNF Formulas from Membership Queries. </b>126-130<br><a href="http://doi.acm.org/10.1145/237814.237845"><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/BergadanoCV96">BibTeX</a></font> <li><a name="Bshouty96" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>: <br><b>Towards the Learnability of DNF Formulae. </b>131-140<br><a href="http://doi.acm.org/10.1145/237814.237848"><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/Bshouty96">BibTeX</a></font> <li><a name="Cesa-BianchiDFS96" href="../../indices/a-tree/c/Cesa=Bianchi:Nicol=ograve=.html">Nicolò Cesa-Bianchi</a>, <a href="../../indices/a-tree/d/Dichterman:Eli.html">Eli Dichterman</a>, <a href="../../indices/a-tree/f/Fischer:Paul.html">Paul Fischer</a>, <a href="../../indices/a-tree/s/Simon:Hans=Ulrich.html">Hans-Ulrich Simon</a>: <br><b>Noise-Tolerant Learning Near the Information-Theoretic Bound. </b>141-150<br><a href="http://doi.acm.org/10.1145/237814.237849"><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-BianchiDFS96">BibTeX</a></font> <li><a name="BshoutyGMST96" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>, <a href="../../indices/a-tree/g/Goldman:Sally_A=.html">Sally A. Goldman</a>, <a href="../../indices/a-tree/m/Mathias:H=_David.html">H. David Mathias</a>, <a href="../../indices/a-tree/s/Suri:Subhash.html">Subhash Suri</a>, <a href="../../indices/a-tree/t/Tamaki:Hisao.html">Hisao Tamaki</a>: <br><b>Noise-Tolerant Distribution-Free Learning of General Geometric Concepts. </b>151-160<br><a href="http://doi.acm.org/10.1145/237814.237854"><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/BshoutyGMST96">BibTeX</a></font> </ul> <h2>Session 3B</h2> <ul> <li><a name="AllenderBO96" href="../../indices/a-tree/a/Allender:Eric.html">Eric Allender</a>, <a href="../../indices/a-tree/b/Beals:Robert.html">Robert Beals</a>, <a href="../../indices/a-tree/o/Ogihara:Mitsunori.html">Mitsunori Ogihara</a>: <br><b>The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). </b>161-167<br><a href="http://doi.acm.org/10.1145/237814.237856"><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/AllenderBO96">BibTeX</a></font> <li><a name="BasuPR96" href="../../indices/a-tree/b/Basu:Saugata.html">Saugata Basu</a>, <a href="../../indices/a-tree/p/Pollack:Richard.html">Richard Pollack</a>, <a href="../../indices/a-tree/r/Roy:Marie=Fran=ccedil=oise.html">Marie-Françoise Roy</a>: <br><b>Computing Roadmaps of Semi-Algebraic Sets (Extended Abstract). </b>168-173<br><a href="http://doi.acm.org/10.1145/237814.237857"><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/BasuPR96">BibTeX</a></font> <li><a name="CleggEI96" href="../../indices/a-tree/c/Clegg:Matthew.html">Matthew Clegg</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>: <br><b>Using the Groebner Basis Algorithm to Find Proofs of Unsatisfiability. </b>174-183<br><a href="http://doi.acm.org/10.1145/237814.237860"><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/CleggEI96">BibTeX</a></font> <li><a name="KapurS96" href="../../indices/a-tree/k/Kapur:Deepak.html">Deepak Kapur</a>, <a href="../../indices/a-tree/s/Saxena:Tushar.html">Tushar Saxena</a>: <br><b>Sparsity Considerations in Dixon Resultants. </b>184-191<br><a href="http://doi.acm.org/10.1145/237814.237862"><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/KapurS96">BibTeX</a></font> </ul> <h2>Session 4A</h2> <ul> <li><a name="VengroffV96" href="../../indices/a-tree/v/Vengroff:Darren_Erik.html">Darren Erik Vengroff</a>, <a href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: <br><b>Efficient 3-D Range Searching in External Memory. </b>192-201<br><a href="http://doi.acm.org/10.1145/237814.237864"><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/VengroffV96">BibTeX</a></font> <li><a name="KaplanT96" 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>Purely Functional Representations of Catenable Sorted Lists. </b>202-211<br><a href="http://doi.acm.org/10.1145/237814.237865"><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/KaplanT96">BibTeX</a></font> <li><a name="Grover96" href="../../indices/a-tree/g/Grover:Lov_K=.html">Lov K. Grover</a>: <br><b>A Fast Quantum Mechanical Algorithm for Database Search. </b>212-219<br><a href="http://doi.acm.org/10.1145/237814.237866"><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/Grover96">BibTeX</a></font> </ul> <h2>Session 4B</h2> <ul> <li><a name="BonetPWY96" href="../../indices/a-tree/b/Bonet:Maria_Luisa.html">Maria Luisa Bonet</a>, <a href="../../indices/a-tree/p/Phillips:Cynthia_A=.html">Cynthia A. Phillips</a>, <a href="../../indices/a-tree/w/Warnow:Tandy.html">Tandy Warnow</a>, <a href="../../indices/a-tree/y/Yooseph:Shibu.html">Shibu Yooseph</a>: <br><b>Constructing Evolutionary Trees in the Presence of Polymorphic Characters. </b>220-229<br><a href="http://doi.acm.org/10.1145/237814.237867"><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/BonetPWY96">BibTeX</a></font> <li><a name="FarachK96" href="../../indices/a-tree/f/Farach:Martin.html">Martin Farach</a>, <a href="../../indices/a-tree/k/Kannan:Sampath.html">Sampath Kannan</a>: <br><b>Efficient Algorithms for Inverting Evolution. </b>230-236<br><a href="http://doi.acm.org/10.1145/237814.237868"><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/FarachK96">BibTeX</a></font> </ul> <h2>Session 5A</h2> <ul> <li><a name="AspnesW96" href="../../indices/a-tree/a/Aspnes:James.html">James Aspnes</a>, <a href="../../indices/a-tree/w/Waarts:Orli.html">Orli Waarts</a>: <br><b>Modular Competitiveness for Distributed Algorithms. </b>237-246<br><a href="http://doi.acm.org/10.1145/237814.237869"><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/AspnesW96">BibTeX</a></font> <li><a name="Goodrich96" href="../../indices/a-tree/g/Goodrich:Michael_T=.html">Michael T. Goodrich</a>: <br><b>Communication-Efficient Parallel Sorting (Preliminary Version). </b>247-256<br><a href="http://doi.acm.org/10.1145/237814.237870"><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/Goodrich96">BibTeX</a></font> <li><a name="AndrewsLMZ96" href="../../indices/a-tree/a/Andrews:Matthew.html">Matthew Andrews</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/Metaxas:Panagiotis_Takis.html">Panagiotis Takis Metaxas</a>, <a href="../../indices/a-tree/z/Zhang:Lisa.html">Lisa Zhang</a>: <br><b>Automatic Methods for Hiding Latency in High Bandwidth Networks (Extended Abstract). </b>257-265<br><a href="http://doi.acm.org/10.1145/237814.237871"><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/AndrewsLMZ96">BibTeX</a></font> <li><a name="Ma96" href="../../indices/a-tree/m/Ma:Yuan.html">Yuan Ma</a>: <br><b>An <i>O</i>(<i>n</i> <i>log</i> <i>n</i>)-Size Fault-Tolerant Sorting Network (Extended Abstract). </b>266-275<br><a href="http://doi.acm.org/10.1145/237814.237876"><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/Ma96">BibTeX</a></font> </ul> <h2>Session 5B</h2> <ul> <li><a name="Ta-Shma96" href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>: <br><b>On Extracting Randomness From Weak Random Sources (Extended Abstract). </b>276-285<br><a href="http://doi.acm.org/10.1145/237814.237877"><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/Ta-Shma96">BibTeX</a></font> <li><a name="Zuckerman96" href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>: <br><b>Randomness-Optimal Sampling, Extractors, and Constructive Leader Election. </b>286-295<br><a href="http://doi.acm.org/10.1145/237814.237878"><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/Zuckerman96">BibTeX</a></font> <li><a name="Wilson96" href="../../indices/a-tree/w/Wilson:David_Bruce.html">David Bruce Wilson</a>: <br><b>Generating Random Spanning Trees More Quickly than the Cover Time. </b>296-303<br><a href="http://doi.acm.org/10.1145/237814.237880"><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/Wilson96">BibTeX</a></font> <li><a name="DimitriouI96" href="../../indices/a-tree/d/Dimitriou:Tassos.html">Tassos Dimitriou</a>, <a href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>: <br><b>Towards an Analysis of Local Optimization Algorithms. </b>304-313<br><a href="http://doi.acm.org/10.1145/237814.237882"><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/DimitriouI96">BibTeX</a></font> </ul> <h2>Session 6: Knuth Prize Lecture</h2> <h2>Session 7A</h2> <ul> <li><a name="Feige96" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>: <br><b>A Threshold of ln <i>n</i> for Approximating Set Cover (Preliminary Version). </b>314-318<br><a href="http://doi.acm.org/10.1145/237814.237977"><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/Feige96">BibTeX</a></font> <li><a name="McCormick96" href="../../indices/a-tree/m/McCormick:S=_Thomas.html">S. Thomas McCormick</a>: <br><b>Fast Algorithms for Parametric Scheduling Come from Extensions to Parametric Maximum Flow. </b>319-328<br><a href="http://doi.acm.org/10.1145/237814.237978"><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/McCormick96">BibTeX</a></font> <li><a name="KhannaM96" href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>: <br><b>Towards a Syntactic Characterization of PTAS. </b>329-337<br><a href="http://doi.acm.org/10.1145/237814.237979"><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/KhannaM96">BibTeX</a></font> <li><a name="KleinL96" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/l/Lu:Hsueh=I.html">Hsueh-I Lu</a>: <br><b>Efficient Approximation Algorithms for Semidefinite Programs Arising from MAX CUT and COLORING. </b>338-347<br><a href="http://doi.acm.org/10.1145/237814.237980"><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/KleinL96">BibTeX</a></font> </ul> <h2>Session 7B</h2> <ul> <li><a name="BroderU96" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: <br><b>Dynamic Deflection Routing on Arrays (Preliminary Version). </b>348-355<br><a href="http://doi.acm.org/10.1145/237814.237981"><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/BroderU96">BibTeX</a></font> <li><a name="CypherHSV96" href="../../indices/a-tree/c/Cypher:Robert.html">Robert Cypher</a>, <a href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/s/Scheideler:Christian.html">Christian Scheideler</a>, <a href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold Vöcking</a>: <br><b>Universal Algorithms for Store-and-Forward and Wormhole Routing. </b>356-365<br><a href="http://doi.acm.org/10.1145/237814.237982"><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/CypherHSV96">BibTeX</a></font> <li><a name="RabaniT96" href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>: <br><b>Distributed Packet Switching in Arbitrary Networks. </b>366-375<br><a href="http://doi.acm.org/10.1145/237814.237983"><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/RabaniT96">BibTeX</a></font> <li><a name="BorodinKRSW96" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</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>, <a href="../../indices/a-tree/w/Williamson:David_P=.html">David P. Williamson</a>: <br><b>Adversarial Queueing Theory. </b>376-385<br><a href="http://doi.acm.org/10.1145/237814.237984"><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/BorodinKRSW96">BibTeX</a></font> </ul> <h2>Session 8A</h2> <ul> <li><a name="Friedman96" href="../../indices/a-tree/f/Friedman:Joel.html">Joel Friedman</a>: <br><b>Computing Betti Numbers via Combinatorial Laplacians. </b>386-391<br><a href="http://doi.acm.org/10.1145/237814.237985"><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/Friedman96">BibTeX</a></font> <li><a name="Mohar96" href="../../indices/a-tree/m/Mohar:Bojan.html">Bojan Mohar</a>: <br><b>Embedding Graphs in an Arbitrary Surface in Linear Time. </b>392-397<br><a href="http://doi.acm.org/10.1145/237814.237986"><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/Mohar96">BibTeX</a></font> <li><a name="DeyG96" href="../../indices/a-tree/d/Dey:Tamal_K=.html">Tamal K. Dey</a>, <a href="../../indices/a-tree/g/Guha:Sumanta.html">Sumanta Guha</a>: <br><b>Algorithms for Manifolds and Simplicial Complexes in Euclidean 3-Space (Preliminary Version). </b>398-407<br><a href="http://doi.acm.org/10.1145/237814.237987"><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/DeyG96">BibTeX</a></font> <li><a name="Basu96" href="../../indices/a-tree/b/Basu:Saugata.html">Saugata Basu</a>: <br><b>On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets. </b>408-417<br><a href="http://doi.acm.org/10.1145/237814.237988"><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/Basu96">BibTeX</a></font> </ul> <h2>Session 8B</h2> <ul> <li><a name="KellererTW96" href="../../indices/a-tree/k/Kellerer:Hans.html">Hans Kellerer</a>, <a href="../../indices/a-tree/t/Tautenhahn:Thomas.html">Thomas Tautenhahn</a>, <a href="../../indices/a-tree/w/Woeginger:Gerhard_J=.html">Gerhard J. Woeginger</a>: <br><b>Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine. </b>418-426<br><a href="http://doi.acm.org/10.1145/237814.237989"><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/KellererTW96">BibTeX</a></font> <li><a name="Karloff96" href="../../indices/a-tree/k/Karloff:Howard_J=.html">Howard J. Karloff</a>: <br><b>How Good is the Goemans-Williamson MAX CUT Algorithm? </b>427-434<br><a href="http://doi.acm.org/10.1145/237814.237990"><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/Karloff96">BibTeX</a></font> <li><a name="Slavik96" href="../../indices/a-tree/s/Slav=iacute=k:Petr.html">Petr Slavík</a>: <br><b>A Tight Analysis of the Greedy Algorithm for Set Cover. </b>435-441<br><a href="http://doi.acm.org/10.1145/237814.237991"><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/Slavik96">BibTeX</a></font> <li><a name="BlumRV96" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/r/Ravi:R=.html">R. Ravi</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>: <br><b>A Constant-factor Approximation Algorithm for the <i>k</i> MST Problem (Extended Abstract). </b>442-448<br><a href="http://doi.acm.org/10.1145/237814.237992"><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/BlumRV96">BibTeX</a></font> </ul> <h2>Session 9A</h2> <ul> <li><a name="BergerKL96" href="../../indices/a-tree/b/Berger:Bonnie.html">Bonnie Berger</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>: <br><b>Reconstructing a Three-Dimensional Model with Arbitrary Errors. </b>449-458<br><a href="http://doi.acm.org/10.1145/237814.237993"><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/BergerKL96">BibTeX</a></font> <li><a name="KearnsM96" 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>: <br><b>On the Boosting Ability of Top-Down Decision Tree Learning Algorithms. </b>459-468<br><a href="http://doi.acm.org/10.1145/237814.237994"><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/KearnsM96">BibTeX</a></font> <li><a name="AngluinWZ96" href="../../indices/a-tree/a/Angluin:Dana.html">Dana Angluin</a>, <a href="../../indices/a-tree/w/Westbrook:Jeffery.html">Jeffery Westbrook</a>, <a href="../../indices/a-tree/z/Zhu:Wenhong.html">Wenhong Zhu</a>: <br><b>Robot Navigation with Range Queries. </b>469-478<br><a href="http://doi.acm.org/10.1145/237814.237995"><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/AngluinWZ96">BibTeX</a></font> </ul> <h2>Session 9B</h2> <ul> <li><a name="Beaver96" href="../../indices/a-tree/b/Beaver:Donald.html">Donald Beaver</a>: <br><b>Correlated Pseudorandomness and the Complexity of Private Computations. </b>479-488<br><a href="http://doi.acm.org/10.1145/237814.237996"><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/Beaver96">BibTeX</a></font> <li><a name="DworkLN96" href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/l/Lotspiech:Jeffrey_B=.html">Jeffrey B. Lotspiech</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: <br><b>Digital Signets: Self-Enforcing Protection of Digital Information (Preliminary Version). </b>489-498<br><a href="http://doi.acm.org/10.1145/237814.237997"><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/DworkLN96">BibTeX</a></font> <li><a name="FrankelGY96" href="../../indices/a-tree/f/Frankel:Yair.html">Yair Frankel</a>, <a href="../../indices/a-tree/g/Gemmell:Peter.html">Peter Gemmell</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: <br><b>Witness-Based Cryptographic Program Checking and Robust Function Sharing. </b>499-508<br><a href="http://doi.acm.org/10.1145/237814.237998"><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/FrankelGY96">BibTeX</a></font> </ul> <h2>Session 10A</h2> <ul> <li><a name="LinialS96" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/s/Sasson:Ori.html">Ori Sasson</a>: <br><b>Non-Expansive Hashing. </b>509-518<br><a href="http://doi.acm.org/10.1145/237814.237999"><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/LinialS96">BibTeX</a></font> <li><a name="AwerbuchAFL96" 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/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>: <br><b>Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (Extended Abstract). </b>519-530<br><a href="http://doi.acm.org/10.1145/237814.238000"><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/AwerbuchAFL96">BibTeX</a></font> <li><a name="BartalFL96" href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>, <a href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/l/Leonardi:Stefano.html">Stefano Leonardi</a>: <br><b>Lower Bounds for On-line Graph Problems with Application to On-line Circuit and Optical Routing. </b>531-540<br><a href="http://doi.acm.org/10.1145/237814.238001"><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/BartalFL96">BibTeX</a></font> </ul> <h2>Session 10B</h2> <ul> <li><a name="KushilevitzOR96" 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>Characterizing Linear Size Circuits in Terms of Privacy. </b>541-550<br><a href="http://doi.acm.org/10.1145/237814.238002"><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/KushilevitzOR96">BibTeX</a></font> <li><a name="HromkovicS96" href="../../indices/a-tree/h/Hromkovic:Juraj.html">Juraj Hromkovic</a>, <a href="../../indices/a-tree/s/Schnitger:Georg.html">Georg Schnitger</a>: <br><b>Nondeterministic Communication with a Limited Number of Advice Bits. </b>551-560<br><a href="http://doi.acm.org/10.1145/237814.238003"><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/HromkovicS96">BibTeX</a></font> <li><a name="NewmanS96" href="../../indices/a-tree/n/Newman:Ilan.html">Ilan Newman</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: <br><b>Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract). </b>561-570<br><a href="http://doi.acm.org/10.1145/237814.238004"><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/NewmanS96">BibTeX</a></font> </ul> <h2>Session 11A</h2> <ul> <li><a name="RobertsonSST96" href="../../indices/a-tree/r/Robertson:Neil.html">Neil Robertson</a>, <a href="../../indices/a-tree/s/Sanders:Daniel_P=.html">Daniel P. Sanders</a>, <a href="../../indices/a-tree/s/Seymour:Paul_D=.html">Paul D. Seymour</a>, <a href="../../indices/a-tree/t/Thomas:Robin.html">Robin Thomas</a>: <br><b>Efficiently Four-Coloring Planar Graphs. </b>571-575<br><a href="http://doi.acm.org/10.1145/237814.238005"><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/RobertsonSST96">BibTeX</a></font> <li><a name="Spielman96" href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>: <br><b>Faster Isomorphism Testing of Strongly Regular Graphs. </b>576-584<br><a href="http://doi.acm.org/10.1145/237814.238006"><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/Spielman96">BibTeX</a></font> <li><a name="AggarwalKW96" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/w/Williamson:David_P=.html">David P. Williamson</a>: <br><b>Node-Disjoint Paths on the Mesh and a New Trade-Off in VLSI Layout. </b>585-594<br><a href="http://doi.acm.org/10.1145/237814.238007"><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/AggarwalKW96">BibTeX</a></font> </ul> <h2>Session 11B</h2> <ul> <li><a name="Fu96" href="../../indices/a-tree/f/Fu:Xudong.html">Xudong Fu</a>: <br><b>Modular Coloring Formulas Are Hard for Cutting Planes Proofs. </b>595-602<br><a href="http://doi.acm.org/10.1145/237814.238008"><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/Fu96">BibTeX</a></font> <li><a name="BabaiGKRSW96" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/g/G=aacute=l:Anna.html">Anna Gál</a>, <a href="../../indices/a-tree/k/Koll=aacute=r:J=aacute=nos.html">János Kollár</a>, <a href="../../indices/a-tree/r/R=oacute=nyai:Lajos.html">Lajos Rónyai</a>, <a href="../../indices/a-tree/s/Szab=oacute=:Tibor.html">Tibor Szabó</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: <br><b>Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs. </b>603-611<br><a href="http://doi.acm.org/10.1145/237814.238010"><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/BabaiGKRSW96">BibTeX</a></font> <li><a name="GrigorievKHS96" 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/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/s/Smolensky:Roman.html">Roman Smolensky</a>: <br><b>A Lower Bound for Randomized Algebraic Decision Trees. </b>612-619<br><a href="http://doi.acm.org/10.1145/237814.238011"><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/GrigorievKHS96">BibTeX</a></font> <li><a name="EvansP96" href="../../indices/a-tree/e/Evans:William_S=.html">William S. Evans</a>, <a href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>: <br><b>Lower Bounds for Noisy Boolean Decision Trees. </b>620-628<br><a href="http://doi.acm.org/10.1145/237814.238013"><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/EvansP96">BibTeX</a></font> </ul> <h2>Session 12</h2> <ul> <li><a name="Beaver96a" href="../../indices/a-tree/b/Beaver:Donald.html">Donald Beaver</a>: <br><b>Adaptive Zero Knowledge and Computational Equivocation (Extended Abstract). </b>629-638<br><a href="http://doi.acm.org/10.1145/237814.238014"><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/Beaver96a">BibTeX</a></font> <li><a name="CanettiFGN96" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: <br><b>Adaptively Secure Multi-Party Computation. </b>639-648<br><a href="http://doi.acm.org/10.1145/237814.238015"><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/CanettiFGN96">BibTeX</a></font> <li><a name="Okamoto96" href="../../indices/a-tree/o/Okamoto:Tatsuaki.html">Tatsuaki Okamoto</a>: <br><b>On Relationships between Statistical Zero-Knowledge Proofs. </b>649-658<br><a href="http://doi.acm.org/10.1145/237814.238016"><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/Okamoto96">BibTeX</a></font> </ul> <h2>Errata</h2> <ul> <li><a name="KosarajuD96" 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 (Correction). </b>659<br><a href="http://doi.acm.org/10.1145/237814.250975"><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/KosarajuD96">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
