[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0818608773

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

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

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21928 ◽

1988 ◽

Cited By ~ 27

Author(s):

D. Haussler ◽

N. Littlestone ◽

M.K. Warmuth

Download Full-text

The complexity of tree automata and logics of programs

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21949 ◽

1988 ◽

Cited By ~ 133

Author(s):

E.A. Emerson ◽

C.S. Jutla

Keyword(s):

Tree Automata ◽

Logics Of Programs

Download Full-text

The complexity of the pigeonhole principle

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21951 ◽

1988 ◽

Cited By ~ 54

Author(s):

M. Ajtai

Keyword(s):

Pigeonhole Principle

Download Full-text

Covering polygons is hard

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21976 ◽

1988 ◽

Cited By ~ 25

Author(s):

J.C. Culberson ◽

R.A. Reckhow

Download Full-text

Speeding up dynamic programming

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21965 ◽

1988 ◽

Cited By ~ 13

Author(s):

D. Eppstein ◽

Z. Galil ◽

R. Giancarlo

Keyword(s):

Dynamic Programming

Download Full-text

On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21955 ◽

1988 ◽

Cited By ~ 12

Author(s):

L. Blum ◽

M. Shub ◽

S. Smale

Keyword(s):

Theory Of Computation ◽

Real Numbers ◽

The Real ◽

Recursive Functions ◽

Np Completeness

Download Full-text

An optimal algorithm for intersecting line segments in the plane

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21975 ◽

1988 ◽

Cited By ~ 46

Author(s):

B. Chazelle ◽

H. Edelsbrunner

Keyword(s):

Optimal Algorithm ◽

Line Segments

Download Full-text

Genus g graphs have pagenumber O( square root g)

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21962 ◽

1988 ◽

Cited By ~ 1

Author(s):

S.M. Malitz

Keyword(s):

Square Root

Download Full-text

The influence of variables on Boolean functions

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21923 ◽

1988 ◽

Cited By ~ 190

Author(s):

J. Kahn ◽

G. Kalai ◽

N. Linial

Keyword(s):

Boolean Functions

Download Full-text

On pointers versus addresses

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1988.21969 ◽

1988 ◽

Cited By ~ 2

Author(s):

A.M. Ben-Amram ◽

Z. Galil

Download Full-text

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

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

The complexity of tree automata and logics of programs

The complexity of the pigeonhole principle

Covering polygons is hard

Speeding up dynamic programming

On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines

An optimal algorithm for intersecting line segments in the plane

Genus g graphs have pagenumber O( square root g)

The influence of variables on Boolean functions

On pointers versus addresses

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
Latest Publications