Sciweavers

120

click to vote

STOC
1995
ACM

118views Algorithms» more STOC 1995»

On randomized one-round communication complexity

15 years 8 months ago

Download faculty-gsb.stanford.edu

Ilan Kremer, Noam Nisan, Dana Ron

claim paper

Read More »

143

click to vote

STOC
1995
ACM

135views Algorithms» more STOC 1995»

Subquadratic-time factoring of polynomials over finite fields

15 years 8 months ago

Download www4.ncsu.edu

New probabilistic algorithms are presented for factoring univariate polynomials over ﬁnite ﬁelds. The algorithms factor a polynomial of

Erich Kaltofen, Victor Shoup

claim paper

Read More »

112

click to vote

STOC
1995
ACM

117views Algorithms» more STOC 1995»

Lower bounds for sorting networks

15 years 8 months ago

Download nkahale.free.fr

Nabil Kahale, Frank Thomson Leighton, Yuan Ma, C. ...

claim paper

Read More »

107

click to vote

STOC
1995
ACM

117views Algorithms» more STOC 1995»

What's decidable about hybrid automata?

15 years 8 months ago

Download www.eecs.berkeley.edu

Thomas A. Henzinger, Peter W. Kopke, Anuj Puri, Pr...

claim paper

Read More »

101

click to vote

STOC
1995
ACM

86views Algorithms» more STOC 1995»

Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal (Extended Abstract)

15 years 8 months ago

Download www.cs.brown.edu

William E. Hart, Sorin Istrail

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Sciweavers