Jan Reiterman

According to our database1, Jan Reiterman authored at least 18 papers between 1975 and 1995.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1995
Continuous Algebras Revisited.
J. Comput. Syst. Sci., 1995

1994
Banach's Fixed-Point Theorem as a base for data-type equations.
Applied Categorical Structures, 1994

1992
On embedding of graphs into euclidean spaces of small dimension.
J. Comb. Theory, Ser. B, 1992

Onwalpha-compactness.
Discrete Mathematics, 1992

1989
Geometrical embeddings of graphs.
Discrete Mathematics, 1989

Embeddings of Graphs in Euclidean Spaces.
Discrete & Computational Geometry, 1989

A note on monotone paths in labeled graphs.
Combinatorica, 1989

1988
On the logic of continuous algebras.
Notre Dame Journal of Formal Logic, 1988

Embedding of trees in euclidean spaces.
Graphs and Combinatorics, 1988

1987
Dynamic Algebras with Test.
J. Comput. Syst. Sci., 1987

1986
Continuous Semilattices.
Theor. Comput. Sci., 1986

1985
Threshold hypergraphs.
Discrete Mathematics, 1985

1984
From Dynamic Algebras to Test Algebras.
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

1982
Tree Constructions of Free Continuous Algebras.
J. Comput. Syst. Sci., 1982

1981
On Representations of Dynamic Algebras with Reversion.
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980
Dynamic Algebras which are not Kripke Structures.
Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1977
A More Categorical Model of Universal Algebra.
Proceedings of the Fundamentals of Computation Theory, 1977

1975
Automata and Categories - Input Processes.
Proceedings of the Mathematical Foundations of Computer Science 1975, 1975


  Loading...