Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

081862082x

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Network synchronization with polylogarithmic overhead

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89572 ◽

2002 ◽

Cited By ~ 33

Author(s):

B. Awerbuch ◽

D. Peleg

Keyword(s):

Network Synchronization

Download Full-text

On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89584 ◽

2002 ◽

Cited By ~ 9

Author(s):

R. Smolensky

Keyword(s):

Lower Bounds ◽

Analytic Functions

Download Full-text

Efficient parallel algorithms for tree-decomposition and related problems

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89536 ◽

2002 ◽

Cited By ~ 20

Author(s):

J. Lagergren

Keyword(s):

Parallel Algorithms ◽

Tree Decomposition

Download Full-text

Simple construction of almost k-wise independent random variables

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89575 ◽

2002 ◽

Cited By ~ 44

Author(s):

N. Alon ◽

O. Goldreich ◽

J. Hastad ◽

R. Peralta

Keyword(s):

Random Variables ◽

Independent Random Variables ◽

Simple Construction

Download Full-text

Perfectly secure message transmission

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89522 ◽

2002 ◽

Cited By ~ 12

Author(s):

D. Dolev ◽

C. Dwork ◽

O. Waarts ◽

M. Yung

Keyword(s):

Message Transmission ◽

Secure Message Transmission

Download Full-text

Some tools for approximate 3-coloring

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89576 ◽

2002 ◽

Cited By ~ 9

Author(s):

A. Blum

Download Full-text

Tight bounds on the complexity of cascaded decomposition of automata

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89589 ◽

2002 ◽

Cited By ~ 7

Author(s):

O. Maler ◽

A. Pnueli

Download Full-text

Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89564 ◽

2002 ◽

Cited By ~ 1

Author(s):

S. Istrail

Keyword(s):

Small Diameter ◽

Polynomial Size

Download Full-text

Interpolation of sparse rational functions without knowing bounds on exponents

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89616 ◽

2002 ◽

Cited By ~ 6

Author(s):

D.Y. Grigoriev ◽

M. Karpinski ◽

M.F. Singer

Keyword(s):

Rational Functions

Download Full-text

Fault tolerant sorting network

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science ◽

10.1109/fscs.1990.89546 ◽

2002 ◽

Cited By ~ 19

Author(s):

S. Assaf ◽

E. Upfal

Keyword(s):

Fault Tolerant ◽

Sorting Network

Download Full-text

Proceedings [1990] 31st Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

Network synchronization with polylogarithmic overhead

On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates

Efficient parallel algorithms for tree-decomposition and related problems

Simple construction of almost k-wise independent random variables

Perfectly secure message transmission

Some tools for approximate 3-coloring

Tight bounds on the complexity of cascaded decomposition of automata

Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter

Interpolation of sparse rational functions without knowing bounds on exponents

Fault tolerant sorting network

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
Latest Publications