- Hans
Zantema (1956) is a
Dutch mathematician and
computer scientist, and
professor at
Radboud University in Nijmegen,
known for his work on termination...
-
Revised Edition, Boston:
Allyn and Bacon, LCCN 68-15225 J.D. Fokker, H.
Zantema, S.D.
Swierstra (1991). "Iteratie en invariatie",
Programmeren en Correctheid...
- are permitted. This is
easily seen as follows, by an
argument from Hans
Zantema.
Divide the
positions of the
board into A, B and C
positions as follows:...
- Péter 1935.
Robinson 1948.
Ritchie 1965, p. 1028. Buck 1963.
Meeussen &
Zantema 1992, p. 6.
Munafo 1999a.
Ritchie 1965.
Sundblad 1971.
Porto &
Matos 1980...
- by L.Ciompi&A.Seville "A
probabilistic analysis of the Game of the Goose" by J.F. Groote, F.
Wiedijk and H.
Zantema, SIAM
Reviews 58(1):143–155, 2016...
-
challenging open problem. For yet
another type of
relevant generalisation, Hans
Zantema suggested the
notion of a k-semi-transitive
orientation refining the notion...
-
Systems Analysis and
Design Method Moti Yung
Lotfi Zadeh –
fuzzy logic Hans
Zantema –
termination analysis Arif
Zaman – pseudo-random
number generator Stanley...
- Int. Conf., RTA-06. LNCS. Vol. 4098. Springer. pp. 257–266. Marché, C.;
Zantema, H. (2007). "The
Termination Competition (system description)". In Baader...
-
Vertegaal AC,
Whiteside ST, Israël A,
Toebes M,
Dorsman JC, van der Eb AJ,
Zantema A (June 1997). "IkappaB
alpha is a
target for the mitogen-activated 90...
- (a−1)−1⋅1 to
obtain the term a; no
other rules are applicable. Walters, H.R.;
Zantema, H. (Oct 1994). "Rewrite
systems for
integer arithmetic" (PDF). Utrecht...
