Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Bergstra, Jan A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the contribution of backward jumps to instruction sequence expressiveness
Jan A. Bergstra
,
Inge Bethke
Theory of Computing Systems
50
(4), 2012, pp. 706-720
Straight-line instruction sequence completeness for total calculation on cancellation meadows
Jan A. Bergstra
,
Inge Bethke
Theory of Computing Systems
48
(4), 2011, pp. 840-864
A calculus for four-valued sequential logic
Jan A. Bergstra
,
Jaco van de Pol
Theoretical Computer Science
412
(28), 2011, pp. 3122-3128
Polarized process algebra and program equivalence
Jan A. Bergstra
,
Inge Bethke
Lecture Notes in Computer Science
2719
, 2003, pp. 1-21
Branching time and orthogonal bisimulation equivalence
Jan A. Bergstra
,
Alban Ponse
,
Mark B. van der Zwaag
Theoretical Computer Science
309
(1-3), 2003, pp. 313-355
Process algebra and conditional composition
Jan A. Bergstra
,
Alban Ponse
Information Processing Letters
80
(1), 2001, pp. 41-49
Non-regular iterators in process algebra
Jan A. Bergstra
,
Alban Ponse
Theoretical Computer Science
269
(1-2), 2001, pp. 203-229
Kleene's three-valued logic and process algebra
Jan A. Bergstra
,
Alban Ponse
Information Processing Letters
67
(2), 1998, pp. 95-103