Sciweavers

AAECC
2008
Springer
90views Algorithms» more  AAECC 2008»
13 years 4 months ago
Maximal AMDS codes
T. L. Alderson, Aiden A. Bruen
AAECC
2008
Springer
63views Algorithms» more  AAECC 2008»
13 years 5 months ago
Probabilistic algorithms for computing resolvent representations of regular differential ideals
In a previous article [14], we proved the existence of resolvent representations for regular differential ideals. The present paper provides practical algorithms for computing suc...
Thomas Cluzeau, Evelyne Hubert
AAECC
2008
Springer
83views Algorithms» more  AAECC 2008»
13 years 5 months ago
Fast separable factorization and applications
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
Grégoire Lecerf
AAECC
2008
Springer
101views Algorithms» more  AAECC 2008»
13 years 5 months ago
In search of mathematical primitives for deriving universal projective hash families
We provide some guidelines for deriving new projective hash families of cryptographic interest. Our main building blocks are so called group action systems; we explore what propert...
Maria Isabel Gonzalez Vasco, Jorge Luis Villar
AAECC
2008
Springer
85views Algorithms» more  AAECC 2008»
13 years 5 months ago
In memoriam Thomas Beth
Jacques Calmet, Willi Geiselmann
AAECC
2008
Springer
110views Algorithms» more  AAECC 2008»
13 years 5 months ago
Adding constants to string rewriting
We consider unary term rewriting, i.e., term rewriting with unary signatures where all function symbols are either unary or constants. Terms over such signatures can be transformed...
René Thiemann, Hans Zantema, Jürgen Gi...