1.
� |
H. Peter Gumm, Manfred Sommer : Informatik
- FormaleSprachen, Compilerbau, Berechenbarkeit und
Komplexität, (2019), 251 pages. � |
2.
|
H. Peter Gumm, Manfred Sommer : Informatik -
Rechnerarchitektur, Betriebssysteme, Rechnernetze, (2017), 332 pages. � |
3.
|
H. Peter Gumm, Manfred Sommer : Informatik -
Programmierung, Algorithmen und Datenstrukturen, (2016), 450 pages. |
4.
|
H. Peter Gumm, Manfred Sommer : Einführung in die Informatik. � |
5.
H.
Peter Gumm : Geometrical Methods in Congruence
Modular Varieties. |
6.
H. Peter Gumm, Werner Poguntke
: Boolesche Algebra. |
7.
H.
Peter Gumm, ed., CMCS'03 - Coalgebraic Methods
in Computer Science. |
8.
H. Peter Gumm : Universelle Coalgebra.
|
9.
H.
Peter Gumm (Guest editor) : Selected Papers of
CMCS03. |
10.
H. Peter Gumm, Mona Taheri: Saturated Kripke Structures as Vietoris Coalgebras.
Springer LNCS 13225, Coalgebraic Methods in Computer Science, 16th IFIP WG 1.3, 2022.
arXiv:2001.08453
11.
H. Peter Gumm, Ralph S. Freese: Free-lattice functors weakly preserve epi-pullbacks.
Algebra Universalis, 83(2022).
12.
H. Peter Gumm. Free-Algebra Functors from a Coalgebraic Perspective.
In: Petrişan, D., Rot, J. (eds) Coalgebraic Methods in Computer Science.
CMCS 2020.
Lecture Notes in Computer Science, vol 12094.
Springer, Cham(2020).
arXiv: https://doi.org/10.48550/arXiv.2001.08453
13.
H. Peter Gumm: Connected
monads weakly preserve products.
14. Mehdi Zarrad,
H. Peter Gumm: Transitivity
and Difunctionality of Bisimulations.
15. H. Peter Gumm, Mehdi Zarrad : Coalgebraic
Simulations and Congruences. 16. Jiri Adámek,
H. Peter Gumm, Vera Trnková : Presentation of
Set Functors: A coalgebraic
perspective. 17. H. Peter Gumm
: Universal
Coalgebras and their logics. 18. H. Peter Gumm
: Copower Functors. 19. H. Peter Gumm
: On
Minimal Coalgebras. 20. H. Peter Gumm
: On Coalgebras
and Type Transformations. 21. H. Peter Gumm
: From T-Coalgebras to Filter Structures and Transition Systems.
22. H. Peter Gumm, Tobias Schröder :
Types and Coalgebraic
Structure. 23. H. Peter Gumm
: State based systems are coalgebras.
24. H. Peter Gumm, Jesse Hughes,
Tobias Schröder : Distributivity
of Classes of Coalgebras. 25. H. Peter Gumm, Tobias Schröder :
Monoid-Labeled Transition Systems. 26. H. Peter Gumm
: Birkhoffs
variety theorem for coalgebras. 27. H. Peter Gumm, Tobias Schröder :
Coalgebras of bounded
type. 28. H. Peter Gumm, Tobias Schröder :
Products
of coalgebras. 29. H. Peter Gumm, Tobias Schröder :
Coalgebraic structure from weak limit preserving functors. 30. H. Peter Gumm
: Elements of the general theory of coalgebras. 31.
H. Peter Gumm : Programmieren und Beweisen: Experimente mit dem Programmverifizierer
NPPV. 32. H. Peter Gumm
: Functors for Coalgebras. 33. H. Peter Gumm
: Equational and Implicational Classes of Coalgebras. 34. H. Peter Gumm
: Equational and
Implicational Classes of Coalgebras. 35. H. Peter Gumm, Tobias Schröder :
Covarieties
and Complete Covarieties. 36. H. Peter Gumm
: Generating algebraic laws from Imperative
Programs. 37. H. Peter Gumm, Martin Perner : Der Mikrocodesimulator Microsim. 38. H. Peter Gumm
: Another Glance at the Alpern-Schneider
Theorem. 39.
H.
Peter Gumm : MUNITY - Munich
UNITY Assistant. 40. H. Peter Gumm, Ferdinand Hergert :
Neural Pascal: A language for Neural Network
Programming. 41. H. Peter Gumm
: Continuations of Logic Programs. 42. Alan Day, H. Peter Gumm : Some Characterizations of
the Commutator. 43. H. Peter Gumm
: Encoding of numbers to detect
typing errors. 44. H. Peter Gumm
: Data Security through check digits. Here is an article from Computerwoche
reporting on this method. 45. H. Peter Gumm
: A new class of check
digit methods for arbitrary number systems. 46. H.Peter Gumm :
Topological
implications in n-permutable varieties. 47. H. Peter Gumm
: Geometrical reasoning and
analogy in Universal Algebras. 48. H. Peter Gumm, Aldo Ursini : Ideals in Universal Algebras. 49. H. Peter Gumm
: Congruence modularity is permutability composed with distributivity.
50. H. Peter Gumm
: The Little Desarguesian Theorem for algebras in modular varieties.
51. H. Peter Gumm
: An easy way
to the commutator in modular varieties. 52. H. Peter Gumm, Christian
Herrmann : Algebras in
modular varieties: Baer refinements, cancellation and isotopy. 53. H. Peter Gumm
: Algebras in
permutable varieties: Geometrical properties of affine algebras. 54. H. Peter Gumm : Über die
Lösungsmengen von Gleichungssystemen über allgemeinen Algebren. 55. H. Peter Gumm
: Is there a Mal'cev theory for finite algebras ?. 56. H. Peter Gumm
: A cancellation theorem for
finite algebras. 57. H. Peter Gumm
: Congruence equalities and Mal'cev conditions in regular equational classes. 58. H. Peter
Gumm : Mal'cev
Conditions in Sums of Varieties and a New Mal'cev
condition. 59. H. Peter Gumm, Dimitry Zhukov : On strong fairness in UNITY 60. H. Peter Gumm
: Halting sets of programs over universal
algebras 61. H. Peter Gumm : Geometrische Methoden in kongruenzmodularen Algebren. 62. H. Peter Gumm
: Algebras in Permutable Varieties. 63. H. Peter Gumm
: Mal'cev Conditions in Sums of
Varieties.
Algebra Universalis, 81(2020).
In Coalgebraic Methods in Computer Science CMCS 2016,
Revised Selected Papers, Ichiro Hasuo (ed.),
Springer Lecture Notes in Computer Science (LNCS), 2016.
Preprint
In Coalgebraic Methods in Computer Science, Marcello Bonsangue (ed.),
Springer Lecture Notes in Computer Science (LNCS), 2014
Preprint
J. of Logic and Computation,
20(5), (2010), pp.991-1015.
Preprint
AJSE-Mathematics, 1
(2009), pp.105-130.
Preprint
Theoretical Computer Science, 410 (2009) pp. 1109-1304.
Preprint
Applied Categorical Structures, 16, pp.313-332, 2008.
Preprint.
Discussiones Mathematicae,
27(2007), pp. 187-197.
CALCO 2005, Springer Lecture Notes in Computer Science (LNCS) 3629, 2005.
Preprint
Algebra Universalis, 53(2005),pp.229-252.
Cubo - Matemática
Educacional, 5, No. 2, (239-262),2003.
Preprint
Theoretical Computer Science, 308(2003), pp. 131-143.
Preprint
Electronic Notes in Theoretical Computer Science, 44(2001).
Contributions to General Algebra 13 (2000), 159 - 173.
Mathematical Structures in Computer Science,12(2002),
565-578.
Preprint
Algebra Universalis 46 (2001), 163 - 185.
Electronic Notes in Theoretical Computer Science 33, (2000).
LUATCS'99, Rand Africaans University, Johannesburg,
South Africa, 1999.
In Informatik und Schule, Reihe Informatik aktuell, A. Schwill (ed.), Springer Verlag, (1999), pp 94--107.
Algebra Universalis, 45 (2001), 135 - 147.
Extended Abstract. RelMiCS'4. The 4th International Seminar on
Relational Methods in Logic, Algebra and Computer Science. Warsaw, 1998.
Theoretical Computer Science 260 (2001), 57-69.
Theoretical Computer Science 260 (2001),71-86.
Theoretical Computer Science 217 (1999), 385-405.
CeBit '95.
Information Processing Letters 47(1993), 291-294.
In Formale Methoden im Entwurf verteilterSysteme,
H.König, (ed.), Saur
Verlag, 1993.
In R.Eckmiller, G.Hartmann,
G.Hauske (Ed.) Parallel Processing in Neural
Systems and Computers, North Holland, 1990.
In C.H.Bergman, R.D.Maddux, D.Pigozzi (eds.), Algebraic
Logic and Universal Algebra in Computer Science, Springer LNCS 425,
1990.
Algebra Universalis 29(1992) 61--78.
Int. J. Appl. Engineering Ed. 2(1986), 61--65.
Statistical Software Newsletter 11(1986), 124--127.
IEEE Transactions on information theory,31
(1985),102--105.
Algebra Universalis 19(1984), 319--321.
In: Universal Algebra and its links to Computer Science, R.Wille,
ed., Research and Exp. in Mathematics 4(1984), 14--28.
Algebra Universalis 19(1984), 45--54.
Arch. Math. 36 (1981), 569--576.
Proc. of the American Math. Soc. 80(1980), 393--397.
Arch. Math. 34(1980), 220--228.
Houston J. of Math. 5(1979), 503--523.
Algebra Universalis 9(1979), 8--34.
Math.Zeitschrift 162(1978), 51--62.
Algebra Universalis 8(1978), 320--329.
Colloquia Math. Soc. J.Bolyai, 29(1977),
341--344.
Acta Sci.Math. 39(1977),
265--272.
Algebra Universalis 5(1975), 56--64.Unpublished
Work and Theses
(manuscript ).
(manuscript 1989).
Habilitationsschrift, TH-Darmstadt, 1980.
Dissertation, TH-Darmstadt, 1976.
Master Thesis, TH-Darmstadt, 1976.