Miros/law Kuty/lowski z (2007)
Martin Dietzfelbinger, Heinz Nixdorf, Fachbereich Mathematik-informatik, Rudiger Reischuk
y Partially supported by DFG grant ME 872/1-4 and by DFG-Forschergruppe "Effiziente Nutzung paralleler
Ugur G. Abdulla, Fachbereich Mathematik-informatik
We study the Dirichlet problem for the nonlinear degenerate and/or singular parabolic equations in a bounded, non-cylindrical and non-smooth domain
Running head: On Embeddings in Cycles Contact author: (2007)
Juraj Hromkovic, Fachbereich Mathematik-informatik, Imrich Vr, Slovak Republik
We prove exact results on dilations in cycles for important parallel computer interconnection networks as complete trees, hypercubes and 2- and 3-dimensional meshes. Moreover we show that trees,...
High Degree Solutions of Low Degree Equations (1998)
Jürgen Gerhard, Fachbereich Mathematik-informatik
, August 21, 1998 Abstract We exhibit a class of proper hypergeometric expressions which lead to a key equation with coefficients of degree at most two and a unique solution of arbitrarily high...
Exponentiation in Finite Fields: Theory and Practice (1997)
Michael Nöcker, Fachbereich Mathematik-informatik
this article is twofold: first, to present and analyze in a unified framework five addition chain algorithms from the literature, plus a new one. This allows their theoretical comparison in Section...
Fast algorithms for Taylor shifts and certain difference equations (1997)
Jürgen Gerhard, Fachbereich Mathematik-informatik
Abstract We analyze six algorithms for computing integral Taylor shifts for polynomials with integral coefficients. We present and analyze a new algorithm for solving the "key equation"...
Arithmetic and factorization of polynomials over F_2 (1996)
Jürgen Gerhard, J Urgen Gerhard, Fachbereich Mathematik-informatik
Abstract We describe algorithms for polynomial multiplication and polynomial factorization over the binary field F2 and their implementation. They allow polynomials of degree up to 100; 000 to be...
Strongly adaptive token distribution (1993)
Brigitte Oesterdiekhoff, Rolf Wanka, Fachbereich Mathematik-informatik
Abstract. The token distribution (TD) problem, an abstract static variant of load balancing, is defined as follows: let M be a (parallel processor) network with processors P. Initially each processor...
Arithmetic and factorization of polynomials over F_2
Jürgen Gerhard, J Urgen Gerhard, Fachbereich Mathematik-informatik
We describe algorithms for polynomial multiplication and polynomial factorization over the binary field F 2 and their implementation. They allow polynomials of degree up to 100; 000 to be factored in...