Sciweavers

STOC
1995
ACM
194views Algorithms» more  STOC 1995»
15 years 5 months ago
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals
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
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
15 years 5 months ago
Geometric lower bounds for parametric matroid optimization
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
122
Voted
STOC
1995
ACM
126views Algorithms» more  STOC 1995»
15 years 5 months ago
A computational view of population genetics
This paper contributes tothe study of nonlinear dynamical systems from a computational perspective. These systems are inherently more powerful than their linear counterparts (such...
Yuval Rabani, Yuri Rabinovich, Alistair Sinclair
122
Voted
STOC
1995
ACM
135views Algorithms» more  STOC 1995»
15 years 5 months ago
Subquadratic-time factoring of polynomials over finite fields
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
Erich Kaltofen, Victor Shoup
STOC
1995
ACM
107views Algorithms» more  STOC 1995»
15 years 5 months ago
Incremental cryptography and application to virus protection
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
Algorithms
Top of PageReset Settings