Sciweavers

83
Voted
AAECC
2015
Springer
23views Algorithms» more  AAECC 2015»
10 years 7 days ago
Computing fundamental groups from point clouds
We describe an algorithm for computing a finite, and typically small, presentation of the fundamental group of a finite regular CW-space. The algorithm is based on the constructi...
Piotr Brendel, Pawel Dlotko, Graham Ellis, Mateusz...
61
Voted
AAECC
2015
Springer
4views Algorithms» more  AAECC 2015»
10 years 7 days ago
Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
The present paper investigates properties of quasi stable ideals and of Borel-fixed ideals in a polynomial ring k[x0, . . . , xn], in order to design two algorithms: the first on...
Cristina Bertone
71
Voted
AAECC
2015
Springer
7views Algorithms» more  AAECC 2015»
10 years 7 days ago
The Rabin cryptosystem revisited
The Rabin scheme used in public-key cryptosystem is here revisited with a focus limited to a few specific open issues. In particular, message decryption requires one out of four ...
Michele Elia, Matteo Piva, Davide Schipani
71
Voted
AAECC
2015
Springer
6views Algorithms» more  AAECC 2015»
10 years 7 days ago
Trace representation of pseudorandom binary sequences derived from Euler quotients
Zhixiong Chen, Xiaoni Du, Radwa Marzouk