Sciweavers

48 search results - page 3 / 10

» focs 2002

6

FOCS
2002
IEEE

90views Theoretical Computer Science» more FOCS 2002»

Dependent Rounding in Bipartite Graphs

13 years 10 months ago

Dependent Rounding in Bipartite Graphs

Download crab.rutgers.edu

Rajiv Gandhi, Samir Khuller, Srinivasan Parthasara...

claim paper

Read More »

9

FOCS
2002
IEEE

93views Theoretical Computer Science» more FOCS 2002»

An Information Statistics Approach to Data Stream and Communication Complexity

13 years 10 months ago

An Information Statistics Approach to Data Stream and Communication Complexity

Download www.madalgo.au.dk

Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, D. Sivak...

claim paper

Read More »

10

FOCS
2002
IEEE

126views Theoretical Computer Science» more FOCS 2002»

Authentication of Quantum Messages

13 years 10 months ago

Authentication of Quantum Messages

Download people.csail.mit.edu

Howard Barnum, Claude Crépeau, Daniel Gotte...

claim paper

Read More »

8

FOCS
2002
IEEE

84views Theoretical Computer Science» more FOCS 2002»

Power from Random Strings

13 years 10 months ago

Power from Random Strings

Download www.cs.rutgers.edu

Eric Allender, Harry Buhrman, Michal Koucký...

claim paper

Read More »

10

FOCS
2002
IEEE

110views Theoretical Computer Science» more FOCS 2002»

13 years 10 months ago

Download www.math.ias.edu

We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity...

Oded Goldreich

claim paper

Read More »

« Prev « First page 3 / 10 Last » Next »