Proceedings 38th Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0818681977

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Two Decades of Temporal Logic: Achievements and Challenges

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646095 ◽

2005 ◽

Author(s):

A. Pnueli

Keyword(s):

Temporal Logic

Download Full-text

Computable obstructions to wait-free computability

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646096 ◽

2002 ◽

Cited By ~ 1

Author(s):

J. Havlicek

Download Full-text

Hamiltonian cycles in solid grid graphs

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646138 ◽

2002 ◽

Cited By ~ 14

Author(s):

C. Umans ◽

W. Lenhart

Keyword(s):

Hamiltonian Cycles ◽

Grid Graphs

Download Full-text

Constant depth circuits and the Lutz hypothesis

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646149 ◽

2002 ◽

Cited By ~ 2

Author(s):

Jin-Yi Cai ◽

D. Sivakumar ◽

M. Strauss

Keyword(s):

Constant Depth ◽

Constant Depth Circuits

Download Full-text

New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646120 ◽

2002 ◽

Cited By ~ 5

Author(s):

S. Goldwasser

Keyword(s):

Complexity Theory ◽

New Directions ◽

Made In

Download Full-text

Separation of the monotone NC hierarchy

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646112 ◽

2002 ◽

Cited By ~ 12

Author(s):

R. Raz ◽

P. McKenzie

Download Full-text

Learning noisy perceptrons by a perceptron in polynomial time

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646140 ◽

2002 ◽

Cited By ~ 14

Author(s):

E. Cohen

Keyword(s):

Polynomial Time

Download Full-text

General dynamic routing with per-packet delay guarantees of O(distance+1/session rate)

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646118 ◽

2002 ◽

Cited By ~ 3

Author(s):

M. Andrews ◽

A. Fernandez ◽

M. Harchol-Balter ◽

T. Leighton ◽

L. Zhang

Keyword(s):

Packet Delay ◽

Dynamic Routing ◽

Delay Guarantees ◽

General Dynamic

Download Full-text

Storage management for evolving databases

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646124 ◽

2002 ◽

Cited By ~ 2

Author(s):

J. Kleinberg ◽

R. Motwani ◽

P. Raghavan ◽

S. Venkatasubramanian

Keyword(s):

Storage Management

Download Full-text

Global optimization using local information with applications to flow control

Proceedings 38th Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1997.646119 ◽

2002 ◽

Cited By ~ 29

Author(s):

Y. Bartal ◽

J.W. Byers ◽

D. Raz

Keyword(s):

Global Optimization ◽

Flow Control ◽

Local Information

Download Full-text

Proceedings 38th Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

Two Decades of Temporal Logic: Achievements and Challenges

Computable obstructions to wait-free computability

Hamiltonian cycles in solid grid graphs

Constant depth circuits and the Lutz hypothesis

New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)

Separation of the monotone NC hierarchy

Learning noisy perceptrons by a perceptron in polynomial time

General dynamic routing with per-packet delay guarantees of O(distance+1/session rate)

Storage management for evolving databases

Global optimization using local information with applications to flow control

Proceedings 38th Annual Symposium on Foundations of Computer Science
Latest Publications