stoc91.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1991</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>23. <a href="index.html">STOC</a> 1991</h1> Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA. ACM 1991 <ul> <li><a name="BeigelRS91" href="../../indices/a-tree/b/Beigel:Richard.html">Richard Beigel</a>, <a href="../../indices/a-tree/r/Reingold:Nick.html">Nick Reingold</a>, <a href="../../indices/a-tree/s/Spielman:Daniel_A=.html">Daniel A. Spielman</a>: PP Is Closed Under Intersection (Extended Abstract). 1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeigelRS91">BibTeX</a></font> <li><a name="Ko91" href="../../indices/a-tree/k/Ko:Ker=I.html">Ker-I Ko</a>: Integral Equations, Systems of Quadratic Equations, and Exponential-Time Completeness (Extended Abstract). 10-20 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ko91">BibTeX</a></font> <li><a name="BabaiFLS91" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/f/Fortnow:Lance.html">Lance Fortnow</a>, <a href="../../indices/a-tree/l/Levin:Leonid_A=.html">Leonid A. Levin</a>, <a href="../../indices/a-tree/s/Szegedy:Mario.html">Mario Szegedy</a>: Checking Computations in Polylogarithmic Time. 21-31 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BabaiFLS91">BibTeX</a></font> <li><a name="GemmellLRSW91" href="../../indices/a-tree/g/Gemmell:Peter.html">Peter Gemmell</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/r/Rubinfeld:Ronitt.html">Ronitt Rubinfeld</a>, <a href="../../indices/a-tree/s/Sudan:Madhu.html">Madhu Sudan</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Self-Testing/Correcting for Polynomials and for Approximate Functions. 32-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GemmellLRSW91">BibTeX</a></font> <li><a name="BarnesR91" href="../../indices/a-tree/b/Barnes:Greg.html">Greg Barnes</a>, <a href="../../indices/a-tree/r/Ruzzo:Walter_L=.html">Walter L. Ruzzo</a>: Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract). 43-53 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BarnesR91">BibTeX</a></font> <li><a name="Kaltofen91" href="../../indices/a-tree/k/Kaltofen:Erich.html">Erich Kaltofen</a>: Effective Noether Irreducibility Forms and Applications (Extended Abstract). 54-63 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kaltofen91">BibTeX</a></font> <li><a name="Adleman91" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>: Factoring Numbers Using Singular Integers. 64-71 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Adleman91">BibTeX</a></font> <li><a name="BuchmannS91" href="../../indices/a-tree/b/Buchmann:Johannes.html">Johannes Buchmann</a>, <a href="../../indices/a-tree/s/Shoup:Victor.html">Victor Shoup</a>: Constructing Nonresidues in Finite Fields and the Extended Riemann Hypothesis. 72-79 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BuchmannS91">BibTeX</a></font> <li><a name="MenezesVO91" href="../../indices/a-tree/m/Menezes:Alfred.html">Alfred Menezes</a>, <a href="../../indices/a-tree/v/Vanstone:Scott_A=.html">Scott A. Vanstone</a>, <a href="../../indices/a-tree/o/Okamoto:Tatsuaki.html">Tatsuaki Okamoto</a>: Reducing Elliptic Curve Logarithms to Logarithms in a Finite Field. 80-89 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MenezesVO91">BibTeX</a></font> <li><a name="BabaiCFLS91" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>, <a href="../../indices/a-tree/c/Cooperman:Gene.html">Gene Cooperman</a>, <a href="../../indices/a-tree/f/Finkelstein:Larry.html">Larry Finkelstein</a>, <a href="../../indices/a-tree/l/Luks:Eugene_M=.html">Eugene M. Luks</a>, <a href="../../indices/a-tree/s/Seress:=Aacute=kos.html">Ákos Seress</a>: Fast Monte Carlo Algorithms for Permutation Groups. 90-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BabaiCFLS91">BibTeX</a></font> <li><a name="LeightonMPSTT91" href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/m/Makedon:Fillia.html">Fillia Makedon</a>, <a href="../../indices/a-tree/p/Plotkin:Serge_A=.html">Serge A. Plotkin</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>, <a href="../../indices/a-tree/t/Tragoudas:Spyros.html">Spyros Tragoudas</a>: Fast Approximation Algorithms for Multicommodity Flow Problems. 101-111 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LeightonMPSTT91">BibTeX</a></font> <li><a name="Gabow91" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>: A Matroid Approach to Finding Edge Connectivity and Packing Arborescences. 112-122 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Gabow91">BibTeX</a></font> <li><a name="FederM91" href="../../indices/a-tree/f/Feder:Tom=aacute=s.html">Tomás Feder</a>, <a href="../../indices/a-tree/m/Motwani:Rajeev.html">Rajeev Motwani</a>: Clique Partitions, Graph Compression, and Speeding-Up Algorithms. 123-133 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FederM91">BibTeX</a></font> <li><a name="AgrawalKR91" href="../../indices/a-tree/a/Agrawal:Ajit.html">Ajit Agrawal</a>, <a href="../../indices/a-tree/k/Klein:Philip_N=.html">Philip N. Klein</a>, <a href="../../indices/a-tree/r/Ravi:R=.html">R. Ravi</a>: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks. 134-144 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AgrawalKR91">BibTeX</a></font> <li><a name="CohenM91" href="../../indices/a-tree/c/Cohen:Edith.html">Edith Cohen</a>, <a href="../../indices/a-tree/m/Megiddo:Nimrod.html">Nimrod Megiddo</a>: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). 145-155 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CohenM91">BibTeX</a></font> <li><a name="ApplegateK91" href="../../indices/a-tree/a/Applegate:David.html">David Applegate</a>, <a href="../../indices/a-tree/k/Kannan:Ravi.html">Ravi Kannan</a>: Sampling and Integration of Near Log-Concave functions. 156-163 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ApplegateK91">BibTeX</a></font> <li><a name="Babai91" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">László Babai</a>: Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups. 164-174 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Babai91">BibTeX</a></font> <li><a name="BrightwellW91" href="../../indices/a-tree/b/Brightwell:Graham.html">Graham Brightwell</a>, <a href="../../indices/a-tree/w/Winkler:Peter.html">Peter Winkler</a>: Counting Linear Extensions is \#P-Complete. 175-181 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BrightwellW91">BibTeX</a></font> <li><a name="BroderFS91" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/f/Frieze:Alan_M=.html">Alan M. Frieze</a>, <a href="../../indices/a-tree/s/Shamir:Eli.html">Eli Shamir</a>: Finding Hidden Hamiltonian Cycles (Extended Abstract). 182-189 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BroderFS91">BibTeX</a></font> <li><a name="Karp91" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>: Probabilistic Recurrence Relations. 190-197 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Karp91">BibTeX</a></font> <li><a name="Shapiro91" href="../../indices/a-tree/s/Shapiro:Ehud_Y=.html">Ehud Y. Shapiro</a>: Separating Concurrent Languages with Categories of Language Embeddings (Extended Abstract). 198-208 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Shapiro91">BibTeX</a></font> <li><a name="AbiteboulV91" href="../../indices/a-tree/a/Abiteboul:Serge.html">Serge Abiteboul</a>, <a href="../../indices/a-tree/v/Vianu:Victor.html">Victor Vianu</a>: Generic Computation and Its Complexity. 209-219 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AbiteboulV91">BibTeX</a></font> <li><a name="Harel91" href="../../indices/a-tree/h/Harel:David.html">David Harel</a>: Hamiltonian Paths in Infinite Graphs. 220-229 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Harel91">BibTeX</a></font> <li><a name="CoffmanCGJMSWY91" href="../../indices/a-tree/c/Coffman_Jr=:Edward_G=.html">Edward G. Coffman Jr.</a>, <a href="../../indices/a-tree/c/Courcoubetis:Costas.html">Costas Courcoubetis</a>, <a href="../../indices/a-tree/g/Garey:M=_R=.html">M. R. Garey</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/m/McGeoch:Lyle_A=.html">Lyle A. McGeoch</a>, <a href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>, <a href="../../indices/a-tree/w/Weber:Richard_R=.html">Richard R. Weber</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study. 230-240 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CoffmanCGJMSWY91">BibTeX</a></font> <li><a name="CoffmanG91" href="../../indices/a-tree/c/Coffman_Jr=:Edward_G=.html">Edward G. Coffman Jr.</a>, <a href="../../indices/a-tree/g/Garey:M=_R=.html">M. R. Garey</a>: Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling. 241-248 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CoffmanG91">BibTeX</a></font> <li><a name="BorodinIRS91" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/i/Irani:Sandy.html">Sandy Irani</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>: Competitive Paging with Locality of Reference (Preliminary Version). 249-259 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BorodinIRS91">BibTeX</a></font> <li><a name="Grove91" href="../../indices/a-tree/g/Grove:Edward_F=.html">Edward F. Grove</a>: The Harmonic Online K-Server Algorithm Is Competitive. 260-266 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Grove91">BibTeX</a></font> <li><a name="Kahan91" href="../../indices/a-tree/k/Kahan:Simon.html">Simon Kahan</a>: A Model for Data in Motion. 267-277 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kahan91">BibTeX</a></font> <li><a name="KarloffRR91" href="../../indices/a-tree/k/Karloff:Howard_J=.html">Howard J. Karloff</a>, <a href="../../indices/a-tree/r/Rabani:Yuval.html">Yuval Rabani</a>, <a href="../../indices/a-tree/r/Ravid:Yiftach.html">Yiftach Ravid</a>: Lower Bounds for Randomized k-Server and Motion Planning Algorithms. 278-288 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarloffRR91">BibTeX</a></font> <li><a name="DengM91" href="../../indices/a-tree/d/Deng:Xiaotie.html">Xiaotie Deng</a>, <a href="../../indices/a-tree/m/Mahajan:Sanjeev.html">Sanjeev Mahajan</a>: Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version). 289-298 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DengM91">BibTeX</a></font> <li><a name="Hagerup91" href="../../indices/a-tree/h/Hagerup:Torben.html">Torben Hagerup</a>: Constant-Time Parallel Integer Sorting (Extended Abstract). 299-306 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hagerup91">BibTeX</a></font> <li><a name="MatiasV91" href="../../indices/a-tree/m/Matias:Yossi.html">Yossi Matias</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>: Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract). 307-316 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MatiasV91">BibTeX</a></font> <li><a name="GalilI91" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/i/Italiano:Giuseppe_F=.html">Giuseppe F. Italiano</a>: Fully Dynamic Algorithms for Edge-Connectivity Problems (Extended Abstract). 317-327 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GalilI91">BibTeX</a></font> <li><a name="BlumJLTY91" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/j/Jiang:Tao.html">Tao Jiang</a>, <a href="../../indices/a-tree/l/Li:Ming.html">Ming Li</a>, <a href="../../indices/a-tree/t/Tromp:John.html">John Tromp</a>, <a href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>: Linear Approximation of Shortest Superstrings. 328-336 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumJLTY91">BibTeX</a></font> <li><a name="DjidjevR91" href="../../indices/a-tree/d/Djidjev:Hristo.html">Hristo Djidjev</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: An Efficient Algorithm for the Genus Problem with Explicit Construction of Forbidden Subgraphs. 337-347 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DjidjevR91">BibTeX</a></font> <li><a name="AspnesHS91" href="../../indices/a-tree/a/Aspnes:James.html">James Aspnes</a>, <a href="../../indices/a-tree/h/Herlihy:Maurice.html">Maurice Herlihy</a>, <a href="../../indices/a-tree/s/Shavit:Nir.html">Nir Shavit</a>: Counting Networks and Multi-Processor Coordination. 348-358 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AspnesHS91">BibTeX</a></font> <li><a name="AttiyaDLS91" href="../../indices/a-tree/a/Attiya:Hagit.html">Hagit Attiya</a>, <a href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. 359-369 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AttiyaDLS91">BibTeX</a></font> <li><a name="AndersonW91" href="../../indices/a-tree/a/Anderson:Richard_J=.html">Richard J. Anderson</a>, <a href="../../indices/a-tree/w/Woll:Heather.html">Heather Woll</a>: Wait-free Parallel Algorithms for the Union-Find Problem. 370-380 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AndersonW91">BibTeX</a></font> <li><a name="KedemPRS91" 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/r/Raghunathan:A=.html">A. Raghunathan</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>: Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract). 381-390 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KedemPRS91">BibTeX</a></font> <li><a name="CheriyanT91" href="../../indices/a-tree/c/Cheriyan:Joseph.html">Joseph Cheriyan</a>, <a href="../../indices/a-tree/t/Thurimella:Ramakrishna.html">Ramakrishna Thurimella</a>: Algorithms for Parallel k-Vertex Connectivity and Sparse Certificates (Extended Abstract). 391-401 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CheriyanT91">BibTeX</a></font> <li><a name="AspnesBFR91" href="../../indices/a-tree/a/Aspnes:James.html">James Aspnes</a>, <a href="../../indices/a-tree/b/Beigel:Richard.html">Richard Beigel</a>, <a href="../../indices/a-tree/f/Furst:Merrick_L=.html">Merrick L. Furst</a>, <a href="../../indices/a-tree/r/Rudich:Steven.html">Steven Rudich</a>: The Expressive Power of Voting Polynomials. 402-409 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AspnesBFR91">BibTeX</a></font> <li><a name="Nisan91" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>: Lower Bounds for Non-Commutative Computation (Extended Abstract). 410-418 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Nisan91">BibTeX</a></font> <li><a name="NisanW91" href="../../indices/a-tree/n/Nisan:Noam.html">Noam Nisan</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>: Rounds in Communication Complexity Revisited. 419-429 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NisanW91">BibTeX</a></font> <li><a name="LubyV91" href="../../indices/a-tree/l/Luby:Michael.html">Michael Luby</a>, <a href="../../indices/a-tree/v/Velickovic:Boban.html">Boban Velickovic</a>: On Deterministic Approximation of DNF. 430-438 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LubyV91">BibTeX</a></font> <li><a name="BreslauerG91" href="../../indices/a-tree/b/Breslauer:Dany.html">Dany Breslauer</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: A Lower Bound for Parallel String Matching. 439-443 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BreslauerG91">BibTeX</a></font> <li><a name="AngluinK91" href="../../indices/a-tree/a/Angluin:Dana.html">Dana Angluin</a>, <a href="../../indices/a-tree/k/Kharitonov:Michael.html">Michael Kharitonov</a>: When Won't Membership Queries Help? (Extended Abstract). 444-454 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AngluinK91">BibTeX</a></font> <li><a name="KushilevitzM91" href="../../indices/a-tree/k/Kushilevitz:Eyal.html">Eyal Kushilevitz</a>, <a href="../../indices/a-tree/m/Mansour:Yishay.html">Yishay Mansour</a>: Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract). 455-464 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KushilevitzM91">BibTeX</a></font> <li><a name="LittlestoneLW91" href="../../indices/a-tree/l/Littlestone:Nick.html">Nick Littlestone</a>, <a href="../../indices/a-tree/l/Long:Philip_M=.html">Philip M. Long</a>, <a href="../../indices/a-tree/w/Warmuth:Manfred_K=.html">Manfred K. Warmuth</a>: On-Line Learning of Linear Functions. 465-475 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LittlestoneLW91">BibTeX</a></font> <li><a name="YannakakisL91" href="../../indices/a-tree/y/Yannakakis:Mihalis.html">Mihalis Yannakakis</a>, <a href="../../indices/a-tree/l/Lee:David.html">David Lee</a>: Testing Finite State Machines (Extended Abstract). 476-485 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/YannakakisL91">BibTeX</a></font> <li><a name="AslamD91" href="../../indices/a-tree/a/Aslam:Javed_A=.html">Javed A. Aslam</a>, <a href="../../indices/a-tree/d/Dhagat:Aditi.html">Aditi Dhagat</a>: Searching in the Presence of Linearly Bounded Errors (Extended Abstract). 486-493 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AslamD91">BibTeX</a></font> <li><a name="BlumRS91" href="../../indices/a-tree/b/Blum:Avrim.html">Avrim Blum</a>, <a href="../../indices/a-tree/r/Raghavan:Prabhakar.html">Prabhakar Raghavan</a>, <a href="../../indices/a-tree/s/Schieber:Baruch.html">Baruch Schieber</a>: Navigating in Unfamiliar Geometric Terrain (Preliminary Version). 494-504 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumRS91">BibTeX</a></font> <li><a name="Matousek91" href="../../indices/a-tree/m/Matousek:Jir=iacute=.html">Jirí Matousek</a>: Approximations and Optimal Geometric Divide-And-Conquer. 505-511 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Matousek91">BibTeX</a></font> <li><a name="Mulmuley91" href="../../indices/a-tree/m/Mulmuley:Ketan.html">Ketan Mulmuley</a>: Hidden Surface Removal with Respect to a Moving View Point. 512-522 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Mulmuley91">BibTeX</a></font> <li><a name="GoodrichT91" href="../../indices/a-tree/g/Goodrich:Michael_T=.html">Michael T. Goodrich</a>, <a href="../../indices/a-tree/t/Tamassia:Roberto.html">Roberto Tamassia</a>: Dynamic Trees and Dynamic Point Location (Preliminary Version). 523-533 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GoodrichT91">BibTeX</a></font> <li><a name="FiatN91" href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: Rigorous Time/Space Tradeoffs for Inverting Functions. 534-541 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FiatN91">BibTeX</a></font> <li><a name="DolevDN91" href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>, <a href="../../indices/a-tree/d/Dwork:Cynthia.html">Cynthia Dwork</a>, <a href="../../indices/a-tree/n/Naor:Moni.html">Moni Naor</a>: Non-Malleable Cryptography (Extended Abstract). 542-552 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DolevDN91">BibTeX</a></font> <li><a name="Kilian91" href="../../indices/a-tree/k/Kilian:Joe.html">Joe Kilian</a>: A General Completeness Theorem for Two-Party Games. 553-560 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kilian91">BibTeX</a></font> <li><a name="Maurer91" href="../../indices/a-tree/m/Maurer:Ueli_M=.html">Ueli M. Maurer</a>: Perfect Cryptographic Security from Partially Independent Channels. 561-571 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Maurer91">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:11 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
