focs87.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>28. FOCS 1987: Los Angeles, California</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>28. <a href="index.html">FOCS</a> 1987: Los Angeles, California</h1> 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, 27-29 October 1987. IEEE Computer Society <ul> <li><a name="Chazelle87" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>: Polytope Range Searching and Integral Geometry (Extended Abstract). 1-10 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chazelle87">BibTeX</a></font> <li><a name="GhoshM87" href="../../indices/a-tree/g/Ghosh:Subir_Kumar.html">Subir Kumar Ghosh</a>, <a href="../../indices/a-tree/m/Mount:David_M=.html">David M. Mount</a>: An Output Sensitive Algorithm for Computing Visibility Graphs. 11-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GhoshM87">BibTeX</a></font> <li><a name="DobkinFS87" href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>, <a href="../../indices/a-tree/f/Friedman:Steven_J=.html">Steven J. Friedman</a>, <a href="../../indices/a-tree/s/Supowit:Kenneth_J=.html">Kenneth J. Supowit</a>: Delaunay Graphs are Almost as Good as Complete Graphs. 20-26 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DobkinFS87">BibTeX</a></font> <li><a name="EdelsbrunnerPSS87" href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>, <a href="../../indices/a-tree/p/Pach:J=aacute=nos.html">János Pach</a>, <a href="../../indices/a-tree/s/Schwartz:Jacob_T=.html">Jacob T. Schwartz</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>: On the Lower Envelope of Bivariate Functions and its Applications. 27-37 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EdelsbrunnerPSS87">BibTeX</a></font> <li><a name="Canny87" href="../../indices/a-tree/c/Canny:John_F=.html">John F. Canny</a>: A New Algebraic Method for Robot Motion Planning and Real Geometry. 39-48 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Canny87">BibTeX</a></font> <li><a name="CannyR87" href="../../indices/a-tree/c/Canny:John_F=.html">John F. Canny</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: New Lower Bound Techniques for Robot Motion Planning Problems. 49-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CannyR87">BibTeX</a></font> <li><a name="BermanR87" href="../../indices/a-tree/b/Berman:Piotr.html">Piotr Berman</a>, <a href="../../indices/a-tree/r/Roos:Robert.html">Robert Roos</a>: Learning One-Counter Languages in Polynomial Time (Extended Abstract). 61-67 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BermanR87">BibTeX</a></font> <li><a name="Littlestone87" href="../../indices/a-tree/l/Littlestone:Nick.html">Nick Littlestone</a>: Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract). 68-77 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Littlestone87">BibTeX</a></font> <li><a name="RivestS87" href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>, <a href="../../indices/a-tree/s/Schapire:Robert_E=.html">Robert E. Schapire</a>: Diversity-Based Inference of Finite Automata (Extended Abstract). 78-87 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RivestS87">BibTeX</a></font> <li><a name="GrolmuszR87" href="../../indices/a-tree/g/Grolmusz:Vince.html">Vince Grolmusz</a>, <a href="../../indices/a-tree/r/Ragde:Prabhakar.html">Prabhakar Ragde</a>: Incomparability in Parallel Computation. 89-98 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GrolmuszR87">BibTeX</a></font> <li><a name="HajnalMPST87" href="../../indices/a-tree/h/Hajnal:Andr=aacute=s.html">András Hajnal</a>, <a href="../../indices/a-tree/m/Maass:Wolfgang.html">Wolfgang Maass</a>, <a href="../../indices/a-tree/p/Pudl=aacute=k:Pavel.html">Pavel Pudlák</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>, <a href="../../indices/a-tree/t/Tur=aacute=n:Gy=ouml=rgy.html">György Turán</a>: Threshold circuits of bounded depth. 99-110 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HajnalMPST87">BibTeX</a></font> <li><a name="Gurevich87" href="../../indices/a-tree/g/Gurevich:Yuri.html">Yuri Gurevich</a>: Complete and Incomplete Randomized NP Problems. 111-117 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gurevich87">BibTeX</a></font> <li><a name="BlumI87" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>: Generic Oracles and Oracle Classes (Extended Abstract). 118-126 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumI87">BibTeX</a></font> <li><a name="GathenKL87" href="../../indices/a-tree/g/Gathen:Joachim_von_zur.html">Joachim von zur Gathen</a>, <a href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>, <a href="../../indices/a-tree/l/Landau:Susan.html">Susan Landau</a>: Functional Decomposition of Polynomials. 127-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GathenKL87">BibTeX</a></font> <li><a name="Ronyai87" href="../../indices/a-tree/r/R=oacute=nyai:Lajos.html">Lajos Rónyai</a>: Factoring Polynomials over Finite Fields. 132-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ronyai87">BibTeX</a></font> <li><a name="KaminskiB87" href="../../indices/a-tree/k/Kaminski:Michael.html">Michael Kaminski</a>, <a href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>: Multiplicative complexity of polynomial multiplication over finite fields (Extended abstract). 138-140 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KaminskiB87">BibTeX</a></font> <li><a name="MirwaldS87" href="../../indices/a-tree/m/Mirwald:Roland.html">Roland Mirwald</a>, <a href="../../indices/a-tree/s/Schnorr:Claus=Peter.html">Claus-Peter Schnorr</a>: The Multiplicative Complexity of Quadratic Boolean Forms. 141-150 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MirwaldS87">BibTeX</a></font> <li><a name="AtallahCG87" href="../../indices/a-tree/a/Atallah:Mikhail_J=.html">Mikhail J. Atallah</a>, <a href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/g/Goodrich:Michael_T=.html">Michael T. Goodrich</a>: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms. 151-160 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AtallahCG87">BibTeX</a></font> <li><a name="GoldbergS87" href="../../indices/a-tree/g/Goldberg:Mark_K=.html">Mark K. Goldberg</a>, <a href="../../indices/a-tree/s/Spencer:Thomas_H=.html">Thomas H. Spencer</a>: A New Parallel Algorithm for the Maximal Independent Set Problem. 161-165 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldbergS87">BibTeX</a></font> <li><a name="GrigorievK87" href="../../indices/a-tree/g/Grigoriev:Dima.html">Dima Grigoriev</a>, <a href="../../indices/a-tree/k/Karpinski:Marek.html">Marek Karpinski</a>: The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract). 166-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GrigorievK87">BibTeX</a></font> <li><a name="PanR87" href="../../indices/a-tree/p/Pan:Victor_Y=.html">Victor Y. Pan</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: Some Polynomial and Toeplitz Matrix Computations. 173-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PanR87">BibTeX</a></font> <li><a name="Ranade87" href="../../indices/a-tree/r/Ranade:Abhiram_G=.html">Abhiram G. Ranade</a>: How to emulate shared memory (Preliminary Version). 185-194 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ranade87">BibTeX</a></font> <li><a name="Gereb-GrausK87" href="../../indices/a-tree/g/Ger=eacute=b=Graus:Mih=aacute=ly.html">Mihály Geréb-Graus</a>, <a href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>: The Complexity of Parallel Comparison Merging. 195-201 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gereb-GrausK87">BibTeX</a></font> <li><a name="AggarwalCS87" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>, <a href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>, <a href="../../indices/a-tree/s/Snir:Marc.html">Marc Snir</a>: Hierarchical Memory with Block Transfer. 204-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AggarwalCS87">BibTeX</a></font> <li><a name="LenstraST87" href="../../indices/a-tree/l/Lenstra:Jan_Karel.html">Jan Karel Lenstra</a>, <a href="../../indices/a-tree/s/Shmoys:David_B=.html">David B. Shmoys</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>: Approximation Algorithms for Scheduling Unrelated Parallel Machines. 217-224 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LenstraST87">BibTeX</a></font> <li><a name="Rao87" href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>: Finding Near Optimal Separators in Planar Graphs. 225-237 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rao87">BibTeX</a></font> <li><a name="GazitM87" href="../../indices/a-tree/g/Gazit:Hillel.html">Hillel Gazit</a>, <a href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>: A Parallel Algorithm for Finding a Separator in Planar Graphs. 238-248 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GazitM87">BibTeX</a></font> <li><a name="Matula87" href="../../indices/a-tree/m/Matula:David_W=.html">David W. Matula</a>: Determining Edge Connectivity in O(nm). 249-251 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Matula87">BibTeX</a></font> <li><a name="KanevskyR87" href="../../indices/a-tree/k/Kanevsky:Arkady.html">Arkady Kanevsky</a>, <a href="../../indices/a-tree/r/Ramachandran:Vijaya.html">Vijaya Ramachandran</a>: Improved Algorithms for Graph Four-Connectivity. 252-259 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KanevskyR87">BibTeX</a></font> <li><a name="CoppersmithRT87" href="../../indices/a-tree/c/Coppersmith:Don.html">Don Coppersmith</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>: Parallel Graph Algorithms that Are Efficient on Average. 260-269 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CoppersmithRT87">BibTeX</a></font> <li><a name="Kucera87" href="../../indices/a-tree/k/Kucera:Ludek.html">Ludek Kucera</a>: Canonical Labeling of Regular Graphs in Linear Average Time. 271-279 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kucera87">BibTeX</a></font> <li><a name="Boppana87" href="../../indices/a-tree/b/Boppana:Ravi_B=.html">Ravi B. Boppana</a>: Eigenvalues and Graph Bisection: An Average-Case Analysis (Extended Abstract). 280-285 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Boppana87">BibTeX</a></font> <li><a name="BroderS87" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/s/Shamir:Eli.html">Eli Shamir</a>: On the Second Eigenvalue of Random Regular Graphs (Preliminary Version). 286-294 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BroderS87">BibTeX</a></font> <li><a name="Ajtai87" href="../../indices/a-tree/a/Ajtai:Mikl=oacute=s.html">Miklós Ajtai</a>: Recursive Construction for 3-Regular Expanders. 295-304 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ajtai87">BibTeX</a></font> <li><a name="KilianKL87" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>, <a href="../../indices/a-tree/k/Kipnis:Shlomo.html">Shlomo Kipnis</a>, <a href="../../indices/a-tree/l/Leiserson:Charles_E=.html">Charles E. Leiserson</a>: The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract). 305-315 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KilianKL87">BibTeX</a></font> <li><a name="GaoK87" href="../../indices/a-tree/g/Gao:Shaodi.html">Shaodi Gao</a>, <a href="../../indices/a-tree/k/Kaufmann:Michael.html">Michael Kaufmann</a>: Channel Routing of Multiterminal Nets. 316-325 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GaoK87">BibTeX</a></font> <li><a name="DurisG87" href="../../indices/a-tree/d/Duris:Pavol.html">Pavol Duris</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version). 326-330 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DurisG87">BibTeX</a></font> <li><a name="Linial87" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>: Distributive Graph Algorithms-Global Solutions from Local Data. 331-335 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Linial87">BibTeX</a></font> <li><a name="AttiyaBDKPR87" href="../../indices/a-tree/a/Attiya:Hagit.html">Hagit Attiya</a>, <a href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>, <a href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/k/Koller:Daphne.html">Daphne Koller</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>, <a href="../../indices/a-tree/r/Reischuk:R=uuml=diger.html">Rüdiger Reischuk</a>: Achievable Cases in an Asynchronous Environment (Extended Abstract). 337-346 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AttiyaBDKPR87">BibTeX</a></font> <li><a name="AfekAPS87" href="../../indices/a-tree/a/Afek:Yehuda.html">Yehuda Afek</a>, <a href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: Local Management of a Global Resource in a Communication Network. 347-357 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AfekAPS87">BibTeX</a></font> <li><a name="AfekAG87" href="../../indices/a-tree/a/Afek:Yehuda.html">Yehuda Afek</a>, <a href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/g/Gafni:Eli.html">Eli Gafni</a>: Applying Static Network Protocols to Dynamic Networks. 358-370 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AfekAG87">BibTeX</a></font> <li><a name="IsraeliL87" href="../../indices/a-tree/i/Israeli:Amos.html">Amos Israeli</a>, <a href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>: Bounded Time-Stamps (Extended Abstract). 371-382 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/IsraeliL87">BibTeX</a></font> <li><a name="PetersonB87" href="../../indices/a-tree/p/Peterson:Gary_L=.html">Gary L. Peterson</a>, <a href="../../indices/a-tree/b/Burns:James_E=.html">James E. Burns</a>: Concurrent Reading While Writing II: The Multi-writer Case. 383-392 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PetersonB87">BibTeX</a></font> <li><a name="Yao87" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Lower Bounds to Randomized Algorithms for Graph Properties (Extended Abstract). 393-400 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Yao87">BibTeX</a></font> <li><a name="HirschV87" href="../../indices/a-tree/h/Hirsch:Michael_D=.html">Michael D. Hirsch</a>, <a href="../../indices/a-tree/v/Vavasis:Stephen_A=.html">Stephen A. Vavasis</a>: Exponential Lower Bounds for Finding Brouwer Fixed Points (Extended Abstract). 401-410 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HirschV87">BibTeX</a></font> <li><a name="Cosmadakis87" href="../../indices/a-tree/c/Cosmadakis:Stavros_S=.html">Stavros S. Cosmadakis</a>: Database Theory and Cylindric Lattices (Extended Abstract). 411-420 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cosmadakis87">BibTeX</a></font> <li><a name="Stern87" href="../../indices/a-tree/s/Stern:Jacques.html">Jacques Stern</a>: Secret Linear Congruential Generators Are Not Cryptographically Secure. 421-426 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Stern87">BibTeX</a></font> <li><a name="Feldman87" href="../../indices/a-tree/f/Feldman:Paul.html">Paul Feldman</a>: A Practical Scheme for Non-interactive Verifiable Secret Sharing. 427-437 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Feldman87">BibTeX</a></font> <li><a name="AielloH87" href="../../indices/a-tree/a/Aiello:William.html">William Aiello</a>, <a href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>: Perfect Zero-Knowledge Languages Can Be Recognized in Two Rounds. 439-448 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AielloH87">BibTeX</a></font> <li><a name="GoldreichMS87" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: Interactive Proof Systems: Provers that never Fail and Random Selection (Extended Abstract). 449-461 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldreichMS87">BibTeX</a></font> <li><a name="Oren87" href="../../indices/a-tree/o/Oren:Yair.html">Yair Oren</a>: On the Cunning Power of Cheating Verifiers: Some Observations about Zero Knowledge Proofs (Extended Abstract). 462-471 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Oren87">BibTeX</a></font> <li><a name="TompaW87" href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>, <a href="../../indices/a-tree/w/Woll:Heather.html">Heather Woll</a>: Random Self-Reducibility and Zero Knowledge Interactive Proofs of Possession of Information. 472-482 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TompaW87">BibTeX</a></font> <li><a name="TarjanW87" href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>, <a href="../../indices/a-tree/w/Wyk:Christopher_J=_Van.html">Christopher J. Van Wyk</a>: Correction to ``A Linear-Time Algorithm for Triangulating Simple Polygons''. 486 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TarjanW87">BibTeX</a></font> <li><a name="VitanyiA87" href="../../indices/a-tree/v/Vit=aacute=nyi:Paul_M=_B=.html">Paul M. B. Vitányi</a>, <a href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>: Errata to ``Atomic Shared Register Access by Asynchronous Hardware''. 487 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VitanyiA87">BibTeX</a></font> <li><a name="AlonA87" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/a/Azar:Yossi.html">Yossi Azar</a>: The Average Complexity of Deterministic and Randomized Parallel Comparison Sorting Algorithms. 489-498 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonA87">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:25 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
