Personal tools
You are here: Home dblp db conf focs focs84.html

focs84.html

Click here to view the file or click here to download the file

Size 21.0 kB - File type text/html

File contents

<html><head><title>25. FOCS 1984:
West Palm Beach,
Florida</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>25. <a href="index.html">FOCS</a> 1984:
West Palm Beach,
Florida</h1>
25th Annual Symposium on Foundations of Computer Science,
West Palm Beach, Florida, 24-26 October 1984. IEEE Computer Society 
<ul>
<li><a name="BeameCH84" href="../../indices/a-tree/b/Beame:Paul.html">Paul Beame</a>, <a href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>, <a href="../../indices/a-tree/h/Hoover:H=_James.html">H. James Hoover</a>:
Log Depth Circuits for Division and Related Problems.
1-6 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeameCH84">BibTeX</a></font>

<li><a name="KannanMR84" href="../../indices/a-tree/k/Kannan:Ravindran.html">Ravindran Kannan</a>, <a href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/r/Rudolph:Larry.html">Larry Rudolph</a>:
Sublinear Parallel Algorithm for Computing the Greatest Common Divisor of Two Integers.
7-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KannanMR84">BibTeX</a></font>

<li><a name="TarjanV84" href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>, <a href="../../indices/a-tree/v/Vishkin:Uzi.html">Uzi Vishkin</a>:
Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary).
12-20 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TarjanV84">BibTeX</a></font>

<li><a name="Eberly84" href="../../indices/a-tree/e/Eberly:Wayne.html">Wayne Eberly</a>:
Very Fast Parallel Matrix and Polynomial Arithmetic.
21-30 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Eberly84">BibTeX</a></font>

<li><a name="Gathen84" href="../../indices/a-tree/g/Gathen:Joachim_von_zur.html">Joachim von zur Gathen</a>:
Parallel Powering.
31-36 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gathen84">BibTeX</a></font>

<li><a name="FiatS84" href="../../indices/a-tree/f/Fiat:Amos.html">Amos Fiat</a>, <a href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>:
Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers.
37-45 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FiatS84">BibTeX</a></font>

<li><a name="IbarraPK84" href="../../indices/a-tree/i/Ibarra:Oscar_H=.html">Oscar H. Ibarra</a>, <a href="../../indices/a-tree/p/Palis:Michael_A=.html">Michael A. Palis</a>, <a href="../../indices/a-tree/k/Kim:Sam_M=.html">Sam M. Kim</a>:
Designing Systolic Algorithms Using Sequential Machines.
46-55 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/IbarraPK84">BibTeX</a></font>

<li><a name="HeideR84" href="../../indices/a-tree/h/Heide:Friedhelm_Meyer_auf_der.html">Friedhelm Meyer auf der Heide</a>, <a href="../../indices/a-tree/r/Reischuk:R=uuml=diger.html">R&uuml;diger Reischuk</a>:
On the Limits to Speed Up Parallel Machines by Large Hardware and Unbounded Communication.
56-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HeideR84">BibTeX</a></font>

<li><a name="ColeS84" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>, <a href="../../indices/a-tree/s/Siegel:Alan.html">Alan Siegel</a>:
River Routing Every Which Way, but Loose (Extended Abstract).
65-73 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ColeS84">BibTeX</a></font>

<li><a name="Heath84" href="../../indices/a-tree/h/Heath:Lenwood_S=.html">Lenwood S. Heath</a>:
Embedding Planar Graphs in Seven Pages.
74-83 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Heath84">BibTeX</a></font>

<li><a name="PapadimitriouU84" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>:
A Communication-Time Tradeoff.
84-88 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PapadimitriouU84">BibTeX</a></font>

<li><a name="Aggarwal84" href="../../indices/a-tree/a/Aggarwal:Alok.html">Alok Aggarwal</a>:
A Comparative Study of X-Tree, Pyramid and Related Machines.
89-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Aggarwal84">BibTeX</a></font>

<li><a name="GamalO84" href="../../indices/a-tree/g/Gamal:Abbas_El.html">Abbas El Gamal</a>, <a href="../../indices/a-tree/o/Orlitsky:Alon.html">Alon Orlitsky</a>:
Interactive Data Comparison.
100-108 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GamalO84">BibTeX</a></font>

<li><a name="Tiwari84" href="../../indices/a-tree/t/Tiwari:Prasoon.html">Prasoon Tiwari</a>:
Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version).
109-117 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Tiwari84">BibTeX</a></font>

<li><a name="PaturiS84" href="../../indices/a-tree/p/Paturi:Ramamohan.html">Ramamohan Paturi</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>:
Probabilistic Communication Complexity (Preliminary Version).
118-126 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PaturiS84">BibTeX</a></font>

<li><a name="Pippenger84" href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>:
Parallel Communication with Limited Buffers (Preliminary Version).
127-136 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pippenger84">BibTeX</a></font>

<li><a name="ItaiR84" href="../../indices/a-tree/i/Itai:Alon.html">Alon Itai</a>, <a href="../../indices/a-tree/r/Rodeh:Michael.html">Michael Rodeh</a>:
The Multi-Tree Approach to Reliability in Distributed Networks.
137-147 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ItaiR84">BibTeX</a></font>

<li><a name="Sullivan84" href="../../indices/a-tree/s/Sullivan:Gregory_F=.html">Gregory F. Sullivan</a>:
A Polynomial Time Algorithm for Fault Diagnosability.
148-156 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sullivan84">BibTeX</a></font>

<li><a name="BroderD84" href="../../indices/a-tree/b/Broder:Andrei_Z=.html">Andrei Z. Broder</a>, <a href="../../indices/a-tree/d/Dolev:Danny.html">Danny Dolev</a>:
Flipping coins in many pockets (Byzantine agreement on uniformly random values).
157-170 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BroderD84">BibTeX</a></font>

<li><a name="UpfalW84" href="../../indices/a-tree/u/Upfal:Eli.html">Eli Upfal</a>, <a href="../../indices/a-tree/w/Wigderson:Avi.html">Avi Wigderson</a>:
How to Share Memory in a Distributed System (A Preliminary Version).
171-180 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/UpfalW84">BibTeX</a></font>

<li><a name="BuiCLS84" href="../../indices/a-tree/b/Bui:Thang_Nguyen.html">Thang Nguyen Bui</a>, <a href="../../indices/a-tree/c/Chaudhuri:Soma.html">Soma Chaudhuri</a>, <a href="../../indices/a-tree/l/Leighton:Frank_Thomson.html">Frank Thomson Leighton</a>, <a href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>:
Graph Bisection Algorithms with Good Average Case Behavior.
181-192 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BuiCLS84">BibTeX</a></font>

<li><a name="Shor84" href="../../indices/a-tree/s/Shor:Peter_W=.html">Peter W. Shor</a>:
The Average-Case Analysis of Some On-Line Algorithms for Bin Packing.
193-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Shor84">BibTeX</a></font>

<li><a name="Komlos84" href="../../indices/a-tree/k/Koml=oacute=s:J=aacute=nos.html">J&aacute;nos Koml&oacute;s</a>:
Linear Verification for Spanning Trees.
201-206 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Komlos84">BibTeX</a></font>

<li><a name="Mishra84" href="../../indices/a-tree/m/Mishra:Bhubaneswar.html">Bhubaneswar Mishra</a>:
An Efficient Algorithm to Find all `Bidirectional' Edges of an Undirected Graph.
207-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mishra84">BibTeX</a></font>

<li><a name="StallmannG84" href="../../indices/a-tree/s/Stallmann:Matthias_F=_M=.html">Matthias F. M. Stallmann</a>, <a href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>:
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids.
217-228 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/StallmannG84">BibTeX</a></font>

<li><a name="BabaiS84" href="../../indices/a-tree/b/Babai:L=aacute=szl=oacute=.html">L&aacute;szl&oacute; Babai</a>, <a href="../../indices/a-tree/s/Szemer=eacute=di:Endre.html">Endre Szemer&eacute;di</a>:
On the Complexity of Matrix Group Problems I.
229-240 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BabaiS84">BibTeX</a></font>

<li><a name="KornhauserMS84" href="../../indices/a-tree/k/Kornhauser:Daniel.html">Daniel Kornhauser</a>, <a href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>:
Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications.
241-250 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KornhauserMS84">BibTeX</a></font>

<li><a name="Kaminski84" href="../../indices/a-tree/k/Kaminski:Michael.html">Michael Kaminski</a>:
Mulltiplication of Polynomials over the Ring of Integers.
251-254 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kaminski84">BibTeX</a></font>

<li><a name="Cole84" href="../../indices/a-tree/c/Cole:Richard.html">Richard Cole</a>:
Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms.
255-260 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cole84">BibTeX</a></font>

<li><a name="BlumS84" href="../../indices/a-tree/b/Blum:Lenore.html">Lenore Blum</a>, <a href="../../indices/a-tree/s/Shub:Mike.html">Mike Shub</a>:
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract).
261-267 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BlumS84">BibTeX</a></font>

<li><a name="FaginHV84" href="../../indices/a-tree/f/Fagin:Ronald.html">Ronald Fagin</a>, <a 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>:
A Model-Theoretic Analysis of Knowledge: Preliminary Report.
268-278 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FaginHV84">BibTeX</a></font>

<li><a name="Mulmuley84" href="../../indices/a-tree/m/Mulmuley:Ketan.html">Ketan Mulmuley</a>:
A Semantic Characterization of Full Abstraction for Typed Lambda Calculi.
279-288 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mulmuley84">BibTeX</a></font>

<li><a name="Mitchell84" href="../../indices/a-tree/m/Mitchell:John_C=.html">John C. Mitchell</a>:
Semantic Models for Second-Order Lambda Calculus.
289-299 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mitchell84">BibTeX</a></font>

<li><a name="Homer84" href="../../indices/a-tree/h/Homer:Steven.html">Steven Homer</a>:
Minimal Degrees for Honest Polynomial Reducibilities.
300-307 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Homer84">BibTeX</a></font>

<li><a name="BalcazarBLSS84" href="../../indices/a-tree/b/Balc=aacute=zar:Jos=eacute=_L=.html">Jos&eacute; L. Balc&aacute;zar</a>, <a href="../../indices/a-tree/b/Book:Ronald_V=.html">Ronald V. Book</a>, <a href="../../indices/a-tree/l/Long:Timothy_J=.html">Timothy J. Long</a>, <a href="../../indices/a-tree/s/Sch=ouml=ning:Uwe.html">Uwe Sch&ouml;ning</a>, <a href="../../indices/a-tree/s/Selman:Alan_L=.html">Alan L. Selman</a>:
Sparse Oracles and Uniform Complexity Classes.
308-311 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BalcazarBLSS84">BibTeX</a></font>

<li><a name="HartS84" href="../../indices/a-tree/h/Hart:Sergiu.html">Sergiu Hart</a>, <a href="../../indices/a-tree/s/Sharir:Micha.html">Micha Sharir</a>:
Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme.
313-319 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HartS84">BibTeX</a></font>

<li><a name="AlonM84" href="../../indices/a-tree/a/Alon:Noga.html">Noga Alon</a>, <a href="../../indices/a-tree/m/Milman:V=_D=.html">V. D. Milman</a>:
Eigenvalues, Expanders and Superconcentrators (Extended Abstract).
320-322 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlonM84">BibTeX</a></font>

<li><a name="GreenbergW84" href="../../indices/a-tree/g/Greenberg:Albert_G=.html">Albert G. Greenberg</a>, <a href="../../indices/a-tree/w/Weiss:Alan.html">Alan Weiss</a>:
A Lower Bound for Probabilistic Algorithms for Finite State Machines.
323-331 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GreenbergW84">BibTeX</a></font>

<li><a name="MoranSM84" href="../../indices/a-tree/m/Moran:Shlomo.html">Shlomo Moran</a>, <a href="../../indices/a-tree/s/Snir:Marc.html">Marc Snir</a>, <a href="../../indices/a-tree/m/Manber:Udi.html">Udi Manber</a>:
Applications of Ramsey's Theorem to Decision Trees Complexity (Preliminary Version).
332-337 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MoranSM84">BibTeX</a></font>

<li><a name="FredmanT84" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>:
Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms.
338-346 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FredmanT84">BibTeX</a></font>

<li><a name="GabowGS84" href="../../indices/a-tree/g/Gabow:Harold_N=.html">Harold N. Gabow</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/s/Spencer:Thomas_H=.html">Thomas H. Spencer</a>:
Efficient Implementation of Graph Algorithms Using Contraction.
347-357 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GabowGS84">BibTeX</a></font>

<li><a name="Chazelle84" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>:
Computing on a Free Tree via Complexity-Preserving Mappings.
358-368 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chazelle84">BibTeX</a></font>

<li><a name="Munro84" href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>:
An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time.
369-374 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Munro84">BibTeX</a></font>

<li><a name="FischerP84" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>:
Fishspear: A Priority Queue Algorithm (Extended Abstract).
375-386 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerP84">BibTeX</a></font>

<li><a name="DobkinE84" href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>, <a href="../../indices/a-tree/e/Edelsbrunner:Herbert.html">Herbert Edelsbrunner</a>:
Space Searching for Intersecting Objects.
387-392 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DobkinE84">BibTeX</a></font>

<li><a name="ImaiA84" href="../../indices/a-tree/i/Imai:Hiroshi.html">Hiroshi Imai</a>, <a href="../../indices/a-tree/a/Asano:Takao.html">Takao Asano</a>:
Dynamic Segment Intersection Search with Applications.
393-402 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ImaiA84">BibTeX</a></font>

<li><a name="Vaidya84" href="../../indices/a-tree/v/Vaidya:Pravin_M=.html">Pravin M. Vaidya</a>:
A fast approximation for minimum spanning trees in k-dimensional space.
403-407 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Vaidya84">BibTeX</a></font>

<li><a name="ChangY84" href="../../indices/a-tree/c/Chang:Jyun=Sheng.html">Jyun-Sheng Chang</a>, <a href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>:
A Polynomial Solution for Potato-peeling and other Polygon Inclusion and Enclosure Problems.
408-416 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ChangY84">BibTeX</a></font>

<li><a name="SedgewickV84" href="../../indices/a-tree/s/Sedgewick:Robert.html">Robert Sedgewick</a>, <a href="../../indices/a-tree/v/Vitter:Jeffrey_Scott.html">Jeffrey Scott Vitter</a>:
Shortest Paths in Euclidean Graphs (Extended Abstract).
417-424 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SedgewickV84">BibTeX</a></font>

<li><a name="Blum84" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>:
Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain.
425-433 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Blum84">BibTeX</a></font>

<li><a name="SanthaV84" href="../../indices/a-tree/s/Santha:Miklos.html">Miklos Santha</a>, <a href="../../indices/a-tree/v/Vazirani:Umesh_V=.html">Umesh V. Vazirani</a>:
Generating Quasi-Random Sequences from Slightly-Random Sources (Extended Abstract).
434-440 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SanthaV84">BibTeX</a></font>

<li><a name="GoldwasserMR84" href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>, <a href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>:
A ``Paradoxical'' Solution to the Signature Problem (Extended Abstract).
441-448 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldwasserMR84">BibTeX</a></font>

<li><a name="AlexiCGS84" href="../../indices/a-tree/a/Alexi:Werner.html">Werner Alexi</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/s/Schnorr:Claus=Peter.html">Claus-Peter Schnorr</a>:
RSA/Rabin Bits are 1/2 + 1/poly(log N) Secure.
449-457 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AlexiCGS84">BibTeX</a></font>

<li><a name="VaziraniV84" 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>:
Efficient and Secure Pseudo-Random Number Generation (Extended Abstract).
458-463 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/VaziraniV84">BibTeX</a></font>

<li><a name="GoldreichGM84" href="../../indices/a-tree/g/Goldreich:Oded.html">Oded Goldreich</a>, <a href="../../indices/a-tree/g/Goldwasser:Shafi.html">Shafi Goldwasser</a>, <a href="../../indices/a-tree/m/Micali:Silvio.html">Silvio Micali</a>:
How to Construct Random Functions (Extended Abstract).
464-479 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldreichGM84">BibTeX</a></font>

<li><a name="FriezeKL84" 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 href="../../indices/a-tree/l/Lagarias:J=_C=.html">J. C. Lagarias</a>:
Linear Congruential Generators Do Not Produce Random Sequences.
480-484 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FriezeKL84">BibTeX</a></font>

<li><a name="Pitt84" href="../../indices/a-tree/p/Pitt:Leonard.html">Leonard Pitt</a>:
A Characterization of Probabilistic Inference.
485-494 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Pitt84">BibTeX</a></font>

<li><a name="GrollmannS84" href="../../indices/a-tree/g/Grollmann:Joachim.html">Joachim Grollmann</a>, <a href="../../indices/a-tree/s/Selman:Alan_L=.html">Alan L. Selman</a>:
Complexity Measures for Public-Key Cryptosystems (Preliminary Report).
495-503 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GrollmannS84">BibTeX</a></font>

<li><a name="Friedman84" href="../../indices/a-tree/f/Friedman:J=.html">J. Friedman</a>:
Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables.
506-515 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Friedman84">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> &#151; 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 &#169;</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>

Document Actions