Proceedings 41st Annual Symposium on Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

67

(FIVE YEARS 0)

H-INDEX

26

(FIVE YEARS 0)

Published By IEEE Comput. Soc

0769508502

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The quantum complexity of set membership

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892143 ◽

2002 ◽

Author(s):

J. Radhakrishnan ◽

P. Sen ◽

S. Venkatesh

Keyword(s):

Set Membership ◽

Quantum Complexity

Download Full-text

Extracting randomness via repeated condensing

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892008 ◽

2002 ◽

Author(s):

O. Reingold ◽

R. Shaltiel ◽

A. Wigderson

Download Full-text

Optimal myopic algorithms for random 3-SAT

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892327 ◽

2002 ◽

Author(s):

D. Achioptas ◽

G.B. Sorkin

Download Full-text

Succinct quantum proofs for properties of finite groups

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892141 ◽

2002 ◽

Author(s):

J. Watrous

Keyword(s):

Download Full-text

Stochastic models for the Web graph

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892065 ◽

2002 ◽

Author(s):

R. Kumar ◽

P. Raghavan ◽

S. Rajagopalan ◽

D. Sivakumar ◽

A. Tomkins ◽

...

Keyword(s):

Stochastic Models ◽

Web Graph ◽

Download Full-text

The cover time, the blanket time, and the Matthews bound

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892134 ◽

2002 ◽

Author(s):

J. Kahn ◽

J.H. Kim ◽

L. Lovasz ◽

V.H. Vu

Keyword(s):

Download Full-text

Fast broadcasting and gossiping in radio networks

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892325 ◽

2002 ◽

Author(s):

M. Chrobak ◽

L. Gasieniec ◽

W. Rytter

Keyword(s):

Download Full-text

Extracting randomness from samplable distributions

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892063 ◽

2002 ◽

Author(s):

L. Trevisan ◽

S. Vadhan

Download Full-text

Sampling adsorbing staircase walks using a new Markov chain decomposition method

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892137 ◽

2002 ◽

Author(s):

R.A. Martin ◽

D. Randall

Keyword(s):

Markov Chain ◽

Decomposition Method ◽

Chain Decomposition ◽

Markov Chain Decomposition

Download Full-text

On the approximability of trade-offs and optimal access of Web sources

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892068 ◽

2002 ◽

Author(s):

C.H. Papadimitriou ◽

M. Yannakakis

Keyword(s):

Download Full-text