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