25. FOCS 1984:
West Palm Beach, Florida, USA
Wayne Eberly:
Very Fast Parallel Matrix and Polynomial Arithmetic.
21-30
Alok Aggarwal:
A Comparative Study of X-Tree, Pyramid and Related Machines.
89-99
Prasoon Tiwari:
Lower Bounds on Communication Complexity in Distributed Computer Networks (Preliminary Version).
109-117
Nicholas Pippenger:
Parallel Communication with Limited Buffers (Preliminary Version).
127-136
Peter W. Shor:
The Average-Case Analysis of Some On-Line Algorithms for Bin Packing.
193-200
János Komlós:
Linear Verification for Spanning Trees.
201-206
Bhubaneswar Mishra:
An Efficient Algorithm to Find all `Bidirectional' Edges of an Undirected Graph.
207-216
Michael Kaminski:
Mulltiplication of Polynomials over the Ring of Integers.
251-254
Richard Cole:
Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms.
255-260
Lenore Blum,
Mike Shub:
Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average (Extended Abstract).
261-267
Ketan Mulmuley:
A Semantic Characterization of Full Abstraction for Typed Lambda Calculi.
279-288
Steven Homer:
Minimal Degrees for Honest Polynomial Reducibilities.
300-307
Sergiu Hart,
Micha Sharir:
Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme.
313-319
Bernard Chazelle:
Computing on a Free Tree via Complexity-Preserving Mappings.
358-368
J. Ian Munro:
An Implicit Data Structure for the Dictionary Problem that Runs in Polylog Time.
369-374
Pravin M. Vaidya:
A fast approximation for minimum spanning trees in k-dimensional space.
403-407
Manuel Blum:
Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain.
425-433
Leonard Pitt:
A Characterization of Probabilistic Inference.
485-494
J. Friedman:
Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables.
506-515
data released under the ODC-BY 1.0 license
