focs2000.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>41. FOCS 2000: Redondo Beach, CA, USA</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head><body> <table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td> <td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table> <h1>41. <a href="index.html">FOCS</a> 2000: Redondo Beach, CA, USA</h1> 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA. IEEE Computer Society, 2000, ISBN 0-7695-0850-2 <h2>Session 1</h2> <ul> <li><a name="ReingoldVW00" href="../../indices/a-tree/r/Reingold:Omer.html">Omer Reingold</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors. 3-13 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ReingoldVW00">BibTeX</a></font> <li><a name="AlonCKRRS00" 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>, <a href="../../indices/a-tree/k/Kohayakawa:Yoshiharu.html">Yoshiharu Kohayakawa</a>, <a href="../../indices/a-tree/r/R=ouml=dl:Vojtech.html">Vojtech Rödl</a>, <a href="../../indices/a-tree/r/Rucinski:Andrzej.html">Andrzej Rucinski</a>, <a href="../../indices/a-tree/s/Szemer=eacute=di:Endre.html">Endre Szemerédi</a>: Universality and Tolerance. 14-21 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonCKRRS00">BibTeX</a></font> <li><a name="ReingoldSW00" href="../../indices/a-tree/r/Reingold:Omer.html">Omer Reingold</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>: Extracting Randomness via Repeated Condensing. 22-31 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ReingoldSW00">BibTeX</a></font> <li><a name="TrevisanV00" href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>, <a href="../../indices/a-tree/v/Vadhan:Salil_P=.html">Salil P. Vadhan</a>: Extracting Randomness from Samplable Distributions. 32-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TrevisanV00">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>: Pseudorandom Generators in Propositional Proof Complexity. 43-53 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlekhnovichBRW00">BibTeX</a></font> </ul> <h2>Session 2</h2> <ul> <li><a name="KumarRRSTU00" href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</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/s/Sivakumar:D=.html">D. Sivakumar</a>, <a href="../../indices/a-tree/t/Tomkins:Andrew.html">Andrew Tomkins</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: Random graph models for the web graph. 57-65 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KumarRRSTU00">BibTeX</a></font> <li><a name="KarpKPS00" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/k/Koutsoupias:Elias.html">Elias Koutsoupias</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>: Optimization Problems in Congestion Control. 66-74 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpKPS00">BibTeX</a></font> <li><a name="KumarK00" href="../../indices/a-tree/k/Kumar:Amit.html">Amit Kumar</a>, <a href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>: Fairness Measures for Resource Allocation. 75-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KumarK00">BibTeX</a></font> <li><a name="PapadimitriouY00" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: On the Approximability of Trade-offs and Optimal Access of Web Sources. 86-92 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PapadimitriouY00">BibTeX</a></font> <li><a name="RoughgardenT00" href="../../indices/a-tree/r/Roughgarden:Tim.html">Tim Roughgarden</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>: How Bad is Selfish Routing? 93-102 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RoughgardenT00">BibTeX</a></font> </ul> <h2>Session 3</h2> <ul> <li><a name="FeigeK00" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/k/Krauthgamer:Robert.html">Robert Krauthgamer</a>: A polylogarithmic approximation of the minimum bisection. 105-115 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FeigeK00">BibTeX</a></font> <li><a name="SviridenkoW00" href="../../indices/a-tree/s/Sviridenko:Maxim.html">Maxim Sviridenko</a>, <a href="../../indices/a-tree/w/Woeginger:Gerhard_J=.html">Gerhard J. Woeginger</a>: Approximability and in-approximability results for no-wait shop scheduling. 116-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SviridenkoW00">BibTeX</a></font> <li><a name="Guha00" href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>: Nested Graph Dissection and Approximation Algorithms. 126-135 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Guha00">BibTeX</a></font> <li><a name="Skutella00" href="../../indices/a-tree/s/Skutella:Martin.html">Martin Skutella</a>: Approximating the single source unsplittable min-cost flow problem. 136-145 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Skutella00">BibTeX</a></font> </ul> <h2>Session 4</h2> <ul> <li><a name="GuruswamiHS00" href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>, <a href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>: Hardness of Approximate Hypergraph Coloring. 149-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuruswamiHS00">BibTeX</a></font> <li><a name="GuruswamiSS00" href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>: "Soft-decision" Decoding of Chinese Remainder Codes. 159-168 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuruswamiSS00">BibTeX</a></font> <li><a name="BeameSSV00" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>, <a href="../../indices/a-tree/s/Sun:Xiaodong.html">Xiaodong Sun</a>, <a href="../../indices/a-tree/v/Vee:Erik.html">Erik Vee</a>: Super-linear time-space tradeoff lower bounds for randomized computation. 169-179 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeameSSV00">BibTeX</a></font> <li><a name="Toran00" href="../../indices/a-tree/t/Tor=aacute=n:Jacobo.html">Jacobo Torán</a>: On the Hardness of Graph Isomorphism. 180-186 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Toran00">BibTeX</a></font> </ul> <h2>Session 5</h2> <ul> <li><a name="Indyk00" href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>: Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation. 189-197 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Indyk00">BibTeX</a></font> <li><a name="AlstrupBR00" href="../../indices/a-tree/a/Alstrup:Stephen.html">Stephen Alstrup</a>, <a href="../../indices/a-tree/b/Brodal:Gerth_St=oslash=lting.html">Gerth Stølting Brodal</a>, <a href="../../indices/a-tree/r/Rauhe:Theis.html">Theis Rauhe</a>: New Data Structures for Orthogonal Range Searching. 198-207 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlstrupBR00">BibTeX</a></font> <li><a name="AryaMM00" href="../../indices/a-tree/a/Arya:Sunil.html">Sunil Arya</a>, <a href="../../indices/a-tree/m/Malamatos:Theocharis.html">Theocharis Malamatos</a>, <a href="../../indices/a-tree/m/Mount:David_M=.html">David M. Mount</a>: Nearly Optimal Expected-Case Planar Point Location. 208-218 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AryaMM00">BibTeX</a></font> <li><a name="Chan00" href="../../indices/a-tree/c/Chan:Timothy_M=.html">Timothy M. Chan</a>: On Levels in Arrangements of Curves. 219-227 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chan00">BibTeX</a></font> </ul> <h2>Session 7</h2> <ul> <li><a name="Kleinberg00" href="../../indices/a-tree/k/Kleinberg:Jon_M=.html">Jon M. Kleinberg</a>: Detecting a Network Failure. 231-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kleinberg00">BibTeX</a></font> <li><a name="AlonDPR00" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/d/Dar:Seannie.html">Seannie Dar</a>, <a href="../../indices/a-tree/p/Parnas:Michal.html">Michal Parnas</a>, <a href="../../indices/a-tree/r/Ron:Dana.html">Dana Ron</a>: Testing of Clustering. 240-250 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonDPR00">BibTeX</a></font> <li><a name="Newman00" href="../../indices/a-tree/n/Newman:Ilan.html">Ilan Newman</a>: Testing of Functions that have small width Branching Programs. 251-258 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Newman00">BibTeX</a></font> <li><a name="BatuFRSW00" href="../../indices/a-tree/b/Batu:Tugkan.html">Tugkan Batu</a>, <a href="../../indices/a-tree/f/Fortnow:Lance.html">Lance Fortnow</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>, <a href="../../indices/a-tree/s/Smith:Warren_D=.html">Warren D. Smith</a>, <a href="../../indices/a-tree/w/White:Patrick.html">Patrick White</a>: Testing that distributions are close. 259-269 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BatuFRSW00">BibTeX</a></font> <li><a name="Auer00" href="../../indices/a-tree/a/Auer:Peter.html">Peter Auer</a>: Using Upper Confidence Bounds for Online Learning. 270-279 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Auer00">BibTeX</a></font> </ul> <h2>Session 7</h2> <ul> <li><a name="DworkN00" href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: Zaps and Their Applications. 283-293 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DworkN00">BibTeX</a></font> <li><a name="IshaiK00" href="../../indices/a-tree/i/Ishai:Yuval.html">Yuval Ishai</a>, <a href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>: Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. 294-304 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/IshaiK00">BibTeX</a></font> <li><a name="GennaroT00" href="../../indices/a-tree/g/Gennaro:Rosario.html">Rosario Gennaro</a>, <a href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>: Lower Bounds on the Efficiency of Generic Cryptographic Constructions. 305-313 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GennaroT00">BibTeX</a></font> <li><a name="GarayM00" href="../../indices/a-tree/g/Garay:Juan_A=.html">Juan A. Garay</a>, <a href="../../indices/a-tree/m/MacKenzie:Philip_D=.html">Philip D. MacKenzie</a>: Concurrent Oblivious Transfer. 314-324 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GarayM00">BibTeX</a></font> <li><a name="GertnerKMRV00" href="../../indices/a-tree/g/Gertner:Yael.html">Yael Gertner</a>, <a href="../../indices/a-tree/k/Kannan:Sampath.html">Sampath Kannan</a>, <a href="../../indices/a-tree/m/Malkin:Tal.html">Tal Malkin</a>, <a href="../../indices/a-tree/r/Reingold:Omer.html">Omer Reingold</a>, <a href="../../indices/a-tree/v/Viswanathan:Mahesh.html">Mahesh Viswanathan</a>: The Relationship between Public Key Encryption and Oblivious Transfer. 325-335 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GertnerKMRV00">BibTeX</a></font> </ul> <h2>Session 8</h2> <ul> <li><a name="MettuP00" href="../../indices/a-tree/m/Mettu:Ramgopal_R=.html">Ramgopal R. Mettu</a>, <a href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>: The Online Median Problem. 339-348 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MettuP00">BibTeX</a></font> <li><a name="OstrovskyR00" href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>: Polynomial Time Approximation Schemes for Geometric k-Clustering. 349-358 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/OstrovskyR00">BibTeX</a></font> <li><a name="GuhaMMO00" href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/m/Mishra:Nina.html">Nina Mishra</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>, <a href="../../indices/a-tree/o/O=Callaghan:Liadan.html">Liadan O'Callaghan</a>: Clustering Data Streams. 359-366 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuhaMMO00">BibTeX</a></font> <li><a name="VempalaV00" href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>, <a href="../../indices/a-tree/v/Vetta:Adrian.html">Adrian Vetta</a>: On Clusterings - Good, Bad and Spectral. 367-377 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VempalaV00">BibTeX</a></font> </ul> <h2>Session 9</h2> <ul> <li><a name="DemetrescuI00" href="../../indices/a-tree/d/Demetrescu:Camil.html">Camil Demetrescu</a>, <a href="../../indices/a-tree/i/Italiano:Giuseppe_F=.html">Giuseppe F. Italiano</a>: Fully Dynamic Transitive Closure: Breaking Through the O(n<sup>2</sup>) Barrier. 381-389 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DemetrescuI00">BibTeX</a></font> <li><a name="FerraginaM00" href="../../indices/a-tree/f/Ferragina:Paolo.html">Paolo Ferragina</a>, <a href="../../indices/a-tree/m/Manzini:Giovanni.html">Giovanni Manzini</a>: Opportunistic Data Structures with Applications. 390-398 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FerraginaM00">BibTeX</a></font> <li><a name="BenderDF00" href="../../indices/a-tree/b/Bender:Michael_A=.html">Michael A. Bender</a>, <a href="../../indices/a-tree/d/Demaine:Erik_D=.html">Erik D. Demaine</a>, <a href="../../indices/a-tree/f/Farach=Colton:Martin.html">Martin Farach-Colton</a>: Cache-Oblivious B-Trees. 399-409 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BenderDF00">BibTeX</a></font> <li><a name="Gabow00" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>: Using Expander Graphs to Find Vertex Connectivity. 410-420 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gabow00">BibTeX</a></font> </ul> <h2>Session 10</h2> <ul> <li><a name="PachT00" href="../../indices/a-tree/p/Pach:J=aacute=nos.html">János Pach</a>, <a href="../../indices/a-tree/t/Tardos:G=aacute=bor.html">Gábor Tardos</a>: On the boundary complexity of the union of fat triangles. 423-431 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PachT00">BibTeX</a></font> <li><a name="ConnellyDR00" href="../../indices/a-tree/c/Connelly:Robert.html">Robert Connelly</a>, <a href="../../indices/a-tree/d/Demaine:Erik_D=.html">Erik D. Demaine</a>, <a href="../../indices/a-tree/r/Rote:G=uuml=nter.html">Günter Rote</a>: Straighting Polygonal Arcs and Convexifying Polygonal Cycles. 432-442 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ConnellyDR00">BibTeX</a></font> <li><a name="Streinu00" href="../../indices/a-tree/s/Streinu:Ileana.html">Ileana Streinu</a>: A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning. 443-453 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Streinu00">BibTeX</a></font> <li><a name="EdelsbrunnerLZ00" href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>, <a href="../../indices/a-tree/l/Letscher:David.html">David Letscher</a>, <a href="../../indices/a-tree/z/Zomorodian:Afra.html">Afra Zomorodian</a>: Topological Persistence and Simplification. 454-463 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EdelsbrunnerLZ00">BibTeX</a></font> </ul> <h2>Session 11</h2> <ul> <li><a name="KahnKLV00" href="../../indices/a-tree/k/Kahn:Jeff.html">Jeff Kahn</a>, <a href="../../indices/a-tree/k/Kim:Jeong_Han.html">Jeong Han Kim</a>, <a href="../../indices/a-tree/l/Lov=aacute=sz:L=aacute=szl=oacute=.html">László Lovász</a>, <a href="../../indices/a-tree/v/Vu:Van_H=.html">Van H. Vu</a>: The Cover Time, the Blanket Time, and the Matthews Bound. 467-475 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KahnKLV00">BibTeX</a></font> <li><a name="Pak00" href="../../indices/a-tree/p/Pak:Igor.html">Igor Pak</a>: The product replacement algorithm is polynomial. 476-485 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pak00">BibTeX</a></font> <li><a name="KalaiV00" href="../../indices/a-tree/k/Kalai:Adam.html">Adam Kalai</a>, <a href="../../indices/a-tree/v/Vempala:Santosh.html">Santosh Vempala</a>: Efficient Algorithms for Universal Portfolios. 486-491 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KalaiV00">BibTeX</a></font> <li><a name="MartinR00" href="../../indices/a-tree/m/Martin:Russell_A=.html">Russell A. Martin</a>, <a href="../../indices/a-tree/r/Randall:Dana.html">Dana Randall</a>: Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method. 492-502 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MartinR00">BibTeX</a></font> <li><a name="FillH00" href="../../indices/a-tree/f/Fill:James_Allen.html">James Allen Fill</a>, <a href="../../indices/a-tree/h/Huber:Mark.html">Mark Huber</a>: The Randomness Recycler: A New Technique for Perfect Sampling. 503-511 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FillH00">BibTeX</a></font> </ul> <h2>Session 12</h2> <ul> <li><a name="HalesH00" href="../../indices/a-tree/h/Hales:Lisa.html">Lisa Hales</a>, <a href="../../indices/a-tree/h/Hallgren:Sean.html">Sean Hallgren</a>: An Improved Quantum Fourier Transform Algorithm and Applications. 515-525 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HalesH00">BibTeX</a></font> <li><a name="CleveW00" href="../../indices/a-tree/c/Cleve:Richard.html">Richard Cleve</a>, <a href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>: Fast parallel circuits for the quantum Fourier transform. 526-536 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CleveW00">BibTeX</a></font> <li><a name="Watrous00" href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>: Succinct quantum proofs for properties of finite groups. 537-546 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Watrous00">BibTeX</a></font> <li><a name="AmbainisMTW00" href="../../indices/a-tree/a/Ambainis:Andris.html">Andris Ambainis</a>, <a href="../../indices/a-tree/m/Mosca:Michele.html">Michele Mosca</a>, <a href="../../indices/a-tree/t/Tapp:Alain.html">Alain Tapp</a>, <a href="../../indices/a-tree/w/Wolf:Ronald_de.html">Ronald de Wolf</a>: Private Quantum Channels. 547-553 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AmbainisMTW00">BibTeX</a></font> <li><a name="RadhakrishnanSV00" href="../../indices/a-tree/r/Radhakrishnan:Jaikumar.html">Jaikumar Radhakrishnan</a>, <a href="../../indices/a-tree/s/Sen:Pranab.html">Pranab Sen</a>, <a href="../../indices/a-tree/v/Venkatesh:Srinivasan.html">Srinivasan Venkatesh</a>: The Quantum Complexity of Set Membership. 554-562 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RadhakrishnanSV00">BibTeX</a></font> </ul> <h2>Session 13</h2> <ul> <li><a name="KarpSSV00" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/s/Schindelhauer:Christian.html">Christian Schindelhauer</a>, <a href="../../indices/a-tree/s/Shenker:Scott.html">Scott Shenker</a>, <a href="../../indices/a-tree/v/V=ouml=cking:Berthold.html">Berthold Vöcking</a>: Randomized Rumor Spreading. 565-574 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpSSV00">BibTeX</a></font> <li><a name="ChrobakGR00" href="../../indices/a-tree/c/Chrobak:Marek.html">Marek Chrobak</a>, <a href="../../indices/a-tree/g/Gasieniec:Leszek.html">Leszek Gasieniec</a>, <a href="../../indices/a-tree/r/Rytter:Wojciech.html">Wojciech Rytter</a>: Fast Broadcasting and Gossiping in Radio Networks. 575-581 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChrobakGR00">BibTeX</a></font> <li><a name="KenyonM00" href="../../indices/a-tree/k/Kenyon:Claire.html">Claire Kenyon</a>, <a href="../../indices/a-tree/m/Mitzenmacher:Michael.html">Michael Mitzenmacher</a>: Linear Waste of Best Fit Bin Packing on Skewed Distributions. 582-589 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KenyonM00">BibTeX</a></font> <li><a name="AchlioptasS00" href="../../indices/a-tree/a/Achlioptas:Dimitris.html">Dimitris Achlioptas</a>, <a href="../../indices/a-tree/s/Sorkin:Gregory_B=.html">Gregory B. Sorkin</a>: Optimal myopic algorithms for random 3-SAT. 590-600 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AchlioptasS00">BibTeX</a></font> </ul> <h2>Session 14</h2> <ul> <li><a name="GuhaMM00" href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/m/Meyerson:Adam.html">Adam Meyerson</a>, <a href="../../indices/a-tree/m/Munagala:Kamesh.html">Kamesh Munagala</a>: Hierarchical Placement and Network Design Problems. 603-612 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GuhaMM00">BibTeX</a></font> <li><a name="KargerM00" href="../../indices/a-tree/k/Karger:David_R=.html">David R. Karger</a>, <a href="../../indices/a-tree/m/Minkoff:Maria.html">Maria Minkoff</a>: Building Steiner Trees with Incomplete Global Knowledge. 613-623 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KargerM00">BibTeX</a></font> <li><a name="MeyersonMP00" href="../../indices/a-tree/m/Meyerson:Adam.html">Adam Meyerson</a>, <a href="../../indices/a-tree/m/Munagala:Kamesh.html">Kamesh Munagala</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>: Cost-Distance: Two Metric Network Design. 624-630 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MeyersonMP00">BibTeX</a></font> <li><a name="CharikarGKRS00" href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>, <a href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>, <a href="../../indices/a-tree/k/Kumar:Ravi.html">Ravi Kumar</a>, <a href="../../indices/a-tree/r/Rajagopalan:Sridhar.html">Sridhar Rajagopalan</a>, <a href="../../indices/a-tree/s/Sahai:Amit.html">Amit Sahai</a>: Combinatorial feature selection problems. 631-640 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CharikarGKRS00">BibTeX</a></font> </ul> <h2>Session 15</h2> <ul> <li><a name="Maidl00" href="../../indices/a-tree/m/Maidl:Monika.html">Monika Maidl</a>: The Common Fragment of CTL and LTL. 643-652 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Maidl00">BibTeX</a></font> <li><a name="HerlihyR00" href="../../indices/a-tree/h/Herlihy:Maurice.html">Maurice Herlihy</a>, <a href="../../indices/a-tree/r/Ruppert:Eric.html">Eric Ruppert</a>: On the Existence of Booster Types. 653-663 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HerlihyR00">BibTeX</a></font> <li><a name="GottlobKS00" href="../../indices/a-tree/g/Gottlob:Georg.html">Georg Gottlob</a>, <a href="../../indices/a-tree/k/Kolaitis:Phokion_G=.html">Phokion G. Kolaitis</a>, <a href="../../indices/a-tree/s/Schwentick:Thomas.html">Thomas Schwentick</a>: Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. 664-674 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GottlobKS00">BibTeX</a></font> <li><a name="EberlyGV00" href="../../indices/a-tree/e/Eberly:Wayne.html">Wayne Eberly</a>, <a href="../../indices/a-tree/g/Giesbrecht:Mark.html">Mark Giesbrecht</a>, <a href="../../indices/a-tree/v/Villard:Gilles.html">Gilles Villard</a>: Computing the Determinant and Smith Form of an Integer Matrix. 675-685 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EberlyGV00">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:12:26 2009 by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
