The Community for Technology Leaders
2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1988)
White Plains, NY, USA
Oct. 24, 1988 to Oct. 26, 1988
ISBN: 0-8186-0877-3
TABLE OF CONTENTS
Papers

Hardness vs. randomness (PDF)

N. Nisan , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 2-11

On the existence of pseudorandom generators (PDF)

O. Goldreich , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 12-24

Zero-knowledge with log-space verifiers (PDF)

J. Kilian , Dept. of Math., MIT, Cambridge, MA, USA
pp. 25-35

Homogeneous measures and polynomial time invariants (PDF)

L.A. Levin , Dept. of Comput. Sci., Boston Univ., MA, USA
pp. 36-41

Achieving oblivious transfer using weakened security assumptions (PDF)

C. Crepeau , MIT, Cambridge, MA, USA
J. Kilian , MIT, Cambridge, MA, USA
pp. 42-52

Lower bounds for integer greatest common divisor computations (PDF)

Y. Mansour , Lab. for Comput. Sci., MIT, Cambridge, MA, USA
pp. 54-63

A lower bound for matrix multiplication (PDF)

N.H. Bshouty , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
pp. 64-67

The influence of variables on Boolean functions (PDF)

J. Kahn , Dept. of Math., Rutgers Univ., New Brunswick, NJ, USA
pp. 68-80

Lattices, mobius functions and communications complexity (PDF)

L. Lovasz , Dept. of Comput. Sci., Eotvos Lorand Univ., Budapest, Hungary
pp. 81-90

Near-optimal time-space tradeoff for element distinctness (PDF)

A.C.-C. Yao , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 91-97

Predicting (0, 1)-functions on randomly drawn points (PDF)

D. Haussler , Dept. of Comput.&Inf. Sci., California Univ., Santa Cruz, CA, USA
M.K. Warmuth , Dept. of Comput.&Inf. Sci., California Univ., Santa Cruz, CA, USA
N. Littlestone , Dept. of Comput.&Inf. Sci., California Univ., Santa Cruz, CA, USA
pp. 100-109

Learning probabilistic prediction functions (PDF)

A. DeSantis , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 110-119

Results on learnability and the Vapnik-Chervonenkis dimension (PDF)

N. Linial , IBM Almaden Res. Center, San Jose, CA, USA
pp. 120-129

Learning via queries (PDF)

W.I. Gasarch , Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
pp. 130-137

Effect of connectivity in associative memory models (PDF)

R. Paturi , California Univ., San Diego, La Jolla, CA, USA
J. Komlos , California Univ., San Diego, La Jolla, CA, USA
pp. 138-147

Efficient parallel algorithms for chordal graphs (PDF)

P.N. Klein , Harvard Univ., Cambridge, MA, USA
pp. 150-161

Removing randomness in parallel computation without a processor penalty (PDF)

M. Luby , Dept. of Comput. Sci., Toronto Univ., Ont., Canada
pp. 162-173

Parallel comparison algorithms for approximation problems (PDF)

N. Alon , Fac. of Exact Sci., Tel Aviv Univ., Israel
Y. Azar , Fac. of Exact Sci., Tel Aviv Univ., Israel
pp. 194-203

Dynamic networks are as fast as static networks (PDF)

B. Awerbuch , Dept. of Math., MIT, Cambridge, MA, USA
M. Sipser , Dept. of Math., MIT, Cambridge, MA, USA
pp. 206-219

On the effects of feedback in dynamic network protocols (PDF)

B. Awerbuch , Dept. of Math., MIT, Cambridge, MA, USA
pp. 231-245

Coordinated traversal: (t+1)-round Byzantine agreement in polynomial time (PDF)

O. Waarts , Dept. of Comput. Sci., Weizmann Inst., Rehovot, Israel
Y. Moses , Dept. of Comput. Sci., Weizmann Inst., Rehovot, Israel
pp. 246-255

Universal packet routing algorithms (PDF)

T. Leighton , Dept. of Math., MIT, Cambridge, MA, USA
pp. 256-269

Fast management of permutation groups (PDF)

L. Babai , Eotvos Univ., Budapest, Hungary
pp. 272-282

New algorithms for finding irreducible polynomials over finite fields (PDF)

V. Shoup , Dept. of Comput. Sci., Wisconsin Univ., Madison, WI, USA
pp. 283-290

A faster PSPACE algorithm for deciding the existential theory of the reals (PDF)

J. Renegar , Sch. of Oper. Res.&Ind. Eng., Cornell Univ., Ithaca, NY, USA
pp. 291-295

Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators (PDF)

E. Kaltofen , Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
B. Trager , Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
pp. 296-305

On the complexity of kinodynamic planning (PDF)

J. Canny , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 306-316

On the complexity of omega -automata (PDF)

S. Safra , Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel
pp. 319-327

The complexity of tree automata and logics of programs (PDF)

C.S. Jutla , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
E.A. Emerson , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
pp. 328-337

Verifying temporal properties of finite-state probabilistic programs (PDF)

C. Courcoubetis , AT&T Bell Lab., Murray Hill, NJ, USA
M. Yannakakis , AT&T Bell Lab., Murray Hill, NJ, USA
pp. 338-345

The complexity of the pigeonhole principle (PDF)

M. Ajtai , IBM Almaden Res. Center, San Jose, CA, USA
pp. 346-355

Reachability is harder for directed than for undirected finite graphs (PDF)

R. Fagin , IBM Almaden Res. Center, San Jose, CA, USA
M. Ajtai , IBM Almaden Res. Center, San Jose, CA, USA
pp. 358-367

Fully abstract models of the lazy lambda calculus (PDF)

C.-H.L. Ong , Imperial Coll., London, UK
pp. 368-376

Nonexpressibility of fairness and signaling (PDF)

V. Shanbhogue , Cornell Univ., Ithaca, NY, USA
P. Panangaden , Cornell Univ., Ithaca, NY, USA
D. McAllester , Cornell Univ., Ithaca, NY, USA
pp. 377-386

Constructive results from graph minors: linkless embeddings (PDF)

A. Raghunathan , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
R. Motwani , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
H. Saran , Div. of Comput. Sci., California Univ., Berkeley, CA, USA
pp. 398-409

Polytopes, permanents and graphs with large factors (PDF)

M. Luby , Toronto Univ., Ont., Canada
P. Dagum , Toronto Univ., Ont., Canada
pp. 412-421

Combinatorial algorithms for the generalized circulation problem (PDF)

A.V. Goldberg , Dept. of Comput. Sci., Stanford Univ., CA, USA
pp. 432-443

Polynomial algorithm for the k-cut problem (PDF)

O. Goldschmidt , California Univ., Berkeley, CA, USA
D.S. Hochbaum , California Univ., Berkeley, CA, USA
pp. 444-451

Genus g graphs have pagenumber O( square root g) (PDF)

S.M. Malitz , Dept. of Math., MIT, Cambridge, MA, USA
pp. 458-468

Take a walk, grow a tree (PDF)

Jin-Yi Cai , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
S. Bhatt , Dept. of Comput. Sci., Yale Univ., New Haven, CT, USA
pp. 469-478

Bounds on the cover time (PDF)

A.Z. Broder , DEC-Syst. Res. Center, Palo Alto, CA, USA
A.R. Karlin , DEC-Syst. Res. Center, Palo Alto, CA, USA
pp. 479-487

Speeding up dynamic programming (PDF)

D. Eppstein , Dept. of Comput. Sci., Columbia Univ., NY, USA
Z. Galil , Dept. of Comput. Sci., Columbia Univ., NY, USA
R. Giancarlo , Dept. of Comput. Sci., Columbia Univ., NY, USA
pp. 488-496

Notes on searching in multidimensional monotone arrays (PDF)

A. Aggarwal , IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
pp. 497-512

Three stacks (PDF)

M.L. Fredman , Bellcore, Morristown, NJ, USA
pp. 514-523

On pointers versus addresses (PDF)

Z. Galil , Tel-Aviv Univ., Israel
A.M. Ben-Amram , Tel-Aviv Univ., Israel
pp. 532-538

A deterministic view of random sampling and its use in geometry (PDF)

J. Friedman , Dept. of Comput. Sci., Princeton Univ., NJ, USA
B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 539-549

New upper bounds in Klee's measure problem (PDF)

M.H. Overmars , Dept. of Comput. Sci., Utrecht Univ., Netherlands
pp. 550-556

Fully dynamic techniques for point location and transitive closure in planar structures (PDF)

R. Tamassia , Dept. of Electr.&Comput. Eng., Illinois Univ., Urbana, IL, USA
F.P. Preparata , Dept. of Electr.&Comput. Eng., Illinois Univ., Urbana, IL, USA
pp. 558-567

A fast planar partition algorithm. I (PDF)

K. Mulmuley , Chicago Univ., IL, USA
pp. 580-589

An optimal algorithm for intersecting line segments in the plane (PDF)

B. Chazelle , Dept. of Comput. Sci., Princeton Univ., NJ, USA
pp. 590-600

Covering polygons is hard (PDF)

R.A. Reckhow , Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
J.C. Culberson , Dept. of Comput. Sci., Alberta Univ., Edmonton, Alta., Canada
pp. 601-611
103 ms
(Ver 3.1 (10032016))