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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(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 ◽

Cited By ~ 1

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 ◽

Cited By ~ 22

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 ◽

Cited By ~ 16

Author(s):

D. Achioptas ◽

G.B. Sorkin

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 ◽

Cited By ~ 49

Author(s):

M. Chrobak ◽

L. Gasieniec ◽

W. Rytter

Keyword(s):

Radio Networks

Download Full-text

Extracting randomness from samplable distributions

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892063 ◽

2002 ◽

Cited By ~ 64

Author(s):

L. Trevisan ◽

S. Vadhan

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 ◽

Cited By ~ 33

Author(s):

J. Watrous

Keyword(s):

Finite Groups

Download Full-text

Stochastic models for the Web graph

Proceedings 41st Annual Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2000.892065 ◽

2002 ◽

Cited By ~ 164

Author(s):

R. Kumar ◽

P. Raghavan ◽

S. Rajagopalan ◽

D. Sivakumar ◽

A. Tomkins ◽

...

Keyword(s):

Stochastic Models ◽

Web Graph ◽

The Web

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 ◽

Cited By ~ 7

Author(s):

J. Kahn ◽

J.H. Kim ◽

L. Lovasz ◽

V.H. Vu

Keyword(s):

Cover Time

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 ◽

Cited By ~ 12

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 ◽

Cited By ~ 107

Author(s):

C.H. Papadimitriou ◽

M. Yannakakis

Keyword(s):

Trade Offs

Download Full-text

Proceedings 41st Annual Symposium on Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc

The quantum complexity of set membership

Extracting randomness via repeated condensing

Optimal myopic algorithms for random 3-SAT

Fast broadcasting and gossiping in radio networks

Extracting randomness from samplable distributions

Succinct quantum proofs for properties of finite groups

Stochastic models for the Web graph

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

Sampling adsorbing staircase walks using a new Markov chain decomposition method

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

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