stoc90.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1990</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>22. <a href="index.html">STOC</a> 1990</h1> Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA. ACM 1990 <ul> <li><a name="FredmanW90" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>, <a href="../../indices/a-tree/w/Willard:Dan_E=.html">Dan E. Willard</a>: BLASTING through the Information Theoretic Barrier with FUSION TREES. 1-7 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FredmanW90">BibTeX</a></font> <li><a name="Cole90" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>: On the Dynamic Finger Conjecture for Splay Trees (Extended Abstract). 8-17 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cole90">BibTeX</a></font> <li><a name="SundarT90" href="../../indices/a-tree/s/Sundar:Rajamani.html">Rajamani Sundar</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Unique Binary Search Tree Representations and Equality-testing of Sets and Sequences. 18-25 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SundarT90">BibTeX</a></font> <li><a name="Frederickson90" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>: The Information Theory Bound Is Tight for Selection in a Heap. 26-33 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Frederickson90">BibTeX</a></font> <li><a name="Poutre90" href="../../indices/a-tree/p/Poutr=eacute=:Johannes_A=_La.html">Johannes A. La Poutré</a>: Lower Bounds for the Union-Find and the Split-Find Problem on Pointer Machines. 34-44 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Poutre90">BibTeX</a></font> <li><a name="GoddardKS90" href="../../indices/a-tree/g/Goddard:Wayne.html">Wayne Goddard</a>, <a href="../../indices/a-tree/k/King:Valerie.html">Valerie King</a>, <a href="../../indices/a-tree/s/Schulman:Leonard_J=.html">Leonard J. Schulman</a>: Optimal Randomized Algorithms for Local Sorting and Set-Maxima. 45-53 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoddardKS90">BibTeX</a></font> <li><a name="BoardP90" href="../../indices/a-tree/b/Board:Raymond_A=.html">Raymond A. Board</a>, <a href="../../indices/a-tree/p/Pitt:Leonard.html">Leonard Pitt</a>: On the Necessity of Occam Algorithms. 54-63 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BoardP90">BibTeX</a></font> <li><a name="Blum90" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>: Learning Boolean Functions in an Infinite Atribute Space (Extended Abstract). 64-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Blum90">BibTeX</a></font> <li><a name="BlumLR90" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>: Self-Testing/Correcting with Applications to Numerical Problems. 73-83 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumLR90">BibTeX</a></font> <li><a name="Yao90" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Coherent Functions and Program Checkers (Extended Abstract). 84-94 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao90">BibTeX</a></font> <li><a name="EvenR90" href="../../indices/a-tree/e/Even:Shimon.html">Shimon Even</a>, <a href="../../indices/a-tree/r/Rajsbaum:Sergio.html">Sergio Rajsbaum</a>: The Use of a Synchronizer Yields Maximum Computation Rate in Distributed Networks (Extended Abstract). 95-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EvenR90">BibTeX</a></font> <li><a name="FischerMRT90" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/m/Moran:Shlomo.html">Shlomo Moran</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>, <a href="../../indices/a-tree/t/Taubenfeld:Gadi.html">Gadi Taubenfeld</a>: The Wakeup Problem (Extended Abstract). 106-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FischerMRT90">BibTeX</a></font> <li><a name="DietzfelbingerH90" href="../../indices/a-tree/d/Dietzfelbinger:Martin.html">Martin Dietzfelbinger</a>, <a href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>: How to Distribute a Dictionary in a Complete Network. 117-127 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DietzfelbingerH90">BibTeX</a></font> <li><a name="FeigePRU90" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/p/Peleg:David.html">David Peleg</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>: Computing with Unreliable Information (Preliminary Version). 128-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeigePRU90">BibTeX</a></font> <li><a name="KedemPS90" href="../../indices/a-tree/k/Kedem:Zvi_M=.html">Zvi M. Kedem</a>, <a href="../../indices/a-tree/p/Palem:Krishna_V=.html">Krishna V. Palem</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>: Efficient Robust Parallel Computations (Extended Abstract). 138-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KedemPS90">BibTeX</a></font> <li><a name="AroraLM90" href="../../indices/a-tree/a/Arora:Sanjeev.html">Sanjeev Arora</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>: On-line Algorithms for Path Selection in a Nonblocking Network (Extended Abstract). 149-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AroraLM90">BibTeX</a></font> <li><a name="VitterS90" href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>, <a href="../../indices/a-tree/s/Shriver:Elizabeth_A=_M=.html">Elizabeth A. M. Shriver</a>: Optimal Disk I/O with Parallel Block Transfer (Extended Abstract). 159-169 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/VitterS90">BibTeX</a></font> <li><a name="Vishkin90" href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Deterministic Sampling-A New Technique for Fast Pattern Matching. 170-180 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vishkin90">BibTeX</a></font> <li><a name="KaoK90" href="../../indices/a-tree/k/Kao:Ming=Yang.html">Ming-Yang Kao</a>, <a href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>: Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs. 181-192 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KaoK90">BibTeX</a></font> <li><a name="CypherP90" href="../../indices/a-tree/c/Cypher:Robert.html">Robert Cypher</a>, <a href="../../indices/a-tree/p/Plaxton:C=_Greg.html">C. Greg Plaxton</a>: Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers. 193-203 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CypherP90">BibTeX</a></font> <li><a name="Nisan90" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>: Psuedorandom Generators for Space-Bounded Computation. 204-212 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Nisan90">BibTeX</a></font> <li><a name="NaorN90" href="../../indices/a-tree/n/Naor:Joseph.html">Joseph Naor</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: Small-bias Probability Spaces: Efficient Constructions and Applications. 213-223 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NaorN90">BibTeX</a></font> <li><a name="SchmidtS90" 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>: The Analysis of Closed Hashing under Limited Randomness (Extended Abstract). 224-234 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SchmidtS90">BibTeX</a></font> <li><a name="MansourNT90" href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/t/Tiwari:Prasoon.html">Prasoon Tiwari</a>: The Computational Complexity of Universal Hashing. 235-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MansourNT90">BibTeX</a></font> <li><a name="GilHW90" href="../../indices/a-tree/g/Gil:Joseph.html">Joseph Gil</a>, <a href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Not All Keys Can Be Hashed in Constant Time (Preliminary Version). 244-253 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GilHW90">BibTeX</a></font> <li><a name="Zuckerman90" href="../../indices/a-tree/z/Zuckerman:David.html">David Zuckerman</a>: A Technique for Lower Bounding the Cover Time. 254-259 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Zuckerman90">BibTeX</a></font> <li><a name="LinialN90" href="../../indices/a-tree/l/Linial:Nathan.html">Nathan Linial</a>, <a href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>: Approximate Inclusion-Exclusion. 260-270 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LinialN90">BibTeX</a></font> <li><a name="Cleve90" href="../../indices/a-tree/c/Cleve:Richard.html">Richard Cleve</a>: Towards Optimal Simulations of Formulas by Bounded-Width Programs. 271-277 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cleve90">BibTeX</a></font> <li><a name="Szegedy90" href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: Functions with Bounded Symmetric Communication Complexity and Circuits with \mathop mod m Gates. 278-286 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Szegedy90">BibTeX</a></font> <li><a name="RazW90" href="../../indices/a-tree/r/Raz:Ran.html">Ran Raz</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Monotone Circuits for Matching Require Linear Depth. 287-292 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RazW90">BibTeX</a></font> <li><a name="AlonST90" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/s/Seymour:Paul_D=.html">Paul D. Seymour</a>, <a href="../../indices/a-tree/t/Thomas:Robin.html">Robin Thomas</a>: A Separator Theorem for Graphs with an Excluded Minor and its Applications. 293-299 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AlonST90">BibTeX</a></font> <li><a name="MillerT90" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/t/Thurston:William_P=.html">William P. Thurston</a>: Separators in Two and Three Dimensions. 300-309 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MillerT90">BibTeX</a></font> <li><a name="KleinST90" href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/s/Stein:Clifford.html">Clifford Stein</a>, <a href="../../indices/a-tree/t/Tardos:=Eacute=va.html">Éva Tardos</a>: Leighton-Rao Might Be Practical: Faster Approximation Algorithms for Concurrent Flow with Uniform Capacities. 310-321 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KleinST90">BibTeX</a></font> <li><a name="Mulmuley90" href="../../indices/a-tree/m/Mulmuley:Ketan.html">Ketan Mulmuley</a>: Output Sensitive Construction of Levels and Voronoi Diagrams in R^d of Order 1 to k. 322-330 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Mulmuley90">BibTeX</a></font> <li><a name="AggarwalHL90" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>, <a href="../../indices/a-tree/h/Hansen:Mark.html">Mark Hansen</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>: Solving Query-Retrieval Problems by Compacting Voronoi Diagrams (Extended Abstract). 331-340 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AggarwalHL90">BibTeX</a></font> <li><a name="KirkpatrickMY90" href="../../indices/a-tree/k/Kirkpatrick:David_G=.html">David G. Kirkpatrick</a>, <a href="../../indices/a-tree/m/Mishra:Bhubaneswar.html">Bhubaneswar Mishra</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: Quantitative Steinitz's Theorems with Applications to Multifingered Grasping. 341-351 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KirkpatrickMY90">BibTeX</a></font> <li><a name="KarpVV90" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>, <a href="../../indices/a-tree/v/Vazirani:Vijay_V=.html">Vijay V. Vazirani</a>: An Optimal Algorithm for On-line Bipartite Matching. 352-358 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpVV90">BibTeX</a></font> <li><a name="BernGRS90" href="../../indices/a-tree/b/Bern:Marshall_W=.html">Marshall W. Bern</a>, <a href="../../indices/a-tree/g/Greene:Daniel_H=.html">Daniel H. Greene</a>, <a href="../../indices/a-tree/r/Raghunathan:Arvind.html">Arvind Raghunathan</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>: Online Algorithms for Locating Checkpoints. 359-368 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BernGRS90">BibTeX</a></font> <li><a name="CoppersmithDRS90" href="../../indices/a-tree/c/Coppersmith:Don.html">Don Coppersmith</a>, <a href="../../indices/a-tree/d/Doyle:Peter.html">Peter Doyle</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/s/Snir:Marc.html">Marc Snir</a>: Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version). 369-378 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CoppersmithDRS90">BibTeX</a></font> <li><a name="Ben-DavidBKTW90" href="../../indices/a-tree/b/Ben=David:Shai.html">Shai Ben-David</a>, <a href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/t/Tardos:G=aacute=bor.html">Gábor Tardos</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: On the Power of Randomization in Online Algorithms (Extended Abstract). 379-386 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ben-DavidBKTW90">BibTeX</a></font> <li><a name="Rompel90" href="../../indices/a-tree/r/Rompel:John.html">John Rompel</a>: One-Way Functions are Necessary and Sufficient for Secure Signatures. 387-394 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rompel90">BibTeX</a></font> <li><a name="Hastad90" href="../../indices/a-tree/h/H=aring=stad:Johan.html">Johan Håstad</a>: Pseudo-Random Generators under Uniform Assumptions. 395-404 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hastad90">BibTeX</a></font> <li><a name="SchriftS90" href="../../indices/a-tree/s/Schrift:A=_W=.html">A. W. Schrift</a>, <a href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>: The Discrete Log is Very Discreet. 405-415 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SchriftS90">BibTeX</a></font> <li><a name="FeigeS90" href="../../indices/a-tree/f/Feige:Uriel.html">Uriel Feige</a>, <a href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>: Witness Indistinguishable and Witness Hiding Protocols. 416-426 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FeigeS90">BibTeX</a></font> <li><a name="NaorY90" href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>, <a href="../../indices/a-tree/y/Yung:Moti.html">Moti Yung</a>: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. 427-437 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NaorY90">BibTeX</a></font> <li><a name="PapadimitriouSY90" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/s/Sch=auml=ffer:Alejandro_A=.html">Alejandro A. Schäffer</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: On the Complexity of Local Search (Extended Abstract). 438-445 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PapadimitriouSY90">BibTeX</a></font> <li><a name="PanconesiR90" href="../../indices/a-tree/p/Panconesi:Alessandro.html">Alessandro Panconesi</a>, <a href="../../indices/a-tree/r/Ranjan:Desh.html">Desh Ranjan</a>: Quantifiers and Approximation (Extended Abstract). 446-456 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PanconesiR90">BibTeX</a></font> <li><a name="OgiwaraW90" href="../../indices/a-tree/o/Ogiwara:Mitsunori.html">Mitsunori Ogiwara</a>, <a href="../../indices/a-tree/w/Watanabe:Osamu.html">Osamu Watanabe</a>: On Polynomial Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets. 457-467 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/OgiwaraW90">BibTeX</a></font> <li><a name="KfouryTU90" href="../../indices/a-tree/k/Kfoury:A=_J=.html">A. J. Kfoury</a>, <a href="../../indices/a-tree/t/Tiuryn:Jerzy.html">Jerzy Tiuryn</a>, <a href="../../indices/a-tree/u/Urzyczyn:Pawel.html">Pawel Urzyczyn</a>: The Undecidability of the Semi-Unification Problem (Preliminary Report). 468-476 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KfouryTU90">BibTeX</a></font> <li><a name="HarjuK90" href="../../indices/a-tree/h/Harju:Tero.html">Tero Harju</a>, <a href="../../indices/a-tree/k/Karhum=auml=ki:Juhani.html">Juhani Karhumäki</a>: Decidability of the Multiplicity Equivalence of Multitape Finite Automata. 477-481 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HarjuK90">BibTeX</a></font> <li><a name="BellareMO90" href="../../indices/a-tree/b/Bellare:Mihir.html">Mihir Bellare</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>: Perfect Zero-Knowledge in Constant Rounds. 482-493 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BellareMO90">BibTeX</a></font> <li><a name="BeaverMR90" href="../../indices/a-tree/b/Beaver:Donald.html">Donald Beaver</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/r/Rogaway:Phillip.html">Phillip Rogaway</a>: The Round Complexity of Secure Protocols (Extended Abstract). 503-513 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeaverMR90">BibTeX</a></font> <li><a name="Ostrovsky90" href="../../indices/a-tree/o/Ostrovsky:Rafail.html">Rafail Ostrovsky</a>: Efficient Computation on Oblivious RAMs. 514-523 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ostrovsky90">BibTeX</a></font> <li><a name="KantorL90" href="../../indices/a-tree/k/Kantor:William_M=.html">William M. Kantor</a>, <a href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>: Computing in Quotient Groups. 524-534 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KantorL90">BibTeX</a></font> <li><a name="BorodinT90" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/t/Tiwari:Prasoon.html">Prasoon Tiwari</a>: On the Decidability of Sparse Univariate Polynomial Interpolation (Preliminary Version). 535-545 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BorodinT90">BibTeX</a></font> <li><a name="Shoup90" href="../../indices/a-tree/s/Shoup:Victor.html">Victor Shoup</a>: Searching for Primitive Roots in Finite Fields. 546-554 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Shoup90">BibTeX</a></font> <li><a name="Lakshman90" href="../../indices/a-tree/l/Lakshman:Yagati_N=.html">Yagati N. Lakshman</a>: On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal. 555-563 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lakshman90">BibTeX</a></font> <li><a name="LenstraLMP90" href="../../indices/a-tree/l/Lenstra:Arjen_K=.html">Arjen K. Lenstra</a>, <a href="../../indices/a-tree/l/Lenstra_Jr=:Hendrik_W=.html">Hendrik W. Lenstra Jr.</a>, <a href="../../indices/a-tree/m/Manasse:Mark_S=.html">Mark S. Manasse</a>, <a href="../../indices/a-tree/p/Pollard:John_M=.html">John M. Pollard</a>: The Number Field Sieve. 564-572 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LenstraLMP90">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
