Sciweavers

STOC
1995
ACM
194views Algorithms» more  STOC 1995»
13 years 11 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»
13 years 11 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
STOC
1995
ACM
89views Algorithms» more  STOC 1995»
13 years 11 months ago
What do we know about the Metropolis algorithm?
Persi Diaconis, Laurent Saloff-Coste
STOC
1995
ACM
107views Algorithms» more  STOC 1995»
13 years 11 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
STOC
1995
ACM
91views Algorithms» more  STOC 1995»
13 years 11 months ago
Bandwidth allocation with preemption
Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Ma...
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
13 years 11 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
STOC
1995
ACM
114views Algorithms» more  STOC 1995»
13 years 11 months ago
Sorting in linear time?
Arne Andersson, Torben Hagerup, Stefan Nilsson, Ra...