25th Annual Symposium onFoundations of Computer Science, 1984.
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

081860591x

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Model-Theoretic Analysis Of Knowledge: Preliminary Report

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715925 ◽

2005 ◽

Cited By ~ 4

Author(s):

R. Fagin ◽

J.Y. Halpern ◽

M.Y. Vardi

Keyword(s):

Preliminary Report ◽

Theoretic Analysis ◽

Analysis Of Knowledge

Download Full-text

Lower Bounds On Communication Complexity In Distributed Computer Networks

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715907 ◽

2005 ◽

Cited By ~ 5

Author(s):

P. Tiwari

Keyword(s):

Computer Networks ◽

Lower Bounds ◽

Communication Complexity

Download Full-text

Polymorphic Arrays: A Novel VLSI Layout For Systolic Computers

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715899 ◽

2005 ◽

Cited By ~ 9

Author(s):

A. Fiat ◽

A. Shamir

Keyword(s):

Vlsi Layout

Download Full-text

Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715934 ◽

2005 ◽

Cited By ~ 73

Author(s):

M.L. Fredman ◽

R.E. Tarjan

Keyword(s):

Network Optimization ◽

Optimization Algorithms

Download Full-text

Generating Quasi-Random Sequences From Slightly-Random Sources

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715945 ◽

2005 ◽

Cited By ~ 24

Author(s):

M. Santha ◽

U.V. Vazirani

Keyword(s):

Random Sequences

Download Full-text

Designing Systolic Algorithms Using Sequential Machines

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715900 ◽

2005 ◽

Cited By ~ 8

Author(s):

O.H. Ibarra ◽

M.A. Palis ◽

S.M. Kim

Keyword(s):

Sequential Machines ◽

Systolic Algorithms

Download Full-text

Fishspear: A Priority Queue Algorithm

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715938 ◽

2005 ◽

Author(s):

M.J. Fischer ◽

M.S. Paterson

Keyword(s):

Priority Queue ◽

A Priority

Download Full-text

Log Depth Circuits For Division And Related Problems

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715894 ◽

2005 ◽

Cited By ~ 22

Author(s):

P.W. Beame ◽

S.A. Cook ◽

H.J. Hoover

Download Full-text

A Characterization Of Probabilistic Inference

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715951 ◽

2005 ◽

Cited By ~ 8

Author(s):

L. Pitt

Keyword(s):

Probabilistic Inference

Download Full-text

Shortest Paths In Euclidean Graphs

25th Annual Symposium onFoundations of Computer Science, 1984. ◽

10.1109/sfcs.1984.715943 ◽

2005 ◽

Cited By ~ 1

Author(s):

R. Sedgewick ◽

J.S. Vitter

Keyword(s):

Shortest Paths ◽

Euclidean Graphs

Download Full-text

25th Annual Symposium onFoundations of Computer Science, 1984.Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

A Model-Theoretic Analysis Of Knowledge: Preliminary Report

Lower Bounds On Communication Complexity In Distributed Computer Networks

Polymorphic Arrays: A Novel VLSI Layout For Systolic Computers

Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

Generating Quasi-Random Sequences From Slightly-Random Sources

Designing Systolic Algorithms Using Sequential Machines

Fishspear: A Priority Queue Algorithm

Log Depth Circuits For Division And Related Problems

A Characterization Of Probabilistic Inference

Shortest Paths In Euclidean Graphs

25th Annual Symposium onFoundations of Computer Science, 1984.
Latest Publications