stoc1998.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1998</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>30. <a href="index.html">STOC</a> 1998: Dallas, Texas, USA</h1> Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998. ACM, 1998, ISBN 0-89791-962-9 <h2>Session 1A</h2> <ul> <li><a name="GoldreichG98" 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>On the Limits of Non-Approximability of Lattice Problems. </b>1-9<br><a href="http://doi.acm.org/10.1145/276698.276704"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldreichG98">BibTeX</a></font> <li><a name="Ajtai98" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>: <br><b>The Shortest Vector Problem in <i>L<sub>2</sub></i> is <i>NP</i>-hard for Randomized Reductions (Extended Abstract). </b>10-19<br><a href="http://doi.acm.org/10.1145/276698.276705"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ajtai98">BibTeX</a></font> <li><a name="AharonovKN98" href="../../indices/a-tree/a/Aharonov:Dorit.html">Dorit Aharonov</a>, <a href="../../indices/a-tree/k/Kitaev:Alexei.html">Alexei Kitaev</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>: <br><b>Quantum Circuits with Mixed States. </b>20-30<br><a href="http://doi.acm.org/10.1145/276698.276708"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AharonovKN98">BibTeX</a></font> </ul> <h2>Session 1B</h2> <ul> <li><a name="Huber98" href="../../indices/a-tree/h/Huber:Mark.html">Mark Huber</a>: <br><b>Exact Sampling and Approximate Counting Techniques. </b>31-40<br><a href="http://doi.acm.org/10.1145/276698.276709"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Huber98">BibTeX</a></font> <li><a name="NatanzonSS98" href="../../indices/a-tree/n/Natanzon:Assaf.html">Assaf Natanzon</a>, <a href="../../indices/a-tree/s/Shamir:Ron.html">Ron Shamir</a>, <a href="../../indices/a-tree/s/Sharan:Roded.html">Roded Sharan</a>: <br><b>A Polynomial Approximation Algorithm for the Minimum Fill-In Problem. </b>41-47<br><a href="http://doi.acm.org/10.1145/276698.276710"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NatanzonSS98">BibTeX</a></font> <li><a name="CalinescuKR98" href="../../indices/a-tree/c/Calinescu:Gruia.html">Gruia Calinescu</a>, <a href="../../indices/a-tree/k/Karloff:Howard_J=.html">Howard J. Karloff</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>: <br><b>An Improved Approximation Algorithm for Multiway Cut. </b>48-52<br><a href="http://doi.acm.org/10.1145/276698.276711"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CalinescuKR98">BibTeX</a></font> </ul> <h2>Session 2A</h2> <ul> <li><a name="Grover98" href="../../indices/a-tree/g/Grover:Lov_K=.html">Lov K. Grover</a>: <br><b>A Framework for Fast Quantum Mechanical Algorithms. </b>53-62<br><a href="http://doi.acm.org/10.1145/276698.276712"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Grover98">BibTeX</a></font> <li><a name="BuhrmanCW98" href="../../indices/a-tree/b/Buhrman:Harry.html">Harry Buhrman</a>, <a href="../../indices/a-tree/c/Cleve:Richard.html">Richard Cleve</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: <br><b>Quantum vs. Classical Communication and Computation. </b>63-68<br><a href="http://doi.acm.org/10.1145/276698.276713"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BuhrmanCW98">BibTeX</a></font> </ul> <h2>Session 2B</h2> <ul> <li><a name="KargerL98" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/l/Levine:Matthew_S=.html">Matthew S. Levine</a>: <br><b>Finding Maximum Flows in Undirected Graphs Seems Easier than Bipartite Matching. </b>69-78<br><a href="http://doi.acm.org/10.1145/276698.276714"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KargerL98">BibTeX</a></font> <li><a name="HolmLT98" href="../../indices/a-tree/h/Holm:Jacob.html">Jacob Holm</a>, <a href="../../indices/a-tree/l/Lichtenberg:Kristian_de.html">Kristian de Lichtenberg</a>, <a href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>: <br><b>Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity. </b>79-89<br><a href="http://doi.acm.org/10.1145/276698.276715"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HolmLT98">BibTeX</a></font> </ul> <h2>Invited Session I</h2> <h2>Session 3A</h2> <ul> <li><a name="Feige98" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>: <br><b>Approximating the Bandwidth via Volume Respecting Embeddings (Extended Abstract). </b>90-99<br><a href="http://doi.acm.org/10.1145/276698.276716"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Feige98">BibTeX</a></font> <li><a name="BlumKRV98" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/k/Konjevod:Goran.html">Goran Konjevod</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>Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. </b>100-105<br><a href="http://doi.acm.org/10.1145/276698.276717"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumKRV98">BibTeX</a></font> <li><a name="AroraRR98" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>: <br><b>Approximation Schemes for Euclidean <i>k</i>-Medians and Related Problems. </b>106-113<br><a href="http://doi.acm.org/10.1145/276698.276718"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AroraRR98">BibTeX</a></font> <li><a name="CharikarCGG98" href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/c/Chekuri:Chandra.html">Chandra Chekuri</a>, <a href="../../indices/a-tree/g/Goel:Ashish.html">Ashish Goel</a>, <a href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>: <br><b>Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and <i>k</i>-Median. </b>114-123<br><a href="http://doi.acm.org/10.1145/276698.276719"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CharikarCGG98">BibTeX</a></font> </ul> <h2>Session 3B</h2> <ul> <li><a name="BeigelH98" href="../../indices/a-tree/b/Beigel:Richard.html">Richard Beigel</a>, <a href="../../indices/a-tree/h/Hirst:Tirza.html">Tirza Hirst</a>: <br><b>One Help Bit Doesn't Help. </b>124-130<br><a href="http://doi.acm.org/10.1145/276698.276720"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeigelH98">BibTeX</a></font> <li><a name="CanettiMR98" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/m/Micciancio:Daniele.html">Daniele Micciancio</a>, <a href="../../indices/a-tree/r/Reingold:Omer.html">Omer Reingold</a>: <br><b>Perfectly One-Way Probabilistic Hash Functions (Preliminary Version). </b>131-140<br><a href="http://doi.acm.org/10.1145/276698.276721"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CanettiMR98">BibTeX</a></font> <li><a name="CrescenzoIO98" href="../../indices/a-tree/c/Crescenzo:Giovanni_Di.html">Giovanni Di Crescenzo</a>, <a href="../../indices/a-tree/i/Ishai:Yuval.html">Yuval Ishai</a>, <a href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>: <br><b>Non-Interactive and Non-Malleable Commitment. </b>141-150<br><a href="http://doi.acm.org/10.1145/276698.276722"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CrescenzoIO98">BibTeX</a></font> <li><a name="GertnerIKM98" href="../../indices/a-tree/g/Gertner:Yael.html">Yael Gertner</a>, <a href="../../indices/a-tree/i/Ishai:Yuval.html">Yuval Ishai</a>, <a href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/m/Malkin:Tal.html">Tal Malkin</a>: <br><b>Protecting Data Privacy in Private Information Retrieval Schemes. </b>151-160<br><a href="http://doi.acm.org/10.1145/276698.276723"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GertnerIKM98">BibTeX</a></font> </ul> <h2>Session 4A</h2> <ul> <li><a name="Bartal98" href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>: <br><b>On Approximating Arbitrary Metrices by Tree Metrics. </b>161-168<br><a href="http://doi.acm.org/10.1145/276698.276725"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Bartal98">BibTeX</a></font> <li><a name="LinialMS98" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/m/Magen:Avner.html">Avner Magen</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: <br><b>Trees and Euclidean Metrics. </b>169-175<br><a href="http://doi.acm.org/10.1145/276698.276726"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LinialMS98">BibTeX</a></font> <li><a name="PeinadoL98" href="../../indices/a-tree/p/Peinado:Marcus.html">Marcus Peinado</a>, <a href="../../indices/a-tree/l/Lengauer:Thomas.html">Thomas Lengauer</a>: <br><b>Random Generation of Embedded Graphs and an Extension to Dobrushin Uniqueness (Extended Abstract). </b>176-185<br><a href="http://doi.acm.org/10.1145/276698.276729"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PeinadoL98">BibTeX</a></font> <li><a name="LevcopoulosNS98" href="../../indices/a-tree/l/Levcopoulos:Christos.html">Christos Levcopoulos</a>, <a href="../../indices/a-tree/n/Narasimhan:Giri.html">Giri Narasimhan</a>, <a href="../../indices/a-tree/s/Smid:Michiel_H=_M=.html">Michiel H. M. Smid</a>: <br><b>Efficient Algorithms for Constructing Fault-Tolerant Geometric Spanners. </b>186-195<br><a href="http://doi.acm.org/10.1145/276698.276734"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LevcopoulosNS98">BibTeX</a></font> <li><a name="Ta-Shma98" href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>: <br><b>Almost Optimal Dispersers. </b>196-202<br><a href="http://doi.acm.org/10.1145/276698.276736"><i>Electronic Edition</i></a> (<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-Shma98">BibTeX</a></font> </ul> <h2>Session 4B</h2> <ul> <li><a name="BeigelBF98" href="../../indices/a-tree/b/Beigel:Richard.html">Richard Beigel</a>, <a href="../../indices/a-tree/b/Buhrman:Harry.html">Harry Buhrman</a>, <a href="../../indices/a-tree/f/Fortnow:Lance.html">Lance Fortnow</a>: <br><b>NP Might Not Be As Easy As Detecting Unique Solutions. </b>203-208<br><a href="http://doi.acm.org/10.1145/276698.276737"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeigelBF98">BibTeX</a></font> <li><a name="CanettiGH98" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/h/Halevi:Shai.html">Shai Halevi</a>: <br><b>The Random Oracle Methodology, Revisited (Preliminary Version). </b>209-218<br><a href="http://doi.acm.org/10.1145/276698.276741"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CanettiGH98">BibTeX</a></font> <li><a name="Grigoriev98" href="../../indices/a-tree/g/Grigoriev:Dima.html">Dima Grigoriev</a>: <br><b>Randomized Complexity Lower Bounds. </b>219-223<br><a href="http://doi.acm.org/10.1145/276698.276745"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Grigoriev98">BibTeX</a></font> <li><a name="KupfermanV98" href="../../indices/a-tree/k/Kupferman:Orna.html">Orna Kupferman</a>, <a href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>: <br><b>Weak Alternating Automata and Tree Automata Emptiness. </b>224-233<br><a href="http://doi.acm.org/10.1145/276698.276748"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KupfermanV98">BibTeX</a></font> <li><a name="TherienW98" href="../../indices/a-tree/t/Th=eacute=rien:Denis.html">Denis Thérien</a>, <a href="../../indices/a-tree/w/Wilke:Thomas.html">Thomas Wilke</a>: <br><b>Over Words, Two Variables Are as Powerful as One Quantifier Alternation. </b>234-240<br><a href="http://doi.acm.org/10.1145/276698.276749"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/TherienW98">BibTeX</a></font> </ul> <h2>Session 5A</h2> <ul> <li><a name="ShokrollahiW98" href="../../indices/a-tree/s/Shokrollahi:Mohammad_Amin.html">Mohammad Amin Shokrollahi</a>, <a href="../../indices/a-tree/w/Wasserman:Hal.html">Hal Wasserman</a>: <br><b>Decoding Algebraic-Geometric Codes Beyond the Error-Correction Bound. </b>241-248<br><a href="http://doi.acm.org/10.1145/276698.276753"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ShokrollahiW98">BibTeX</a></font> <li><a name="LubyMSS98" href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/m/Mitzenmacher:Michael.html">Michael Mitzenmacher</a>, <a href="../../indices/a-tree/s/Shokrollahi:Mohammad_Amin.html">Mohammad Amin Shokrollahi</a>, <a href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>: <br><b>Analysis of Low Density Codes and Improved Designs Using Irregular Graphs. </b>249-258<br><a href="http://doi.acm.org/10.1145/276698.276756"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LubyMSS98">BibTeX</a></font> <li><a name="ErgunKKRV98" href="../../indices/a-tree/e/Erg=uuml=n:Funda.html">Funda Ergün</a>, <a href="../../indices/a-tree/k/Kannan:Sampath.html">Sampath Kannan</a>, <a href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>, <a href="../../indices/a-tree/v/Viswanathan:Mahesh.html">Mahesh Viswanathan</a>: <br><b>Spot-Checkers. </b>259-268<br><a href="http://doi.acm.org/10.1145/276698.276757"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ErgunKKRV98">BibTeX</a></font> </ul> <h2>Session 5B</h2> <ul> <li><a name="BenderFRSV98" href="../../indices/a-tree/b/Bender:Michael_A=.html">Michael A. Bender</a>, <a href="../../indices/a-tree/f/Fern=aacute=ndez:Antonio.html">Antonio Fernández</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>: <br><b>The Power of a Pebble: Exploring and Mapping Directed Graphs. </b>269-278<br><a href="http://doi.acm.org/10.1145/276698.276759"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BenderFRSV98">BibTeX</a></font> <li><a name="BuchsbaumKRW98" href="../../indices/a-tree/b/Buchsbaum:Adam_L=.html">Adam L. Buchsbaum</a>, <a href="../../indices/a-tree/k/Kaplan:Haim.html">Haim Kaplan</a>, <a href="../../indices/a-tree/r/Rogers:Anne.html">Anne Rogers</a>, <a href="../../indices/a-tree/w/Westbrook:Jeffery.html">Jeffery Westbrook</a>: <br><b>Linear-Time Pointer-Machine Algorithms for Least Common Ancestors, MST Verification, and Dominators. </b>279-288<br><a href="http://doi.acm.org/10.1145/276698.276764"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BuchsbaumKRW98">BibTeX</a></font> <li><a name="GoldreichR98" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>: <br><b>A Sublinear Bipartiteness Tester for Bunded Degree Graphs. </b>289-298<br><a href="http://doi.acm.org/10.1145/276698.276767"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldreichR98">BibTeX</a></font> </ul> <h2>Session 6A</h2> <ul> <li><a name="Trevisan98" href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>: <br><b>Recycling Queries in PCPs and in Linearity Tests (Extended Abstract). </b>299-308<br><a href="http://doi.acm.org/10.1145/276698.276769"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Trevisan98">BibTeX</a></font> <li><a name="AjtaiFS98" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/f/Fagin:Ronald.html">Ronald Fagin</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: <br><b>The Closure of Monadic NP (Extended Abstract). </b>309-318<br><a href="http://doi.acm.org/10.1145/276698.276771"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AjtaiFS98">BibTeX</a></font> </ul> <h2>Session 6B</h2> <ul> <li><a name="Fredman98" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>: <br><b>Information Theoretic Implications for Pairing Heaps. </b>319-326<br><a href="http://doi.acm.org/10.1145/276698.276779"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Fredman98">BibTeX</a></font> <li><a name="BroderCFM98" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/m/Mitzenmacher:Michael.html">Michael Mitzenmacher</a>: <br><b>Min-Wise Independent Permutations (Extended Abstract). </b>327-336<br><a href="http://doi.acm.org/10.1145/276698.276781"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BroderCFM98">BibTeX</a></font> </ul> <h2>Invited Session II</h2> <ul> <li><a name="Arora98" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>: <br><b>The Approximability of NP-hard Problems. </b>337-348<br><a href="http://doi.acm.org/10.1145/276698.276784"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Arora98">BibTeX</a></font> </ul> <h2>Session 7A</h2> <ul> <li><a name="CharikarKR98" href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a 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>Algorithms for Capacitated Vehicle Routing. </b>349-358<br><a href="http://doi.acm.org/10.1145/276698.276786"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CharikarKR98">BibTeX</a></font> <li><a name="AielloKOR98" href="../../indices/a-tree/a/Aiello:William.html">William Aiello</a>, <a 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>Adaptive Packet Routing for Bursty Adversarial Traffic. </b>359-368<br><a href="http://doi.acm.org/10.1145/276698.276788"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AielloKOR98">BibTeX</a></font> <li><a name="AndrewsZ98" href="../../indices/a-tree/a/Andrews:Matthew.html">Matthew Andrews</a>, <a href="../../indices/a-tree/z/Zhang:Lisa.html">Lisa Zhang</a>: <br><b>Stability Results for Networks with Input and Output Blocking. </b>369-377<br><a href="http://doi.acm.org/10.1145/276698.276789"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AndrewsZ98">BibTeX</a></font> <li><a name="ColeMHMRSSV98" 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/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/m/Mitzenmacher:Michael.html">Michael Mitzenmacher</a>, <a href="../../indices/a-tree/r/Richa:Andr=eacute=a_W=.html">Andréa W. Richa</a>, <a href="../../indices/a-tree/s/Schr=ouml=der:Klaus.html">Klaus Schröder</a>, <a href="../../indices/a-tree/s/Sitaraman:Ramesh_K=.html">Ramesh K. Sitaraman</a>, <a href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold Vöcking</a>: <br><b>Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks. </b>378-388<br><a href="http://doi.acm.org/10.1145/276698.276790"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ColeMHMRSSV98">BibTeX</a></font> <li><a name="DoolyGS98" href="../../indices/a-tree/d/Dooly:Daniel_R=.html">Daniel R. Dooly</a>, <a href="../../indices/a-tree/g/Goldman:Sally_A=.html">Sally A. Goldman</a>, <a href="../../indices/a-tree/s/Scott:Stephen_D=.html">Stephen D. Scott</a>: <br><b>TCP Dynamic Acknowledgment Delay: Theory and Practice (Extended Abstract). </b>389-398<br><a href="http://doi.acm.org/10.1145/276698.276792"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DoolyGS98">BibTeX</a></font> </ul> <h2>Session 7B</h2> <ul> <li><a name="GoldreichSV98" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>: <br><b>Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge. </b>399-408<br><a href="http://doi.acm.org/10.1145/276698.276852"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldreichSV98">BibTeX</a></font> <li><a name="DworkNS98" href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>: <br><b>Concurrent Zero-Knowledge. </b>409-418<br><a href="http://doi.acm.org/10.1145/276698.276853"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DworkNS98">BibTeX</a></font> <li><a name="BellareCK98" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/k/Krawczyk:Hugo.html">Hugo Krawczyk</a>: <br><b>A Modular Approach to the Design and Analysis of Authentication and Key Exchange Protocols (Extended Abstract). </b>419-428<br><a href="http://doi.acm.org/10.1145/276698.276854"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BellareCK98">BibTeX</a></font> <li><a name="Gal98" href="../../indices/a-tree/g/G=aacute=l:Anna.html">Anna Gál</a>: <br><b>A Characterization of Span Program Size and Improved Lower Bounds for Monotone Span Programs. </b>429-437<br><a href="http://doi.acm.org/10.1145/276698.276855"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Gal98">BibTeX</a></font> <li><a name="LewinV98" href="../../indices/a-tree/l/Lewin:Daniel.html">Daniel Lewin</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>: <br><b>Checking Polynomial Identities over any Field: Towards a Derandomization? </b>438-447<br><a href="http://doi.acm.org/10.1145/276698.276856"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LewinV98">BibTeX</a></font> </ul> <h2>Session 8A</h2> <ul> <li><a name="Bar-NoyGNS98" href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>, <a href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/n/Naor:Joseph.html">Joseph Naor</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>: <br><b>Multicasting in Heterogeneous Networks. </b>448-453<br><a href="http://doi.acm.org/10.1145/276698.276857"><i>Electronic Edition</i></a> (<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-NoyGNS98">BibTeX</a></font> <li><a name="AlbersGL98" href="../../indices/a-tree/a/Albers:Susanne.html">Susanne Albers</a>, <a href="../../indices/a-tree/g/Garg:Naveen.html">Naveen Garg</a>, <a href="../../indices/a-tree/l/Leonardi:Stefano.html">Stefano Leonardi</a>: <br><b>Minimizing Stall Time in Single and Parallel Disk Systems. </b>454-462<br><a href="http://doi.acm.org/10.1145/276698.276858"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlbersGL98">BibTeX</a></font> <li><a name="KhannaZ98" href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/z/Zhou:Shiyu.html">Shiyu Zhou</a>: <br><b>On Indexed Data Broadcast. </b>463-472<br><a href="http://doi.acm.org/10.1145/276698.276859"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KhannaZ98">BibTeX</a></font> <li><a name="KleinbergPR98" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>: <br><b>Segmentation Problems. </b>473-482<br><a href="http://doi.acm.org/10.1145/276698.276860"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KleinbergPR98">BibTeX</a></font> </ul> <h2>Session 8B</h2> <ul> <li><a name="Vorobjov98" href="../../indices/a-tree/v/Vorobjov:Nicolai.html">Nicolai Vorobjov</a>: <br><b>Computing Local Dimension of a Semialgebraic Set. </b>483-487<br><a href="http://doi.acm.org/10.1145/276698.276861"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vorobjov98">BibTeX</a></font> <li><a name="MourrainP98" href="../../indices/a-tree/m/Mourrain:Bernard.html">Bernard Mourrain</a>, <a href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>: <br><b>Asymptotic Acceleration of Solving Multivariate Polynomial Systems of Equations. </b>488-496<br><a href="http://doi.acm.org/10.1145/276698.276862"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MourrainP98">BibTeX</a></font> <li><a name="HuangR98" href="../../indices/a-tree/h/Huang:Ming=Deh_A=.html">Ming-Deh A. Huang</a>, <a href="../../indices/a-tree/r/Rao:Ashwin_J=.html">Ashwin J. Rao</a>: <br><b>A Black Box Approach to the Algebraic Set Decomposition Problem. </b>497-506<br><a href="http://doi.acm.org/10.1145/276698.276863"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HuangR98">BibTeX</a></font> <li><a name="FournierK98" href="../../indices/a-tree/f/Fournier:Herv=eacute=.html">Hervé Fournier</a>, <a href="../../indices/a-tree/k/Koiran:Pascal.html">Pascal Koiran</a>: <br><b>Are Lower Bounds Easier over the Reals? </b>507-513<br><a href="http://doi.acm.org/10.1145/276698.276864"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FournierK98">BibTeX</a></font> </ul> <h2>Session 9A</h2> <ul> <li><a name="ChenGP98" href="../../indices/a-tree/c/Chen:Zhi=Zhong.html">Zhi-Zhong Chen</a>, <a href="../../indices/a-tree/g/Grigni:Michelangelo.html">Michelangelo Grigni</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>: <br><b>Planar Map Graphs. </b>514-523<br><a href="http://doi.acm.org/10.1145/276698.276865"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChenGP98">BibTeX</a></font> <li><a name="MolloyR98" href="../../indices/a-tree/m/Molloy:Michael.html">Michael Molloy</a>, <a href="../../indices/a-tree/r/Reed:Bruce_A=.html">Bruce A. Reed</a>: <br><b>Further Algorithmic Aspects of the Local Lemma. </b>524-529<br><a href="http://doi.acm.org/10.1145/276698.276866"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MolloyR98">BibTeX</a></font> <li><a name="Kleinberg98" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>: <br><b>Decision Algorithms for Unsplittable Flow and the Half-Disjoint Paths Problem. </b>530-539<br><a href="http://doi.acm.org/10.1145/276698.276867"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kleinberg98">BibTeX</a></font> <li><a name="RaoS98" href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>, <a href="../../indices/a-tree/s/Smith:Warren_D=.html">Warren D. Smith</a>: <br><b>Approximating Geometrical Graphs via "Spanners" and "Banyans". </b>540-550<br><a href="http://doi.acm.org/10.1145/276698.276868"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RaoS98">BibTeX</a></font> </ul> <h2>Session 9B</h2> <ul> <li><a name="Zwick98" href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>: <br><b>Finding Almost-Satisfying Assignments. </b>551-560<br><a href="http://doi.acm.org/10.1145/276698.276869"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Zwick98">BibTeX</a></font> <li><a name="BeameKPS98" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: <br><b>On the Complexity of Unsatisfiability Proofs for Random <i>k</i>-CNF Formulas. </b>561-571<br><a href="http://doi.acm.org/10.1145/276698.276870"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeameKPS98">BibTeX</a></font> <li><a name="Freedman98" href="../../indices/a-tree/f/Freedman:Michael_H=.html">Michael H. Freedman</a>: <br><b><i>K</i>-sat on Groups and Undecidability. </b>572-576<br><a href="http://doi.acm.org/10.1145/276698.276871"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Freedman98">BibTeX</a></font> <li><a name="GrigorievK98" href="../../indices/a-tree/g/Grigoriev:Dima.html">Dima Grigoriev</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>: <br><b>An Exponential Lower Bound for Depth 3 Arithmetic Circuits. </b>577-582<br><a href="http://doi.acm.org/10.1145/276698.276872"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GrigorievK98">BibTeX</a></font> </ul> <h2>Session 10A</h2> <ul> <li><a name="Bshouty98" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>: <br><b>A New Composition Theorem for Learning Algorithms. </b>583-589<br><a href="http://doi.acm.org/10.1145/276698.276873"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Bshouty98">BibTeX</a></font> <li><a name="Damaschke98" href="../../indices/a-tree/d/Damaschke:Peter.html">Peter Damaschke</a>: <br><b>Adaptive versus Nonadaptive Attribute-Efficient Learning. </b>590-596<br><a href="http://doi.acm.org/10.1145/276698.276874"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Damaschke98">BibTeX</a></font> <li><a name="CrescenziGPPY98" href="../../indices/a-tree/c/Crescenzi:Pierluigi.html">Pierluigi Crescenzi</a>, <a href="../../indices/a-tree/g/Goldman:Deborah.html">Deborah Goldman</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/p/Piccolboni:Antonio.html">Antonio Piccolboni</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: <br><b>On the Complexity of Protein Folding (Extended Abstract). </b>597-603<br><a href="http://doi.acm.org/10.1145/276698.276875"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CrescenziGPPY98">BibTeX</a></font> </ul> <h2>Session 10B</h2> <ul> <li><a name="IndykM98" href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>: <br><b>Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. </b>604-613<br><a href="http://doi.acm.org/10.1145/276698.276876"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/IndykM98">BibTeX</a></font> <li><a name="KushilevitzOR98" 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/Rabani:Yuval.html">Yuval Rabani</a>: <br><b>Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. </b>614-623<br><a href="http://doi.acm.org/10.1145/276698.276877"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KushilevitzOR98">BibTeX</a></font> <li><a name="FeigeS98" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/s/Scheideler:Christian.html">Christian Scheideler</a>: <br><b>Improved Bounds for Acyclic Job Shop Scheduling (Extended Abstract). </b>624-633<br><a href="http://doi.acm.org/10.1145/276698.276878"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeigeS98">BibTeX</a></font> </ul> <h2>Session 11A</h2> <ul> <li><a name="KhannaL98" href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/l/Liberatore:Vincenzo.html">Vincenzo Liberatore</a>: <br><b>On Broadcast Disk Paging. </b>634-643<br><a href="http://doi.acm.org/10.1145/276698.276879"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KhannaL98">BibTeX</a></font> <li><a name="LinialSW98" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/s/Samorodnitsky:Alex.html">Alex Samorodnitsky</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: <br><b>A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. </b>644-652<br><a href="http://doi.acm.org/10.1145/276698.276880"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LinialSW98">BibTeX</a></font> </ul> <h2>Session 11B</h2> <ul> <li><a name="Thathachar98" href="../../indices/a-tree/t/Thathachar:Jayram_S=.html">Jayram S. Thathachar</a>: <br><b>On Separating the Read-k-Times Branching Program Hierarchy. </b>653-662<br><a href="http://doi.acm.org/10.1145/276698.276881"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Thathachar98">BibTeX</a></font> <li><a name="FrankelMY98" href="../../indices/a-tree/f/Frankel:Yair.html">Yair Frankel</a>, <a href="../../indices/a-tree/m/MacKenzie:Philip_D=.html">Philip D. MacKenzie</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: <br><b>Robust Efficient Distributed RSA-Key Generation. </b>663-672<br><a href="http://doi.acm.org/10.1145/276698.276882"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FrankelMY98">BibTeX</a></font> <li><a name="BabaiHK98" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/h/Hayes:Thomas_P=.html">Thomas P. Hayes</a>, <a href="../../indices/a-tree/k/Kimmel:Peter_G=.html">Peter G. Kimmel</a>: <br><b>The Cost of the Missing Bit: Communication Complexity with Help. </b>673-682<br><a href="http://doi.acm.org/10.1145/276698.276883"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BabaiHK98">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:12 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
