1. Thomas Zeugmann,
   Improved Parallel Computations in the Ring Z_p^α,
   Journal of Information Processing and Cybernetics (EIK) 25, No. 10, 1989, 543–547.
   Abstract.
2. Thomas Zeugmann, Parallel Algorithms,
   Encyclopedia of Computer Science and Technology, Vol. 21, Supplement 6, Allen Kent and James G. Williams (Eds.), pp. 223 - 244, Marcel Dekker Inc. New York and Basel, 1990.
   Abstract
3. Thomas Zeugmann,
   Computing Large Polynomial Powers Very Fast in Parallel, in “Mathematical Foundations of Computer Science 1990, Banská Bystrica, Czechoslovakia, August 1990, Proceedings,” B. Rovan (Ed.), Lecture Notes in Computer Science 452, pp. 538 - 544, Springer-Verlag 1990.
   Abstract
4. Thomas Zeugmann,
   Highly Parallel Computations modulo a Number Having only Small Prime Factors, Information & Computation Vol. 96, No. 1, 1992, 95 - 114.
   Abstract
5. T. Erlebach, P. Rossmanith, H. Stadtherr, A. Steger, and T. Zeugmann,
   Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, Theoretical Computer Science Vol. 261, Issue 1, 2001, 119-156. (Special Issue for ALT'97).
   Abstract (and link to our pattern language learning page).

"thomas" at "ist.hokudai.ac.jp"

©Copyright Notice:
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Last update May 08, 2020.