30th Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

100

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0818619821

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the complexity of fixed parameter problems

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63480 ◽

1989 ◽

Cited By ~ 9

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 ◽

Cited By ~ 16

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 ◽

Cited By ~ 57

Author(s):

S.R. Kosaraju

Keyword(s):

Pattern Matching ◽

Tree Pattern ◽

Tree Pattern Matching

Download Full-text

Incremental planarity testing

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63515 ◽

1989 ◽

Cited By ~ 58

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 ◽

Cited By ~ 6

Author(s):

J. Cheriyan ◽

T. Hagerup

Keyword(s):

Maximum Flow ◽

Flow Algorithm

Download Full-text

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 ◽

Cited By ~ 1

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 ◽

Cited By ~ 41

Author(s):

E. Kushilevitz

Keyword(s):

Communication Complexity

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 ◽

Cited By ~ 5

Author(s):

L. Ronyai

Keyword(s):

Finite Fields ◽

Galois Groups ◽

Polynomials Over Finite Fields ◽

Factoring Polynomials

Download Full-text

Efficient algorithms for independent assignment on graphic and linear matroids

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63463 ◽

1989 ◽

Cited By ~ 5

Author(s):

H.N. Gabow ◽

Y. Xu

Keyword(s):

Efficient Algorithms

Download Full-text

A new algorithm for minimizing convex functions over convex sets

30th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1989.63500 ◽

1989 ◽

Cited By ~ 58

Author(s):

P.M. Vaidya

Keyword(s):

Convex Functions ◽

Convex Sets

Download Full-text

30th Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

On the complexity of fixed parameter problems

Solvability in asynchronous environments

Efficient tree pattern matching

Incremental planarity testing

A randomized maximum-flow algorithm

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

Privacy and communication complexity

Galois groups and factoring polynomials over finite fields

Efficient algorithms for independent assignment on graphic and linear matroids

A new algorithm for minimizing convex functions over convex sets

30th Annual Symposium on Foundations of Computer Science
Latest Publications