Heinrich Rolletschek

According to our database1, Heinrich Rolletschek authored at least 9 papers between 1983 and 1995.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1995
Some New Lattice Constructions in High R. E. Degrees.
Math. Log. Q., 1995

1993
A Variant of the Notion of Semicreative Set.
Math. Log. Q., 1993

1988
Shortest Division Chains in Imaginary Quadratic Number Fields.
Proceedings of the Symbolic and Algebraic Computation, 1988

1986
On the Number of Divisions of the Euclidean Algorithm Applied to Gaussian Integers.
J. Symb. Comput., 1986

1985
Algorithm 628: An Algorithm for Constructing Canonical Bases of Polynomial Ideals.
ACM Trans. Math. Softw., 1985

Complexity of Certain Decision Problems about Congruential Languages.
J. Comput. Syst. Sci., 1985

Arithmetic in Quadratic Fields with Unique Factorization.
Proceedings of the EUROCAL '85, 1985

1983
Closure Properties of Almost-Finiteness Classes in Recursive Function Theory.
J. Symb. Log., 1983

The Euclidean algorithm for Gaussian integers.
Proceedings of the Computer Algebra, 1983


  Loading...