30th Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

100

(FIVE YEARS 0)

H-INDEX

29

(FIVE YEARS 0)

Published By IEEE

0818619821

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

30th Annual Symposium on Foundations of Computer Science (Cat. No.89CH2808-4)

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63440 ◽

1989 ◽

Keyword(s):

Computer Science ◽

Annual Symposium

Download Full-text

Privacy and communication complexity

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63512 ◽

1989 ◽

Author(s):

E. Kushilevitz

Keyword(s):

Communication Complexity

Download Full-text

Incremental planarity testing

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63515 ◽

1989 ◽

Author(s):

G. Di Battista ◽

R. Tamassia

Download Full-text

A randomized maximum-flow algorithm

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63465 ◽

1989 ◽

Author(s):

J. Cheriyan ◽

T. Hagerup

Keyword(s):

Maximum Flow ◽

Download Full-text

On the complexity of fixed parameter problems

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63480 ◽

1989 ◽

Author(s):

K.R. Abrahamson ◽

M.R. Fellows ◽

J.A. Ellis ◽

M.E. Mata

Keyword(s):

Fixed Parameter

Download Full-text

Solvability in asynchronous environments

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63513 ◽

1989 ◽

Author(s):

B. Chor ◽

L. Moscovici

Keyword(s):

Asynchronous Environments

Download Full-text

Efficient tree pattern matching

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63475 ◽

1989 ◽

Author(s):

S.R. Kosaraju

Keyword(s):

Pattern Matching ◽

Tree Pattern ◽

Tree Pattern Matching

Download Full-text

Polynomial end-to-end communication

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63503 ◽

1989 ◽

Author(s):

B. Awerbuch ◽

Y. Mansour ◽

N. Shavit

Keyword(s):

Download Full-text

On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63450 ◽

1989 ◽

Author(s):

A. Siegel

Keyword(s):

High Performance ◽

Hash Functions ◽

Universal Classes

Download Full-text

Galois groups and factoring polynomials over finite fields

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63462 ◽

1989 ◽

Author(s):

L. Ronyai

Keyword(s):

Finite Fields ◽

Galois Groups ◽

Polynomials Over Finite Fields ◽

Factoring Polynomials

Download Full-text