Sciweavers

20 search results - page 2 / 4

» focs 1997

12

FOCS
1997
IEEE

98views Theoretical Computer Science» more FOCS 1997»

The Analysis of a List-Coloring Algorithm on a Random Graph

13 years 8 months ago

The Analysis of a List-Coloring Algorithm on a Random Graph

Download users.soe.ucsc.edu

Dimitris Achlioptas, Michael S. O. Molloy

claim paper

Read More »

12

FOCS
1997
IEEE

81views Theoretical Computer Science» more FOCS 1997»

Satisfiability Coding Lemma

13 years 8 months ago

Satisfiability Coding Lemma

Download people.cs.ubc.ca

Ramamohan Paturi, Pavel Pudlák, Francis Zan...

claim paper

Read More »

9

FOCS
1997
IEEE

92views Theoretical Computer Science» more FOCS 1997»

A Concrete Security Treatment of Symmetric Encryption

13 years 9 months ago

A Concrete Security Treatment of Symmetric Encryption

Download www.cs.ucdavis.edu

Mihir Bellare, Anand Desai, E. Jokipii, Phillip Ro...

claim paper

Read More »

9

FOCS
1997
IEEE

71views Theoretical Computer Science» more FOCS 1997»

Pattern Matching with Swaps

13 years 9 months ago

Pattern Matching with Swaps

Download u.cs.biu.ac.il

Amihood Amir, Yonatan Aumann, Gad M. Landau, Moshe...

claim paper

Read More »

15

FOCS
1997
IEEE

116views Theoretical Computer Science» more FOCS 1997»

Making Nondeterminism Unambiguous

13 years 9 months ago

Making Nondeterminism Unambiguous

Download ftp.cs.rutgers.edu

We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...

Klaus Reinhardt, Eric Allender

claim paper

Read More »

« Prev « First page 2 / 4 Last » Next »