Sciweavers

38

STOC
1995
ACM

103views Algorithms» more STOC 1995»

Log-space polynomial end-to-end communication

14 years 9 months ago

Log-space polynomial end-to-end communication

Download www.cs.ucla.edu

Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosé...

claim paper

Read More »

39

STOC
1995
ACM

118views Algorithms» more STOC 1995»

On randomized one-round communication complexity

14 years 9 months ago

On randomized one-round communication complexity

Download faculty-gsb.stanford.edu

Ilan Kremer, Noam Nisan, Dana Ron

claim paper

Read More »

52

STOC
1995
ACM

135views Algorithms» more STOC 1995»

Subquadratic-time factoring of polynomials over finite fields

14 years 9 months ago

Subquadratic-time factoring of polynomials over finite fields

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 »

42

STOC
1995
ACM

117views Algorithms» more STOC 1995»

Lower bounds for sorting networks

14 years 9 months ago

Lower bounds for sorting networks

Download nkahale.free.fr

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

claim paper

Read More »

37

STOC
1995
ACM

117views Algorithms» more STOC 1995»

What's decidable about hybrid automata?

14 years 9 months ago

What's decidable about hybrid automata?

Download www.eecs.berkeley.edu

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

claim paper

Read More »

36

STOC
1995
ACM

86views Algorithms» more STOC 1995»

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

14 years 9 months ago

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

Download www.cs.brown.edu

William E. Hart, Sorin Istrail

claim paper

Read More »

61

STOC
1995
ACM

194views Algorithms» more STOC 1995»

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

14 years 9 months ago

Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

Download www.cs.tau.ac.il

Genomes frequently evolve by reversals ␳(i, j) that transform a gene order ␲1 . . . ␲i␲iϩ1 . . . ␲jϪ1␲j . . . ␲n into ␲1 . . . ␲i␲jϪ1 . . . ␲iϩ1␲j . . ....

Sridhar Hannenhalli, Pavel A. Pevzner

claim paper

Read More »

58

STOC
1995
ACM

115views Algorithms» more STOC 1995»

Geometric lower bounds for parametric matroid optimization

14 years 9 months ago

Geometric lower bounds for parametric matroid optimization

Download www.ics.uci.edu

We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...

David Eppstein

claim paper

Read More »

41

STOC
1995
ACM

89views Algorithms» more STOC 1995»

What do we know about the Metropolis algorithm?

14 years 9 months ago

What do we know about the Metropolis algorithm?

Download www-stat.stanford.edu

Persi Diaconis, Laurent Saloff-Coste

claim paper

Read More »

55

STOC
1995
ACM

107views Algorithms» more STOC 1995»

Incremental cryptography and application to virus protection

14 years 9 months ago

Incremental cryptography and application to virus protection

Download cseweb.ucsd.edu

The goal of incremental cryptography is to design cryptographic algorithms with the property that having applied the algorithm to a document, it is possible to quickly update the ...

Mihir Bellare, Oded Goldreich, Shafi Goldwasser

claim paper

Read More »