129
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
140
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
172
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
119
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
203
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
Genomes frequently evolve by reversals (i, j) that transform a gene order 1 . . . iiϩ1 . . . jϪ1j . . . n into 1 . . . ijϪ1 . . . iϩ1j . . ....
178
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
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...
151
Voted
STOC
1995
ACM
15 years 10 months ago
1995
ACM
170
click to vote
STOC
1995
ACM
15 years 10 months ago
1995
ACM
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 ...