TU Darmstadt / ULB / TUbiblio

Browse by Person

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Group by: No Grouping | Item Type | Date | Language
Number of items: 10.

Teske, Edlyn (1999):
The Pohlig-Hellman Method Generalized for Group Structure Computation.
In: >Journal of Symbolic Computation, pp. 521-534, 27, (6), [Article]

Teske, Edlyn (1998):
Speeding Up Pollard's Rho Method for Computing Discrete Logarithms.
In: ANTS-III - Algorithmic Number Theory, Third International Symposium, Springer, Portland, Oregon, USA, In: LNCS, ISBN 3-540-64657-4,
[Conference or Workshop Item]

Teske, Edlyn (1998):
Algorithms for Finite Abelian Groups.
Shaker, Technische Universität Darmstadt, ISBN 978-3826540455,
[Ph.D. Thesis]

Teske, Edlyn (1998):
The Pohlig-Hellman Method Generalized for Group Structure Computation.
(TI-7/98), [Report]

Teske, Edlyn (1998):
Speeding up Pollard's Rho Method for Computing Discrete Logarithms.
(TI-1/98), [Report]

Teske, Edlyn (1998):
A space efficient algorithm for group structure computation.
In: >Mathematics of Computation, pp. 1637-1663, 67, (224), [Article]

Teske, Edlyn (1997):
A space efficient algorithm for group structure computation.
Darmstadt: Techn. Hochschule, FB 20, Inst. für Theoretische Informatik, 1997. 29 S,
Darmstadt, Techn. Hochschule, FB Informatik, [Book]

Buchmann, Johannes and Jacobson, Michael J. and Teske, Edlyn (1997):
On some computational problems in finite abelian groups.
In: >Mathematics in Computation, pp. 1663-1687, 66, (220), [Article]

Teske, Edlyn (1997):
A Space Efficient Algorithm for Group Structure Computation.
(TI-3/97), [Report]

Buchmann, Johannes and Jacobson, Michael J. and Teske, Edlyn (1996):
On some computational problems in finite abelian groups.
(TI-2/96), [Report]

This list was generated on Sat Sep 21 00:50:27 2019 CEST.