focs99.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>40. FOCS 1999: New York, NY, USA</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>40. <a href="index.html">FOCS</a> 1999: New York, NY, USA</h1> 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA. IEEE Computer Society, 1999 <h2>Session 1</h2> <ul> <li><a name="JainV99" href="../../indices/a-tree/j/Jain:Kamal.html">Kamal Jain</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: <br><b>Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems. </b>2-13<br><a href="http://computer.org/proceedings/focs/0409/04090002abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JainV99">BibTeX</a></font> <li><a name="KleinbergT99" 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>Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields. </b>14-23<br><a href="http://computer.org/proceedings/focs/0409/04090014abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KleinbergT99">BibTeX</a></font> <li><a name="Fleischer99" href="../../indices/a-tree/f/Fleischer:Lisa.html">Lisa Fleischer</a>: <br><b>Approximating Fractional Multicommodity Flow Independent of the Number of Commodities. </b>24-31<br><a href="http://computer.org/proceedings/focs/0409/04090024abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Fleischer99">BibTeX</a></font> <li><a name="AfratiBCKKKMQSSS99" href="../../indices/a-tree/a/Afrati:Foto_N=.html">Foto N. Afrati</a>, <a href="../../indices/a-tree/b/Bampis:Evripidis.html">Evripidis Bampis</a>, <a href="../../indices/a-tree/c/Chekuri:Chandra.html">Chandra Chekuri</a>, <a href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/m/Milis:Ioannis.html">Ioannis Milis</a>, <a href="../../indices/a-tree/q/Queyranne:Maurice.html">Maurice Queyranne</a>, <a href="../../indices/a-tree/s/Skutella:Martin.html">Martin Skutella</a>, <a href="../../indices/a-tree/s/Stein:Clifford.html">Clifford Stein</a>, <a href="../../indices/a-tree/s/Sviridenko:Maxim.html">Maxim Sviridenko</a>: <br><b>Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates. </b>32-44<br><a href="http://computer.org/proceedings/focs/0409/04090032abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AfratiBCKKKMQSSS99">BibTeX</a></font> </ul> <h2>Session 2</h2> <ul> <li><a name="Blaser99" href="../../indices/a-tree/b/Bl=auml=ser:Markus.html">Markus Bläser</a>: <br><b>A 5/2 n<sup>2</sup>-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields. </b>45-50<br><a href="http://computer.org/proceedings/focs/0409/04090045abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Blaser99">BibTeX</a></font> <li><a name="Vigoda99" href="../../indices/a-tree/v/Vigoda:Eric.html">Eric Vigoda</a>: <br><b>Improved Bounds for Sampling Colorings. </b>51-59<br><a href="http://computer.org/proceedings/focs/0409/04090051abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vigoda99">BibTeX</a></font> <li><a name="Ajtai99" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>: <br><b>A Non-linear Time Lower Bound for Boolean Branching Programs. </b>60-70<br><a href="http://computer.org/proceedings/focs/0409/04090060abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ajtai99">BibTeX</a></font> <li><a name="MiltersenV99" href="../../indices/a-tree/m/Miltersen:Peter_Bro.html">Peter Bro Miltersen</a>, <a href="../../indices/a-tree/v/Vinodchandran:N=_V=.html">N. V. Vinodchandran</a>: <br><b>Derandomizing Arthur-Merlin Games Using Hitting Sets. </b>71-80<br><a href="http://computer.org/proceedings/focs/0409/04090071abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MiltersenV99">BibTeX</a></font> <li><a name="King99" href="../../indices/a-tree/k/King:Valerie.html">Valerie King</a>: <br><b>Fully Dynamic Algorithms for Maintaining All-Pairs Shortest Paths and Transitive Closure in Digraphs. </b>81-91<br><a href="http://computer.org/proceedings/focs/0409/04090081abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/King99">BibTeX</a></font> </ul> <h2>Session 3</h2> <ul> <li><a name="Chan99" href="../../indices/a-tree/c/Chan:Timothy_M=.html">Timothy M. Chan</a>: <br><b>Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time. </b>92-99<br><a href="http://computer.org/proceedings/focs/0409/04090092abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chan99">BibTeX</a></font> <li><a name="Har-Peled99" href="../../indices/a-tree/h/Har=Peled:Sariel.html">Sariel Har-Peled</a>: <br><b>Taking a Walk in a Planar Arrangement. </b>100-111<br><a href="http://computer.org/proceedings/focs/0409/04090100abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Har-Peled99">BibTeX</a></font> </ul> <h2>Session 4</h2> <ul> <li><a name="Watrous99" href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>: <br><b>PSPACE Has Constant-Round Quantum Interactive Proof Systems. </b>112-119<br><a href="http://computer.org/proceedings/focs/0409/04090112abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Watrous99">BibTeX</a></font> <li><a name="MicaliRV99" href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/r/Rabin:Michael_O=.html">Michael O. Rabin</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>: <br><b>Verifiable Random Functions. </b>120-130<br><a href="http://computer.org/proceedings/focs/0409/04090120abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MicaliRV99">BibTeX</a></font> <li><a name="Vocking99" href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold Vöcking</a>: <br><b>How Asymmetry Helps Load Balancing. </b>131-141<br><a href="http://computer.org/proceedings/focs/0409/04090131abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vocking99">BibTeX</a></font> <li><a name="Feige99" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>: <br><b>Noncryptographic Selection Protocols. </b>142-153<br><a href="http://computer.org/proceedings/focs/0409/04090142abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Feige99">BibTeX</a></font> </ul> <h2>Session 5A</h2> <ul> <li><a name="Indyk99" href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>: <br><b>A Sublinear Time Approximation Scheme for Clustering in Metric Spaces. </b>154-159<br><a href="http://computer.org/proceedings/focs/0409/04090154abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Indyk99">BibTeX</a></font> <li><a name="AmirEIS99" href="../../indices/a-tree/a/Amir:Arnon.html">Arnon Amir</a>, <a href="../../indices/a-tree/e/Efrat:Alon.html">Alon Efrat</a>, <a href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>, <a href="../../indices/a-tree/s/Samet:Hanan.html">Hanan Samet</a>: <br><b>Efficient Regular Data Structures and Algorithms for Location and Proximity Problems. </b>160-170<br><a href="http://computer.org/proceedings/focs/0409/04090160abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AmirEIS99">BibTeX</a></font> <li><a name="Farach-ColtonI99" href="../../indices/a-tree/f/Farach=Colton:Martin.html">Martin Farach-Colton</a>, <a href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>: <br><b>Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings. </b>171-180<br><a href="http://computer.org/proceedings/focs/0409/04090171abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Farach-ColtonI99">BibTeX</a></font> </ul> <h2>Session 5B</h2> <ul> <li><a name="ImpagliazzoSW99" href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/s/Shaltiel:Ronen.html">Ronen Shaltiel</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: <br><b>Near-Optimal Conversion of Hardness into Pseudo-Randomness. </b>181-190<br><a href="http://computer.org/proceedings/focs/0409/04090181abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ImpagliazzoSW99">BibTeX</a></font> <li><a name="RazRV99" href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>, <a href="../../indices/a-tree/r/Reingold:Omer.html">Omer Reingold</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>: <br><b>Error Reduction for Extractors. </b>191-201<br><a href="http://computer.org/proceedings/focs/0409/04090191abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RazRV99">BibTeX</a></font> <li><a name="AgrawalB99" href="../../indices/a-tree/a/Agrawal:Manindra.html">Manindra Agrawal</a>, <a href="../../indices/a-tree/b/Biswas:Somenath.html">Somenath Biswas</a>: <br><b>Primality and Identity Testing via Chinese Remaindering. </b>202-209<br><a href="http://computer.org/proceedings/focs/0409/04090202abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AgrawalB99">BibTeX</a></font> </ul> <h2>Session 6A</h2> <ul> <li><a name="DyerFJ99" href="../../indices/a-tree/d/Dyer:Martin_E=.html">Martin E. Dyer</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>: <br><b>On Counting Independent Sets in Sparse Graphs. </b>210-217<br><a href="http://computer.org/proceedings/focs/0409/04090210abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DyerFJ99">BibTeX</a></font> <li><a name="BorgsCFKTVV99" href="../../indices/a-tree/b/Borgs:Christian.html">Christian Borgs</a>, <a href="../../indices/a-tree/c/Chayes:Jennifer_T=.html">Jennifer T. Chayes</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/k/Kim:Jeong_Han.html">Jeong Han Kim</a>, <a href="../../indices/a-tree/t/Tetali:Prasad.html">Prasad Tetali</a>, <a href="../../indices/a-tree/v/Vigoda:Eric.html">Eric Vigoda</a>, <a href="../../indices/a-tree/v/Vu:Van_H=.html">Van H. Vu</a>: <br><b>Torpid Mixing of Some Monte Carlo Markov Chain Algorithms in Statistical Physics. </b>218-229<br><a href="http://computer.org/proceedings/focs/0409/04090218abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BorgsCFKTVV99">BibTeX</a></font> <li><a name="MorrisS99" href="../../indices/a-tree/m/Morris:Ben.html">Ben Morris</a>, <a href="../../indices/a-tree/s/Sinclair:Alistair.html">Alistair Sinclair</a>: <br><b>Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. </b>230-240<br><a href="http://computer.org/proceedings/focs/0409/04090230abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MorrisS99">BibTeX</a></font> <li><a name="KumarR99" href="../../indices/a-tree/k/Kumar:V=_S=_Anil.html">V. S. Anil Kumar</a>, <a href="../../indices/a-tree/r/Ramesh:H=.html">H. Ramesh</a>: <br><b>Markovian Coupling vs. Conductance for the Jerrum-Sinclair Chain. </b>241-252<br><a href="http://computer.org/proceedings/focs/0409/04090241abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KumarR99">BibTeX</a></font> </ul> <h2>Session 6B</h2> <ul> <li><a name="PelegR99" href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>, <a href="../../indices/a-tree/r/Rubinovich:Vitaly.html">Vitaly Rubinovich</a>: <br><b>A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction. </b>253-261<br><a href="http://computer.org/proceedings/focs/0409/04090253abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PelegR99">BibTeX</a></font> <li><a name="AfekST99" href="../../indices/a-tree/a/Afek:Yehuda.html">Yehuda Afek</a>, <a href="../../indices/a-tree/s/Stupp:Gideon.html">Gideon Stupp</a>, <a href="../../indices/a-tree/t/Touitou:Dan.html">Dan Touitou</a>: <br><b>ong-lived Adaptive Collect with Applications. </b>262-272<br><a href="http://computer.org/proceedings/focs/0409/04090262abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AfekST99">BibTeX</a></font> <li><a name="BarveV99" href="../../indices/a-tree/b/Barve:Rakesh_D=.html">Rakesh D. Barve</a>, <a href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>: <br><b>A Theoretical Framework for Memory-Adaptive Algorithms. </b>273-284<br><a href="http://computer.org/proceedings/focs/0409/04090273abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BarveV99">BibTeX</a></font> <li><a name="FrigoLPR99" href="../../indices/a-tree/f/Frigo:Matteo.html">Matteo Frigo</a>, <a href="../../indices/a-tree/l/Leiserson:Charles_E=.html">Charles E. Leiserson</a>, <a href="../../indices/a-tree/p/Prokop:Harald.html">Harald Prokop</a>, <a href="../../indices/a-tree/r/Ramachandran:Sridhar.html">Sridhar Ramachandran</a>: <br><b>Cache-Oblivious Algorithms. </b>285-298<br><a href="http://computer.org/proceedings/focs/0409/04090285abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FrigoLPR99">BibTeX</a></font> </ul> <h2>Session 7A</h2> <ul> <li><a name="FeldmanR99" href="../../indices/a-tree/f/Feldman:Jon.html">Jon Feldman</a>, <a href="../../indices/a-tree/r/Ruhl:Matthias.html">Matthias Ruhl</a>: <br><b>The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals. </b>299-308<br><a href="http://computer.org/proceedings/focs/0409/04090299abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeldmanR99">BibTeX</a></font> <li><a name="Eppstein99" href="../../indices/a-tree/e/Eppstein:David.html">David Eppstein</a>: <br><b>Setting Parameters by Example. </b>309-318<br><a href="http://computer.org/proceedings/focs/0409/04090309abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Eppstein99">BibTeX</a></font> <li><a name="ChenHH99" href="../../indices/a-tree/c/Chen:Zhi=Zhong.html">Zhi-Zhong Chen</a>, <a href="../../indices/a-tree/h/He:Xin.html">Xin He</a>, <a href="../../indices/a-tree/h/Huang:Chun=Hsi.html">Chun-Hsi Huang</a>: <br><b>Finding Double Euler Trails of Planar Graphs in Linear Time. </b>319-329<br><a href="http://computer.org/proceedings/focs/0409/04090319abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChenHH99">BibTeX</a></font> <li><a name="Weihe99" href="../../indices/a-tree/w/Weihe:Karsten.html">Karsten Weihe</a>: <br><b>Edge-Disjoint Routing in Plane Switch Graphs in Linear Time. </b>330-340<br><a href="http://computer.org/proceedings/focs/0409/04090330abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Weihe99">BibTeX</a></font> </ul> <h2>Session 7B</h2> <ul> <li><a name="Watrous99a" href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>: <br><b>On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes. </b>341-351<br><a href="http://computer.org/proceedings/focs/0409/04090341abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Watrous99a">BibTeX</a></font> <li><a name="Ambainis99" href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>: <br><b>A Better Lower Bound for Quantum Algorithms Searching an Ordered List. </b>352-357<br><a href="http://computer.org/proceedings/focs/0409/04090352abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ambainis99">BibTeX</a></font> <li><a name="BuhrmanCWZ99" 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/Wolf:Ronald_de.html">Ronald de Wolf</a>, <a href="../../indices/a-tree/z/Zalka:Christof.html">Christof Zalka</a>: <br><b>Bounds for Small-Error and Zero-Error Quantum Algorithms. </b>358-368<br><a href="http://computer.org/proceedings/focs/0409/04090358abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BuhrmanCWZ99">BibTeX</a></font> <li><a name="Nayak99" href="../../indices/a-tree/n/Nayak:Ashwin.html">Ashwin Nayak</a>: <br><b>Optimal Lower Bounds for Quantum Automata and Random Access Codes. </b>369-377<br><a href="http://computer.org/proceedings/focs/0409/04090369abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Nayak99">BibTeX</a></font> </ul> <h2>Session 8A</h2> <ul> <li><a name="CharikarG99" href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>: <br><b>Improved Combinatorial Algorithms for the Facility Location and k-Median Problems. </b>378-388<br><a href="http://computer.org/proceedings/focs/0409/04090378abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CharikarG99">BibTeX</a></font> <li><a name="KatohT99" href="../../indices/a-tree/k/Katoh:Naoki.html">Naoki Katoh</a>, <a href="../../indices/a-tree/t/Tokuyama:Takeshi.html">Takeshi Tokuyama</a>: <br><b>Lovász's Lemma for the Three-Dimensional K-Level of Concave Surfaces and its Applications. </b>389-398<br><a href="http://computer.org/proceedings/focs/0409/04090389abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KatohT99">BibTeX</a></font> <li><a name="GuptaNRS99" href="../../indices/a-tree/g/Gupta:Anupam.html">Anupam Gupta</a>, <a href="../../indices/a-tree/n/Newman:Ilan.html">Ilan Newman</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>Cuts, Trees and l<sub>1</sub>-Embeddings of Graphs. </b>399-409<br><a href="http://computer.org/proceedings/focs/0409/04090399abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuptaNRS99">BibTeX</a></font> </ul> <h2>Session 8B</h2> <ul> <li><a name="Schoning99" href="../../indices/a-tree/s/Sch=ouml=ning:Uwe.html">Uwe Schöning</a>: <br><b>A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems. </b>410-414<br><a href="http://computer.org/proceedings/focs/0409/04090410abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Schoning99">BibTeX</a></font> <li><a name="Ben-SassonI99" href="../../indices/a-tree/b/Ben=Sasson:Eli.html">Eli Ben-Sasson</a>, <a href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>: <br><b>Random CNF's are Hard for the Polynomial Calculus. </b>415-421<br><a href="http://computer.org/proceedings/focs/0409/04090415abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ben-SassonI99">BibTeX</a></font> <li><a name="BonetG99" href="../../indices/a-tree/b/Bonet:Maria_Luisa.html">Maria Luisa Bonet</a>, <a href="../../indices/a-tree/g/Galesi:Nicola.html">Nicola Galesi</a>: <br><b>A Study of Proof Search Algorithms for Resolution and Polynomial Calculus. </b>422-432<br><a href="http://computer.org/proceedings/focs/0409/04090422abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BonetG99">BibTeX</a></font> </ul> <h2>Session 9A</h2> <ul> <li><a name="MuthukrishnanRSG99" href="../../indices/a-tree/m/Muthukrishnan:S=.html">S. Muthukrishnan</a>, <a href="../../indices/a-tree/r/Rajaraman:Rajmohan.html">Rajmohan Rajaraman</a>, <a href="../../indices/a-tree/s/Shaheen:Anthony.html">Anthony Shaheen</a>, <a href="../../indices/a-tree/g/Gehrke:Johannes.html">Johannes Gehrke</a>: <br><b>Online Scheduling to Minimize Average Stretch. </b>433-442<br><a href="http://computer.org/proceedings/focs/0409/04090433abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MuthukrishnanRSG99">BibTeX</a></font> <li><a name="Koutsoupias99" href="../../indices/a-tree/k/Koutsoupias:Elias.html">Elias Koutsoupias</a>: <br><b>Weak Adversaries for the k-Server Problem. </b>444-449<br><a href="http://computer.org/proceedings/focs/0409/04090444abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Koutsoupias99">BibTeX</a></font> <li><a name="BlumBK99" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/b/Burch:Carl.html">Carl Burch</a>, <a href="../../indices/a-tree/k/Kalai:Adam.html">Adam Kalai</a>: <br><b>Finely-Competitive Paging. </b>450-458<br><a href="http://computer.org/proceedings/focs/0409/04090450abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumBK99">BibTeX</a></font> </ul> <h2>Session 9B</h2> <ul> <li><a name="LiptonV99" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/v/Viglas:Anastasios.html">Anastasios Viglas</a>: <br><b>On the Complexity of SAT. </b>459-464<br><a href="http://computer.org/proceedings/focs/0409/04090459abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LiptonV99">BibTeX</a></font> <li><a name="Umans99" href="../../indices/a-tree/u/Umans:Christopher.html">Christopher Umans</a>: <br><b>Hardness of Approximating Sigma<sub>2</sub><sup>p</sup> Minimization Problems. </b>465-474<br><a href="http://computer.org/proceedings/focs/0409/04090465abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Umans99">BibTeX</a></font> <li><a name="DumerMS99" href="../../indices/a-tree/d/Dumer:Ilya.html">Ilya Dumer</a>, <a href="../../indices/a-tree/m/Micciancio:Daniele.html">Daniele Micciancio</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>: <br><b>Hardness of Approximating the Minimum Distance of a Linear Code. </b>475-485<br><a href="http://computer.org/proceedings/focs/0409/04090475abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DumerMS99">BibTeX</a></font> </ul> <h2>Session 10A</h2> <ul> <li><a name="BoykinMPRV99" href="../../indices/a-tree/b/Boykin:P=_Oscar.html">P. Oscar Boykin</a>, <a href="../../indices/a-tree/m/Mor:Tal.html">Tal Mor</a>, <a href="../../indices/a-tree/p/Pulver:Matthew.html">Matthew Pulver</a>, <a href="../../indices/a-tree/r/Roychowdhury:Vwani_P=.html">Vwani P. Roychowdhury</a>, <a href="../../indices/a-tree/v/Vatan:Farrokh.html">Farrokh Vatan</a>: <br><b>On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis. </b>486-494<br><a href="http://computer.org/proceedings/focs/0409/04090486abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BoykinMPRV99">BibTeX</a></font> <li><a name="Plandowski99" href="../../indices/a-tree/p/Plandowski:Wojciech.html">Wojciech Plandowski</a>: <br><b>Satisfiability of Word Equations with Constants is in PSPACE. </b>495-500<br><a href="http://computer.org/proceedings/focs/0409/04090495abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Plandowski99">BibTeX</a></font> <li><a name="FeigenbaumKSV99" href="../../indices/a-tree/f/Feigenbaum:Joan.html">Joan Feigenbaum</a>, <a href="../../indices/a-tree/k/Kannan:Sampath.html">Sampath Kannan</a>, <a href="../../indices/a-tree/s/Strauss:Martin.html">Martin Strauss</a>, <a href="../../indices/a-tree/v/Viswanathan:Mahesh.html">Mahesh Viswanathan</a>: <br><b>An Approximate L<sup>1</sup>-Difference Algorithm for Massive Data Streams. </b>501-511<br><a href="http://computer.org/proceedings/focs/0409/04090501abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeigenbaumKSV99">BibTeX</a></font> <li><a name="GoldmanIP99" href="../../indices/a-tree/g/Goldman:Deborah.html">Deborah Goldman</a>, <a href="../../indices/a-tree/i/Istrail:Sorin.html">Sorin Istrail</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>: <br><b>Algorithmic Aspects of Protein Structure Similarity. </b>512-522<br><a href="http://computer.org/proceedings/focs/0409/04090512abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldmanIP99">BibTeX</a></font> </ul> <h2>Session 10B</h2> <ul> <li><a name="DworkNRS99" 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/r/Reingold:Omer.html">Omer Reingold</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: <br><b>Magic Functions. </b>523-534<br><a href="http://computer.org/proceedings/focs/0409/04090523abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DworkNRS99">BibTeX</a></font> <li><a name="KimST99" href="../../indices/a-tree/k/Kim:Jeong_Han.html">Jeong Han Kim</a>, <a href="../../indices/a-tree/s/Simon:Daniel_R=.html">Daniel R. Simon</a>, <a href="../../indices/a-tree/t/Tetali:Prasad.html">Prasad Tetali</a>: <br><b>Limits on the Efficiency of One-Way Permutation-Based Hash Functions. </b>535-542<br><a href="http://computer.org/proceedings/focs/0409/04090535abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KimST99">BibTeX</a></font> <li><a name="Sahai99" href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>: <br><b>Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. </b>543-553<br><a href="http://computer.org/proceedings/focs/0409/04090543abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sahai99">BibTeX</a></font> <li><a name="SanderYY99" href="../../indices/a-tree/s/Sander:Tomas.html">Tomas Sander</a>, <a href="../../indices/a-tree/y/Young:Adam.html">Adam Young</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: <br><b>Non-Interactive CryptoComputing For NC<sup>1</sup>. </b>554-567<br><a href="http://computer.org/proceedings/focs/0409/04090554abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SanderYY99">BibTeX</a></font> </ul> <h2>Session 11A</h2> <ul> <li><a name="KleinbergRT99" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a 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>Fairness in Routing and Load Balancing. </b>568-578<br><a href="http://computer.org/proceedings/focs/0409/04090568abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KleinbergRT99">BibTeX</a></font> <li><a name="GoelI99" href="../../indices/a-tree/g/Goel:Ashish.html">Ashish Goel</a>, <a href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>: <br><b>Stochastic Load Balancing and Related Problems. </b>579-586<br><a href="http://computer.org/proceedings/focs/0409/04090579abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoelI99">BibTeX</a></font> <li><a name="LuczakU99" href="../../indices/a-tree/l/Luczak:Malwina_J=.html">Malwina J. Luczak</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: <br><b>Reducing Network Congestion and Blocking Probability Through Balanced Allocation. </b>587-595<br><a href="http://computer.org/proceedings/focs/0409/04090587abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LuczakU99">BibTeX</a></font> <li><a name="KolpakovK99" href="../../indices/a-tree/k/Kolpakov:Roman_M=.html">Roman M. Kolpakov</a>, <a href="../../indices/a-tree/k/Kucherov:Gregory.html">Gregory Kucherov</a>: <br><b>Finding Maximal Repetitions in a Word in Linear Time. </b>596-604<br><a href="http://computer.org/proceedings/focs/0409/04090596abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KolpakovK99">BibTeX</a></font> <li><a name="ShoshanZ99" href="../../indices/a-tree/s/Shoshan:Avi.html">Avi Shoshan</a>, <a href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>: <br><b>All Pairs Shortest Paths in Undirected Graphs with Integer Weights. </b>605-615<br><a href="http://computer.org/proceedings/focs/0409/04090605abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ShoshanZ99">BibTeX</a></font> </ul> <h2>Session 11B</h2> <ul> <li><a name="ArriagaV99" href="../../indices/a-tree/a/Arriaga:Rosa_I=.html">Rosa I. Arriaga</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>: <br><b>An Algorithmic Theory of Learning: Robust Concepts and Random Projection. </b>616-623<br><a href="http://computer.org/proceedings/focs/0409/04090616abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ArriagaV99">BibTeX</a></font> <li><a name="KlivansS99" href="../../indices/a-tree/k/Klivans:Adam.html">Adam Klivans</a>, <a href="../../indices/a-tree/s/Servedio:Rocco_A=.html">Rocco A. Servedio</a>: <br><b>Boosting and Hard-Core Sets. </b>624-633<br><a href="http://computer.org/proceedings/focs/0409/04090624abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KlivansS99">BibTeX</a></font> <li><a name="Dasgupta99" href="../../indices/a-tree/d/Dasgupta:Sanjoy.html">Sanjoy Dasgupta</a>: <br><b>Learning Mixtures of Gaussians. </b>634-644<br><a href="http://computer.org/proceedings/focs/0409/04090634abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Dasgupta99">BibTeX</a></font> <li><a name="AlonKNS99" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/k/Krivelevich:Michael.html">Michael Krivelevich</a>, <a 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>Regular Languages Are Testable with a Constant Number of Queries. </b>645-655<br><a href="http://computer.org/proceedings/focs/0409/04090645abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonKNS99">BibTeX</a></font> <li><a name="AlonFKS99" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/f/Fischer:Eldar.html">Eldar Fischer</a>, <a href="../../indices/a-tree/k/Krivelevich:Michael.html">Michael Krivelevich</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: <br><b>Efficient Testing of Large Graphs. </b>656-666<br><a href="http://computer.org/proceedings/focs/0409/04090656abs.htm"><i>Electronic Edition</i></a> (<a href="http://www.computer.org/publications/dlib/index.htm">IEEE Computer Society DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonFKS99">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:12:26 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
