Personal tools
You are here: Home → dblp → db → conf → stoc → stoc2004.html
 

stoc2004.html

Click here to view the file or click here to download the file

Size 38.6 kB - File type text/html

File contents

<html><head><title>STOC 2004</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>36. <a href="index.html">STOC</a> 2004:
Chicago,
IL,
USA</h1> <a name="2004" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">L&aacute;szl&oacute; Babai</a> (Ed.):
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004.
 ACM 2004, ISBN 1-58113-852-0 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/2004">BibTeX</a></font>
 <pre>@proceedings{<a href="../../about/bibtex.html">DBLP</a>:conf/stoc/2004,
  editor    = {L{\'a}szl{\'o} Babai},
  title     = {Proceedings of the 36th Annual ACM Symposium on Theory of Computing,
               Chicago, IL, USA, June 13-16, 2004},
  booktitle = {STOC},
  publisher = {ACM},
  year      = {2004},
  isbn      = {1-58113-852-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
</pre>
 
<h2>Session 1A</h2> 
<ul>
<li><a name="Ben-SassonGHSV04" href="../../indices/a-tree/b/Ben=Sasson:Eli.html">Eli Ben-Sasson</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/h/Harsha:Prahladh.html">Prahladh Harsha</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>:
<br><b>Robust pcps of proximity, shorter pcps and applications to coding.
</b>1-10<br><a href="http://doi.acm.org/10.1145/1007352.1007361"><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/Ben-SassonGHSV04">BibTeX</a></font>

<li><a name="HolmerinK04" href="../../indices/a-tree/h/Holmerin:Jonas.html">Jonas Holmerin</a>, <a href="../../indices/a-tree/k/Khot:Subhash.html">Subhash Khot</a>:
<br><b>A new PCP outer verifier with applications to homogeneous linear equations and max-bisection.
</b>11-20<br><a href="http://doi.acm.org/10.1145/1007352.1007362"><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/HolmerinK04">BibTeX</a></font>

<li><a name="ChuzhoyGHKKN04" href="../../indices/a-tree/c/Chuzhoy:Julia.html">Julia Chuzhoy</a>, <a href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/h/Halperin:Eran.html">Eran Halperin</a>, <a href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/k/Kortsarz:Guy.html">Guy Kortsarz</a>, <a href="../../indices/a-tree/n/Naor:Joseph.html">Joseph Naor</a>:
<br><b>Asymmetric k-center is log<sup>*</sup> <i>n</i>-hard to approximate.
</b>21-27<br><a href="http://doi.acm.org/10.1145/1007352.1007363"><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/ChuzhoyGHKKN04">BibTeX</a></font>

<li><a name="ChuzhoyN04" 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>New hardness results for congestion minimization and machine scheduling.
</b>28-34<br><a href="http://doi.acm.org/10.1145/1007352.1007364"><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/ChuzhoyN04">BibTeX</a></font>

<li><a name="AlbersS04" href="../../indices/a-tree/a/Albers:Susanne.html">Susanne Albers</a>, <a href="../../indices/a-tree/s/Schmidt:Markus.html">Markus Schmidt</a>:
<br><b>On the performance of greedy algorithms in packet buffering.
</b>35-44<br><a href="http://doi.acm.org/10.1145/1007352.1007366"><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/AlbersS04">BibTeX</a></font>

</ul>
<h2>Session 1B</h2> 
<ul>
<li><a name="AwerbuchK04" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/k/Kleinberg:Robert_D=.html">Robert D. Kleinberg</a>:
<br><b>Adaptive routing with end-to-end feedback: distributed learning and geometric approaches.
</b>45-53<br><a href="http://doi.acm.org/10.1145/1007352.1007367"><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/AwerbuchK04">BibTeX</a></font>

<li><a name="MankuNW04" href="../../indices/a-tree/m/Manku:Gurmeet_Singh.html">Gurmeet Singh Manku</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/w/Wieder:Udi.html">Udi Wieder</a>:
<br><b>Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks.
</b>54-63<br><a href="http://doi.acm.org/10.1145/1007352.1007368"><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/MankuNW04">BibTeX</a></font>

<li><a name="AzarR04" href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>, <a href="../../indices/a-tree/r/Richter:Yossi.html">Yossi Richter</a>:
<br><b>The zero-one principle for switching networks.
</b>64-71<br><a href="http://doi.acm.org/10.1145/1007352.1007369"><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/AzarR04">BibTeX</a></font>

</ul>
<h2>Session 2A</h2> 
<ul>
<li><a name="AlonN04" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/n/Naor:Assaf.html">Assaf Naor</a>:
<br><b>Approximating the cut-norm via Grothendieck's inequality.
</b>72-80<br><a href="http://doi.acm.org/10.1145/1007352.1007371"><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/AlonN04">BibTeX</a></font>

<li><a name="SpielmanT04" 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>Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems.
</b>81-90<br><a href="http://doi.acm.org/10.1145/1007352.1007372"><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/SpielmanT04">BibTeX</a></font>

</ul>
<h2>Session 2B</h2> 
<ul>
<li><a name="ColeGL04" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/g/Gottlieb:Lee=Ad.html">Lee-Ad Gottlieb</a>, <a href="../../indices/a-tree/l/Lewenstein:Moshe.html">Moshe Lewenstein</a>:
<br><b>Dictionary matching and indexing with errors and don't cares.
</b>91-100<br><a href="http://doi.acm.org/10.1145/1007352.1007374"><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/ColeGL04">BibTeX</a></font>

<li><a name="FinocchiI04" href="../../indices/a-tree/f/Finocchi:Irene.html">Irene Finocchi</a>, <a href="../../indices/a-tree/i/Italiano:Giuseppe_F=.html">Giuseppe F. Italiano</a>:
<br><b>Sorting and searching in the presence of memory faults (without redundancy).
</b>101-110<br><a href="http://doi.acm.org/10.1145/1007352.1007375"><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/FinocchiI04">BibTeX</a></font>

<li><a name="Ambainis04" href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>:
<br><b>Quantum algorithms a decade after shor.
</b>111<br><a href="http://doi.acm.org/10.1145/1007352.1007354"><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/Ambainis04">BibTeX</a></font>

</ul>
<h2>Session 4A</h2> 
<ul>
<li><a name="Yao04" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>:
<br><b>Graph entropy and quantum sorting problems.
</b>112-117<br><a href="http://doi.acm.org/10.1145/1007352.1007377"><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/Yao04">BibTeX</a></font>

<li><a name="Aaronson04" href="../../indices/a-tree/a/Aaronson:Scott.html">Scott Aaronson</a>:
<br><b>Multilinear formulas and skepticism of quantum computing.
</b>118-127<br><a href="http://doi.acm.org/10.1145/1007352.1007378"><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/Aaronson04">BibTeX</a></font>

<li><a name="Bar-YossefJK04" 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/Kerenidis:Iordanis.html">Iordanis Kerenidis</a>:
<br><b>Exponential separation of quantum and classical one-way communication complexity.
</b>128-137<br><a href="http://doi.acm.org/10.1145/1007352.1007379"><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-YossefJK04">BibTeX</a></font>

</ul>
<h2>Session 4B</h2> 
<ul>
<li><a name="KortsarzN04" href="../../indices/a-tree/k/Kortsarz:Guy.html">Guy Kortsarz</a>, <a href="../../indices/a-tree/n/Nutov:Zeev.html">Zeev Nutov</a>:
<br><b>Approximation algorithm for k-node connected subgraphs via critical graphs.
</b>138-145<br><a href="http://doi.acm.org/10.1145/1007352.1007381"><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/KortsarzN04">BibTeX</a></font>

<li><a name="BienstockI04" href="../../indices/a-tree/b/Bienstock:Daniel.html">Daniel Bienstock</a>, <a href="../../indices/a-tree/i/Iyengar:Garud.html">Garud Iyengar</a>:
<br><b>Solving fractional packing problems in <i>O</i><sup>ast</sup>(1/?) iterations.
</b>146-155<br><a href="http://doi.acm.org/10.1145/1007352.1007382"><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/BienstockI04">BibTeX</a></font>

<li><a name="ChekuriKS04" 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/s/Shepherd:F=_Bruce.html">F. Bruce Shepherd</a>:
<br><b>The all-or-nothing multicommodity flow problem.
</b>156-165<br><a href="http://doi.acm.org/10.1145/1007352.1007383"><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/ChekuriKS04">BibTeX</a></font>

</ul>
<h2>Session 5A</h2> 
<ul>
<li><a name="BansalBCM04" 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>, <a href="../../indices/a-tree/m/Meyerson:Adam.html">Adam Meyerson</a>:
<br><b>Approximation algorithms for deadline-TSP and vehicle routing with time-windows.
</b>166-174<br><a href="http://doi.acm.org/10.1145/1007352.1007385"><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/BansalBCM04">BibTeX</a></font>

<li><a name="CzumajS04" 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>Estimating the weight of metric minimum spanning trees in sublinear-time.
</b>175-183<br><a href="http://doi.acm.org/10.1145/1007352.1007386"><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/CzumajS04">BibTeX</a></font>

<li><a name="RodittyZ04" 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>A fully dynamic reachability algorithm for directed graphs with an almost linear update time.
</b>184-191<br><a href="http://doi.acm.org/10.1145/1007352.1007387"><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/RodittyZ04">BibTeX</a></font>

</ul>
<h2>Session 5B</h2> 
<ul>
<li><a name="HealyVV04" href="../../indices/a-tree/h/Healy:Alexander.html">Alexander Healy</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>, <a href="../../indices/a-tree/v/Viola:Emanuele.html">Emanuele Viola</a>:
<br><b>Using nondeterminism to amplify hardness.
</b>192-201<br><a href="http://doi.acm.org/10.1145/1007352.1007389"><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/HealyVV04">BibTeX</a></font>

<li><a name="AlurM04" href="../../indices/a-tree/a/Alur:Rajeev.html">Rajeev Alur</a>, <a href="../../indices/a-tree/m/Madhusudan:P=.html">P. Madhusudan</a>:
<br><b>Visibly pushdown languages.
</b>202-211<br><a href="http://doi.acm.org/10.1145/1007352.1007390"><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/AlurM04">BibTeX</a></font>

<li><a name="ChenHKX04" href="../../indices/a-tree/c/Chen:Jianer.html">Jianer Chen</a>, <a href="../../indices/a-tree/h/Huang:Xiuzhen.html">Xiuzhen Huang</a>, <a href="../../indices/a-tree/k/Kanj:Iyad_A=.html">Iyad A. Kanj</a>, <a href="../../indices/a-tree/x/Xia:Ge.html">Ge Xia</a>:
<br><b>Linear FPT reductions and computational lower bounds.
</b>212-221<br><a href="http://doi.acm.org/10.1145/1007352.1007391"><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/ChenHKX04">BibTeX</a></font>

<li><a name="AroraRV04" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>:
<br><b>Expander flows, geometric embeddings and graph partitioning.
</b>222-231<br><a href="http://doi.acm.org/10.1145/1007352.1007355"><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/AroraRV04">BibTeX</a></font>

</ul>
<h2>Session 7A</h2> 
<ul>
<li><a name="Pass04" href="../../indices/a-tree/p/Pass:Rafael.html">Rafael Pass</a>:
<br><b>Bounded-concurrent secure multi-party computation with a dishonest majority.
</b>232-241<br><a href="http://doi.acm.org/10.1145/1007352.1007393"><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/Pass04">BibTeX</a></font>

<li><a name="PrabhakaranS04" href="../../indices/a-tree/p/Prabhakaran:Manoj.html">Manoj Prabhakaran</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>:
<br><b>New notions of security: achieving universal composability without trusted setup.
</b>242-251<br><a href="http://doi.acm.org/10.1145/1007352.1007394"><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/PrabhakaranS04">BibTeX</a></font>

<li><a name="HarnikNRR04" href="../../indices/a-tree/h/Harnik:Danny.html">Danny Harnik</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/r/Rosen:Alon.html">Alon Rosen</a>:
<br><b>Completeness in two-party secure computation: a computational view.
</b>252-261<br><a href="http://doi.acm.org/10.1145/1007352.1007395"><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/HarnikNRR04">BibTeX</a></font>

<li><a name="IshaiKOS04" 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/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>:
<br><b>Batch codes and their applications.
</b>262-271<br><a href="http://doi.acm.org/10.1145/1007352.1007396"><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/IshaiKOS04">BibTeX</a></font>

</ul>
<h2>Session 7B</h2> 
<ul>
<li><a name="KenyonRS04" href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>, <a href="../../indices/a-tree/s/Sinclair:Alistair.html">Alistair Sinclair</a>:
<br><b>Low distortion maps between point sets.
</b>272-280<br><a href="http://doi.acm.org/10.1145/1007352.1007398"><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/KenyonRS04">BibTeX</a></font>

<li><a name="Talwar04" href="../../indices/a-tree/t/Talwar:Kunal.html">Kunal Talwar</a>:
<br><b>Bypassing the embedding: algorithms for low dimensional metrics.
</b>281-290<br><a href="http://doi.acm.org/10.1145/1007352.1007399"><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/Talwar04">BibTeX</a></font>

<li><a name="Har-PeledM04" href="../../indices/a-tree/h/Har=Peled:Sariel.html">Sariel Har-Peled</a>, <a href="../../indices/a-tree/m/Mazumdar:Soham.html">Soham Mazumdar</a>:
<br><b>On coresets for k-means and k-median clustering.
</b>291-300<br><a href="http://doi.acm.org/10.1145/1007352.1007400"><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/Har-PeledM04">BibTeX</a></font>

<li><a name="BoissonnatCV04" href="../../indices/a-tree/b/Boissonnat:Jean=Daniel.html">Jean-Daniel Boissonnat</a>, <a href="../../indices/a-tree/c/Cohen=Steiner:David.html">David Cohen-Steiner</a>, <a href="../../indices/a-tree/v/Vegter:Gert.html">Gert Vegter</a>:
<br><b>Isotopic implicit surface meshing.
</b>301-309<br><a href="http://doi.acm.org/10.1145/1007352.1007401"><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/BoissonnatCV04">BibTeX</a></font>

</ul>
<h2>Session 8A</h2> 
<ul>
<li><a name="LovaszV04" href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">L&aacute;szl&oacute; Lov&aacute;sz</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>:
<br><b>Hit-and-run from a corner.
</b>310-314<br><a href="http://doi.acm.org/10.1145/1007352.1007403"><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/LovaszV04">BibTeX</a></font>

<li><a name="DunaganV04" 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>A simple polynomial-time rescaling algorithm for solving linear programs.
</b>315-320<br><a href="http://doi.acm.org/10.1145/1007352.1007404"><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/DunaganV04">BibTeX</a></font>

</ul>
<h2>Session 8B</h2> 
<ul>
<li><a name="ChlebusKS04" href="../../indices/a-tree/c/Chlebus:Bogdan_S=.html">Bogdan S. Chlebus</a>, <a href="../../indices/a-tree/k/Kowalski:Dariusz_R=.html">Dariusz R. Kowalski</a>, <a href="../../indices/a-tree/s/Shvartsman:Alexander_A=.html">Alexander A. Shvartsman</a>:
<br><b>Collective asynchronous reading with polylogarithmic worst-case overhead.
</b>321-330<br><a href="http://doi.acm.org/10.1145/1007352.1007406"><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/ChlebusKS04">BibTeX</a></font>

<li><a name="Elkin04" href="../../indices/a-tree/e/Elkin:Michael.html">Michael Elkin</a>:
<br><b>Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem.
</b>331-340<br><a href="http://doi.acm.org/10.1145/1007352.1007407"><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/Elkin04">BibTeX</a></font>

<li><a name="Tardos04" href="../../indices/a-tree/t/Tardos:=Eacute=va.html">&Eacute;va Tardos</a>:
<br><b>Network games.
</b>341-342<br><a href="http://doi.acm.org/10.1145/1007352.1007356"><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/Tardos04">BibTeX</a></font>

</ul>
<h2>Session 10A</h2> 
<ul>
<li><a name="BeierV04" href="../../indices/a-tree/b/Beier:Ren=eacute=.html">Ren&eacute; Beier</a>, <a href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold V&ouml;cking</a>:
<br><b>Typical properties of winners and losers in discrete optimization.
</b>343-352<br><a href="http://doi.acm.org/10.1145/1007352.1007409"><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/BeierV04">BibTeX</a></font>

<li><a name="LeviRS04" href="../../indices/a-tree/l/Levi:Retsef.html">Retsef Levi</a>, <a href="../../indices/a-tree/r/Roundy:Robin.html">Robin Roundy</a>, <a href="../../indices/a-tree/s/Shmoys:David_B=.html">David B. Shmoys</a>:
<br><b>Primal-dual algorithms for deterministic inventory problems.
</b>353-362<br><a href="http://doi.acm.org/10.1145/1007352.1007410"><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/LeviRS04">BibTeX</a></font>

<li><a name="ChekuriGKK04" href="../../indices/a-tree/c/Chekuri:Chandra.html">Chandra Chekuri</a>, <a href="../../indices/a-tree/g/Goel:Ashish.html">Ashish Goel</a>, <a href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/k/Kumar:Amit.html">Amit Kumar</a>:
<br><b>Multi-processor scheduling to minimize flow time with epsilon resource augmentation.
</b>363-372<br><a href="http://doi.acm.org/10.1145/1007352.1007411"><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/ChekuriGKK04">BibTeX</a></font>

</ul>
<h2>Session 10B</h2> 
<ul>
<li><a name="Indyk04" href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>:
<br><b>Algorithms for dynamic geometric problems over data streams.
</b>373-380<br><a href="http://doi.acm.org/10.1145/1007352.1007413"><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/Indyk04">BibTeX</a></font>

<li><a name="BatuKR04" href="../../indices/a-tree/b/Batu:Tugkan.html">Tugkan Batu</a>, <a href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>:
<br><b>Sublinear algorithms for testing monotone and unimodal distributions.
</b>381-390<br><a href="http://doi.acm.org/10.1145/1007352.1007414"><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/BatuKR04">BibTeX</a></font>

<li><a name="Fischer04" href="../../indices/a-tree/f/Fischer:Eldar.html">Eldar Fischer</a>:
<br><b>The difficulty of testing for isomorphism against a graph that is given in advance.
</b>391-397<br><a href="http://doi.acm.org/10.1145/1007352.1007415"><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/Fischer04">BibTeX</a></font>

</ul>
<h2>Session 11A</h2> 
<ul>
<li><a name="CorreaG04" href="../../indices/a-tree/c/Correa:Jos=eacute=_R=.html">Jos&eacute; R. Correa</a>, <a href="../../indices/a-tree/g/Goemans:Michel_X=.html">Michel X. Goemans</a>:
<br><b>An approximate K&ouml;nig's theorem for edge-coloring weighted bipartite graphs.
</b>398-406<br><a href="http://doi.acm.org/10.1145/1007352.1007417"><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/CorreaG04">BibTeX</a></font>

<li><a name="Gabow04" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>:
<br><b>Finding paths and cycles of superpolylogarithmic length.
</b>407-416<br><a href="http://doi.acm.org/10.1145/1007352.1007418"><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/Gabow04">BibTeX</a></font>

<li><a name="GuptaPRS04" href="../../indices/a-tree/g/Gupta:Anupam.html">Anupam Gupta</a>, <a href="../../indices/a-tree/p/P=aacute=l:Martin.html">Martin P&aacute;l</a>, <a href="../../indices/a-tree/r/Ravi:R=.html">R. Ravi</a>, <a href="../../indices/a-tree/s/Sinha:Amitabh.html">Amitabh Sinha</a>:
<br><b>Boosted sampling: approximation algorithms for stochastic optimization.
</b>417-426<br><a href="http://doi.acm.org/10.1145/1007352.1007419"><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/GuptaPRS04">BibTeX</a></font>

</ul>
<h2>Session 11B</h2> 
<ul>
<li><a name="ShpilkaW04" href="../../indices/a-tree/s/Shpilka:Amir.html">Amir Shpilka</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>Derandomizing homomorphism testing in general groups.
</b>427-435<br><a href="http://doi.acm.org/10.1145/1007352.1007421"><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/ShpilkaW04">BibTeX</a></font>

<li><a name="Guruswami04" href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>:
<br><b>Better extractors for better codes?
</b>436-444<br><a href="http://doi.acm.org/10.1145/1007352.1007422"><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/Guruswami04">BibTeX</a></font>

<li><a name="RozenmanSW04" href="../../indices/a-tree/r/Rozenman:Eyal.html">Eyal Rozenman</a>, <a href="../../indices/a-tree/s/Shalev:Aner.html">Aner Shalev</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>A new family of Cayley expanders (?).
</b>445-454<br><a href="http://doi.acm.org/10.1145/1007352.1007423"><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/RozenmanSW04">BibTeX</a></font>

<li><a name="Kelner04" href="../../indices/a-tree/k/Kelner:Jonathan_A=.html">Jonathan A. Kelner</a>:
<br><b>Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus.
</b>455-464<br><a href="http://doi.acm.org/10.1145/1007352.1007357"><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/Kelner04">BibTeX</a></font>

<li><a name="Aaronson04a" href="../../indices/a-tree/a/Aaronson:Scott.html">Scott Aaronson</a>:
<br><b>Lower bounds for local search by quantum arguments.
</b>465-474<br><a href="http://doi.acm.org/10.1145/1007352.1007358"><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/Aaronson04a">BibTeX</a></font>

<li><a name="BurgisserC04" href="../../indices/a-tree/b/B=uuml=rgisser:Peter.html">Peter B&uuml;rgisser</a>, <a href="../../indices/a-tree/c/Cucker:Felipe.html">Felipe Cucker</a>:
<br><b>Counting complexity classes for numeric computations II: algebraic and semialgebraic sets.
</b>475-485<br><a href="http://doi.acm.org/10.1145/1007352.1007425"><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/BurgisserC04">BibTeX</a></font>

</ul>
<h2>Session 14A</h2> 
<ul>
<li><a name="Ajtai04" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Mikl&oacute;s Ajtai</a>:
<br><b>A conjecture about polynomial time computable lattice-lattice functions.
</b>486-493<br><a href="http://doi.acm.org/10.1145/1007352.1007426"><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/Ajtai04">BibTeX</a></font>

<li><a name="SanthaS04" href="../../indices/a-tree/s/Santha:Miklos.html">Miklos Santha</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>:
<br><b>Quantum and classical query complexities of local search are polynomially related.
</b>494-501<br><a href="http://doi.acm.org/10.1145/1007352.1007427"><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/SanthaS04">BibTeX</a></font>

<li><a name="Reichardt04" href="../../indices/a-tree/r/Reichardt:Ben.html">Ben Reichardt</a>:
<br><b>The quantum adiabatic optimization algorithm and local minima.
</b>502-510<br><a href="http://doi.acm.org/10.1145/1007352.1007428"><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/Reichardt04">BibTeX</a></font>

<li><a name="GargK04" href="../../indices/a-tree/g/Garg:Rahul.html">Rahul Garg</a>, <a href="../../indices/a-tree/k/Kapoor:Sanjiv.html">Sanjiv Kapoor</a>:
<br><b>Auction algorithms for market equilibrium.
</b>511-518<br><a href="http://doi.acm.org/10.1145/1007352.1007430"><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/GargK04">BibTeX</a></font>

</ul>
<h2>Session 14B</h2> 
<ul>
<li><a name="Devanur04" href="../../indices/a-tree/d/Devanur:Nikhil_R=.html">Nikhil R. Devanur</a>:
<br><b>The spending constraint model for market equilibrium: algorithmic, existence and uniqueness results.
</b>519-528<br><a href="http://doi.acm.org/10.1145/1007352.1007431"><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/Devanur04">BibTeX</a></font>

<li><a name="ChenKLRSV04" href="../../indices/a-tree/c/Chen:Jiangzhuo.html">Jiangzhuo Chen</a>, <a href="../../indices/a-tree/k/Kleinberg:Robert_D=.html">Robert D. Kleinberg</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">L&aacute;szl&oacute; Lov&aacute;sz</a>, <a href="../../indices/a-tree/r/Rajaraman:Rajmohan.html">Rajmohan Rajaraman</a>, <a href="../../indices/a-tree/s/Sundaram:Ravi.html">Ravi Sundaram</a>, <a href="../../indices/a-tree/v/Vetta:Adrian.html">Adrian Vetta</a>:
<br><b>(Almost) tight bounds and existence theorems for confluent flows.
</b>529-538<br><a href="http://doi.acm.org/10.1145/1007352.1007432"><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/ChenKLRSV04">BibTeX</a></font>

<li><a name="Obata04" href="../../indices/a-tree/o/Obata:Kenji.html">Kenji Obata</a>:
<br><b>Approximate max-integral-flow/min-multicut theorems.
</b>539-545<br><a href="http://doi.acm.org/10.1145/1007352.1007433"><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/Obata04">BibTeX</a></font>

</ul>
<h2>Session 15A</h2> 
<ul>
<li><a name="PatrascuD04" href="../../indices/a-tree/p/Patrascu:Mihai.html">Mihai Patrascu</a>, <a href="../../indices/a-tree/d/Demaine:Erik_D=.html">Erik D. Demaine</a>:
<br><b>Lower bounds for dynamic connectivity.
</b>546-553<br><a href="http://doi.acm.org/10.1145/1007352.1007435"><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/PatrascuD04">BibTeX</a></font>

<li><a name="AilonC04" href="../../indices/a-tree/a/Ailon:Nir.html">Nir Ailon</a>, <a href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>:
<br><b>Lower bounds for linear degeneracy testing.
</b>554-560<br><a href="http://doi.acm.org/10.1145/1007352.1007436"><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/AilonC04">BibTeX</a></font>

</ul>
<h2>Session 15B</h2> 
<ul>
<li><a name="KempeM04" href="../../indices/a-tree/k/Kempe:David.html">David Kempe</a>, <a href="../../indices/a-tree/m/McSherry:Frank.html">Frank McSherry</a>:
<br><b>A decentralized algorithm for spectral analysis.
</b>561-568<br><a href="http://doi.acm.org/10.1145/1007352.1007438"><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/KempeM04">BibTeX</a></font>

<li><a name="KleinbergS04" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/s/Sandler:Mark.html">Mark Sandler</a>:
<br><b>Using mixture models for collaborative filtering.
</b>569-578<br><a href="http://doi.acm.org/10.1145/1007352.1007439"><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/KleinbergS04">BibTeX</a></font>

<li><a name="Wigderson04" href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>Depth through breadth, or why should we attend talks in other areas?
</b>579<br><a href="http://doi.acm.org/10.1145/1007352.1007359"><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/Wigderson04">BibTeX</a></font>

</ul>
<h2>Session 17A</h2> 
<ul>
<li><a name="GoelRK04" href="../../indices/a-tree/g/Goel:Ashish.html">Ashish Goel</a>, <a href="../../indices/a-tree/r/Rai:Sanatan.html">Sanatan Rai</a>, <a href="../../indices/a-tree/k/Krishnamachari:Bhaskar.html">Bhaskar Krishnamachari</a>:
<br><b>Sharp thresholds For monotone properties in random geometric graphs.
</b>580-586<br><a href="http://doi.acm.org/10.1145/1007352.1007441"><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/GoelRK04">BibTeX</a></font>

<li><a name="AchlioptasN04" href="../../indices/a-tree/a/Achlioptas:Dimitris.html">Dimitris Achlioptas</a>, <a href="../../indices/a-tree/n/Naor:Assaf.html">Assaf Naor</a>:
<br><b>The two possible values of the chromatic number of a random graph.
</b>587-593<br><a href="http://doi.acm.org/10.1145/1007352.1007442"><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/AchlioptasN04">BibTeX</a></font>

<li><a name="Feige04" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>:
<br><b>On sums of independent random variables with unbounded variance, and estimating the average degree in a graph.
</b>594-603<br><a href="http://doi.acm.org/10.1145/1007352.1007443"><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/Feige04">BibTeX</a></font>

<li><a name="FabrikantPT04" href="../../indices/a-tree/f/Fabrikant:Alex.html">Alex Fabrikant</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/t/Talwar:Kunal.html">Kunal Talwar</a>:
<br><b>The complexity of pure Nash equilibria.
</b>604-612<br><a href="http://doi.acm.org/10.1145/1007352.1007445"><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/FabrikantPT04">BibTeX</a></font>

</ul>
<h2>Session 17B</h2> 
<ul>
<li><a name="GairingLMM04" href="../../indices/a-tree/g/Gairing:Martin.html">Martin Gairing</a>, <a href="../../indices/a-tree/l/L=uuml=cking:Thomas.html">Thomas L&uuml;cking</a>, <a href="../../indices/a-tree/m/Mavronicolas:Marios.html">Marios Mavronicolas</a>, <a href="../../indices/a-tree/m/Monien:Burkhard.html">Burkhard Monien</a>:
<br><b>Computing Nash equilibria for scheduling on restricted parallel links.
</b>613-622<br><a href="http://doi.acm.org/10.1145/1007352.1007446"><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/GairingLMM04">BibTeX</a></font>

<li><a name="HalpernT04" href="../../indices/a-tree/h/Halpern:Joseph_Y=.html">Joseph Y. Halpern</a>, <a href="../../indices/a-tree/t/Teague:Vanessa.html">Vanessa Teague</a>:
<br><b>Rational secret sharing and multiparty computation: extended abstract.
</b>623-632<br><a href="http://doi.acm.org/10.1145/1007352.1007447"><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/HalpernT04">BibTeX</a></font>

<li><a name="Raz04" href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>:
<br><b>Multi-linear formulas for permanent and determinant are of super-polynomial size.
</b>633-641<br><a href="http://doi.acm.org/10.1145/1007352.1007353"><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/Raz04">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> &#151; 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 &#169;</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>
Document Actions
SIGMOD Record
SIGMOD Record