Proceedings., 33rd Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE

0818629002

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the second eigenvalue and linear expansion of regular graphs

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267762 ◽

1992 ◽

Cited By ~ 8

Author(s):

N. Kahale

Keyword(s):

Linear Expansion ◽

Regular Graphs ◽

Second Eigenvalue

Download Full-text

Tighter bounds on the exact complexity of string matching

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267791 ◽

1992 ◽

Cited By ~ 11

Author(s):

R. Cole ◽

R. Hariharan

Keyword(s):

String Matching

Download Full-text

Communication on noisy channels: a coding theorem for computation

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267778 ◽

1992 ◽

Cited By ~ 43

Author(s):

L.J. Schulman

Keyword(s):

Noisy Channels

Download Full-text

Fault tolerant graphs, perfect hash functions and disjoint paths

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267781 ◽

1992 ◽

Cited By ~ 14

Author(s):

M. Ajtai ◽

N. Alon ◽

J. Bruck ◽

R. Cypher ◽

C.T. Ho ◽

...

Keyword(s):

Fault Tolerant ◽

Hash Functions ◽

Disjoint Paths

Download Full-text

On the exact learning of formulas in parallel

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267800 ◽

1992 ◽

Cited By ~ 7

Author(s):

N.H. Bshouty ◽

R. Cleve

Keyword(s):

Exact Learning

Download Full-text

Reconstructing algebraic functions from mixed data

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267801 ◽

1992 ◽

Cited By ~ 13

Author(s):

S. Ar ◽

R.J. Lipton ◽

R. Rubinfeld ◽

M. Sudan

Keyword(s):

Mixed Data ◽

Algebraic Functions

Download Full-text

The isomorphism conjecture holds relative to an oracle

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267821 ◽

1992 ◽

Cited By ~ 20

Author(s):

S. Fenner ◽

L. Fortnow ◽

S.A. Kurtz

Download Full-text

Safe and effective determinant evaluation

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267751 ◽

1992 ◽

Cited By ~ 36

Author(s):

K.L. Clarkson

Download Full-text

Computing a shortest k-link path in a polygon

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267794 ◽

1992 ◽

Cited By ~ 10

Author(s):

J.S.B. Mitchell ◽

C. Piatko ◽

E.M. Arkin

Download Full-text

Efficient inference of partial types

Proceedings., 33rd Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.1992.267754 ◽

1992 ◽

Cited By ~ 7

Author(s):

D. Kozen ◽

J. Palsberg ◽

M.I. Schwartzbach

Download Full-text

Proceedings., 33rd Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE

On the second eigenvalue and linear expansion of regular graphs

Tighter bounds on the exact complexity of string matching

Communication on noisy channels: a coding theorem for computation

Fault tolerant graphs, perfect hash functions and disjoint paths

On the exact learning of formulas in parallel

Reconstructing algebraic functions from mixed data

The isomorphism conjecture holds relative to an oracle

Safe and effective determinant evaluation

Computing a shortest k-link path in a polygon

Efficient inference of partial types

Proceedings., 33rd Annual Symposium on Foundations of Computer Science
Latest Publications