stoc2007.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 2007</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>39. <a href="index.html">STOC</a> 2007: San Diego, California, USA</h1> <a name="2007" href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a> (Eds.): Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007. ACM 2007, ISBN 978-1-59593-631-8 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/2007">BibTeX</a></font> <h2>Session 1A</h2> <ul> <li><a name="HaitnerR07" href="../../indices/a-tree/h/Haitner:Iftach.html">Iftach Haitner</a>, <a href="../../indices/a-tree/r/Reingold:Omer.html">Omer Reingold</a>: <br><b>Statistically-hiding commitment from any one-way function. </b>1-10<br><a href="http://doi.acm.org/10.1145/1250790.1250792"><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/HaitnerR07">BibTeX</a></font> <li><a name="Katz07" href="../../indices/a-tree/k/Katz:Jonathan.html">Jonathan Katz</a>: <br><b>On achieving the "best of both worlds" in secure multiparty computation. </b>11-20<br><a href="http://doi.acm.org/10.1145/1250790.1250793"><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/Katz07">BibTeX</a></font> <li><a name="IshaiKOS07" 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>Zero-knowledge from secure multiparty computation. </b>21-30<br><a href="http://doi.acm.org/10.1145/1250790.1250794"><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/IshaiKOS07">BibTeX</a></font> </ul> <h2>Session 1B</h2> <ul> <li><a name="ChanP07" href="../../indices/a-tree/c/Chan:Timothy_M=.html">Timothy M. Chan</a>, <a href="../../indices/a-tree/p/Patrascu:Mihai.html">Mihai Patrascu</a>: <br><b>Voronoi diagrams in n·2<sup>osqrt(lg lg n)</sup> time. </b>31-39<br><a href="http://doi.acm.org/10.1145/1250790.1250796"><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/ChanP07">BibTeX</a></font> <li><a name="Patrascu07" href="../../indices/a-tree/p/Patrascu:Mihai.html">Mihai Patrascu</a>: <br><b>Lower bounds for 2-dimensional range counting. </b>40-46<br><a href="http://doi.acm.org/10.1145/1250790.1250797"><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/Patrascu07">BibTeX</a></font> <li><a name="Basu07" href="../../indices/a-tree/b/Basu:Saugata.html">Saugata Basu</a>: <br><b>Combinatorial complexity in O-minimal geometry. </b>47-56<br><a href="http://doi.acm.org/10.1145/1250790.1250798"><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/Basu07">BibTeX</a></font> </ul> <h2>Session 2A</h2> <ul> <li><a name="Furer07" href="../../indices/a-tree/f/F=uuml=rer:Martin.html">Martin Fürer</a>: <br><b>Faster integer multiplication. </b>57-66<br><a href="http://doi.acm.org/10.1145/1250790.1250800"><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/Furer07">BibTeX</a></font> <li><a name="BjorklundHKK07" href="../../indices/a-tree/b/Bj=ouml=rklund:Andreas.html">Andreas Björklund</a>, <a href="../../indices/a-tree/h/Husfeldt:Thore.html">Thore Husfeldt</a>, <a href="../../indices/a-tree/k/Kaski:Petteri.html">Petteri Kaski</a>, <a href="../../indices/a-tree/k/Koivisto:Mikko.html">Mikko Koivisto</a>: <br><b>Fourier meets möbius: fast subset convolution. </b>67-74<br><a href="http://doi.acm.org/10.1145/1250790.1250801"><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/BjorklundHKK07">BibTeX</a></font> </ul> <h2>Session 2B</h2> <ul> <li><a name="NissimRS07" href="../../indices/a-tree/n/Nissim:Kobbi.html">Kobbi Nissim</a>, <a href="../../indices/a-tree/r/Raskhodnikova:Sofya.html">Sofya Raskhodnikova</a>, <a href="../../indices/a-tree/s/Smith:Adam.html">Adam Smith</a>: <br><b>Smooth sensitivity and sampling in private data analysis. </b>75-84<br><a href="http://doi.acm.org/10.1145/1250790.1250803"><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/NissimRS07">BibTeX</a></font> <li><a name="DworkMT07" href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/m/McSherry:Frank.html">Frank McSherry</a>, <a href="../../indices/a-tree/t/Talwar:Kunal.html">Kunal Talwar</a>: <br><b>The price of privacy and the limits of LP decoding. </b>85-94<br><a href="http://doi.acm.org/10.1145/1250790.1250804"><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/DworkMT07">BibTeX</a></font> </ul> <h2>Session 3A</h2> <ul> <li><a name="Kenyon-MathieuS07" href="../../indices/a-tree/k/Kenyon=Mathieu:Claire.html">Claire Kenyon-Mathieu</a>, <a href="../../indices/a-tree/s/Schudy:Warren.html">Warren Schudy</a>: <br><b>How to rank with few errors. </b>95-103<br><a href="http://doi.acm.org/10.1145/1250790.1250806"><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/Kenyon-MathieuS07">BibTeX</a></font> <li><a name="GuhaM07" href="../../indices/a-tree/g/Guha:Sudipto.html">Sudipto Guha</a>, <a href="../../indices/a-tree/m/Munagala:Kamesh.html">Kamesh Munagala</a>: <br><b>Approximation algorithms for budgeted learning problems. </b>104-113<br><a href="http://doi.acm.org/10.1145/1250790.1250807"><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/GuhaM07">BibTeX</a></font> <li><a name="AsadpourS07" href="../../indices/a-tree/a/Asadpour:Arash.html">Arash Asadpour</a>, <a href="../../indices/a-tree/s/Saberi:Amin.html">Amin Saberi</a>: <br><b>An approximation algorithm for max-min fair allocation of indivisible goods. </b>114-121<br><a href="http://doi.acm.org/10.1145/1250790.1250808"><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/AsadpourS07">BibTeX</a></font> <li><a name="BayatiGKNT07" href="../../indices/a-tree/b/Bayati:Mohsen.html">Mohsen Bayati</a>, <a href="../../indices/a-tree/g/Gamarnik:David.html">David Gamarnik</a>, <a href="../../indices/a-tree/k/Katz:Dimitriy_A=.html">Dimitriy A. Katz</a>, <a href="../../indices/a-tree/n/Nair:Chandra.html">Chandra Nair</a>, <a href="../../indices/a-tree/t/Tetali:Prasad.html">Prasad Tetali</a>: <br><b>Simple deterministic approximation algorithms for counting matchings. </b>122-127<br><a href="http://doi.acm.org/10.1145/1250790.1250809"><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/BayatiGKNT07">BibTeX</a></font> </ul> <h2>Session 3B</h2> <ul> <li><a name="MosselR07" href="../../indices/a-tree/m/Mossel:Elchanan.html">Elchanan Mossel</a>, <a href="../../indices/a-tree/r/Roch:S=eacute=bastien.html">Sébastien Roch</a>: <br><b>On the submodularity of influence in social networks. </b>128-134<br><a href="http://doi.acm.org/10.1145/1250790.1250811"><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/MosselR07">BibTeX</a></font> <li><a name="BorgsCDR07" href="../../indices/a-tree/b/Borgs:Christian.html">Christian Borgs</a>, <a href="../../indices/a-tree/c/Chayes:Jennifer_T=.html">Jennifer T. Chayes</a>, <a href="../../indices/a-tree/d/Daskalakis:Constantinos.html">Constantinos Daskalakis</a>, <a href="../../indices/a-tree/r/Roch:S=eacute=bastien.html">Sébastien Roch</a>: <br><b>First to market is not everything: an analysis of preferential attachment with fitness. </b>135-144<br><a href="http://doi.acm.org/10.1145/1250790.1250812"><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/BorgsCDR07">BibTeX</a></font> <li><a name="AndrewsJS07" href="../../indices/a-tree/a/Andrews:Matthew.html">Matthew Andrews</a>, <a href="../../indices/a-tree/j/Jung:Kyomin.html">Kyomin Jung</a>, <a href="../../indices/a-tree/s/Stolyar:Alexander_L=.html">Alexander L. Stolyar</a>: <br><b>Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads. </b>145-154<br><a href="http://doi.acm.org/10.1145/1250790.1250813"><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/AndrewsJS07">BibTeX</a></font> <li><a name="AttiyaC07" href="../../indices/a-tree/a/Attiya:Hagit.html">Hagit Attiya</a>, <a href="../../indices/a-tree/c/Censor:Keren.html">Keren Censor</a>: <br><b>Tight bounds for asynchronous randomized consensus. </b>155-164<br><a href="http://doi.acm.org/10.1145/1250790.1250814"><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/AttiyaC07">BibTeX</a></font> </ul> <h2>Session 4A</h2> <ul> <li><a name="ChuzhoyGKT07" href="../../indices/a-tree/c/Chuzhoy:Julia.html">Julia Chuzhoy</a>, <a href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>, <a href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>, <a href="../../indices/a-tree/t/Talwar:Kunal.html">Kunal Talwar</a>: <br><b>Hardness of routing with congestion in directed graphs. </b>165-178<br><a href="http://doi.acm.org/10.1145/1250790.1250816"><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/ChuzhoyGKT07">BibTeX</a></font> <li><a name="ChuzhoyK07" href="../../indices/a-tree/c/Chuzhoy:Julia.html">Julia Chuzhoy</a>, <a href="../../indices/a-tree/k/Khanna:Sanjeev.html">Sanjeev Khanna</a>: <br><b>Polynomial flow-cut gaps and hardness of directed cut problems. </b>179-188<br><a href="http://doi.acm.org/10.1145/1250790.1250817"><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/ChuzhoyK07">BibTeX</a></font> <li><a name="Austrin07" href="../../indices/a-tree/a/Austrin:Per.html">Per Austrin</a>: <br><b>Balanced max 2-sat might not be the hardest. </b>189-197<br><a href="http://doi.acm.org/10.1145/1250790.1250818"><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/Austrin07">BibTeX</a></font> <li><a name="GuruswamiR07" href="../../indices/a-tree/g/Guruswami:Venkatesan.html">Venkatesan Guruswami</a>, <a href="../../indices/a-tree/r/Raghavendra:Prasad.html">Prasad Raghavendra</a>: <br><b>A 3-query PCP over integers. </b>198-206<br><a href="http://doi.acm.org/10.1145/1250790.1250819"><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/GuruswamiR07">BibTeX</a></font> </ul> <h2>Session 4B</h2> <ul> <li><a name="DunaganH07" href="../../indices/a-tree/d/Dunagan:John.html">John Dunagan</a>, <a href="../../indices/a-tree/h/Harvey:Nicholas_J=_A=.html">Nicholas J. A. Harvey</a>: <br><b>Iteratively constructing preconditioners via the conjugate gradient method. </b>207-216<br><a href="http://doi.acm.org/10.1145/1250790.1250821"><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/DunaganH07">BibTeX</a></font> <li><a name="KieferLE07" href="../../indices/a-tree/k/Kiefer:Stefan.html">Stefan Kiefer</a>, <a href="../../indices/a-tree/l/Luttenberger:Michael.html">Michael Luttenberger</a>, <a href="../../indices/a-tree/e/Esparza:Javier.html">Javier Esparza</a>: <br><b>On the convergence of Newton's method for monotone systems of polynomial equations. </b>217-226<br><a href="http://doi.acm.org/10.1145/1250790.1250822"><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/KieferLE07">BibTeX</a></font> <li><a name="AroraK07" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</a>, <a href="../../indices/a-tree/k/Kale:Satyen.html">Satyen Kale</a>: <br><b>A combinatorial, primal-dual approach to semidefinite programs. </b>227-236<br><a href="http://doi.acm.org/10.1145/1250790.1250823"><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/AroraK07">BibTeX</a></font> <li><a name="GilbertSTV07" href="../../indices/a-tree/g/Gilbert:Anna_C=.html">Anna C. Gilbert</a>, <a href="../../indices/a-tree/s/Strauss:Martin_J=.html">Martin J. Strauss</a>, <a href="../../indices/a-tree/t/Tropp:Joel_A=.html">Joel A. Tropp</a>, <a href="../../indices/a-tree/v/Vershynin:Roman.html">Roman Vershynin</a>: <br><b>One sketch for all: fast algorithms for compressed sensing. </b>237-246<br><a href="http://doi.acm.org/10.1145/1250790.1250824"><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/GilbertSTV07">BibTeX</a></font> </ul> <h2>Session 5</h2> <ul> <li><a name="Lynch07" href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>: <br><b>Distributed computing theory: algorithms, impossibility results, models, and proofs. </b>247<br><a href="http://doi.acm.org/10.1145/1250790.1250826"><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/Lynch07">BibTeX</a></font> </ul> <h2>Session 6A</h2> <ul> <li><a name="VuT07" href="../../indices/a-tree/v/Vu:Van_H=.html">Van H. Vu</a>, <a href="../../indices/a-tree/t/Tao:Terence.html">Terence Tao</a>: <br><b>The condition number of a randomly perturbed matrix. </b>248-255<br><a href="http://doi.acm.org/10.1145/1250790.1250828"><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/VuT07">BibTeX</a></font> <li><a name="TalwarW07" href="../../indices/a-tree/t/Talwar:Kunal.html">Kunal Talwar</a>, <a href="../../indices/a-tree/w/Wieder:Udi.html">Udi Wieder</a>: <br><b>Balanced allocations: the weighted case. </b>256-265<br><a href="http://doi.acm.org/10.1145/1250790.1250829"><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/TalwarW07">BibTeX</a></font> <li><a name="Yekhanin07" href="../../indices/a-tree/y/Yekhanin:Sergey.html">Sergey Yekhanin</a>: <br><b>Towards 3-query locally decodable codes of subexponential length. </b>266-274<br><a href="http://doi.acm.org/10.1145/1250790.1250830"><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/Yekhanin07">BibTeX</a></font> </ul> <h2>Session 6B</h2> <ul> <li><a name="Santhanam07" href="../../indices/a-tree/s/Santhanam:Rahul.html">Rahul Santhanam</a>: <br><b>Circuit lower bounds for Merlin-Arthur classes. </b>275-283<br><a href="http://doi.acm.org/10.1145/1250790.1250832"><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/Santhanam07">BibTeX</a></font> <li><a name="Shpilka07" href="../../indices/a-tree/s/Shpilka:Amir.html">Amir Shpilka</a>: <br><b>Interpolation of depth-3 arithmetic circuits with two multiplication gates. </b>284-293<br><a href="http://doi.acm.org/10.1145/1250790.1250833"><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/Shpilka07">BibTeX</a></font> <li><a name="Sherstov07" href="../../indices/a-tree/s/Sherstov:Alexander_A=.html">Alexander A. Sherstov</a>: <br><b>Separating AC<sup>0</sup> from depth-2 majority circuits. </b>294-301<br><a href="http://doi.acm.org/10.1145/1250790.1250834"><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/Sherstov07">BibTeX</a></font> </ul> <h2>Session 7A</h2> <ul> <li><a name="SchoenebeckTT07" href="../../indices/a-tree/s/Schoenebeck:Grant.html">Grant Schoenebeck</a>, <a href="../../indices/a-tree/t/Trevisan:Luca.html">Luca Trevisan</a>, <a href="../../indices/a-tree/t/Tulsiani:Madhur.html">Madhur Tulsiani</a>: <br><b>Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut. </b>302-310<br><a href="http://doi.acm.org/10.1145/1250790.1250836"><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/SchoenebeckTT07">BibTeX</a></font> <li><a name="Dantchev07" href="../../indices/a-tree/d/Dantchev:Stefan_S=.html">Stefan S. Dantchev</a>: <br><b>Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. </b>311-317<br><a href="http://doi.acm.org/10.1145/1250790.1250837"><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/Dantchev07">BibTeX</a></font> </ul> <h2>Session 7B</h2> <ul> <li><a name="PaghPR07" href="../../indices/a-tree/p/Pagh:Anna.html">Anna Pagh</a>, <a href="../../indices/a-tree/p/Pagh:Rasmus.html">Rasmus Pagh</a>, <a href="../../indices/a-tree/r/Ruzic:Milan.html">Milan Ruzic</a>: <br><b>Linear probing with constant independence. </b>318-327<br><a href="http://doi.acm.org/10.1145/1250790.1250839"><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/PaghPR07">BibTeX</a></font> <li><a name="FranceschiniM07" href="../../indices/a-tree/f/Franceschini:Gianni.html">Gianni Franceschini</a>, <a href="../../indices/a-tree/m/Muthukrishnan:S=.html">S. Muthukrishnan</a>: <br><b>Optimal suffix selection. </b>328-337<br><a href="http://doi.acm.org/10.1145/1250790.1250840"><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/FranceschiniM07">BibTeX</a></font> </ul> <h2>Session 8A</h2> <ul> <li><a name="DobzinskiN07" href="../../indices/a-tree/d/Dobzinski:Shahar.html">Shahar Dobzinski</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>: <br><b>Limitations of VCG-based mechanisms. </b>338-344<br><a href="http://doi.acm.org/10.1145/1250790.1250842"><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/DobzinskiN07">BibTeX</a></font> <li><a name="HartM07" href="../../indices/a-tree/h/Hart:Sergiu.html">Sergiu Hart</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>: <br><b>The communication complexity of uncoupled nash equilibrium procedures. </b>345-353<br><a href="http://doi.acm.org/10.1145/1250790.1250843"><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/HartM07">BibTeX</a></font> <li><a name="WuZ07" href="../../indices/a-tree/w/Wu:Fang.html">Fang Wu</a>, <a href="../../indices/a-tree/z/Zhang:Li.html">Li Zhang</a>: <br><b>Proportional response dynamics leads to market equilibrium. </b>354-363<br><a href="http://doi.acm.org/10.1145/1250790.1250844"><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/WuZ07">BibTeX</a></font> <li><a name="JainV07" href="../../indices/a-tree/j/Jain:Kamal.html">Kamal Jain</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: <br><b>Eisenberg-Gale markets: algorithms and structural properties. </b>364-373<br><a href="http://doi.acm.org/10.1145/1250790.1250845"><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/JainV07">BibTeX</a></font> </ul> <h2>Session 8B</h2> <ul> <li><a name="HeggernesPTV07" href="../../indices/a-tree/h/Heggernes:Pinar.html">Pinar Heggernes</a>, <a href="../../indices/a-tree/p/Paul:Christophe.html">Christophe Paul</a>, <a href="../../indices/a-tree/t/Telle:Jan_Arne.html">Jan Arne Telle</a>, <a href="../../indices/a-tree/v/Villanger:Yngve.html">Yngve Villanger</a>: <br><b>Interval completion with few edges. </b>374-381<br><a href="http://doi.acm.org/10.1145/1250790.1250847"><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/HeggernesPTV07">BibTeX</a></font> <li><a name="KawarabayashiR07" href="../../indices/a-tree/k/Kawarabayashi:Ken=ichi.html">Ken-ichi Kawarabayashi</a>, <a href="../../indices/a-tree/r/Reed:Bruce_A=.html">Bruce A. Reed</a>: <br><b>Computing crossing number in linear time. </b>382-390<br><a href="http://doi.acm.org/10.1145/1250790.1250848"><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/KawarabayashiR07">BibTeX</a></font> <li><a name="AnshelevichK07" href="../../indices/a-tree/a/Anshelevich:Elliot.html">Elliot Anshelevich</a>, <a href="../../indices/a-tree/k/Karagiozova:Adriana.html">Adriana Karagiozova</a>: <br><b>Terminal backup, 3D matching, and covering cubic graphs. </b>391-400<br><a href="http://doi.acm.org/10.1145/1250790.1250849"><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/AnshelevichK07">BibTeX</a></font> <li><a name="CaiL07" href="../../indices/a-tree/c/Cai:Jin=yi.html">Jin-yi Cai</a>, <a href="../../indices/a-tree/l/Lu:Pinyan.html">Pinyan Lu</a>: <br><b>Holographic algorithms: from art to science. </b>401-410<br><a href="http://doi.acm.org/10.1145/1250790.1250850"><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/CaiL07">BibTeX</a></font> </ul> <h2>Session 9A</h2> <ul> <li><a name="Holenstein07" href="../../indices/a-tree/h/Holenstein:Thomas.html">Thomas Holenstein</a>: <br><b>Parallel repetition: simplifications and the no-signaling case. </b>411-419<br><a href="http://doi.acm.org/10.1145/1250790.1250852"><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/Holenstein07">BibTeX</a></font> <li><a name="PassV07" href="../../indices/a-tree/p/Pass:Rafael.html">Rafael Pass</a>, <a href="../../indices/a-tree/v/Venkitasubramaniam:Muthuramakrishnan.html">Muthuramakrishnan Venkitasubramaniam</a>: <br><b>An efficient parallel repetition theorem for Arthur-Merlin games. </b>420-429<br><a href="http://doi.acm.org/10.1145/1250790.1250853"><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/PassV07">BibTeX</a></font> <li><a name="ShaltielU07" href="../../indices/a-tree/s/Shaltiel:Ronen.html">Ronen Shaltiel</a>, <a href="../../indices/a-tree/u/Umans:Christopher.html">Christopher Umans</a>: <br><b>Low-end uniform hardness vs. randomness tradeoffs for AM. </b>430-439<br><a href="http://doi.acm.org/10.1145/1250790.1250854"><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/ShaltielU07">BibTeX</a></font> <li><a name="GoldwasserGHKR07" href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/g/Gutfreund:Dan.html">Dan Gutfreund</a>, <a href="../../indices/a-tree/h/Healy:Alexander.html">Alexander Healy</a>, <a href="../../indices/a-tree/k/Kaufman:Tali.html">Tali Kaufman</a>, <a href="../../indices/a-tree/r/Rothblum:Guy_N=.html">Guy N. Rothblum</a>: <br><b>Verifying and decoding in constant depth. </b>440-449<br><a href="http://doi.acm.org/10.1145/1250790.1250855"><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/GoldwasserGHKR07">BibTeX</a></font> </ul> <h2>Session 9B</h2> <ul> <li><a name="HayesVV07" href="../../indices/a-tree/h/Hayes:Thomas_P=.html">Thomas P. Hayes</a>, <a href="../../indices/a-tree/v/Vera:Juan_Carlos.html">Juan Carlos Vera</a>, <a href="../../indices/a-tree/v/Vigoda:Eric.html">Eric Vigoda</a>: <br><b>Randomly coloring planar graphs with fewer colors than the maximum degree. </b>450-458<br><a href="http://doi.acm.org/10.1145/1250790.1250857"><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/HayesVV07">BibTeX</a></font> <li><a name="GoldbergJ07" href="../../indices/a-tree/g/Goldberg:Leslie_Ann.html">Leslie Ann Goldberg</a>, <a href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>: <br><b>Inapproximability of the Tutte polynomial. </b>459-468<br><a href="http://doi.acm.org/10.1145/1250790.1250858"><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/GoldbergJ07">BibTeX</a></font> <li><a name="HavivR07" href="../../indices/a-tree/h/Haviv:Ishay.html">Ishay Haviv</a>, <a href="../../indices/a-tree/r/Regev:Oded.html">Oded Regev</a>: <br><b>Tensor-based hardness of the shortest vector problem to within almost polynomial factors. </b>469-477<br><a href="http://doi.acm.org/10.1145/1250790.1250859"><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/HavivR07">BibTeX</a></font> <li><a name="PeikertR07" href="../../indices/a-tree/p/Peikert:Chris.html">Chris Peikert</a>, <a href="../../indices/a-tree/r/Rosen:Alon.html">Alon Rosen</a>: <br><b>Lattices that admit logarithmic worst-case to average-case connection factors. </b>478-487<br><a href="http://doi.acm.org/10.1145/1250790.1250860"><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/PeikertR07">BibTeX</a></font> </ul> <h2>Session 10A</h2> <ul> <li><a name="RodlS07" href="../../indices/a-tree/r/R=ouml=dl:Vojtech.html">Vojtech Rödl</a>, <a href="../../indices/a-tree/s/Schacht:Mathias.html">Mathias Schacht</a>: <br><b>Property testing in hypergraphs and the removal lemma. </b>488-495<br><a href="http://doi.acm.org/10.1145/1250790.1250862"><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/RodlS07">BibTeX</a></font> <li><a name="AlonAKMRX07" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/a/Andoni:Alexandr.html">Alexandr Andoni</a>, <a href="../../indices/a-tree/k/Kaufman:Tali.html">Tali Kaufman</a>, <a href="../../indices/a-tree/m/Matulef:Kevin.html">Kevin Matulef</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>, <a href="../../indices/a-tree/x/Xie:Ning.html">Ning Xie</a>: <br><b>Testing k-wise and almost k-wise independence. </b>496-505<br><a href="http://doi.acm.org/10.1145/1250790.1250863"><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/AlonAKMRX07">BibTeX</a></font> <li><a name="Samorodnitsky07" href="../../indices/a-tree/s/Samorodnitsky:Alex.html">Alex Samorodnitsky</a>: <br><b>Low-degree tests at large distances. </b>506-515<br><a href="http://doi.acm.org/10.1145/1250790.1250864"><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/Samorodnitsky07">BibTeX</a></font> </ul> <h2>Session 10B</h2> <ul> <li><a name="GavinskyKKRW07" href="../../indices/a-tree/g/Gavinsky:Dmitry.html">Dmitry Gavinsky</a>, <a href="../../indices/a-tree/k/Kempe:Julia.html">Julia Kempe</a>, <a href="../../indices/a-tree/k/Kerenidis:Iordanis.html">Iordanis Kerenidis</a>, <a href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>, <a href="../../indices/a-tree/w/Wolf:Ronald_de.html">Ronald de Wolf</a>: <br><b>Exponential separations for one-way quantum communication complexity, with applications to cryptography. </b>516-525<br><a href="http://doi.acm.org/10.1145/1250790.1250866"><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/GavinskyKKRW07">BibTeX</a></font> <li><a name="HoyerLS07" href="../../indices/a-tree/h/H=oslash=yer:Peter.html">Peter Høyer</a>, <a href="../../indices/a-tree/l/Lee:Troy.html">Troy Lee</a>, <a href="../../indices/a-tree/s/Spalek:Robert.html">Robert Spalek</a>: <br><b>Negative weights make adversaries stronger. </b>526-535<br><a href="http://doi.acm.org/10.1145/1250790.1250867"><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/HoyerLS07">BibTeX</a></font> <li><a name="MooreRS07" href="../../indices/a-tree/m/Moore:Cristopher.html">Cristopher Moore</a>, <a href="../../indices/a-tree/r/Russell:Alexander.html">Alexander Russell</a>, <a href="../../indices/a-tree/s/Sniady:Piotr.html">Piotr Sniady</a>: <br><b>On the impossibility of a quantum sieve algorithm for graph isomorphism. </b>536-545<br><a href="http://doi.acm.org/10.1145/1250790.1250868"><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/MooreRS07">BibTeX</a></font> </ul> <h2>Session 11A</h2> <ul> <li><a name="KakadeKL07" href="../../indices/a-tree/k/Kakade:Sham_M=.html">Sham M. Kakade</a>, <a href="../../indices/a-tree/k/Kalai:Adam_Tauman.html">Adam Tauman Kalai</a>, <a href="../../indices/a-tree/l/Ligett:Katrina.html">Katrina Ligett</a>: <br><b>Playing games with approximation algorithms. </b>546-555<br><a href="http://doi.acm.org/10.1145/1250790.1250870"><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/KakadeKL07">BibTeX</a></font> <li><a name="EnglertRW07" href="../../indices/a-tree/e/Englert:Matthias.html">Matthias Englert</a>, <a href="../../indices/a-tree/r/R=auml=cke:Harald.html">Harald Räcke</a>, <a href="../../indices/a-tree/w/Westermann:Matthias.html">Matthias Westermann</a>: <br><b>Reordering buffers for general metric spaces. </b>556-564<br><a href="http://doi.acm.org/10.1145/1250790.1250871"><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/EnglertRW07">BibTeX</a></font> </ul> <h2>Session 11B</h2> <ul> <li><a name="GutoskiW07" href="../../indices/a-tree/g/Gutoski:Gus.html">Gus Gutoski</a>, <a href="../../indices/a-tree/w/Watrous:John.html">John Watrous</a>: <br><b>Toward a general theory of quantum games. </b>565-574<br><a href="http://doi.acm.org/10.1145/1250790.1250873"><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/GutoskiW07">BibTeX</a></font> <li><a name="MagniezNRS07" href="../../indices/a-tree/m/Magniez:Fr=eacute=d=eacute=ric.html">Frédéric Magniez</a>, <a href="../../indices/a-tree/n/Nayak:Ashwin.html">Ashwin Nayak</a>, <a href="../../indices/a-tree/r/Roland:Jeremie.html">Jeremie Roland</a>, <a href="../../indices/a-tree/s/Santha:Miklos.html">Miklos Santha</a>: <br><b>Search via quantum walk. </b>575-584<br><a href="http://doi.acm.org/10.1145/1250790.1250874"><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/MagniezNRS07">BibTeX</a></font> </ul> <h2>Session 12A</h2> <ul> <li><a name="VassilevskaWY07" href="../../indices/a-tree/v/Vassilevska:Virginia.html">Virginia Vassilevska</a>, <a href="../../indices/a-tree/w/Williams:Ryan.html">Ryan Williams</a>, <a href="../../indices/a-tree/y/Yuster:Raphael.html">Raphael Yuster</a>: <br><b>All-pairs bottleneck paths for general graphs in truly sub-cubic time. </b>585-589<br><a href="http://doi.acm.org/10.1145/1250790.1250876"><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/VassilevskaWY07">BibTeX</a></font> <li><a name="Chan07" href="../../indices/a-tree/c/Chan:Timothy_M=.html">Timothy M. Chan</a>: <br><b>More algorithms for all-pairs shortest paths in weighted graphs. </b>590-598<br><a href="http://doi.acm.org/10.1145/1250790.1250877"><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/Chan07">BibTeX</a></font> <li><a name="Pap07" href="../../indices/a-tree/p/Pap:Gyula.html">Gyula Pap</a>: <br><b>Some new results on node-capacitated packing of A-paths. </b>599-604<br><a href="http://doi.acm.org/10.1145/1250790.1250878"><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/Pap07">BibTeX</a></font> <li><a name="HariharanKPB07" href="../../indices/a-tree/h/Hariharan:Ramesh.html">Ramesh Hariharan</a>, <a href="../../indices/a-tree/k/Kavitha:Telikepalli.html">Telikepalli Kavitha</a>, <a href="../../indices/a-tree/p/Panigrahi:Debmalya.html">Debmalya Panigrahi</a>, <a href="../../indices/a-tree/b/Bhalgat:Anand.html">Anand Bhalgat</a>: <br><b>An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. </b>605-614<br><a href="http://doi.acm.org/10.1145/1250790.1250879"><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/HariharanKPB07">BibTeX</a></font> </ul> <h2>Session 12B</h2> <ul> <li><a name="Indyk07" href="../../indices/a-tree/i/Indyk:Piotr.html">Piotr Indyk</a>: <br><b>Uncertainty principles, extractors, and explicit embeddings of l2 into l1. </b>615-620<br><a href="http://doi.acm.org/10.1145/1250790.1250881"><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/Indyk07">BibTeX</a></font> <li><a name="BrinkmanKL07" href="../../indices/a-tree/b/Brinkman:Bo.html">Bo Brinkman</a>, <a href="../../indices/a-tree/k/Karagiozova:Adriana.html">Adriana Karagiozova</a>, <a href="../../indices/a-tree/l/Lee:James_R=.html">James R. Lee</a>: <br><b>Vertex cuts, random walks, and dimension reduction in series-parallel graphs. </b>621-630<br><a href="http://doi.acm.org/10.1145/1250790.1250882"><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/BrinkmanKL07">BibTeX</a></font> <li><a name="AbrahamBN07" href="../../indices/a-tree/a/Abraham:Ittai.html">Ittai Abraham</a>, <a href="../../indices/a-tree/b/Bartal:Yair.html">Yair Bartal</a>, <a href="../../indices/a-tree/n/Neiman:Ofer.html">Ofer Neiman</a>: <br><b>Local embeddings of metric spaces. </b>631-640<br><a href="http://doi.acm.org/10.1145/1250790.1250883"><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/AbrahamBN07">BibTeX</a></font> <li><a name="DeshpandeV07" href="../../indices/a-tree/d/Deshpande:Amit.html">Amit Deshpande</a>, <a href="../../indices/a-tree/v/Varadarajan:Kasturi_R=.html">Kasturi R. Varadarajan</a>: <br><b>Sampling-based dimension reduction for subspace approximation. </b>641-650<br><a href="http://doi.acm.org/10.1145/1250790.1250884"><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/DeshpandeV07">BibTeX</a></font> </ul> <h2>Session 13A</h2> <ul> <li><a name="LauNSS07" href="../../indices/a-tree/l/Lau:Lap_Chi.html">Lap Chi Lau</a>, <a href="../../indices/a-tree/n/Naor:Joseph.html">Joseph Naor</a>, <a href="../../indices/a-tree/s/Salavatipour:Mohammad_R=.html">Mohammad R. Salavatipour</a>, <a href="../../indices/a-tree/s/Singh:Mohit.html">Mohit Singh</a>: <br><b>Survivable network design with degree or order constraints. </b>651-660<br><a href="http://doi.acm.org/10.1145/1250790.1250886"><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/LauNSS07">BibTeX</a></font> <li><a name="SinghL07" href="../../indices/a-tree/s/Singh:Mohit.html">Mohit Singh</a>, <a href="../../indices/a-tree/l/Lau:Lap_Chi.html">Lap Chi Lau</a>: <br><b>Approximating minimum bounded degree spanning trees to within one of optimal. </b>661-670<br><a href="http://doi.acm.org/10.1145/1250790.1250887"><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/SinghL07">BibTeX</a></font> <li><a name="AgarwalAC07" href="../../indices/a-tree/a/Agarwal:Amit.html">Amit Agarwal</a>, <a href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/c/Charikar:Moses.html">Moses Charikar</a>: <br><b>Improved approximation for directed cut problems. </b>671-680<br><a href="http://doi.acm.org/10.1145/1250790.1250888"><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/AgarwalAC07">BibTeX</a></font> <li><a name="DonovanSVW07" href="../../indices/a-tree/d/Donovan:P=.html">P. Donovan</a>, <a href="../../indices/a-tree/s/Shepherd:F=_Bruce.html">F. Bruce Shepherd</a>, <a href="../../indices/a-tree/v/Vetta:Adrian.html">Adrian Vetta</a>, <a href="../../indices/a-tree/w/Wilfong:Gordon_T=.html">Gordon T. Wilfong</a>: <br><b>Degree-constrained network flows. </b>681-688<br><a href="http://doi.acm.org/10.1145/1250790.1250889"><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/DonovanSVW07">BibTeX</a></font> </ul> <h2>Session 13B</h2> <ul> <li><a name="BeameJR07" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/j/Jayram:T=_S=.html">T. S. Jayram</a>, <a href="../../indices/a-tree/r/Rudra:Atri.html">Atri Rudra</a>: <br><b>Lower bounds for randomized read/write stream algorithms. </b>689-698<br><a href="http://doi.acm.org/10.1145/1250790.1250891"><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/BeameJR07">BibTeX</a></font> <li><a name="LinialS07" href="../../indices/a-tree/l/Linial:Nati.html">Nati Linial</a>, <a href="../../indices/a-tree/s/Shraibman:Adi.html">Adi Shraibman</a>: <br><b>Lower bounds in communication complexity based on factorization norms. </b>699-708<br><a href="http://doi.acm.org/10.1145/1250790.1250892"><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/LinialS07">BibTeX</a></font> <li><a name="BravermanY07" href="../../indices/a-tree/b/Braverman:Mark.html">Mark Braverman</a>, <a href="../../indices/a-tree/y/Yampolsky:Michael.html">Michael Yampolsky</a>: <br><b>Constructing non-computable Julia sets. </b>709-716<br><a href="http://doi.acm.org/10.1145/1250790.1250893"><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/BravermanY07">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:43:13 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
