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

stoc2000.html

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

Size 45.3 kB - File type text/html

File contents

<html><head><title>STOC 2000</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>32. <a href="index.html">STOC</a> 2000:
Portland,
Oregon,
USA</h1> Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing,
May 21-23,
2000,
Portland,
OR,
USA. ACM,
2000 
<ul>
<li><a name="ImpagliazzoSW00" href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/s/Shaltiel:Ronen.html">Ronen Shaltiel</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>Extractors and pseudo-random generators with optimal seed length.
</b>1-10<br><a href="http://doi.acm.org/10.1145/335305.335306"><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/ImpagliazzoSW00">BibTeX</a></font>

<li><a name="NaorRR00" 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>Pseudo-random functions and factoring (extended abstract).
</b>11-20<br><a href="http://doi.acm.org/10.1145/335305.335307"><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/NaorRR00">BibTeX</a></font>

<li><a name="Gutierrez00" href="../../indices/a-tree/g/Guti=eacute=rrez:Claudio.html">Claudio Guti&eacute;rrez</a>:
<br><b>Satisfiability of equations in free groups is in PSPACE.
</b>21-27<br><a href="http://doi.acm.org/10.1145/335305.335308"><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/Gutierrez00">BibTeX</a></font>

<li><a name="Achlioptas00" href="../../indices/a-tree/a/Achlioptas:Dimitris.html">Dimitris Achlioptas</a>:
<br><b>Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract).
</b>28-37<br><a href="http://doi.acm.org/10.1145/335305.335309"><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/Achlioptas00">BibTeX</a></font>

<li><a name="CzumajS00" href="../../indices/a-tree/c/Czumaj:Artur.html">Artur Czumaj</a>, <a href="../../indices/a-tree/s/Scheideler:Christian.html">Christian Scheideler</a>:
<br><b>A new algorithm approach to the general Lov&aacute;sz local lemma with applications to scheduling and satisfiability problems (extended abstract).
</b>38-47<br><a href="http://doi.acm.org/10.1145/335305.335310"><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/CzumajS00">BibTeX</a></font>

<li><a name="GurvitsS00" href="../../indices/a-tree/g/Gurvits:Leonid.html">Leonid Gurvits</a>, <a href="../../indices/a-tree/s/Samorodnitsky:Alex.html">Alex Samorodnitsky</a>:
<br><b>A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume.
</b>48-57<br><a href="http://doi.acm.org/10.1145/335305.335311"><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/GurvitsS00">BibTeX</a></font>

<li><a name="CarrV00" href="../../indices/a-tree/c/Carr:Robert_D=.html">Robert D. Carr</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>:
<br><b>Randomized metarounding (extended abstract).
</b>58-62<br><a href="http://doi.acm.org/10.1145/335305.335312"><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/CarrV00">BibTeX</a></font>

<li><a name="Grohe00" href="../../indices/a-tree/g/Grohe:Martin.html">Martin Grohe</a>:
<br><b>Isomorphism testing for embeddable graphs through definability.
</b>63-72<br><a href="http://doi.acm.org/10.1145/335305.335313"><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/Grohe00">BibTeX</a></font>

<li><a name="KabanetsC00" href="../../indices/a-tree/k/Kabanets:Valentine.html">Valentine Kabanets</a>, <a href="../../indices/a-tree/c/Cai:Jin=yi.html">Jin-yi Cai</a>:
<br><b>Circuit minimization problem.
</b>73-79<br><a href="http://doi.acm.org/10.1145/335305.335314"><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/KabanetsC00">BibTeX</a></font>

<li><a name="KatzT00" href="../../indices/a-tree/k/Katz:Jonathan.html">Jonathan Katz</a>, <a href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>:
<br><b>On the efficiency of local decoding procedures for error-correcting codes.
</b>80-86<br><a href="http://doi.acm.org/10.1145/335305.335315"><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/KatzT00">BibTeX</a></font>

<li><a name="Istrail00" href="../../indices/a-tree/i/Istrail:Sorin.html">Sorin Istrail</a>:
<br><b>Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract).
</b>87-96<br><a href="http://doi.acm.org/10.1145/335305.335316"><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/Istrail00">BibTeX</a></font>

<li><a name="IwataFF00" href="../../indices/a-tree/i/Iwata:Satoru.html">Satoru Iwata</a>, <a href="../../indices/a-tree/f/Fleischer:Lisa.html">Lisa Fleischer</a>, <a href="../../indices/a-tree/f/Fujishige:Satoru.html">Satoru Fujishige</a>:
<br><b>A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions.
</b>97-106<br><a href="http://doi.acm.org/10.1145/335305.335317"><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/IwataFF00">BibTeX</a></font>

<li><a name="FleischerI00" href="../../indices/a-tree/f/Fleischer:Lisa.html">Lisa Fleischer</a>, <a href="../../indices/a-tree/i/Iwata:Satoru.html">Satoru Iwata</a>:
<br><b>Improved algorithms for submodular function minimization and submodular flow.
</b>107-116<br><a href="http://doi.acm.org/10.1145/335305.335318"><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/FleischerI00">BibTeX</a></font>

<li><a name="Vygen00" href="../../indices/a-tree/v/Vygen:Jens.html">Jens Vygen</a>:
<br><b>On dual minimum cost flow algorithms (extended abstract).
</b>117-125<br><a href="http://doi.acm.org/10.1145/335305.335319"><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/Vygen00">BibTeX</a></font>

<li><a name="PapadimitriouV00" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>:
<br><b>On the approximability of the traveling salesman problem (extended abstract).
</b>126-133<br><a href="http://doi.acm.org/10.1145/335305.335320"><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/PapadimitriouV00">BibTeX</a></font>

<li><a name="FeigeHK00" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/h/Halld=oacute=rsson:Magn=uacute=s_M=.html">Magn&uacute;s M. Halld&oacute;rsson</a>, <a href="../../indices/a-tree/k/Kortsarz:Guy.html">Guy Kortsarz</a>:
<br><b>Approximating the domatic number.
</b>134-143<br><a href="http://doi.acm.org/10.1145/335305.335321"><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/FeigeHK00">BibTeX</a></font>

<li><a name="Srinivasan00" href="../../indices/a-tree/s/Srinivasan:Aravind.html">Aravind Srinivasan</a>:
<br><b>The value of strong inapproximability results for clique.
</b>144-152<br><a href="http://doi.acm.org/10.1145/335305.335322"><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/Srinivasan00">BibTeX</a></font>

<li><a name="AdlerL00" href="../../indices/a-tree/a/Adler:Micah.html">Micah Adler</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>:
<br><b>Compression using efficient multicasting.
</b>153-162<br><a href="http://doi.acm.org/10.1145/335305.335324"><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/AdlerL00">BibTeX</a></font>

<li><a name="Kleinberg00" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>:
<br><b>The small-world phenomenon: an algorithm perspective.
</b>163-170<br><a href="http://doi.acm.org/10.1145/335305.335325"><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/Kleinberg00">BibTeX</a></font>

<li><a name="AielloCL00" href="../../indices/a-tree/a/Aiello:William.html">William Aiello</a>, <a href="../../indices/a-tree/c/Chung:Fan_R=_K=.html">Fan R. K. Chung</a>, <a href="../../indices/a-tree/l/Lu:Linyuan.html">Linyuan Lu</a>:
<br><b>A random graph model for massive graphs.
</b>171-180<br><a href="http://doi.acm.org/10.1145/335305.335326"><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/AielloCL00">BibTeX</a></font>

<li><a name="GuruswamiS00" href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>:
<br><b>List decoding algorithms for certain concatenated codes.
</b>181-190<br><a href="http://doi.acm.org/10.1145/335305.335327"><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/GuruswamiS00">BibTeX</a></font>

<li><a name="SamorodnitskyT00" href="../../indices/a-tree/s/Samorodnitsky:Alex.html">Alex Samorodnitsky</a>, <a href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>:
<br><b>A PCP characterization of NP with optimal amortized query complexity.
</b>191-199<br><a href="http://doi.acm.org/10.1145/335305.335329"><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/SamorodnitskyT00">BibTeX</a></font>

<li><a name="Vadhan00" href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>:
<br><b>On transformation of interactive proofs that preserve the prover's complexity.
</b>200-207<br><a href="http://doi.acm.org/10.1145/335305.335330"><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/Vadhan00">BibTeX</a></font>

<li><a name="CsirikJKOSW00" href="../../indices/a-tree/c/Csirik:J=aacute=nos.html">J&aacute;nos Csirik</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/o/Orlin:James_B=.html">James B. Orlin</a>, <a href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>, <a href="../../indices/a-tree/w/Weber:Richard_R=.html">Richard R. Weber</a>:
<br><b>On the sum-of-squares algorithm for bin packing.
</b>208-217<br><a href="http://doi.acm.org/10.1145/335305.335331"><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/CsirikJKOSW00">BibTeX</a></font>

<li><a name="FeigenbaumPS00" href="../../indices/a-tree/f/Feigenbaum:Joan.html">Joan Feigenbaum</a>, <a href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/s/Shenker:Scott.html">Scott Shenker</a>:
<br><b>Sharing the cost of muliticast transmissions (preliminary version).
</b>218-227<br><a href="http://doi.acm.org/10.1145/335305.335332"><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/FeigenbaumPS00">BibTeX</a></font>

<li><a name="KaoNT00" href="../../indices/a-tree/k/Kao:Ming=Yang.html">Ming-Yang Kao</a>, <a href="../../indices/a-tree/n/Nolte:Andreas.html">Andreas Nolte</a>, <a href="../../indices/a-tree/t/Tate:Stephen_R=.html">Stephen R. Tate</a>:
<br><b>The risk profile problem for stock portfolio optimization (extended abstract).
</b>228-234<br><a href="http://doi.acm.org/10.1145/335305.335333"><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/KaoNT00">BibTeX</a></font>

<li><a name="CanettiGGM00" href="../../indices/a-tree/c/Canetti:Ran.html">Ran Canetti</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>:
<br><b>Resettable zero-knowledge (extended abstract).
</b>235-244<br><a href="http://doi.acm.org/10.1145/335305.335334"><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/CanettiGGM00">BibTeX</a></font>

<li><a name="KatzY00" href="../../indices/a-tree/k/Katz:Jonathan.html">Jonathan Katz</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>:
<br><b>Complete characterization of security notions for probabilistic private-key encryption.
</b>245-254<br><a href="http://doi.acm.org/10.1145/335305.335335"><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/KatzY00">BibTeX</a></font>

<li><a name="CrescenzoSY00" href="../../indices/a-tree/c/Crescenzo:Giovanni_Di.html">Giovanni Di Crescenzo</a>, <a href="../../indices/a-tree/s/Sakurai:Kouichi.html">Kouichi Sakurai</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>:
<br><b>On zero-knowledge proofs (extended abstract): ``from membership to decision''.
</b>255-264<br><a href="http://doi.acm.org/10.1145/335305.335336"><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/CrescenzoSY00">BibTeX</a></font>

<li><a name="Boneh00" href="../../indices/a-tree/b/Boneh:Dan.html">Dan Boneh</a>:
<br><b>Finding smooth integers in short intervals using CRT decoding.
</b>265-272<br><a href="http://doi.acm.org/10.1145/335305.335337"><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/Boneh00">BibTeX</a></font>

<li><a name="EdelsbrunnerLMSTTUW00" href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>, <a href="../../indices/a-tree/l/Li:Xiang=Yang.html">Xiang-Yang Li</a>, <a href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/s/Stathopoulos:Andreas.html">Andreas Stathopoulos</a>, <a href="../../indices/a-tree/t/Talmor:Dafna.html">Dafna Talmor</a>, <a href="../../indices/a-tree/t/Teng:Shang=Hua.html">Shang-Hua Teng</a>, <a href="../../indices/a-tree/=/=Uuml=ng=ouml=r:Alper.html">Alper &Uuml;ng&ouml;r</a>, <a href="../../indices/a-tree/w/Walkington:Noel.html">Noel Walkington</a>:
<br><b>Smoothing and cleaning up slivers.
</b>273-277<br><a href="http://doi.acm.org/10.1145/335305.335338"><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/EdelsbrunnerLMSTTUW00">BibTeX</a></font>

<li><a name="BuschHW00" href="../../indices/a-tree/b/Busch:Costas.html">Costas Busch</a>, <a href="../../indices/a-tree/h/Herlihy:Maurice.html">Maurice Herlihy</a>, <a href="../../indices/a-tree/w/Wattenhofer:Roger.html">Roger Wattenhofer</a>:
<br><b>Hard-Potato routing.
</b>278-285<br><a href="http://doi.acm.org/10.1145/335305.338762"><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/BuschHW00">BibTeX</a></font>

<li><a name="AleksandrovMS00" href="../../indices/a-tree/a/Aleksandrov:Lyudmil.html">Lyudmil Aleksandrov</a>, <a href="../../indices/a-tree/m/Maheshwari:Anil.html">Anil Maheshwari</a>, <a href="../../indices/a-tree/s/Sack:J=ouml=rg=R=uuml=diger.html">J&ouml;rg-R&uuml;diger Sack</a>:
<br><b>Approximation algorithms for geometric shortest path problems.
</b>286-295<br><a href="http://doi.acm.org/10.1145/335305.335339"><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/AleksandrovMS00">BibTeX</a></font>

<li><a name="EvenGS00" href="../../indices/a-tree/e/Even:Guy.html">Guy Even</a>, <a href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>:
<br><b>Improved approximations of crossings in graph drawings.
</b>296-305<br><a href="http://doi.acm.org/10.1145/335305.335340"><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/EvenGS00">BibTeX</a></font>

<li><a name="MotwaniPSV00" href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/p/Panigrahy:Rina.html">Rina Panigrahy</a>, <a href="../../indices/a-tree/s/Saraswat:Vijay_A=.html">Vijay A. Saraswat</a>, <a href="../../indices/a-tree/v/Venkatasubramanian:Suresh.html">Suresh Venkatasubramanian</a>:
<br><b>On the decidability of accessibility problems (extended abstract).
</b>306-315<br><a href="http://doi.acm.org/10.1145/335305.335341"><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/MotwaniPSV00">BibTeX</a></font>

<li><a name="Kilian00" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>:
<br><b>More general completeness theorems for secure two-party computation.
</b>316-324<br><a href="http://doi.acm.org/10.1145/335305.335342"><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/Kilian00">BibTeX</a></font>

<li><a name="CramerDD00" href="../../indices/a-tree/c/Cramer:Ronald.html">Ronald Cramer</a>, <a href="../../indices/a-tree/d/Damg=aring=rd:Ivan.html">Ivan Damg&aring;rd</a>, <a href="../../indices/a-tree/d/Dziembowski:Stefan.html">Stefan Dziembowski</a>:
<br><b>On the complexity of verifiable secret sharing and multiparty computation.
</b>325-334<br><a href="http://doi.acm.org/10.1145/335305.335343"><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/CramerDD00">BibTeX</a></font>

<li><a name="AnderssonT00" href="../../indices/a-tree/a/Andersson:Arne.html">Arne Andersson</a>, <a href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>:
<br><b>Tight(er) worst-case bounds on dynamic searching and priority queues.
</b>335-342<br><a href="http://doi.acm.org/10.1145/335305.335344"><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/AnderssonT00">BibTeX</a></font>

<li><a name="Thorup00" href="../../indices/a-tree/t/Thorup:Mikkel.html">Mikkel Thorup</a>:
<br><b>Near-optimal fully-dynamic graph connectivity.
</b>343-350<br><a href="http://doi.acm.org/10.1145/335305.335345"><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/Thorup00">BibTeX</a></font>

<li><a name="MahajanV00" href="../../indices/a-tree/m/Mahajan:Meena.html">Meena Mahajan</a>, <a href="../../indices/a-tree/v/Varadarajan:Kasturi_R=.html">Kasturi R. Varadarajan</a>:
<br><b>A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract).
</b>351-357<br><a href="http://doi.acm.org/10.1145/335305.335346"><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/MahajanV00">BibTeX</a></font>

<li><a name="AlekhnovichBRW00" href="../../indices/a-tree/a/Alekhnovich:Michael.html">Michael Alekhnovich</a>, <a href="../../indices/a-tree/b/Ben=Sasson:Eli.html">Eli Ben-Sasson</a>, <a href="../../indices/a-tree/r/Razborov:Alexander_A=.html">Alexander A. Razborov</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
<br><b>Space complexity in propositional calculus.
</b>358-367<br><a href="http://doi.acm.org/10.1145/335305.335347"><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/AlekhnovichBRW00">BibTeX</a></font>

<li><a name="MacielPW00" href="../../indices/a-tree/m/Maciel:Alexis.html">Alexis Maciel</a>, <a href="../../indices/a-tree/p/Pitassi:Toniann.html">Toniann Pitassi</a>, <a href="../../indices/a-tree/w/Woods:Alan_R=.html">Alan R. Woods</a>:
<br><b>A new proof of the weak pigeonhole principle.
</b>368-377<br><a href="http://doi.acm.org/10.1145/335305.335348"><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/MacielPW00">BibTeX</a></font>

<li><a name="HarnikR00" href="../../indices/a-tree/h/Harnik:Danny.html">Danny Harnik</a>, <a href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>:
<br><b>Higher lower bounds on monotone size.
</b>378-387<br><a href="http://doi.acm.org/10.1145/335305.335349"><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/HarnikR00">BibTeX</a></font>

<li><a name="BarkolR00" href="../../indices/a-tree/b/Barkol:Omer.html">Omer Barkol</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>:
<br><b>Tighter bounds for nearest neighbor search and related problems in the cell probe model.
</b>388-396<br><a href="http://doi.acm.org/10.1145/335305.335350"><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/BarkolR00">BibTeX</a></font>

<li><a name="GrossiV00" href="../../indices/a-tree/g/Grossi:Roberto.html">Roberto Grossi</a>, <a href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>:
<br><b>Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract).
</b>397-406<br><a href="http://doi.acm.org/10.1145/335305.335351"><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/GrossiV00">BibTeX</a></font>

<li><a name="ColeH00" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/h/Hariharan:Ramesh.html">Ramesh Hariharan</a>:
<br><b>Faster suffix tree construction with missing suffix links.
</b>407-415<br><a href="http://doi.acm.org/10.1145/335305.335352"><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/ColeH00">BibTeX</a></font>

<li><a name="MuthukrishnanS00" href="../../indices/a-tree/m/Muthukrishnan:S=.html">S. Muthukrishnan</a>, <a href="../../indices/a-tree/s/Sahinalp:S=uuml=leyman_Cenk.html">S&uuml;leyman Cenk Sahinalp</a>:
<br><b>Approximate nearest neighbors and sequence comparison with block operations.
</b>416-424<br><a href="http://doi.acm.org/10.1145/335305.335353"><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/MuthukrishnanS00">BibTeX</a></font>

<li><a name="LiMW00" href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>, <a href="../../indices/a-tree/m/Ma:Bin.html">Bin Ma</a>, <a href="../../indices/a-tree/w/Wang:Lusheng.html">Lusheng Wang</a>:
<br><b>Near optimal multiple alignment within a band in polynomial time.
</b>425-434<br><a href="http://doi.acm.org/10.1145/335305.335354"><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/LiMW00">BibTeX</a></font>

<li><a name="BlumKW00" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/k/Kalai:Adam.html">Adam Kalai</a>, <a href="../../indices/a-tree/w/Wasserman:Hal.html">Hal Wasserman</a>:
<br><b>Noise-tolerant learning, the parity problem, and the statistical query model.
</b>435-440<br><a href="http://doi.acm.org/10.1145/335305.335355"><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/BlumKW00">BibTeX</a></font>

<li><a name="GoldsmithS00" href="../../indices/a-tree/g/Goldsmith:Judy.html">Judy Goldsmith</a>, <a href="../../indices/a-tree/s/Sloan:Robert_H=.html">Robert H. Sloan</a>:
<br><b>More theory revision with queries (extended abstract).
</b>441-448<br><a href="http://doi.acm.org/10.1145/335305.335356"><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/GoldsmithS00">BibTeX</a></font>

<li><a name="BuhrmanMRV00" href="../../indices/a-tree/b/Buhrman:Harry.html">Harry Buhrman</a>, <a href="../../indices/a-tree/m/Miltersen:Peter_Bro.html">Peter Bro Miltersen</a>, <a href="../../indices/a-tree/r/Radhakrishnan:Jaikumar.html">Jaikumar Radhakrishnan</a>, <a href="../../indices/a-tree/v/Venkatesh:Srinivasan.html">Srinivasan Venkatesh</a>:
<br><b>Are bitvectors optimal?
</b>449-458<br><a href="http://doi.acm.org/10.1145/335305.335357"><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/BuhrmanMRV00">BibTeX</a></font>

<li><a name="RothemundW00" href="../../indices/a-tree/r/Rothemund:Paul_W=_K=.html">Paul W. K. Rothemund</a>, <a href="../../indices/a-tree/w/Winfree:Erik.html">Erik Winfree</a>:
<br><b>The program-size complexity of self-assembled squares (extended abstract).
</b>459-468<br><a href="http://doi.acm.org/10.1145/335305.335358"><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/RothemundW00">BibTeX</a></font>

<li><a name="ChenX00" href="../../indices/a-tree/c/Chen:Danny_Z=.html">Danny Z. Chen</a>, <a href="../../indices/a-tree/x/Xu:Jinhui.html">Jinhui Xu</a>:
<br><b>Shortest path queries in planar graphs.
</b>469-478<br><a href="http://doi.acm.org/10.1145/335305.335359"><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/ChenX00">BibTeX</a></font>

<li><a name="Reed00" href="../../indices/a-tree/r/Reed:Bruce_A=.html">Bruce A. Reed</a>:
<br><b>How tall is a tree?
</b>479-483<br><a href="http://doi.acm.org/10.1145/335305.335360"><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/Reed00">BibTeX</a></font>

<li><a name="FaginKKRRRST00" href="../../indices/a-tree/f/Fagin:Ronald.html">Ronald Fagin</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/r/Rajagopalan:Sridhar.html">Sridhar Rajagopalan</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>, <a href="../../indices/a-tree/t/Tomkins:Andrew.html">Andrew Tomkins</a>:
<br><b>Random walks with ``back buttons'' (extended abstract).
</b>484-493<br><a href="http://doi.acm.org/10.1145/335305.335362"><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/FaginKKRRRST00">BibTeX</a></font>

<li><a name="FitziM00" href="../../indices/a-tree/f/Fitzi:Matthias.html">Matthias Fitzi</a>, <a href="../../indices/a-tree/m/Maurer:Ueli_M=.html">Ueli M. Maurer</a>:
<br><b>From partial consistency to global broadcast.
</b>494-503<br><a href="http://doi.acm.org/10.1145/335305.335363"><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/FitziM00">BibTeX</a></font>

<li><a name="KempeKK00" 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/k/Kumar:Amit.html">Amit Kumar</a>:
<br><b>Connectivity and inference problems for temporal networks.
</b>504-513<br><a href="http://doi.acm.org/10.1145/335305.335364"><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/KempeKK00">BibTeX</a></font>

<li><a name="RasalaW00" href="../../indices/a-tree/r/Rasala:April.html">April Rasala</a>, <a href="../../indices/a-tree/w/Wilfong:Gordon_T=.html">Gordon T. Wilfong</a>:
<br><b>Strictly non-blocking WDM cross-connects for heterogeneous networks.
</b>514-523<br><a href="http://doi.acm.org/10.1145/335305.335366"><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/RasalaW00">BibTeX</a></font>

<li><a name="FederMS00" href="../../indices/a-tree/f/Feder:Tom=aacute=s.html">Tom&aacute;s Feder</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/s/Subi:Carlos_S=.html">Carlos S. Subi</a>:
<br><b>Finding long paths and cycles in sparse Hamiltonian graphs.
</b>524-529<br><a href="http://doi.acm.org/10.1145/335305.335368"><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/FederMS00">BibTeX</a></font>

<li><a name="FeigeKN00" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/k/Krauthgamer:Robert.html">Robert Krauthgamer</a>, <a href="../../indices/a-tree/n/Nissim:Kobbi.html">Kobbi Nissim</a>:
<br><b>Approximating the minimum bisection size (extended abstract).
</b>530-536<br><a href="http://doi.acm.org/10.1145/335305.335370"><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/FeigeKN00">BibTeX</a></font>

<li><a name="KonemannR00" href="../../indices/a-tree/k/K=ouml=nemann:Jochen.html">Jochen K&ouml;nemann</a>, <a href="../../indices/a-tree/r/Ravi:R=.html">R. Ravi</a>:
<br><b>A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees.
</b>537-546<br><a href="http://doi.acm.org/10.1145/335305.335371"><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/KonemannR00">BibTeX</a></font>

<li><a name="Schulman00" href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>:
<br><b>Clustering for edge-cost minimization (extended abstract).
</b>547-555<br><a href="http://doi.acm.org/10.1145/335305.335373"><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/Schulman00">BibTeX</a></font>

<li><a name="Fortune00" href="../../indices/a-tree/f/Fortune:Steven.html">Steven Fortune</a>:
<br><b>Exact computations of the inertia symmetric integer matrices.
</b>556-564<br><a href="http://doi.acm.org/10.1145/335305.335374"><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/Fortune00">BibTeX</a></font>

<li><a name="OrlinSS00" href="../../indices/a-tree/o/Orlin:James_B=.html">James B. Orlin</a>, <a href="../../indices/a-tree/s/Schulz:Andreas_S=.html">Andreas S. Schulz</a>, <a href="../../indices/a-tree/s/Sengupta:Sudipta.html">Sudipta Sengupta</a>:
<br><b>epsilon-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization (extended abstract).
</b>565-572<br><a href="http://doi.acm.org/10.1145/335305.335377"><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/OrlinSS00">BibTeX</a></font>

<li><a name="OlshevskyS00" href="../../indices/a-tree/o/Olshevsky:Vadim.html">Vadim Olshevsky</a>, <a href="../../indices/a-tree/s/Shokrollahi:Mohammad_Amin.html">Mohammad Amin Shokrollahi</a>:
<br><b>Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation.
</b>573-581<br><a href="http://doi.acm.org/10.1145/335305.335380"><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/OlshevskyS00">BibTeX</a></font>

<li><a name="CharikarFGKRS00" href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/f/Fagin:Ronald.html">Ronald Fagin</a>, <a href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>:
<br><b>Query strategies for priced information (extended abstract).
</b>582-591<br><a href="http://doi.acm.org/10.1145/335305.335382"><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/CharikarFGKRS00">BibTeX</a></font>

<li><a name="Seiden00" href="../../indices/a-tree/s/Seiden:Steven_S=.html">Steven S. Seiden</a>:
<br><b>A guessing game and randomized online algorithms.
</b>592-601<br><a href="http://doi.acm.org/10.1145/335305.335385"><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/Seiden00">BibTeX</a></font>

<li><a name="FederMPOW00" href="../../indices/a-tree/f/Feder:Tom=aacute=s.html">Tom&aacute;s Feder</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/p/Panigrahy:Rina.html">Rina Panigrahy</a>, <a href="../../indices/a-tree/o/Olston:Chris.html">Chris Olston</a>, <a href="../../indices/a-tree/w/Widom:Jennifer.html">Jennifer Widom</a>:
<br><b>Computing the median with uncertainty.
</b>602-607<br><a href="http://doi.acm.org/10.1145/335305.335386"><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/FederMPOW00">BibTeX</a></font>

<li><a name="KitaevW00" href="../../indices/a-tree/k/Kitaev:Alexei.html">Alexei Kitaev</a>, <a href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>:
<br><b>Parallelization, amplification, and exponential time simulation of quantum interactive proof systems.
</b>608-617<br><a href="http://doi.acm.org/10.1145/335305.335387"><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/KitaevW00">BibTeX</a></font>

<li><a name="Grover00" href="../../indices/a-tree/g/Grover:Lov_K=.html">Lov K. Grover</a>:
<br><b>Rapid sampling though quantum computing.
</b>618-626<br><a href="http://doi.acm.org/10.1145/335305.335389"><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/Grover00">BibTeX</a></font>

<li><a name="HallgrenRT00" href="../../indices/a-tree/h/Hallgren:Sean.html">Sean Hallgren</a>, <a href="../../indices/a-tree/r/Russell:Alexander.html">Alexander Russell</a>, <a href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>:
<br><b>Normal subgroup reconstruction and quantum computation using group representations.
</b>627-635<br><a href="http://doi.acm.org/10.1145/335305.335392"><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/HallgrenRT00">BibTeX</a></font>

<li><a name="Ambainis00" href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>:
<br><b>Quantum lower bounds by quantum arguments.
</b>636-643<br><a href="http://doi.acm.org/10.1145/335305.335394"><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/Ambainis00">BibTeX</a></font>

<li><a name="Klauck00" href="../../indices/a-tree/k/Klauck:Hartmut.html">Hartmut Klauck</a>:
<br><b>On quantum and probabilistic communication: Las Vegas and one-way protocols.
</b>644-651<br><a href="http://doi.acm.org/10.1145/335305.335396"><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/Klauck00">BibTeX</a></font>

<li><a name="GuptaT00" href="../../indices/a-tree/g/Gupta:Anupam.html">Anupam Gupta</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">&Eacute;va Tardos</a>:
<br><b>A constant factor approximation algorithm for a class of classification problems.
</b>652-658<br><a href="http://doi.acm.org/10.1145/335305.335397"><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/GuptaT00">BibTeX</a></font>

<li><a name="KenyonSY00" href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/s/Schabanel:Nicolas.html">Nicolas Schabanel</a>, <a href="../../indices/a-tree/y/Young:Neal_E=.html">Neal E. Young</a>:
<br><b>Polynomial-time approximation scheme for data broadcast.
</b>659-666<br><a href="http://doi.acm.org/10.1145/335305.335398"><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/KenyonSY00">BibTeX</a></font>

<li><a name="Furer00" href="../../indices/a-tree/f/F=uuml=rer:Martin.html">Martin F&uuml;rer</a>:
<br><b>Approximating permanents of complex matrices.
</b>667-669<br><a href="http://doi.acm.org/10.1145/335305.335399"><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/Furer00">BibTeX</a></font>

<li><a name="GoelMP00" href="../../indices/a-tree/g/Goel:Ashish.html">Ashish Goel</a>, <a href="../../indices/a-tree/m/Meyerson:Adam.html">Adam Meyerson</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>:
<br><b>Combining fairness with throughput: online routing with multiple objectives.
</b>670-679<br><a href="http://doi.acm.org/10.1145/335305.335400"><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/GoelMP00">BibTeX</a></font>

<li><a name="BermanD00" href="../../indices/a-tree/b/Berman:Piotr.html">Piotr Berman</a>, <a href="../../indices/a-tree/d/DasGupta:Bhaskar.html">Bhaskar DasGupta</a>:
<br><b>Improvements in throughout maximization for real-time scheduling.
</b>680-687<br><a href="http://doi.acm.org/10.1145/335305.335401"><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/BermanD00">BibTeX</a></font>

<li><a name="DamMMS00" href="../../indices/a-tree/d/Dam:Wim_van.html">Wim van Dam</a>, <a href="../../indices/a-tree/m/Magniez:Fr=eacute=d=eacute=ric.html">Fr&eacute;d&eacute;ric Magniez</a>, <a href="../../indices/a-tree/m/Mosca:Michele.html">Michele Mosca</a>, <a href="../../indices/a-tree/s/Santha:Miklos.html">Miklos Santha</a>:
<br><b>Self-testing of universal and fault-tolerant sets of quantum gates.
</b>688-696<br><a href="http://doi.acm.org/10.1145/335305.335402"><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/DamMMS00">BibTeX</a></font>

<li><a name="AmbainisSV00" href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>, <a href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>:
<br><b>Computing with highly mixed states (extended abstract).
</b>697-704<br><a href="http://doi.acm.org/10.1145/335305.335403"><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/AmbainisSV00">BibTeX</a></font>

<li><a name="AharonovTVY00" href="../../indices/a-tree/a/Aharonov:Dorit.html">Dorit Aharonov</a>, <a href="../../indices/a-tree/t/Ta=Shma:Amnon.html">Amnon Ta-Shma</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>, <a href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>:
<br><b>Quantum bit escrow.
</b>705-714<br><a href="http://doi.acm.org/10.1145/335305.335404"><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/AharonovTVY00">BibTeX</a></font>

<li><a name="BihamBBMR00" href="../../indices/a-tree/b/Biham:Eli.html">Eli Biham</a>, <a href="../../indices/a-tree/b/Boyer:Michel.html">Michel Boyer</a>, <a href="../../indices/a-tree/b/Boykin:P=_Oscar.html">P. Oscar Boykin</a>, <a href="../../indices/a-tree/m/Mor:Tal.html">Tal Mor</a>, <a href="../../indices/a-tree/r/Roychowdhury:Vwani_P=.html">Vwani P. Roychowdhury</a>:
<br><b>A proof of the security of quantum key distribution (extended abstract).
</b>715-724<br><a href="http://doi.acm.org/10.1145/335305.335406"><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/BihamBBMR00">BibTeX</a></font>

<li><a name="FiatM00" href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/m/Mendel:Manor.html">Manor Mendel</a>:
<br><b>Better algorithms for unfair metrical task systems and applications.
</b>725-734<br><a href="http://doi.acm.org/10.1145/335305.335408"><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/FiatM00">BibTeX</a></font>

<li><a name="Bar-NoyBFNS00" href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>, <a href="../../indices/a-tree/b/Bar=Yehuda:Reuven.html">Reuven Bar-Yehuda</a>, <a href="../../indices/a-tree/f/Freund:Ari.html">Ari Freund</a>, <a href="../../indices/a-tree/n/Naor:Joseph.html">Joseph Naor</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>:
<br><b>A unified approach to approximating resource allocation and scheduling.
</b>735-744<br><a href="http://doi.acm.org/10.1145/335305.335410"><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-NoyBFNS00">BibTeX</a></font>

<li><a name="BerenbrinkCSV00" href="../../indices/a-tree/b/Berenbrink:Petra.html">Petra Berenbrink</a>, <a href="../../indices/a-tree/c/Czumaj:Artur.html">Artur Czumaj</a>, <a href="../../indices/a-tree/s/Steger:Angelika.html">Angelika Steger</a>, <a href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold V&ouml;cking</a>:
<br><b>Balanced allocations: the heavily loaded case.
</b>745-754<br><a href="http://doi.acm.org/10.1145/335305.335411"><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/BerenbrinkCSV00">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