stoc2001.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 2001</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>33. <a href="index.html">STOC</a> 2001: Heraklion, Crete, Greece</h1> Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece. ACM, 2001 <h2>Session 1A</h2> <ul> <li><a name="CharikarP01" href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/p/Panigrahy:Rina.html">Rina Panigrahy</a>: <br><b>Clustering to minimize the sum of cluster diameters. </b>1-10<br><a href="http://doi.acm.org/10.1145/380752.380753"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CharikarP01">BibTeX</a></font> <li><a name="BartalCR01" href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>, <a href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/r/Raz:Danny.html">Danny Raz</a>: <br><b>Approximating min-sum <i>k</i>-clustering in metric spaces. </b>11-20<br><a href="http://doi.acm.org/10.1145/380752.380754"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BartalCR01">BibTeX</a></font> <li><a name="AryaGKMP01" href="../../indices/a-tree/a/Arya:Vijay.html">Vijay Arya</a>, <a href="../../indices/a-tree/g/Garg:Naveen.html">Naveen Garg</a>, <a href="../../indices/a-tree/k/Khandekar:Rohit.html">Rohit Khandekar</a>, <a href="../../indices/a-tree/m/Meyerson:Adam.html">Adam Meyerson</a>, <a href="../../indices/a-tree/m/Munagala:Kamesh.html">Kamesh Munagala</a>, <a href="../../indices/a-tree/p/Pandit:Vinayaka.html">Vinayaka Pandit</a>: <br><b>Local search heuristic for k-median and facility location problems. </b>21-29<br><a href="http://doi.acm.org/10.1145/380752.380755"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AryaGKMP01">BibTeX</a></font> <li><a name="Meyerson01" href="../../indices/a-tree/m/Meyerson:Adam.html">Adam Meyerson</a>: <br><b>Profit-earning facility location. </b>30-36<br><a href="http://doi.acm.org/10.1145/380752.380756"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Meyerson01">BibTeX</a></font> </ul> <h2>Session 1B</h2> <ul> <li><a name="AmbainisBNVW01" href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>, <a href="../../indices/a-tree/b/Bach:Eric.html">Eric Bach</a>, <a href="../../indices/a-tree/n/Nayak:Ashwin.html">Ashwin Nayak</a>, <a href="../../indices/a-tree/v/Vishwanath:Ashvin.html">Ashvin Vishwanath</a>, <a href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>: <br><b>One-dimensional quantum walks. </b>37-49<br><a href="http://doi.acm.org/10.1145/380752.380757"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AmbainisBNVW01">BibTeX</a></font> <li><a name="AmbainisKV01" href="../../indices/a-tree/a/Aharonov:Dorit.html">Dorit Aharonov</a>, <a href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>, <a href="../../indices/a-tree/k/Kempe:Julia.html">Julia Kempe</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>: <br><b>Quantum walks on graphs. </b>50-59<br><a href="http://doi.acm.org/10.1145/380752.380758"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AmbainisKV01">BibTeX</a></font> <li><a name="Watrous01" href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>: <br><b>Quantum algorithms for solvable groups. </b>60-67<br><a href="http://doi.acm.org/10.1145/380752.380759"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Watrous01">BibTeX</a></font> <li><a name="GrigniSVV01" href="../../indices/a-tree/g/Grigni:Michelangelo.html">Michelangelo Grigni</a>, <a href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>, <a href="../../indices/a-tree/v/Vazirani:Monica.html">Monica Vazirani</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>: <br><b>Quantum mechanical algorithms for the nonabelian hidden subgroup problem. </b>68-74<br><a href="http://doi.acm.org/10.1145/380752.380769"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GrigniSVV01">BibTeX</a></font> </ul> <h2>Session 2A</h2> <ul> <li><a name="Tokuyama01" href="../../indices/a-tree/t/Tokuyama:Takeshi.html">Takeshi Tokuyama</a>: <br><b>Minimax parametric optimization problems and multi-dimensional parametric searching. </b>75-83<br><a href="http://doi.acm.org/10.1145/380752.380777"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Tokuyama01">BibTeX</a></font> <li><a name="ChekuriKZ01" href="../../indices/a-tree/c/Chekuri:Chandra.html">Chandra Chekuri</a>, <a href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/z/Zhu:An.html">An Zhu</a>: <br><b>Algorithms for minimizing weighted flow time. </b>84-93<br><a href="http://doi.acm.org/10.1145/380752.380778"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChekuriKZ01">BibTeX</a></font> <li><a name="BecchettiL01" href="../../indices/a-tree/b/Becchetti:Luca.html">Luca Becchetti</a>, <a href="../../indices/a-tree/l/Leonardi:Stefano.html">Stefano Leonardi</a>: <br><b>Non-clairvoyant scheduling to minimize the average flow time on single and parallel machines. </b>94-103<br><a href="http://doi.acm.org/10.1145/380752.380782"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BecchettiL01">BibTeX</a></font> <li><a name="Roughgarden01" href="../../indices/a-tree/r/Roughgarden:Tim.html">Tim Roughgarden</a>: <br><b>Stackelberg scheduling strategies. </b>104-113<br><a href="http://doi.acm.org/10.1145/380752.380783"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Roughgarden01">BibTeX</a></font> </ul> <h2>Session 2B</h2> <ul> <li><a name="Valiant01" href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: <br><b>Quantum computers that can be simulated classically in polynomial time. </b>114-123<br><a href="http://doi.acm.org/10.1145/380752.380785"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Valiant01">BibTeX</a></font> <li><a name="KlauckNTZ01" href="../../indices/a-tree/k/Klauck:Hartmut.html">Hartmut Klauck</a>, <a href="../../indices/a-tree/n/Nayak:Ashwin.html">Ashwin Nayak</a>, <a href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>: <br><b>Interaction in quantum communication and the complexity of set disjointness. </b>124-133<br><a href="http://doi.acm.org/10.1145/380752.380786"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KlauckNTZ01">BibTeX</a></font> <li><a name="Ambainis01" href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>: <br><b>A new protocol and lower bounds for quantum coin flipping. </b>134-142<br><a href="http://doi.acm.org/10.1145/380752.380788"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ambainis01">BibTeX</a></font> <li><a name="Ta-ShmaUZ01" href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>, <a href="../../indices/a-tree/u/Umans:Christopher.html">Christopher Umans</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>: <br><b>Loss-less condensers, unbalanced expanders, and extractors. </b>143-152<br><a href="http://doi.acm.org/10.1145/380752.380790"><i>Electronic Edition</i></a> (<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-ShmaUZ01">BibTeX</a></font> </ul> <h2>Session 3A</h2> <ul> <li><a name="MostefaouiRR01" href="../../indices/a-tree/m/Most=eacute=faoui:Achour.html">Achour Mostéfaoui</a>, <a href="../../indices/a-tree/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>, <a href="../../indices/a-tree/r/Raynal:Michel.html">Michel Raynal</a>: <br><b>Conditions on input vectors for consensus solvability in asynchronous distributed systems. </b>153-162<br><a href="http://doi.acm.org/10.1145/380752.380792"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MostefaouiRR01">BibTeX</a></font> <li><a name="KempeKD01" href="../../indices/a-tree/k/Kempe:David.html">David Kempe</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/d/Demers:Alan_J=.html">Alan J. Demers</a>: <br><b>Spatial gossip and resource location protocols. </b>163-172<br><a href="http://doi.acm.org/10.1145/380752.380796"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KempeKD01">BibTeX</a></font> <li><a name="ElkinP01" href="../../indices/a-tree/e/Elkin:Michael.html">Michael Elkin</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: <br><b>(1+epsilon, beta)-spanner constructions for general graphs. </b>173-182<br><a href="http://doi.acm.org/10.1145/380752.380797"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ElkinP01">BibTeX</a></font> <li><a name="ThorupZ01" href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>, <a href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>: <br><b>Approximate distance oracles. </b>183-192<br><a href="http://doi.acm.org/10.1145/380752.380798"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ThorupZ01">BibTeX</a></font> </ul> <h2>Session 3B</h2> <ul> <li><a name="Ta-ShmaZ01" href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>, <a href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>: <br><b>Extractor codes. </b>193-199<br><a href="http://doi.acm.org/10.1145/380752.380800"><i>Electronic Edition</i></a> (<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-ShmaZ01">BibTeX</a></font> <li><a name="Elkies01" href="../../indices/a-tree/e/Elkies:Noam_D=.html">Noam D. Elkies</a>: <br><b>Excellent codes from modular curves. </b>200-208<br><a href="http://doi.acm.org/10.1145/380752.380802"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Elkies01">BibTeX</a></font> <li><a name="Shparlinski01" href="../../indices/a-tree/s/Shparlinski:Igor.html">Igor Shparlinski</a>: <br><b>Sparse polynomial approximation in finite fields. </b>209-215<br><a href="http://doi.acm.org/10.1145/380752.380803"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Shparlinski01">BibTeX</a></font> <li><a name="KlivansS01" href="../../indices/a-tree/k/Klivans:Adam.html">Adam Klivans</a>, <a href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>: <br><b>Randomness efficient identity testing of multivariate polynomials. </b>216-223<br><a href="http://doi.acm.org/10.1145/380752.380801"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KlivansS01">BibTeX</a></font> </ul> <h2>Session 4A</h2> <ul> <li><a name="Thorup01" href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>: <br><b>Fully-dynamic min-cut. </b>224-230<br><a href="http://doi.acm.org/10.1145/380752.380804"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Thorup01">BibTeX</a></font> <li><a name="Grohe01" href="../../indices/a-tree/g/Grohe:Martin.html">Martin Grohe</a>: <br><b>Computing crossing numbers in quadratic time. </b>231-236<br><a href="http://doi.acm.org/10.1145/380752.380805"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Grohe01">BibTeX</a></font> <li><a name="Kosaraju01" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>: <br><b>Euler paths in series parallel graphs. </b>237-240<br><a href="http://doi.acm.org/10.1145/380752.380806"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kosaraju01">BibTeX</a></font> <li><a name="SchaeferS01" href="../../indices/a-tree/s/Schaefer:Marcus.html">Marcus Schaefer</a>, <a href="../../indices/a-tree/s/Stefankovic:Daniel.html">Daniel Stefankovic</a>: <br><b>Decidability of string graphs. </b>241-246<br><a href="http://doi.acm.org/10.1145/380752.380807"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SchaeferS01">BibTeX</a></font> </ul> <h2>Session 4B</h2> <ul> <li><a name="SanjeevK01" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>: <br><b>Learning mixtures of arbitrary gaussians. </b>247-257<br><a href="http://doi.acm.org/10.1145/380752.380808"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SanjeevK01">BibTeX</a></font> <li><a name="KlivansS01a" 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>Learning DNF in time 2<sup>Õ(n<sup>1/3</sup>)</sup>. </b>258-265<br><a href="http://doi.acm.org/10.1145/380752.380809"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KlivansS01a">BibTeX</a></font> <li><a name="Bar-YossefKS01" href="../../indices/a-tree/b/Bar=Yossef:Ziv.html">Ziv Bar-Yossef</a>, <a href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</a>, <a href="../../indices/a-tree/s/Sivakumar:D=.html">D. Sivakumar</a>: <br><b>Sampling algorithms: lower bounds and applications. </b>266-275<br><a href="http://doi.acm.org/10.1145/380752.380810"><i>Electronic Edition</i></a> (<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-YossefKS01">BibTeX</a></font> <li><a name="ParnasR01" href="../../indices/a-tree/p/Parnas:Michal.html">Michal Parnas</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>: <br><b>Testing metric properties. </b>276-285<br><a href="http://doi.acm.org/10.1145/380752.380811"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ParnasR01">BibTeX</a></font> <li><a name="FischerN01" href="../../indices/a-tree/f/Fischer:Eldar.html">Eldar Fischer</a>, <a href="../../indices/a-tree/n/Newman:Ilan.html">Ilan Newman</a>: <br><b>Testing of matrix properties. </b>286-295<br><a href="http://doi.acm.org/10.1145/380752.380812"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FischerN01">BibTeX</a></font> </ul> <h2>Session 5A</h2> <ul> <li><a name="SpielmanT01" href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>, <a href="../../indices/a-tree/t/Teng:Shang=Hua.html">Shang-Hua Teng</a>: <br><b>Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. </b>296-305<br><a href="http://doi.acm.org/10.1145/380752.380813"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SpielmanT01">BibTeX</a></font> <li><a name="GartnerSTWV01" href="../../indices/a-tree/g/G=auml=rtner:Bernd.html">Bernd Gärtner</a>, <a href="../../indices/a-tree/s/Solymosi:J=oacute=zsef.html">József Solymosi</a>, <a href="../../indices/a-tree/t/Tschirschnitz:Falk.html">Falk Tschirschnitz</a>, <a href="../../indices/a-tree/w/Welzl:Emo.html">Emo Welzl</a>, <a href="../../indices/a-tree/v/Valtr:Pavel.html">Pavel Valtr</a>: <br><b>One line and n points. </b>306-315<br><a href="http://doi.acm.org/10.1145/380752.380814"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GartnerSTWV01">BibTeX</a></font> <li><a name="IckingM01" href="../../indices/a-tree/i/Icking:Christian.html">Christian Icking</a>, <a href="../../indices/a-tree/m/Ma:Lihong.html">Lihong Ma</a>: <br><b>A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D. </b>316-321<br><a href="http://doi.acm.org/10.1145/380752.380815"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/IckingM01">BibTeX</a></font> <li><a name="ChazelleL01" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/l/Liu:Ding.html">Ding Liu</a>: <br><b>Lower bounds for intersection searching and fractional cascading in higher dimension. </b>322-329<br><a href="http://doi.acm.org/10.1145/380752.380818"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChazelleL01">BibTeX</a></font> </ul> <h2>Session 5B</h2> <ul> <li><a name="BorgsCP01" 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/p/Pittel:Boris.html">Boris Pittel</a>: <br><b>Sharp threshold and scaling window for the integer partitioning problem. </b>330-336<br><a href="http://doi.acm.org/10.1145/380752.380854"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BorgsCP01">BibTeX</a></font> <li><a name="AchlioptasBM01" href="../../indices/a-tree/a/Achlioptas:Dimitris.html">Dimitris Achlioptas</a>, <a href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/m/Molloy:Michael_S=_O=.html">Michael S. O. Molloy</a>: <br><b>A sharp threshold in proof complexity. </b>337-346<br><a href="http://doi.acm.org/10.1145/380752.380820"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AchlioptasBM01">BibTeX</a></font> <li><a name="PitassiR01" href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>, <a href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>: <br><b>Regular resolution lower bounds for the weak pigeonhole principle. </b>347-355<br><a href="http://doi.acm.org/10.1145/380752.380821"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PitassiR01">BibTeX</a></font> <li><a name="AraiPU01" href="../../indices/a-tree/a/Arai:Noriko_H=.html">Noriko H. Arai</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>, <a href="../../indices/a-tree/u/Urquhart:Alasdair.html">Alasdair Urquhart</a>: <br><b>The complexity of analytic tableaux. </b>356-363<br><a href="http://doi.acm.org/10.1145/380752.380822"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AraiPU01">BibTeX</a></font> </ul> <h2>Session 6A</h2> <ul> <li><a name="JainV01" 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>Applications of approximation algorithms to cooperative games. </b>364-372<br><a href="http://doi.acm.org/10.1145/380752.380825"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JainV01">BibTeX</a></font> <li><a name="MossR01" href="../../indices/a-tree/m/Moss:Anna.html">Anna Moss</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>: <br><b>Approximation algorithms for constrained for constrained node weighted steiner tree problems. </b>373-382<br><a href="http://doi.acm.org/10.1145/380752.380826"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MossR01">BibTeX</a></font> <li><a name="GuhaMM01" href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/m/Meyerson:Adam.html">Adam Meyerson</a>, <a href="../../indices/a-tree/m/Munagala:Kamesh.html">Kamesh Munagala</a>: <br><b>A constant factor approximation for the single sink edge installation problems. </b>383-388<br><a href="http://doi.acm.org/10.1145/380752.380827"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GuhaMM01">BibTeX</a></font> <li><a name="GuptaKKRY01" href="../../indices/a-tree/g/Gupta:Anupam.html">Anupam Gupta</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/k/Kumar:Amit.html">Amit Kumar</a>, <a href="../../indices/a-tree/r/Rastogi:Rajeev.html">Rajeev Rastogi</a>, <a href="../../indices/a-tree/y/Yener:B=uuml=lent.html">Bülent Yener</a>: <br><b>Provisioning a virtual private network: a network design problem for multicommodity flow. </b>389-398<br><a href="http://doi.acm.org/10.1145/380752.380830"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GuptaKKRY01">BibTeX</a></font> </ul> <h2>Session 6B</h2> <ul> <li><a name="LachishR01" href="../../indices/a-tree/l/Lachish:Oded.html">Oded Lachish</a>, <a href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>: <br><b>Explicit lower bound of <i>4.5n - o(n)</i> for boolena circuits. </b>399-408<br><a href="http://doi.acm.org/10.1145/380752.380832"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LachishR01">BibTeX</a></font> <li><a name="RazS01" href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>, <a href="../../indices/a-tree/s/Shpilka:Amir.html">Amir Shpilka</a>: <br><b>Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. </b>409-418<br><a href="http://doi.acm.org/10.1145/380752.380833"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RazS01">BibTeX</a></font> <li><a name="BolligW01" href="../../indices/a-tree/b/Bollig:Beate.html">Beate Bollig</a>, <a href="../../indices/a-tree/w/Woelfel:Philipp.html">Philipp Woelfel</a>: <br><b>A read-once branching program lower bound of Omega(2<sup>n/4</sup>) for integer multiplication using universal. </b>419-424<br><a href="http://doi.acm.org/10.1145/380752.380835"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BolligW01">BibTeX</a></font> <li><a name="Pagh01" href="../../indices/a-tree/p/Pagh:Rasmus.html">Rasmus Pagh</a>: <br><b>On the cell probe complexity of membership and perfect hashing. </b>425-432<br><a href="http://doi.acm.org/10.1145/380752.380836"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pagh01">BibTeX</a></font> </ul> <h2>Session 7A</h2> <ul> <li><a name="FeigeS01" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/s/Schechtman:Gideon.html">Gideon Schechtman</a>: <br><b>On the integrality ratio of semidefinite relaxations of MAX CUT. </b>433-442<br><a href="http://doi.acm.org/10.1145/380752.380837"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeigeS01">BibTeX</a></font> <li><a name="GoemansW01" href="../../indices/a-tree/g/Goemans:Michel_X=.html">Michel X. Goemans</a>, <a href="../../indices/a-tree/w/Williamson:David_P=.html">David P. Williamson</a>: <br><b>Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming. </b>443-452<br><a href="http://doi.acm.org/10.1145/380752.380838"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoemansW01">BibTeX</a></font> <li><a name="Trevisan01" href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>: <br><b>Non-approximability results for optimization problems on bounded degree instances. </b>453-461<br><a href="http://doi.acm.org/10.1145/380752.380839"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Trevisan01">BibTeX</a></font> <li><a name="MolloyR01" 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>Colouring graphs when the number of colours is nearly the maximum degree. </b>462-470<br><a href="http://doi.acm.org/10.1145/380752.380840"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MolloyR01">BibTeX</a></font> </ul> <h2>Session 7B</h2> <ul> <li><a name="GuhaKS01" href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/k/Koudas:Nick.html">Nick Koudas</a>, <a href="../../indices/a-tree/s/Shim:Kyuseok.html">Kyuseok Shim</a>: <br><b>Data-streams and histograms. </b>471-475<br><a href="http://doi.acm.org/10.1145/380752.380841"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GuhaKS01">BibTeX</a></font> <li><a name="AlstrupBR01" href="../../indices/a-tree/a/Alstrup:Stephen.html">Stephen Alstrup</a>, <a href="../../indices/a-tree/b/Brodal:Gerth_St=oslash=lting.html">Gerth Stølting Brodal</a>, <a href="../../indices/a-tree/r/Rauhe:Theis.html">Theis Rauhe</a>: <br><b>Optimal static range reporting in one dimension. </b>476-482<br><a href="http://doi.acm.org/10.1145/380752.380842"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlstrupBR01">BibTeX</a></font> <li><a name="ErgunSSS01" href="../../indices/a-tree/e/Erg=uuml=n:Funda.html">Funda Ergün</a>, <a href="../../indices/a-tree/s/Sahinalp:S=uuml=leyman_Cenk.html">Süleyman Cenk Sahinalp</a>, <a href="../../indices/a-tree/s/Sharp:Jonathan.html">Jonathan Sharp</a>, <a href="../../indices/a-tree/s/Sinha:Rakesh_K=.html">Rakesh K. Sinha</a>: <br><b>Biased dictionaries with fast insert/deletes. </b>483-491<br><a href="http://doi.acm.org/10.1145/380752.380843"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ErgunSSS01">BibTeX</a></font> <li><a name="NaorT01" href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/t/Teague:Vanessa.html">Vanessa Teague</a>: <br><b>Anti-presistence: history independent data structures. </b>492-501<br><a href="http://doi.acm.org/10.1145/380752.380844"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NaorT01">BibTeX</a></font> </ul> <h2>Session 8A</h2> <ul> <li><a name="KarlinKR01" href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/r/Randall:Dana.html">Dana Randall</a>: <br><b>Dynamic TCP acknowledgement and other stories about e/(e-1). </b>502-509<br><a href="http://doi.acm.org/10.1145/380752.380845"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarlinKR01">BibTeX</a></font> <li><a name="MavronicolasS01" href="../../indices/a-tree/m/Mavronicolas:Marios.html">Marios Mavronicolas</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>: <br><b>The price of selfish routing. </b>510-519<br><a href="http://doi.acm.org/10.1145/380752.380846"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MavronicolasS01">BibTeX</a></font> <li><a name="KesselmanLMPSS01" href="../../indices/a-tree/k/Kesselman:Alexander.html">Alexander Kesselman</a>, <a href="../../indices/a-tree/l/Lotker:Zvi.html">Zvi Lotker</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/p/Patt=Shamir:Boaz.html">Boaz Patt-Shamir</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>, <a href="../../indices/a-tree/s/Sviridenko:Maxim.html">Maxim Sviridenko</a>: <br><b>Buffer overflow management in QoS switches. </b>520-529<br><a href="http://doi.acm.org/10.1145/380752.380847"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KesselmanLMPSS01">BibTeX</a></font> <li><a name="Vocking01" href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold Vöcking</a>: <br><b>Almost optimal permutation routing on hypercubes. </b>530-539<br><a href="http://doi.acm.org/10.1145/380752.380848"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vocking01">BibTeX</a></font> <li><a name="JayramKKSS01" href="../../indices/a-tree/j/Jayram:T=_S=.html">T. S. Jayram</a>, <a href="../../indices/a-tree/k/Kimbrel:Tracy.html">Tracy Kimbrel</a>, <a href="../../indices/a-tree/k/Krauthgamer:Robert.html">Robert Krauthgamer</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>, <a href="../../indices/a-tree/s/Sviridenko:Maxim.html">Maxim Sviridenko</a>: <br><b>Online server allocation in a server farm via benefit task systems. </b>540-549<br><a href="http://doi.acm.org/10.1145/380752.380849"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JayramKKSS01">BibTeX</a></font> </ul> <h2>Session 8B</h2> <ul> <li><a name="HaleviKKN01" href="../../indices/a-tree/h/Halevi:Shai.html">Shai Halevi</a>, <a href="../../indices/a-tree/k/Krauthgamer:Robert.html">Robert Krauthgamer</a>, <a href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/n/Nissim:Kobbi.html">Kobbi Nissim</a>: <br><b>Private approximation of NP-hard functions. </b>550-559<br><a href="http://doi.acm.org/10.1145/380752.380850"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HaleviKKN01">BibTeX</a></font> <li><a name="KilianP01" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>, <a href="../../indices/a-tree/p/Petrank:Erez.html">Erez Petrank</a>: <br><b>Concurrent and resettable zero-knowledge in poly-loalgorithm rounds. </b>560-569<br><a href="http://doi.acm.org/10.1145/380752.380851"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KilianP01">BibTeX</a></font> <li><a name="CanettiKPR01" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>, <a href="../../indices/a-tree/p/Petrank:Erez.html">Erez Petrank</a>, <a href="../../indices/a-tree/r/Rosen:Alon.html">Alon Rosen</a>: <br><b>Black-box concurrent zero-knowledge requires Omega~(log n) rounds. </b>570-579<br><a href="http://doi.acm.org/10.1145/380752.380852"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CanettiKPR01">BibTeX</a></font> <li><a name="GennaroIKR01" href="../../indices/a-tree/g/Gennaro:Rosario.html">Rosario Gennaro</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/r/Rabin:Tal.html">Tal Rabin</a>: <br><b>The round complexity of verifiable secret sharing and secure multicast. </b>580-589<br><a href="http://doi.acm.org/10.1145/380752.380853"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GennaroIKR01">BibTeX</a></font> <li><a name="NaorN01" href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/n/Nissim:Kobbi.html">Kobbi Nissim</a>: <br><b>Communication preserving protocols for secure function evaluation. </b>590-599<br><a href="http://doi.acm.org/10.1145/380752.380855"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NaorN01">BibTeX</a></font> </ul> <h2>Turing Award Lecture</h2> <ul> <li><a name="Yao01" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: <br><b>Some perspective on computational complexity (abstract). </b>600<br><a href="http://doi.acm.org/10.1145/380752.380856"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao01">BibTeX</a></font> </ul> <h2>Session 10A</h2> <ul> <li><a name="AjtaiKS01" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>, <a href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</a>, <a href="../../indices/a-tree/s/Sivakumar:D=.html">D. Sivakumar</a>: <br><b>A sieve algorithm for the shortest lattice vector problem. </b>601-610<br><a href="http://doi.acm.org/10.1145/380752.380857"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AjtaiKS01">BibTeX</a></font> <li><a name="AchlioptasM01" href="../../indices/a-tree/a/Achlioptas:Dimitris.html">Dimitris Achlioptas</a>, <a href="../../indices/a-tree/m/McSherry:Frank.html">Frank McSherry</a>: <br><b>Fast computation of low rank matrix. </b>611-618<br><a href="http://doi.acm.org/10.1145/380752.380858"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AchlioptasM01">BibTeX</a></font> <li><a name="AzarFKMS01" 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/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/m/McSherry:Frank.html">Frank McSherry</a>, <a href="../../indices/a-tree/s/Saia:Jared.html">Jared Saia</a>: <br><b>Spectral analysis of data. </b>619-626<br><a href="http://doi.acm.org/10.1145/380752.380859"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AzarFKMS01">BibTeX</a></font> <li><a name="DunaganV01" href="../../indices/a-tree/d/Dunagan:John.html">John Dunagan</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>: <br><b>Optimal outlier removal in high-dimensional. </b>627-636<br><a href="http://doi.acm.org/10.1145/380752.380860"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DunaganV01">BibTeX</a></font> <li><a name="WangW01" href="../../indices/a-tree/w/Wang:Li=San.html">Li-San Wang</a>, <a href="../../indices/a-tree/w/Warnow:Tandy.html">Tandy Warnow</a>: <br><b>Estimating true evolutionary distances between genomes. </b>637-646<br><a href="http://doi.acm.org/10.1145/380752.380861"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/WangW01">BibTeX</a></font> </ul> <h2>Session 10B</h2> <ul> <li><a name="Muller-OlmS01" href="../../indices/a-tree/m/M=uuml=ller=Olm:Markus.html">Markus Müller-Olm</a>, <a href="../../indices/a-tree/s/Seidl:Helmut.html">Helmut Seidl</a>: <br><b>On optimal slicing of parallel programs. </b>647-656<br><a href="http://doi.acm.org/10.1145/380752.380864"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Muller-OlmS01">BibTeX</a></font> <li><a name="GroheSS01" href="../../indices/a-tree/g/Grohe:Martin.html">Martin Grohe</a>, <a href="../../indices/a-tree/s/Schwentick:Thomas.html">Thomas Schwentick</a>, <a href="../../indices/a-tree/s/Segoufin:Luc.html">Luc Segoufin</a>: <br><b>When is the evaluation of conjunctive queries tractable? </b>657-666<br><a href="http://doi.acm.org/10.1145/380752.380867"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GroheSS01">BibTeX</a></font> <li><a name="BulatovKJ01" href="../../indices/a-tree/b/Bulatov:Andrei_A=.html">Andrei A. Bulatov</a>, <a href="../../indices/a-tree/k/Krokhin:Andrei_A=.html">Andrei A. Krokhin</a>, <a href="../../indices/a-tree/j/Jeavons:Peter.html">Peter Jeavons</a>: <br><b>The complexity of maximal constraint languages. </b>667-674<br><a href="http://doi.acm.org/10.1145/380752.380868"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BulatovKJ01">BibTeX</a></font> <li><a name="AlfaroM01" href="../../indices/a-tree/a/Alfaro:Luca_de.html">Luca de Alfaro</a>, <a href="../../indices/a-tree/m/Majumdar:Rupak.html">Rupak Majumdar</a>: <br><b>Quantitative solution of omega-regular games. </b>675-683<br><a href="http://doi.acm.org/10.1145/380752.380871"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlfaroM01">BibTeX</a></font> <li><a name="Vatan01" href="../../indices/a-tree/v/Vatan:Farrokh.html">Farrokh Vatan</a>: <br><b>Distribution functions of probabilistic automata. </b>684-693<br><a href="http://doi.acm.org/10.1145/380752.380872"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vatan01">BibTeX</a></font> </ul> <h2>Session 11A</h2> <ul> <li><a name="Gacs01" href="../../indices/a-tree/g/G=aacute=cs:P=eacute=ter.html">Péter Gács</a>: <br><b>Compatible sequences and a slow Winkler percolation. </b>694-703<br><a href="http://doi.acm.org/10.1145/380752.380874"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Gacs01">BibTeX</a></font> <li><a name="MontenegroS01" href="../../indices/a-tree/m/Montenegro:Ravi.html">Ravi Montenegro</a>, <a href="../../indices/a-tree/s/Son:Jung=Bae.html">Jung-Bae Son</a>: <br><b>Edge isoperimetry and rapid mixing on matroids and geometric Markov chains. </b>704-711<br><a href="http://doi.acm.org/10.1145/380752.380876"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MontenegroS01">BibTeX</a></font> <li><a name="JerrumSV01" href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>, <a href="../../indices/a-tree/s/Sinclair:Alistair.html">Alistair Sinclair</a>, <a href="../../indices/a-tree/v/Vigoda:Eric.html">Eric Vigoda</a>: <br><b>A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. </b>712-721<br><a href="http://doi.acm.org/10.1145/380752.380877"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JerrumSV01">BibTeX</a></font> </ul> <h2>Session 11B</h2> <ul> <li><a name="SimaO01" href="../../indices/a-tree/s/S=iacute=ma:Jir=iacute=.html">Jirí Síma</a>, <a href="../../indices/a-tree/o/Orponen:Pekka.html">Pekka Orponen</a>: <br><b>Computing with continuous-time Liapunov systems. </b>722-731<br><a href="http://doi.acm.org/10.1145/380752.380878"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SimaO01">BibTeX</a></font> <li><a name="DurandLS01" href="../../indices/a-tree/d/Durand:Bruno.html">Bruno Durand</a>, <a href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>, <a href="../../indices/a-tree/s/Shen:Alexander.html">Alexander Shen</a>: <br><b>Complex tilings. </b>732-739<br><a href="http://doi.acm.org/10.1145/380752.380880"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DurandLS01">BibTeX</a></font> <li><a name="AdlemanCGH01" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>, <a href="../../indices/a-tree/c/Cheng:Qi.html">Qi Cheng</a>, <a href="../../indices/a-tree/g/Goel:Ashish.html">Ashish Goel</a>, <a href="../../indices/a-tree/h/Huang:Ming=Deh_A=.html">Ming-Deh A. Huang</a>: <br><b>Running time and program size for self-assembled squares. </b>740-748<br><a href="http://doi.acm.org/10.1145/380752.380881"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AdlemanCGH01">BibTeX</a></font> </ul> <h2>Session 12: Invited Pleanry Talks</h2> <ul> <li><a name="Papadimitriou01" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>: <br><b>Algorithms, games, and the internet. </b>749-753<br><a href="http://doi.acm.org/10.1145/380752.380883"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Papadimitriou01">BibTeX</a></font> <li><a name="Trakhtenbrot01" href="../../indices/a-tree/t/Trakhtenbrot:Boris_A=.html">Boris A. Trakhtenbrot</a>: <br><b>Automata, circuits and hybrids: facets of continuous time. </b>754-755<br><a href="http://doi.acm.org/10.1145/380752.380884"><i>Electronic Edition</i></a> (<a href="http://www.acm.org/dl/">ACM DL</a>) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Trakhtenbrot01">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
