focs2002.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>FOCS 2002</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>43. <a href="index.html">FOCS</a> 2002:
Vancouver,
BC,
Canada</h1> 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings.
IEEE Computer Society 2002, ISBN 0-7695-1822-2 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/2002">BibTeX</a></font>
<pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/focs/2002,
title = {43rd Symposium on Foundations of Computer Science (FOCS 2002),
16-19 November 2002, Vancouver, BC, Canada, Proceedings},
booktitle = {FOCS},
publisher = {IEEE Computer Society},
year = {2002},
isbn = {0-7695-1822-2},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
<h2>Tutorial 1</h2>
<ul>
<li><a name="Goldreich02" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>:
<br><b>Zero-Knowledge.
</b>3-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181876"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Goldreich02">BibTeX</a></font>
</ul>
<h2>Tutorial 3</h2>
<ul>
<li><a name="Vadhan02" href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>:
<br><b>Randomness Extractors and their Many Guises.
</b>9-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181877"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vadhan02">BibTeX</a></font>
</ul>
<h2>Session 1A</h2>
<ul>
<li><a name="GoldreichS02" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>:
<br><b>Locally Testable Codes and PCPs of Almost-Linear Length.
</b>13-22<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181878"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldreichS02">BibTeX</a></font>
<li><a name="Khot02" href="../../indices/a-tree/k/Khot:Subhash.html">Subhash Khot</a>:
<br><b>Hardness Results for Coloring 3 -Colorable 3 -Uniform Hypergraphs.
</b>23-32<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181879"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Khot02">BibTeX</a></font>
<li><a name="DinurRS02" href="../../indices/a-tree/d/Dinur:Irit.html">Irit Dinur</a>, <a href="../../indices/a-tree/r/Regev:Oded.html">Oded Regev</a>, <a href="../../indices/a-tree/s/Smyth:Clifford_D=.html">Clifford D. Smyth</a>:
<br><b>The Hardness of 3 - Uniform Hypergraph Coloring.
</b>33-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181880"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DinurRS02">BibTeX</a></font>
</ul>
<h2>Session 1B</h2>
<ul>
<li><a name="Racke02" href="../../indices/a-tree/r/R=auml=cke:Harald.html">Harald Räcke</a>:
<br><b>Minimizing Congestion in General Networks.
</b>43-52<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181881"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Racke02">BibTeX</a></font>
<li><a name="AlstrupR02" href="../../indices/a-tree/a/Alstrup:Stephen.html">Stephen Alstrup</a>, <a href="../../indices/a-tree/r/Rauhe:Theis.html">Theis Rauhe</a>:
<br><b>Small Induced-Universal Graphs and Compact Implicit Graph Representations.
</b>53-62<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181882"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlstrupR02">BibTeX</a></font>
<li><a name="KowalskiP02" href="../../indices/a-tree/k/Kowalski:Dariusz_R=.html">Dariusz R. Kowalski</a>, <a href="../../indices/a-tree/p/Pelc:Andrzej.html">Andrzej Pelc</a>:
<br><b>Deterministic Broadcasting Time in Radio Networks of Unknown Topology.
</b>63-72<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181883"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KowalskiP02">BibTeX</a></font>
<li><a name="AlonC02" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/c/Capalbo:Michael_R=.html">Michael R. Capalbo</a>:
<br><b>Explicit Unique-Neighbor Expanders.
</b>73-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181884"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonC02">BibTeX</a></font>
</ul>
<h2>Session 2A</h2>
<ul>
<li><a name="CzumajS02" href="../../indices/a-tree/c/Czumaj:Artur.html">Artur Czumaj</a>, <a href="../../indices/a-tree/s/Sohler:Christian.html">Christian Sohler</a>:
<br><b>Abstract Combinatorial Programs and Efficient Property Testers.
</b>83-92<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181885"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CzumajS02">BibTeX</a></font>
<li><a name="BogdanovOT02" href="../../indices/a-tree/b/Bogdanov:Andrej.html">Andrej Bogdanov</a>, <a href="../../indices/a-tree/o/Obata:Kenji.html">Kenji Obata</a>, <a href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>:
<br><b>A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs.
</b>93-102<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181886"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BogdanovOT02">BibTeX</a></font>
<li><a name="FischerKRSS02" href="../../indices/a-tree/f/Fischer:Eldar.html">Eldar Fischer</a>, <a href="../../indices/a-tree/k/Kindler:Guy.html">Guy Kindler</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>, <a href="../../indices/a-tree/s/Safra:Shmuel.html">Shmuel Safra</a>, <a href="../../indices/a-tree/s/Samorodnitsky:Alex.html">Alex Samorodnitsky</a>:
<br><b>Testing Juntas.
</b>103-112<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181887"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerKRSS02">BibTeX</a></font>
<li><a name="VempalaW02" href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>, <a href="../../indices/a-tree/w/Wang:Grant.html">Grant Wang</a>:
<br><b>A Spectral Algorithm for Learning Mixtures of Distributions.
</b>113-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181888"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VempalaW02">BibTeX</a></font>
</ul>
<h2>Session 2B</h2>
<ul>
<li><a name="Thorup02" href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>:
<br><b>Equivalence between Priority Queues and Sorting.
</b>125-134<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181889"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Thorup02">BibTeX</a></font>
<li><a name="HanT02" href="../../indices/a-tree/h/Han:Yijie.html">Yijie Han</a>, <a href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>:
<br><b>Integer Sorting in 0(n sqrt (log log n)) Expected Time and Linear Space.
</b>135-144<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181890"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HanT02">BibTeX</a></font>
<li><a name="FranceschiniGMP02" href="../../indices/a-tree/f/Franceschini:Gianni.html">Gianni Franceschini</a>, <a href="../../indices/a-tree/g/Grossi:Roberto.html">Roberto Grossi</a>, <a href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>, <a href="../../indices/a-tree/p/Pagli:Linda.html">Linda Pagli</a>:
<br><b>Implicit B-Trees: New Results for the Dictionary Problem.
</b>145-154<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181891"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FranceschiniGMP02">BibTeX</a></font>
<li><a name="Pettie02" href="../../indices/a-tree/p/Pettie:Seth.html">Seth Pettie</a>:
<br><b>An Inverse-Ackermann Style Lower Bound for the Online Minimum Spanning Tree.
</b>155-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181892"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pettie02">BibTeX</a></font>
</ul>
<h2>Session 3A</h2>
<ul>
<li><a name="BshoutyG02" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>, <a href="../../indices/a-tree/g/Gavinsky:Dmitry.html">Dmitry Gavinsky</a>:
<br><b>PAC = PAExact and Other Equivalent Models in Learning.
</b>167-176<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181893"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BshoutyG02">BibTeX</a></font>
<li><a name="KlivansOS02" href="../../indices/a-tree/k/Klivans:Adam.html">Adam Klivans</a>, <a href="../../indices/a-tree/o/O=Donnell:Ryan.html">Ryan O'Donnell</a>, <a href="../../indices/a-tree/s/Servedio:Rocco_A=.html">Rocco A. Servedio</a>:
<br><b>Learning Intersections and Thresholds of Halfspaces.
</b>177-186<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181894"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KlivansOS02">BibTeX</a></font>
<li><a name="Vovk02" href="../../indices/a-tree/v/Vovk:Vladimir.html">Vladimir Vovk</a>:
<br><b>On-Line Confidence Machines Are Well-Calibrated.
</b>187-196<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181895"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vovk02">BibTeX</a></font>
<li><a name="AlonBKRS02" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/b/Beigel:Richard.html">Richard Beigel</a>, <a href="../../indices/a-tree/k/Kasif:Simon.html">Simon Kasif</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>, <a href="../../indices/a-tree/s/Sudakov:Benny.html">Benny Sudakov</a>:
<br><b>Learning a Hidden Matching.
</b>197-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181943"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonBKRS02">BibTeX</a></font>
</ul>
<h2>Session 3B</h2>
<ul>
<li><a name="Bar-YossefJKS02" href="../../indices/a-tree/b/Bar=Yossef:Ziv.html">Ziv Bar-Yossef</a>, <a href="../../indices/a-tree/j/Jayram:T=_S=.html">T. S. Jayram</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>An Information Statistics Approach to Data Stream and Communication Complexity.
</b>209-218<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181944"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bar-YossefJKS02">BibTeX</a></font>
<li><a name="CirianiFLM02" href="../../indices/a-tree/c/Ciriani:Valentina.html">Valentina Ciriani</a>, <a href="../../indices/a-tree/f/Ferragina:Paolo.html">Paolo Ferragina</a>, <a href="../../indices/a-tree/l/Luccio:Fabrizio.html">Fabrizio Luccio</a>, <a href="../../indices/a-tree/m/Muthukrishnan:S=.html">S. Muthukrishnan</a>:
<br><b>Static Optimality Theorem for External Memory String Access.
</b>219-227<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181945"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CirianiFLM02">BibTeX</a></font>
<li><a name="Gafni02" href="../../indices/a-tree/g/Gafni:Eli.html">Eli Gafni</a>:
<br><b>A Simple Algorithmic Characterization of Uniform Solvability.
</b>228-237<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181946"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gafni02">BibTeX</a></font>
<li><a name="BansalBC02" href="../../indices/a-tree/b/Bansal:Nikhil.html">Nikhil Bansal</a>, <a href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/c/Chawla:Shuchi.html">Shuchi Chawla</a>:
<br><b>Correlation Clustering.
</b>238-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181947"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BansalBC02">BibTeX</a></font>
</ul>
<h2>Session 4A</h2>
<ul>
<li><a name="FeldmanK02" href="../../indices/a-tree/f/Feldman:Jon.html">Jon Feldman</a>, <a href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>:
<br><b>Decoding Turbo-Like Codes via Linear Programming.
</b>251-260<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181948"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeldmanK02">BibTeX</a></font>
<li><a name="BeimelIKR02" href="../../indices/a-tree/b/Beimel:Amos.html">Amos Beimel</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/Raymond:Jean=Fran=ccedil=ois.html">Jean-François Raymond</a>:
<br><b>Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval.
</b>261-270<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181949"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeimelIKR02">BibTeX</a></font>
<li><a name="Luby02" href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>:
<br><b>LT Codes.
</b>271-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181950"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Luby02">BibTeX</a></font>
</ul>
<h2>Session 4B</h2>
<ul>
<li><a name="FeigeLS02" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/l/Langberg:Michael.html">Michael Langberg</a>, <a href="../../indices/a-tree/s/Schechtman:Gideon.html">Gideon Schechtman</a>:
<br><b>Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers.
</b>283-292<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181951"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeigeLS02">BibTeX</a></font>
<li><a name="AndrewsZ02" 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>Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data.
</b>293-302<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181952"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AndrewsZ02">BibTeX</a></font>
<li><a name="GargY02" href="../../indices/a-tree/g/Garg:Naveen.html">Naveen Garg</a>, <a href="../../indices/a-tree/y/Young:Neal_E=.html">Neal E. Young</a>:
<br><b>On-Line End-to-End Congestion Control.
</b>303-312<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181953"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GargY02">BibTeX</a></font>
</ul>
<h2>Session 1A</h2>
<ul>
<li><a name="AroraBL02" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/b/Bollob=aacute=s:B=eacute=la.html">Béla Bollobás</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>:
<br><b>Proving Integrality Gaps without Knowing the Linear Program.
</b>313-322<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181954"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AroraBL02">BibTeX</a></font>
<li><a name="GandhiKPS02" href="../../indices/a-tree/g/Gandhi:Rajiv.html">Rajiv Gandhi</a>, <a href="../../indices/a-tree/k/Khuller:Samir.html">Samir Khuller</a>, <a href="../../indices/a-tree/p/Parthasarathy_0002:Srinivasan.html">Srinivasan Parthasarathy</a>, <a href="../../indices/a-tree/s/Srinivasan:Aravind.html">Aravind Srinivasan</a>:
<br><b>Dependent Rounding in Bipartite Graphs.
</b>323-332<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181955"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GandhiKPS02">BibTeX</a></font>
<li><a name="KumarGR02" href="../../indices/a-tree/k/Kumar:Amit.html">Amit Kumar</a>, <a href="../../indices/a-tree/g/Gupta:Anupam.html">Anupam Gupta</a>, <a href="../../indices/a-tree/r/Roughgarden:Tim.html">Tim Roughgarden</a>:
<br><b>A Constant-Factor Approximation Algorithm for the Multicommodity.
</b>333-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181956"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KumarGR02">BibTeX</a></font>
</ul>
<h2>Session 1B</h2>
<ul>
<li><a name="Barak02" href="../../indices/a-tree/b/Barak:Boaz.html">Boaz Barak</a>:
<br><b>Constant-Round Coin-Tossing with a Man in the Middle or Realizing the Shared Random String Model.
</b>345-355<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181957"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Barak02">BibTeX</a></font>
<li><a name="Micciancio02" href="../../indices/a-tree/m/Micciancio:Daniele.html">Daniele Micciancio</a>:
<br><b>Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions from Worst-Case Complexity Assumptions.
</b>356-365<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181960"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Micciancio02">BibTeX</a></font>
<li><a name="PrabhakaranRS02" href="../../indices/a-tree/p/Prabhakaran:Manoj.html">Manoj Prabhakaran</a>, <a href="../../indices/a-tree/r/Rosen:Alon.html">Alon Rosen</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>:
<br><b>Concurrent Zero Knowledge with Logarithmic Round-Complexity.
</b>366-375<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181961"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PrabhakaranRS02">BibTeX</a></font>
<li><a name="DodisS02" href="../../indices/a-tree/d/Dodis:Yevgeniy.html">Yevgeniy Dodis</a>, <a href="../../indices/a-tree/s/Spencer:Joel.html">Joel Spencer</a>:
<br><b>On the (non)Universality of the One-Time Pad.
</b>376-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181962"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DodisS02">BibTeX</a></font>
</ul>
<h2>Session 2A</h2>
<ul>
<li><a name="DevanurPSV02" href="../../indices/a-tree/d/Devanur:Nikhil_R=.html">Nikhil R. Devanur</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/s/Saberi:Amin.html">Amin Saberi</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>:
<br><b>Market Equilibrium via a Primal-Dual-Type Algorithm.
</b>389-395<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181963"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DevanurPSV02">BibTeX</a></font>
<li><a name="RonenS02" href="../../indices/a-tree/r/Ronen:Amir.html">Amir Ronen</a>, <a href="../../indices/a-tree/s/Saberi:Amin.html">Amin Saberi</a>:
<br><b>On the Hardness of Optimal Auctions.
</b>396-405<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181964"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RonenS02">BibTeX</a></font>
<li><a name="BlumrosenN02" href="../../indices/a-tree/b/Blumrosen:Liad.html">Liad Blumrosen</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>:
<br><b>Auctions with Severely Bounded Communication.
</b>406-415<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181965"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumrosenN02">BibTeX</a></font>
<li><a name="Vetta02" href="../../indices/a-tree/v/Vetta:Adrian.html">Adrian Vetta</a>:
<br><b>Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions.
</b>416-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181966"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vetta02">BibTeX</a></font>
</ul>
<h2>Session 2B</h2>
<ul>
<li><a name="JainRS02" href="../../indices/a-tree/j/Jain:Rahul.html">Rahul Jain</a>, <a href="../../indices/a-tree/r/Radhakrishnan:Jaikumar.html">Jaikumar Radhakrishnan</a>, <a href="../../indices/a-tree/s/Sen:Pranab.html">Pranab Sen</a>:
<br><b>Privacy and Interaction in Quantum Communication Complexity and a Theorem about the Relative Entropy of Quantum States.
</b>429-438<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181967"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JainRS02">BibTeX</a></font>
<li><a name="Alekhnovich02" href="../../indices/a-tree/a/Alekhnovich:Michael.html">Michael Alekhnovich</a>:
<br><b>Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes.
</b>439-448<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181968"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Alekhnovich02">BibTeX</a></font>
<li><a name="BarnumCGST02" href="../../indices/a-tree/b/Barnum:Howard.html">Howard Barnum</a>, <a href="../../indices/a-tree/c/Cr=eacute=peau:Claude.html">Claude Crépeau</a>, <a href="../../indices/a-tree/g/Gottesman:Daniel.html">Daniel Gottesman</a>, <a href="../../indices/a-tree/s/Smith:Adam.html">Adam Smith</a>, <a href="../../indices/a-tree/t/Tapp:Alain.html">Alain Tapp</a>:
<br><b>Authentication of Quantum Messages.
</b>449-458<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181969"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BarnumCGST02">BibTeX</a></font>
<li><a name="Watrous02" href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>:
<br><b>imits on the Power of Quantum Statistical Zero-Knowledge.
</b>459-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181970"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Watrous02">BibTeX</a></font>
</ul>
<h2>Session 3A</h2>
<ul>
<li><a name="KempeK02" 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>:
<br><b>Protocols and Impossibility Results for Gossip-Based Communication Mechanisms.
</b>471-480<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181971"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KempeK02">BibTeX</a></font>
<li><a name="ChuzhoyN02" href="../../indices/a-tree/c/Chuzhoy:Julia.html">Julia Chuzhoy</a>, <a href="../../indices/a-tree/n/Naor:Joseph.html">Joseph Naor</a>:
<br><b>Covering Problems with Hard Capacities.
</b>481-489<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181972"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChuzhoyN02">BibTeX</a></font>
<li><a name="Caprara02" href="../../indices/a-tree/c/Caprara:Alberto.html">Alberto Caprara</a>:
<br><b>Packing 2-Dimensional Bins in Harmony.
</b>490-499<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181973"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Caprara02">BibTeX</a></font>
<li><a name="GargK02" href="../../indices/a-tree/g/Garg:Naveen.html">Naveen Garg</a>, <a href="../../indices/a-tree/k/Khandekar:Rohit.html">Rohit Khandekar</a>:
<br><b>Fast Approximation Algorithms for Fractional Steiner Forest and Related Problems.
</b>500-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181974"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GargK02">BibTeX</a></font>
</ul>
<h2>Session 3B</h2>
<ul>
<li><a name="Shi02" href="../../indices/a-tree/s/Shi:Yaoyun.html">Yaoyun Shi</a>:
<br><b>Quantum Lower Bounds for the Collision and the Element Distinctness Problems.
</b>513-519<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181975"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Shi02">BibTeX</a></font>
<li><a name="Regev02" href="../../indices/a-tree/r/Regev:Oded.html">Oded Regev</a>:
<br><b>Quantum Computation and Lattice Problems.
</b>520-529<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181976"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Regev02">BibTeX</a></font>
<li><a name="AdlemanKKR02" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>, <a href="../../indices/a-tree/k/Kari:Jarkko.html">Jarkko Kari</a>, <a href="../../indices/a-tree/k/Kari:Lila.html">Lila Kari</a>, <a href="../../indices/a-tree/r/Reishus:Dustin.html">Dustin Reishus</a>:
<br><b>On the Decidability of Self-Assembly of Infinite Ribbons.
</b>530-537<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181977"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AdlemanKKR02">BibTeX</a></font>
<li><a name="FlumG02" href="../../indices/a-tree/f/Flum:J=ouml=rg.html">Jörg Flum</a>, <a href="../../indices/a-tree/g/Grohe:Martin.html">Martin Grohe</a>:
<br><b>The Parameterized Complexity of Counting Problems.
</b>538-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181978"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FlumG02">BibTeX</a></font>
</ul>
<h2>Session 4A</h2>
<ul>
<li><a name="CharikarS02" href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>:
<br><b>Dimension Reduction in the \ell _1 Norm.
</b>551-560<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181979"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CharikarS02">BibTeX</a></font>
<li><a name="VaradarajanVZ02" href="../../indices/a-tree/v/Varadarajan:Kasturi_R=.html">Kasturi R. Varadarajan</a>, <a href="../../indices/a-tree/v/Venkatesh:Srinivasan.html">Srinivasan Venkatesh</a>, <a href="../../indices/a-tree/z/Zhang:Jiawei.html">Jiawei Zhang</a>:
<br><b>On Approximating the Radii of Point Sets in High Dimensions.
</b>561-569<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181980"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VaradarajanVZ02">BibTeX</a></font>
<li><a name="Chan02" href="../../indices/a-tree/c/Chan:Timothy_M=.html">Timothy M. Chan</a>:
<br><b>Low-Dimensional Linear Programming with Violations.
</b>570-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181981"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chan02">BibTeX</a></font>
</ul>
<h2>Session 4B</h2>
<ul>
<li><a name="Buresh-OppenheimBPRS02" href="../../indices/a-tree/b/Buresh=Oppenheim:Josh.html">Josh Buresh-Oppenheim</a>, <a href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>, <a href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>, <a href="../../indices/a-tree/s/Sabharwal:Ashish.html">Ashish Sabharwal</a>:
<br><b>Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles.
</b>583-592<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181982"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Buresh-OppenheimBPRS02">BibTeX</a></font>
<li><a name="AlekhnovichR02" href="../../indices/a-tree/a/Alekhnovich:Michael.html">Michael Alekhnovich</a>, <a href="../../indices/a-tree/r/Razborov:Alexander_A=.html">Alexander A. Razborov</a>:
<br><b>Satisfiability, Branch-Width and Tseitin Tautologies.
</b>593-603<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181983"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlekhnovichR02">BibTeX</a></font>
<li><a name="SegerlindBI02" href="../../indices/a-tree/s/Segerlind:Nathan.html">Nathan Segerlind</a>, <a href="../../indices/a-tree/b/Buss:Samuel_R=.html">Samuel R. Buss</a>, <a href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>:
<br><b>A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution.
</b>604-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181984"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SegerlindBI02">BibTeX</a></font>
</ul>
<h2>Session 1A</h2>
<ul>
<li><a name="BrodalJ02" href="../../indices/a-tree/b/Brodal:Gerth_St=oslash=lting.html">Gerth Stølting Brodal</a>, <a href="../../indices/a-tree/j/Jacob:Riko.html">Riko Jacob</a>:
<br><b>Dynamic Planar Convex Hull.
</b>617-626<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181985"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BrodalJ02">BibTeX</a></font>
<li><a name="VerdiereL02" href="../../indices/a-tree/v/Verdi=egrave=re:=Eacute=ric_Colin_de.html">Éric Colin de Verdière</a>, <a href="../../indices/a-tree/l/Lazarus:Francis.html">Francis Lazarus</a>:
<br><b>Optimal System of Loops on an Orientable Surface.
</b>627-636<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181986"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VerdiereL02">BibTeX</a></font>
<li><a name="KoltunS02" href="../../indices/a-tree/k/Koltun:Vladlen.html">Vladlen Koltun</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>:
<br><b>The Partition Technique for Overlays of Envelopes.
</b>637-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181989"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KoltunS02">BibTeX</a></font>
</ul>
<h2>Session 1B</h2>
<ul>
<li><a name="Bulatov02" href="../../indices/a-tree/b/Bulatov:Andrei_A=.html">Andrei A. Bulatov</a>:
<br><b>A Dichotomy Theorem for Constraints on a Three-Element Set.
</b>649-658<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181990"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bulatov02">BibTeX</a></font>
<li><a name="BurgisserL02" href="../../indices/a-tree/b/B=uuml=rgisser:Peter.html">Peter Bürgisser</a>, <a href="../../indices/a-tree/l/Lotz:Martin.html">Martin Lotz</a>:
<br><b>Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps.
</b>659-668<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181991"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BurgisserL02">BibTeX</a></font>
<li><a name="AllenderBKMR02" href="../../indices/a-tree/a/Allender:Eric.html">Eric Allender</a>, <a href="../../indices/a-tree/b/Buhrman:Harry.html">Harry Buhrman</a>, <a href="../../indices/a-tree/k/Kouck=yacute=:Michal.html">Michal Koucký</a>, <a href="../../indices/a-tree/m/Melkebeek:Dieter_van.html">Dieter van Melkebeek</a>, <a href="../../indices/a-tree/r/Ronneburger:Detlef.html">Detlef Ronneburger</a>:
<br><b>Power from Random Strings.
</b>669-678<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181992"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AllenderBKMR02">BibTeX</a></font>
<li><a name="RodittyZ02" href="../../indices/a-tree/r/Roditty:Liam.html">Liam Roditty</a>, <a href="../../indices/a-tree/z/Zwick:Uri.html">Uri Zwick</a>:
<br><b>Improved Dynamic Reachability Algorithms for Directed Graphs.
</b>679-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181993"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RodittyZ02">BibTeX</a></font>
</ul>
<h2>Session 2A</h2>
<ul>
<li><a name="EvenLRS02" href="../../indices/a-tree/e/Even:Guy.html">Guy Even</a>, <a href="../../indices/a-tree/l/Lotker:Zvi.html">Zvi Lotker</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>, <a href="../../indices/a-tree/s/Smorodinsky:Shakhar.html">Shakhar Smorodinsky</a>:
<br><b>Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks.
</b>691-700<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181994"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EvenLRS02">BibTeX</a></font>
<li><a name="BenjaminiL02" href="../../indices/a-tree/b/Benjamini:Itai.html">Itai Benjamini</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>:
<br><b>Global Information from Local Observation.
</b>701-710<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181995"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BenjaminiL02">BibTeX</a></font>
<li><a name="CryanDGJM02" href="../../indices/a-tree/c/Cryan:Mary.html">Mary Cryan</a>, <a href="../../indices/a-tree/d/Dyer:Martin_E=.html">Martin E. Dyer</a>, <a href="../../indices/a-tree/g/Goldberg:Leslie_Ann.html">Leslie Ann Goldberg</a>, <a href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>, <a href="../../indices/a-tree/m/Martin:Russell_A=.html">Russell A. Martin</a>:
<br><b>Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows.
</b>711-720<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181996"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CryanDGJM02">BibTeX</a></font>
<li><a name="JerrumS02" href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>, <a href="../../indices/a-tree/s/Son:Jung=Bae.html">Jung-Bae Son</a>:
<br><b>Spectral Gap and log-Sobolev Constant for Balanced Matroids.
</b>721-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181997"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/JerrumS02">BibTeX</a></font>
</ul>
<h2>Session 2B</h2>
<ul>
<li><a name="Ajtai02" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>:
<br><b>Random Lattices and a Conjectured 0 - 1 Law about Their Polynomial Time Computable Properties.
</b>733-742<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181998"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ajtai02">BibTeX</a></font>
<li><a name="ArvindK02" href="../../indices/a-tree/a/Arvind:Vikraman.html">Vikraman Arvind</a>, <a href="../../indices/a-tree/k/Kurur:Piyush_P=.html">Piyush P. Kurur</a>:
<br><b>Graph Isomorphism is in SPP.
</b>743-750<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1181999"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ArvindK02">BibTeX</a></font>
<li><a name="VereshchaginV02" href="../../indices/a-tree/v/Vereshchagin:Nikolai_K=.html">Nikolai K. Vereshchagin</a>, <a href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vitányi</a>:
<br><b>Kolmogorov's Structure Functions with an Application to the Foundations of Model Selection.
</b>751-760<br><a href="http://www.computer.org/proceedings/focs/1822/18220751abs.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/VereshchaginV02">BibTeX</a></font>
<li><a name="Levin02" href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>:
<br><b>Forbidden Information.
</b>761-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1182001"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Levin02">BibTeX</a></font>
</ul>
<h2>Session 3</h2>
<ul>
<li><a name="DuboisM02" href="../../indices/a-tree/d/Dubois:Olivier.html">Olivier Dubois</a>, <a href="../../indices/a-tree/m/Mandler:Jacques.html">Jacques Mandler</a>:
<br><b>The 3-XORSAT Threshold.
</b>769-778<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1182002"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DuboisM02">BibTeX</a></font>
<li><a name="AchlioptasM02" href="../../indices/a-tree/a/Achlioptas:Dimitris.html">Dimitris Achlioptas</a>, <a href="../../indices/a-tree/m/Moore:Cristopher.html">Cristopher Moore</a>:
<br><b>The Asymptotic Order of the Random k -SAT Threshold.
</b>779-788<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1182003"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AchlioptasM02">BibTeX</a></font>
<li><a name="Frieze02" href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>:
<br><b>On Random Symmetric Travelling Salesman Problems.
</b>789-798<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1182004"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Frieze02">BibTeX</a></font>
<li><a name="MitzenmacherPS02" href="../../indices/a-tree/m/Mitzenmacher:Michael.html">Michael Mitzenmacher</a>, <a href="../../indices/a-tree/p/Prabhakar:Balaji.html">Balaji Prabhakar</a>, <a href="../../indices/a-tree/s/Shah:Devavrat.html">Devavrat Shah</a>:
<br><b>Load Balancing with Memory.
</b>799-808<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1182005"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MitzenmacherPS02">BibTeX</a></font>
<li><a name="HershbergerS02" href="../../indices/a-tree/h/Hershberger:John.html">John Hershberger</a>, <a href="../../indices/a-tree/s/Suri:Subhash.html">Subhash Suri</a>:
<br><b>Erratum to "Vickrey Pricing and Shortest Paths: What is an Edge Worth?".
</b>809-<br><a href="http://doi.ieeecomputersociety.org/10.1109/SFCS.2002.1182006"><i>Electronic Edition</i></a> (link) <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HershbergerS02">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:27 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
