stoc89.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1989</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>21. <a href="index.html">STOC</a> 1989</h1> Proceedings of the 21st Annual ACM Symposium on Theory of Computing, May 14-17, 1989, Seattle, Washigton, USA. ACM 1989 <ul> <li><a name="BabaiNS89" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: Multiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract). 1-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BabaiNS89">BibTeX</a></font> <li><a name="ImpagliazzoLL89" href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>: Pseudo-random Generation from one-way functions (Extended Abstracts). 12-24 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ImpagliazzoLL89">BibTeX</a></font> <li><a name="GoldreichL89" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>: A Hard-Core Predicate for all One-Way Functions. 25-32 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldreichL89">BibTeX</a></font> <li><a name="NaorY89" href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: Universal One-Way Hash Functions and their Cryptographic Applications. 33-43 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NaorY89">BibTeX</a></font> <li><a name="ImpagliazzoR89" href="../../indices/a-tree/i/Impagliazzo:Russell.html">Russell Impagliazzo</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>: Limits on the Provable Consequences of One-Way Permutations. 44-61 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ImpagliazzoR89">BibTeX</a></font> <li><a name="ChorK89" href="../../indices/a-tree/c/Chor:Benny.html">Benny Chor</a>, <a href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>: A Zero-One Law for Boolean Privacy (extended abstract). 62-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChorK89">BibTeX</a></font> <li><a name="RabinB89" href="../../indices/a-tree/r/Rabin:Tal.html">Tal Rabin</a>, <a href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>: Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). 73-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RabinB89">BibTeX</a></font> <li><a name="BlumK89" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/k/Kannan:Sampath.html">Sampath Kannan</a>: Designing Programs That Check Their Work. 86-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumK89">BibTeX</a></font> <li><a name="Vallee89" href="../../indices/a-tree/v/Vall=eacute=e:Brigitte.html">Brigitte Vallée</a>: Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues. 98-106 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vallee89">BibTeX</a></font> <li><a name="CookU89" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>, <a href="../../indices/a-tree/u/Urquhart:Alasdair.html">Alasdair Urquhart</a>: Functional Interpretations of Feasibly Constructive Arithmetic (Extended Abstract). 107-112 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CookU89">BibTeX</a></font> <li><a name="AfratiC89" href="../../indices/a-tree/a/Afrati:Foto_N=.html">Foto N. Afrati</a>, <a href="../../indices/a-tree/c/Cosmadakis:Stavros_S=.html">Stavros S. Cosmadakis</a>: Expressiveness of Restricted Recursive Queries (Extended Abstract). 113-126 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AfratiC89">BibTeX</a></font> <li><a name="SafraV89" href="../../indices/a-tree/s/Safra:Shmuel.html">Shmuel Safra</a>, <a href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>: On omega-Automata and Temporal Logic (Preliminary Report). 127-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SafraV89">BibTeX</a></font> <li><a name="Ierardi89" href="../../indices/a-tree/i/Ierardi:Doug.html">Doug Ierardi</a>: Quantifier Elimination in the Theory of an Algebraically-closed Field. 138-147 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ierardi89">BibTeX</a></font> <li><a name="FortnowS89" href="../../indices/a-tree/f/Fortnow:Lance.html">Lance Fortnow</a>, <a href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: Probabilistic Computation and Linear Time. 148-156 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FortnowS89">BibTeX</a></font> <li><a name="KurtzMR89" href="../../indices/a-tree/k/Kurtz:Stuart_A=.html">Stuart A. Kurtz</a>, <a href="../../indices/a-tree/m/Mahaney:Stephen_R=.html">Stephen R. Mahaney</a>, <a href="../../indices/a-tree/r/Royer:James_S=.html">James S. Royer</a>: The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract). 157-166 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KurtzMR89">BibTeX</a></font> <li><a name="Razborov89" href="../../indices/a-tree/r/Razborov:Alexander_A=.html">Alexander A. Razborov</a>: On the Method of Approximations. 167-176 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Razborov89">BibTeX</a></font> <li><a name="Bshouty89" href="../../indices/a-tree/b/Bshouty:Nader_H=.html">Nader H. Bshouty</a>: On the Extended Direct Sum Conjecture. 177-185 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Bshouty89">BibTeX</a></font> <li><a name="Yao89" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Circuits and Local Computation. 186-196 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao89">BibTeX</a></font> <li><a name="Beame89" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>: A General Sequential Time-Space Tradeoff for Finding Unique Elements. 197-203 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Beame89">BibTeX</a></font> <li><a name="Ben-DavidCGL89" href="../../indices/a-tree/b/Ben=David:Shai.html">Shai Ben-David</a>, <a href="../../indices/a-tree/c/Chor:Benny.html">Benny Chor</a>, <a href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>: On the Theory of Average Case Complexity. 204-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-DavidCGL89">BibTeX</a></font> <li><a name="LamTT89" href="../../indices/a-tree/l/Lam:Tak_Wah.html">Tak Wah Lam</a>, <a href="../../indices/a-tree/t/Tiwari:Prasoon.html">Prasoon Tiwari</a>, <a href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>: Tradeoffs Between Communication and Space. 217-226 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LamTT89">BibTeX</a></font> <li><a name="KochLMRR89" href="../../indices/a-tree/k/Koch:Richard_R=.html">Richard R. Koch</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/Maggs:Bruce_M=.html">Bruce M. Maggs</a>, <a href="../../indices/a-tree/r/Rao:Satish.html">Satish Rao</a>, <a href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract). 227-240 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KochLMRR89">BibTeX</a></font> <li><a name="Upfal89" href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: An O(log N) Deterministic Packet Routing Scheme (Preliminary Version). 241-250 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Upfal89">BibTeX</a></font> <li><a name="HastadLN89" href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/n/Newman:Mark.html">Mark Newman</a>: Fast Computation Using Faulty Hypercubes (Extended Abstract). 251-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HastadLN89">BibTeX</a></font> <li><a name="ReifT89" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>, <a href="../../indices/a-tree/t/Tate:Stephen_R=.html">Stephen R. Tate</a>: Optimal Size Integer Division Circuits. 264-273 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ReifT89">BibTeX</a></font> <li><a name="AlonBLP89" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: On the Complexity of Radio Communication (Extended Abstract). 274-285 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlonBLP89">BibTeX</a></font> <li><a name="KaoS89" href="../../indices/a-tree/k/Kao:Ming=Yang.html">Ming-Yang Kao</a>, <a href="../../indices/a-tree/s/Shannon:Gregory_E=.html">Gregory E. Shannon</a>: Local Reorientation, Global Order, and Planar Topology (Preliminary Version). 286-296 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KaoS89">BibTeX</a></font> <li><a name="AggarwalAK89" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>, <a href="../../indices/a-tree/a/Anderson:Richard_J=.html">Richard J. Anderson</a>, <a href="../../indices/a-tree/k/Kao:Ming=Yang.html">Ming-Yang Kao</a>: Parallel Depth-First Search in General Directed Graphs (Preliminary Version). 297-308 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AggarwalAK89">BibTeX</a></font> <li><a name="BerkmanBGSV89" href="../../indices/a-tree/b/Berkman:Omer.html">Omer Berkman</a>, <a href="../../indices/a-tree/b/Breslauer:Dany.html">Dany Breslauer</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Highly Parallelizable Problems (Extended Abstract). 309-319 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BerkmanBGSV89">BibTeX</a></font> <li><a name="Boppana89" href="../../indices/a-tree/b/Boppana:Ravi_B=.html">Ravi B. Boppana</a>: Optimal Separations Between Concurrent-Write Parallel Machines. 320-326 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Boppana89">BibTeX</a></font> <li><a name="Nisan89" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>: CREW PRAMs and Decision Trees. 327-335 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Nisan89">BibTeX</a></font> <li><a name="FiatN89" href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: Implicit O(1) Probe Search. 336-344 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FiatN89">BibTeX</a></font> <li><a name="FredmanS89" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>, <a href="../../indices/a-tree/s/Saks:Michael_E=.html">Michael E. Saks</a>: The Cell Probe Complexity of Dynamic Data Structures. 345-354 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FredmanS89">BibTeX</a></font> <li><a name="SchmidtS89" href="../../indices/a-tree/s/Schmidt:Jeanette_P=.html">Jeanette P. Schmidt</a>, <a href="../../indices/a-tree/s/Siegel:Alan.html">Alan Siegel</a>: On Aspects of Universality and Performance for Closed Hashing (Extended Abstract). 355-366 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SchmidtS89">BibTeX</a></font> <li><a name="Kenyon-MathieuK89" href="../../indices/a-tree/k/Kenyon=Mathieu:Claire.html">Claire Kenyon-Mathieu</a>, <a href="../../indices/a-tree/k/King:Valerie.html">Valerie King</a>: Verifying Partial Orders. 367-374 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kenyon-MathieuK89">BibTeX</a></font> <li><a name="DyerFK89" href="../../indices/a-tree/d/Dyer:Martin_E=.html">Martin E. Dyer</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies. 375-381 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DyerFK89">BibTeX</a></font> <li><a name="ChazelleEGS89" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>, <a href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>: Lines in Space-Combinatorics, Algorithms and Applications. 382-393 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChazelleEGS89">BibTeX</a></font> <li><a name="ReifS89" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>, <a href="../../indices/a-tree/s/Sen:Sandeep.html">Sandeep Sen</a>: Polling: A New Randomized Sampling Technique for Computational Geometry. 394-404 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ReifS89">BibTeX</a></font> <li><a name="GoodmanPS89" href="../../indices/a-tree/g/Goodman:Jacob_E=.html">Jacob E. Goodman</a>, <a href="../../indices/a-tree/p/Pollack:Richard.html">Richard Pollack</a>, <a href="../../indices/a-tree/s/Sturmfels:Bernd.html">Bernd Sturmfels</a>: Coordinate Representation of Order Types Requires Exponential Storage. 405-410 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoodmanPS89">BibTeX</a></font> <li><a name="RivestS89" 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>: Inference of Finite Automata Using Homing Sequences (Extended Abstract). 411-420 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RivestS89">BibTeX</a></font> <li><a name="PittW89" href="../../indices/a-tree/p/Pitt:Leonard.html">Leonard Pitt</a>, <a href="../../indices/a-tree/w/Warmuth:Manfred_K=.html">Manfred K. Warmuth</a>: The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial. 421-432 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PittW89">BibTeX</a></font> <li><a name="KearnsV89" href="../../indices/a-tree/k/Kearns:Michael_J=.html">Michael J. Kearns</a>, <a href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. 433-444 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KearnsV89">BibTeX</a></font> <li><a name="Birget89" href="../../indices/a-tree/b/Birget:Jean=Camille.html">Jean-Camille Birget</a>: Proof of a Conjecture of R. Kannan. 445-453 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Birget89">BibTeX</a></font> <li><a name="DolevS89" href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/s/Shavit:Nir.html">Nir Shavit</a>: Bounded Concurrent Time-Stamp Systems Are Constructible. 454-466 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DolevS89">BibTeX</a></font> <li><a name="GrahamY89" href="../../indices/a-tree/g/Graham:Ronald_L=.html">Ronald L. Graham</a>, <a href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: On the Improbability of Reaching Byzantine Agreements (Preliminary Version). 467-478 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GrahamY89">BibTeX</a></font> <li><a name="AwerbuchBLP89" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>, <a href="../../indices/a-tree/b/Bar=Noy:Amotz.html">Amotz Bar-Noy</a>, <a href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>: Compact Distributed Data Structures for Adaptive Routing (Extended Abstract). 479-489 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AwerbuchBLP89">BibTeX</a></font> <li><a name="Awerbuch89" href="../../indices/a-tree/a/Awerbuch:Baruch.html">Baruch Awerbuch</a>: Distributed Shortest Paths Algorithms (Extended Abstract). 490-500 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Awerbuch89">BibTeX</a></font> <li><a name="FellowsL89" href="../../indices/a-tree/f/Fellows:Michael_R=.html">Michael R. Fellows</a>, <a href="../../indices/a-tree/l/Langston:Michael_A=.html">Michael A. Langston</a>: On Search, Decision and the Efficiency of Polynomial-Time Algorithms (Extended Abstract). 501-512 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FellowsL89">BibTeX</a></font> <li><a name="Feder89" href="../../indices/a-tree/f/Feder:Tom=aacute=s.html">Tomás Feder</a>: A New Fixed Point Approach for Stable Networks and Stable Marriages. 513-522 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Feder89">BibTeX</a></font> <li><a name="CohenM89" href="../../indices/a-tree/c/Cohen:Edith.html">Edith Cohen</a>, <a href="../../indices/a-tree/m/Megiddo:Nimrod.html">Nimrod Megiddo</a>: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). 523-534 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CohenM89">BibTeX</a></font> <li><a name="Blum89" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>: An \tildeO(n^0.4)-Approximation Algorithm for 3-Coloring (and Improved Approximation Algorithm for k-Coloring). 535-542 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Blum89">BibTeX</a></font> <li><a name="BroderKRU89" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/k/Karlin:Anna_R=.html">Anna R. Karlin</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: Trading Space for Time in Undirected s-t Connectivity. 543-549 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BroderKRU89">BibTeX</a></font> <li><a name="Motwani89" href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>: Expanding Graphs and the Average-case Analysis of Algorithms for Matchings and Related Problems. 550-561 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Motwani89">BibTeX</a></font> <li><a name="BorodinRT89" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/r/Ruzzo:Walter_L=.html">Walter L. Ruzzo</a>, <a href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>: Lower Bounds on the Length of Universal Traversal Sequences (Detailed Abstract). 562-573 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BorodinRT89">BibTeX</a></font> <li><a name="ChandraRRST89" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/r/Ruzzo:Walter_L=.html">Walter L. Ruzzo</a>, <a href="../../indices/a-tree/s/Smolensky:Roman.html">Roman Smolensky</a>, <a href="../../indices/a-tree/t/Tiwari:Prasoon.html">Prasoon Tiwari</a>: The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract). 574-586 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChandraRRST89">BibTeX</a></font> <li><a name="FriedmanKS89" href="../../indices/a-tree/f/Friedman:Joel.html">Joel Friedman</a>, <a href="../../indices/a-tree/k/Kahn:Jeff.html">Jeff Kahn</a>, <a href="../../indices/a-tree/s/Szemer=eacute=di:Endre.html">Endre Szemerédi</a>: On the Second Eigenvalue in Random Regular Graphs. 587-598 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FriedmanKS89">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:10 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
