The Community for Technology Leaders
25th Annual Symposium onFoundations of Computer Science, 1984. (1984)
Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
ISBN: 0-8186-0591-X

Log Depth Circuits For Division And Related Problems (PDF)

P.W. Beame , Department of Computer Science, University of Toronto
pp. 1-6

Parallel Powering (PDF)

J. von zur Gathen , University of Toronto
pp. 31-36

Embedding Planar Graphs In Seven Pages (PDF)

L. Heath , University of North Carolina
pp. 74-83

Interactive Data Compression (PDF)

A. El Gamal , Stanford University
pp. 100-108

Lower Bounds On Communication Complexity In Distributed Computer Networks (PDF)

P. Tiwari , University of Illinois at Urbana-Champaign
pp. 109-117

Probabilistic Communication Complexity (PDF)

R. Paturi , The Pennsylvania State University
pp. 118-126

Parallel Communication With Limited Buffers (PDF)

N. Pippenger , IBM Research Laboratory
pp. 127-136

The Average-Case Analysis of Some On-Line Algorithms for Bin Packing (PDF)

P.W. Shor , Massachusetts Institute of Technology
pp. 193-200

Linear Verification For Spanning Trees (PDF)

J. Komlos , University of California, San Diego
pp. 201-206

A Fast Approximation Algorithm For Minimum Spanning Trees In K-Dimensional Space (PDF)

P.M. Vaidya , University of Illinois at Urbana-Champaign
pp. 403-407

A "Paradoxical" Solution To The Signature Problem (PDF)

S. Goldwasser , MIT Laboratory for Computer Science
pp. 441-448

RSA/Rabin Bits are 1/2 + 1 Poly (Log N) Secure (PDF)

W. Alexi , Fachbereich Mathematik, Universitat Frankfurt
pp. 449-457

How To Construct Randolli Functions (PDF)

O. Goldreich , Massachusetts Institute of Technology
pp. 464-479

Author Index (PDF)

pp. 517-518
92 ms
(Ver 3.3 (11022016))