stoc88.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1988</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>20. <a href="index.html">STOC</a> 1988</h1> Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA. ACM 1988 <ul> <li><a name="Ben-OrGW88" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). 1-10 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-OrGW88">BibTeX</a></font> <li><a name="ChaumCD88" href="../../indices/a-tree/c/Chaum:David.html">David Chaum</a>, <a href="../../indices/a-tree/c/Cr=eacute=peau:Claude.html">Claude Crépeau</a>, <a href="../../indices/a-tree/d/Damg=aring=rd:Ivan.html">Ivan Damgård</a>: Multiparty Unconditionally Secure Protocols (Extended Abstract). 11-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChaumCD88">BibTeX</a></font> <li><a name="Kilian88" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>: Founding Cryptography on Oblivious Transfer. 20-31 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kilian88">BibTeX</a></font> <li><a name="BellareM88" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>: How to Sign Given Any Trapdoor Function (Extended Abstract). 32-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BellareM88">BibTeX</a></font> <li><a name="PelegU88" href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: A Tradeoff between Space and Efficiency for Routing Tables (Extended Abstract). 43-52 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PelegU88">BibTeX</a></font> <li><a name="HalpernV88" href="../../indices/a-tree/h/Halpern:Joseph_Y=.html">Joseph Y. Halpern</a>, <a href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>: Reasoning about Knowledge and Time in Asynchronous Systems. 53-65 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HalpernV88">BibTeX</a></font> <li><a name="BermanS88" href="../../indices/a-tree/b/Berman:Piotr.html">Piotr Berman</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: Investigations of Fault-Tolerant Networks of Computers (Preliminary Version). 66-77 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BermanS88">BibTeX</a></font> <li><a name="DolevGS88" href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/g/Gafni:Eli.html">Eli Gafni</a>, <a href="../../indices/a-tree/s/Shavit:Nir.html">Nir Shavit</a>: Toward a Non-Atomic Era: \ell-Exclusion as a Test Case. 78-92 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DolevGS88">BibTeX</a></font> <li><a name="KrizancPU88" href="../../indices/a-tree/k/Krizanc:Danny.html">Danny Krizanc</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</a>, <a href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>: A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract). 93-102 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KrizancPU88">BibTeX</a></font> <li><a name="BlumFM88" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/f/Feldman:Paul.html">Paul Feldman</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>: Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract). 103-112 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumFM88">BibTeX</a></font> <li><a name="Ben-OrGKW88" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Multi-Prover Interactive Proofs: How to Remove Intractability Assumptions. 113-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-OrGKW88">BibTeX</a></font> <li><a name="HalpernMT88" href="../../indices/a-tree/h/Halpern:Joseph_Y=.html">Joseph Y. Halpern</a>, <a href="../../indices/a-tree/m/Moses:Yoram.html">Yoram Moses</a>, <a href="../../indices/a-tree/t/Tuttle:Mark_R=.html">Mark R. Tuttle</a>: A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report). 132-147 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HalpernMT88">BibTeX</a></font> <li><a name="FeldmanM88" href="../../indices/a-tree/f/Feldman:Paul.html">Paul Feldman</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>: Optimal Algorithms for Byzantine Agreement. 148-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeldmanM88">BibTeX</a></font> <li><a name="HalstenbergR88" href="../../indices/a-tree/h/Halstenberg:Bernd.html">Bernd Halstenberg</a>, <a href="../../indices/a-tree/r/Reischuk:R=uuml=diger.html">Rüdiger Reischuk</a>: On Different Modes of Communication (Extended Abstract). 162-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HalstenbergR88">BibTeX</a></font> <li><a name="AggarwalC88" 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>: Virtual Memory Algorithms (Preliminary Version). 173-185 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AggarwalC88">BibTeX</a></font> <li><a name="HajnalMT88" 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/t/Tur=aacute=n:Gy=ouml=rgy.html">György Turán</a>: On the Communication Complexity of Graph Properties. 186-191 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HajnalMT88">BibTeX</a></font> <li><a name="BhattCHLR88" href="../../indices/a-tree/b/Bhatt:Sandeep_N=.html">Sandeep N. Bhatt</a>, <a href="../../indices/a-tree/c/Chung:Fan_R=_K=.html">Fan R. K. Chung</a>, <a href="../../indices/a-tree/h/Hong:Jia=Wei.html">Jia-Wei Hong</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Optimal Simulations by Butterfly Networks (Preliminary Version). 192-204 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BhattCHLR88">BibTeX</a></font> <li><a name="AggarwalCR88" 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/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>: Energy Consumption in VLSI Circuits (Preliminary Version). 205-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AggarwalCR88">BibTeX</a></font> <li><a name="VenkatesanL88" href="../../indices/a-tree/v/Venkatesan:Ramarathnam.html">Ramarathnam Venkatesan</a>, <a href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>: Random Instances of a Graph Coloring Problem Are Hard. 217-222 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/VenkatesanL88">BibTeX</a></font> <li><a name="Yannakakis88" href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract). 223-228 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yannakakis88">BibTeX</a></font> <li><a name="JerrumS88" href="../../indices/a-tree/j/Jerrum:Mark.html">Mark Jerrum</a>, <a href="../../indices/a-tree/s/Sinclair:Alistair.html">Alistair Sinclair</a>: Conductance and the Rapid Mixing Property for Markov Chains: the Approximation of the Permanent Resolved (Preliminary Version). 235-244 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JerrumS88">BibTeX</a></font> <li><a name="Ko88" href="../../indices/a-tree/k/Ko:Ker=I.html">Ker-I Ko</a>: Relativized Polynominal Time Hierarchies Having Exactly K Levels. 245-253 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ko88">BibTeX</a></font> <li><a name="Ben-OrC88" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>, <a href="../../indices/a-tree/c/Cleve:Richard.html">Richard Cleve</a>: Computing Algebraic Formulas Using a Constant Number of Registers. 254-257 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-OrC88">BibTeX</a></font> <li><a name="KalyanasundaramS88" href="../../indices/a-tree/k/Kalyanasundaram:Bala.html">Bala Kalyanasundaram</a>, <a href="../../indices/a-tree/s/Schnitger:Georg.html">Georg Schnitger</a>: On the Power of White Pebbles (Extended Abstract). 258-266 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KalyanasundaramS88">BibTeX</a></font> <li><a name="KearnsL88" href="../../indices/a-tree/k/Kearns:Michael_J=.html">Michael J. Kearns</a>, <a href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>: Learning in the Presence of Malicious Errors (Extended Abstract). 267-280 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KearnsL88">BibTeX</a></font> <li><a name="GurevichS88" href="../../indices/a-tree/g/Gurevich:Yuri.html">Yuri Gurevich</a>, <a href="../../indices/a-tree/s/Shelah:Saharon.html">Saharon Shelah</a>: Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space. 281-289 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GurevichS88">BibTeX</a></font> <li><a name="KarpZ88" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/z/Zhang:Yanjun.html">Yanjun Zhang</a>: A Randomized Parallel Branch-and-Bound Procedure. 290-300 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpZ88">BibTeX</a></font> <li><a name="Ben-OrT88" href="../../indices/a-tree/b/Ben=Or:Michael.html">Michael Ben-Or</a>, <a href="../../indices/a-tree/t/Tiwari:Prasoon.html">Prasoon Tiwari</a>: A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract). 301-309 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-OrT88">BibTeX</a></font> <li><a name="KarloffR88" href="../../indices/a-tree/k/Karloff:Howard_J=.html">Howard J. Karloff</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>: Randomized Algorithms and Pseudorandom Numbers. 310-321 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarloffR88">BibTeX</a></font> <li><a name="ManasseMS88" href="../../indices/a-tree/m/Manasse:Mark_S=.html">Mark S. Manasse</a>, <a href="../../indices/a-tree/m/McGeoch:Lyle_A=.html">Lyle A. McGeoch</a>, <a href="../../indices/a-tree/s/Sleator:Daniel_Dominic.html">Daniel Dominic Sleator</a>: Competitive Algorithms for On-line Problems. 322-333 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ManasseMS88">BibTeX</a></font> <li><a name="KannanNR88" href="../../indices/a-tree/k/Kannan:Sampath.html">Sampath Kannan</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>: Implicit Representation of Graphs. 334-343 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KannanNR88">BibTeX</a></font> <li><a name="FiatNSSS88" href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/s/Sch=auml=ffer:Alejandro_A=.html">Alejandro A. Schäffer</a>, <a 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>: Storing and Searching a Multikey Table (Extended Abstract). 344-353 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FiatNSSS88">BibTeX</a></font> <li><a name="LuekerM88" href="../../indices/a-tree/l/Lueker:George_S=.html">George S. Lueker</a>, <a href="../../indices/a-tree/m/Molodowitch:Mariko.html">Mariko Molodowitch</a>: More Analysis of Double Hashing. 354-359 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LuekerM88">BibTeX</a></font> <li><a name="LoeblN88" href="../../indices/a-tree/l/Loebl:Martin.html">Martin Loebl</a>, <a href="../../indices/a-tree/n/Nesetril:Jaroslav.html">Jaroslav Nesetril</a>: Linearity and Unprovability of Set Union Problem Strategies. 360-366 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LoeblN88">BibTeX</a></font> <li><a name="FiatNSS88" href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a 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>: Non-Oblivious Hashing (Extended Abstract). 367-376 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FiatNSS88">BibTeX</a></font> <li><a name="Orlin88" href="../../indices/a-tree/o/Orlin:James_B=.html">James B. Orlin</a>: A Faster Strongly Polynominal Minimum Cost Flow Algorithm. 377-387 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Orlin88">BibTeX</a></font> <li><a name="GoldbergT88" href="../../indices/a-tree/g/Goldberg:Andrew_V=.html">Andrew V. Goldberg</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Finding Minimum-Cost Circulations by Canceling Negative Cycles. 388-397 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoldbergT88">BibTeX</a></font> <li><a name="KosarajuS88" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>, <a href="../../indices/a-tree/s/Sullivan:Gregory_F=.html">Gregory F. Sullivan</a>: Detecting Cycles in Dynamic Graphs in Polynomial Time (Preliminary Version). 398-406 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KosarajuS88">BibTeX</a></font> <li><a name="GabowW88" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>, <a href="../../indices/a-tree/w/Westermann:Herbert_H=.html">Herbert H. Westermann</a>: Forests, Frames and Games: Algorithms for Matroid Sums and Applications. 407-421 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GabowW88">BibTeX</a></font> <li><a name="Vaidya88" href="../../indices/a-tree/v/Vaidya:Pravin_M=.html">Pravin M. Vaidya</a>: Geometry Helps in Matching (Extended Abstract). 422-425 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vaidya88">BibTeX</a></font> <li><a name="FraysseixPP88" href="../../indices/a-tree/f/Fraysseix:Hubert_de.html">Hubert de Fraysseix</a>, <a href="../../indices/a-tree/p/Pach:J=aacute=nos.html">János Pach</a>, <a href="../../indices/a-tree/p/Pollack:Richard.html">Richard Pollack</a>: Small Sets Supporting Fáry Embeddings of Planar Graphs. 426-433 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FraysseixPP88">BibTeX</a></font> <li><a name="FederG88" href="../../indices/a-tree/f/Feder:Tom=aacute=s.html">Tomás Feder</a>, <a href="../../indices/a-tree/g/Greene:Daniel_H=.html">Daniel H. Greene</a>: Optimal Algorithms for Approximate Clustering. 434-444 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FederG88">BibTeX</a></font> <li><a name="FortuneW88" href="../../indices/a-tree/f/Fortune:Steven.html">Steven Fortune</a>, <a href="../../indices/a-tree/w/Wilfong:Gordon_T=.html">Gordon T. Wilfong</a>: Planning Constrained Motion. 445-459 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FortuneW88">BibTeX</a></font> <li><a name="Canny88" href="../../indices/a-tree/c/Canny:John_F=.html">John F. Canny</a>: Some Algebraic and Geometric Computations in PSPACE. 460-467 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Canny88">BibTeX</a></font> <li><a name="King88" href="../../indices/a-tree/k/King:Valerie.html">Valerie King</a>: Lower Bounds on the Complexity of Graph Properties. 468-476 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/King88">BibTeX</a></font> <li><a name="CosmadakisGKV88" href="../../indices/a-tree/c/Cosmadakis:Stavros_S=.html">Stavros S. Cosmadakis</a>, <a href="../../indices/a-tree/g/Gaifman:Haim.html">Haim Gaifman</a>, <a href="../../indices/a-tree/k/Kanellakis:Paris_C=.html">Paris C. Kanellakis</a>, <a href="../../indices/a-tree/v/Vardi:Moshe_Y=.html">Moshe Y. Vardi</a>: Decidable Optimization Problems for Database Logic Programs (Preliminary Report). 477-490 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CosmadakisGKV88">BibTeX</a></font> <li><a name="Istrail88" href="../../indices/a-tree/i/Istrail:Sorin.html">Sorin Istrail</a>: Polynomial Universal Traversing Sequences for Cycles Are Constructible (Extended Abstract). 491-503 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Istrail88">BibTeX</a></font> <li><a name="PintzSS88" href="../../indices/a-tree/p/Pintz:Janos.html">Janos Pintz</a>, <a href="../../indices/a-tree/s/Steiger:William_L=.html">William L. Steiger</a>, <a href="../../indices/a-tree/s/Szemer=eacute=di:Endre.html">Endre Szemerédi</a>: Two Infinite Sets of Primes with Fast Primality Tests. 504-509 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PintzSS88">BibTeX</a></font> <li><a name="GabowT88" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems. 514-527 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GabowT88">BibTeX</a></font> <li><a name="AdlemanK88" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>, <a href="../../indices/a-tree/k/Kompella:Kireeti.html">Kireeti Kompella</a>: Using Smoothness to Achieve Parallelism (Abstract). 528-538 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AdlemanK88">BibTeX</a></font> <li><a name="KarchmerW88" href="../../indices/a-tree/k/Karchmer:Mauricio.html">Mauricio Karchmer</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Monotone Circuits for Connectivity Require Super-logarithmic Depth. 539-550 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarchmerW88">BibTeX</a></font> <li><a name="Broder88" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>: Errata to ``How hard is to marry at random? (On the approximation of the permanent)''. 551 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Broder88">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
