Publications of the cosec research group (von zur Gathen, Bonn-Aachen International Center for Information Technology)

Subject area: parallel computation (sorted by year)

Last generated: 13 May 2012, 03:35.

There is also a BibTeX file corresponding to this list.

The local PDFs contained in this page are included as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that these works are posted here electronically. It is understood that all persons copying any of these documents will adhere to the terms and constraints invoked by each copyright holder, and in particular use them only for noncommercial purposes. These works may not be posted elsewhere without the explicit written permission of the copyright holder.

2003

Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael Saks & Igor Shparlinski (2003). Complexity of some arithmetic problems for binary polynomials. computational complexity 12(1/2), 23-47. Link to electronic version. Local PDF (399KB).

C. Grabbe, M. Bednara, J. Shokrollahi, J. Teich & J. von zur Gathen (2003). FPGA Designs of parallel high performance GF(2²³³) Multipliers. In Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS-03), volume II, 268-271. Bangkok, Thailand. Local PDF (244KB).

C. Grabbe, M. Bednara, J. Shokrollahi, J. Teich & J. von zur Gathen (2003). A High Performance VLIW Processor for Finite Field Arithmetic. In Proc. of The 10th Reconfigurable Architectures Workshop (RAW-03). Local PDF (185KB).

2002

M. Bednara, M. Daldrup, J. Shokrollahi, J. Teich & J. von zur Gathen (2002). Reconfigurable Implementation of Elliptic Curve Crypto Algorithms. In Proc. of The 9th Reconfigurable Architectures Workshop (RAW-02), 157-164. Fort Lauderdale FL, USA. Local PDF (193KB).

M. Bednara, M. Daldrup, J. Shokrollahi, J. Teich & J. von zur Gathen (2002). Tradeoff Analysis of FPGA Based Elliptic Curve Cryptography. In Proc. of the IEEE International Symposium on Circuits and Systems (ISCAS-02), volume V, 797-800. Scottsdale, Arizona, U.S.A. Link to PDF version. Local PDF (109KB).

2001

Olaf Bonorden, Joachim von zur Gathen, Jürgen Gerhard, Olaf Müller & Michael Nöcker (2001). Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin 35(1), 16-18. Link to electronic version. Local PDF (194KB).

2000

Joachim von zur Gathen & Igor Shparlinski (2000). The CREW PRAM complexity of modular inversion. SIAM Journal on Computing 29(6), 1839-1857. Link to electronic version. Local PDF (306KB).

Michael Nöcker (2000). Some Remarks on Parallel Exponentiation: Extended Abstract. In Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation ISSAC2000, St. Andrews, Scotland, Carlo Traverso, editor, 250-257.

1998

Joachim von zur Gathen & Igor Shparlinski (1998). The CREW PRAM complexity of modular inversion. In Proceedings of LATIN ’98, Campinas, Brazil, C. L. Lucchesi & A. V. Moura, editors, number 1380 in Lecture Notes in Computer Science, 305-315. Springer-Verlag, Berlin, Heidelberg. ISBN 3-540-64275-7. ISSN 0302-9743. Link to electronic version. Final version in SIAM Journal on Computing. Local PDF (262KB).

1997

Joachim von zur Gathen & Michael Nöcker (1997). Exponentiation in Finite Fields: Theory and Practice. In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes: AAECC-12, Toulouse, France, Teo Mora & Harold Mattson, editors, number 1255 in Lecture Notes in Computer Science, 88-113. Springer-Verlag. ISSN 0302-9743. Link to electronic version. Local PDF (414KB).

1993

Joachim von zur Gathen (1993). Parallel linear algebra. In Synthesis of parallel algorithms, J. Reif, editor, 573-617. Morgan Kaufmann Publishers.

1992

Joachim von zur Gathen (1992). Processor-efficient exponentiation in finite fields. Information Processing Letters 41, 81-86. Link to electronic version.

1991

Joachim von zur Gathen (1991). Efficient and optimal exponentiation in finite fields. computational complexity 1, 360-394. Link to electronic version.

Joachim von zur Gathen (1991). Efficient exponentiation in finite fields. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, San Juan PR, 384-391. IEEE Computer Society Press, Los Alamitos CA. Final version in computational complexity, see von zur Gathen (1991a).

1990

Joachim von zur Gathen (1990). Inversion in finite fields using logarithmic depth. Journal of Symbolic Computation 9, 175-183. Link to electronic version.

1987

Joachim von zur Gathen (1987). Computing powers in parallel. SIAM Journal on Computing 16, 930-945. Link to electronic version.

1986

Joachim von zur Gathen (1986). Parallel Arithmetic computations: a survey. In Proceedings of the 12th International Symposium Mathematical Foundations of Computer Science 1986, Bratislava, Czechosolvakia, Jozef Gruska, Branislav Rovan & Juraj Wiedermann, editors, volume 233 of Lecture Notes in Computer Science, 93-112. Springer-Verlag, Berlin, Heidelberg. ISBN 3-540-16783-8. ISSN 0302-9743. Link to electronic version.

Joachim von zur Gathen (1986). Representations and parallel computations for rational functions. SIAM Journal on Computing 15(2), 432-452. Link to electronic version.

1984

Joachim von zur Gathen (1984). Parallel algorithms for algebraic problems. SIAM Journal on Computing 13(4), 802-824.

Joachim von zur Gathen (1984). Parallel powering. In Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, Singer Island FL, 31-36. IEEE Computer Society Press. Final version in SIAM Journal on Computing. Local PDF (297KB).

1983

Joachim von zur Gathen (1983). Representations and parallel Computations for rational Functions. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, Tucson AZ, 133-137. IEEE Computer Society Press. Final version in SIAM Journal on Computing. Local PDF (166KB).