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
[2]
Hilfe
Suche: Author="Hesselink, Wim H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
Wim H. Hesselink
Acta Informatica
50
(3), 2013, pp. 199-228
A distributed resource allocation algorithm for many processes
Wim H. Hesselink
Acta Informatica
50
(5-6), 2013, pp. 297-329
Finite and infinite implementation of transition systems
Wim H. Hesselink
,
Gerard R. Renardel de Lavalette
Theoretical Computer Science
458
, 2012, pp. 131-135
Nonatomic dual bakery algorithm with bounded tokens
Alex A. Aravind
,
Wim H. Hesselink
Acta Informatica
48
(2), 2011, pp. 67-96
Alternating states for dual nondeterminism in imperative programming
Wim H. Hesselink
Theoretical Computer Science
411
(22-24), 2010, pp. 2317-2330
A queue based mutual exclusion algorithm
Alex A. Aravind
,
Wim H. Hesselink
Acta Informatica
46
(1), 2009, pp. 73-86
Universal extensions to simulate specifications
Wim H. Hesselink
Information and Computation
206
(1), 2008, pp. 108-128
A criterion for atomicity revisited
Wim H. Hesselink
Acta Informatica
44
(2), 2007, pp. 123-151
A linear-time algorithm for Euclidean feature transform sets
Wim H. Hesselink
Information Processing Letters
102
(5), 2007, pp. 181-186
Splitting forward simulations to copewith liveness
Wim H. Hesselink
Acta Informatica
42
(8-9), 2006, pp. 583-602
Refinement verification of the lazy caching algorithm
Wim H. Hesselink
Acta Informatica
43
(3), 2006, pp. 195-222
Preference rankings in the face of uncertainty
Wim H. Hesselink
Acta Informatica
39
(3), 2003, pp. 211-231
Salembier's min-tree algorithm turned into breadth first search
Wim H. Hesselink
Information Processing Letters
88
(5), 2003, pp. 225-229
An assertional criterion for atomicity
Wim H. Hesselink
Acta Informatica
38
(5), 2001, pp. 343-366
Fixpoint semantics and simulation
Wim H. Hesselink
,
Albert Thijs
Theoretical Computer Science
238
(1-2), 2000, pp. 275-311
A generalization of Nundorf's fixpoint theorem
Wim H. Hesselink
Theoretical Computer Science
247
(1-2), 2000, pp. 291-296
Invariants for the construction of a handshake register
Wim H. Hesselink
Information Processing Letters
68
(4), 1998, pp. 173-177
Bounded delay for a free address
Wim H. Hesselink
Acta Informatica
33
(3), 1996, pp. 233-254
Nondeterminacy and recursion via stacks and games
Wim H. Hesselink
Theoretical Computer Science
124
(2), 1994, pp. 273-295
Processes and formalisms for unbounded choice
Wim H. Hesselink
Theoretical Computer Science
99
, 1992, pp. 105-119
Smoothsort revisited
Coenraad Bron
,
Wim H. Hesselink
Information Processing Letters
39
, 1991, pp. 269-276
Predicate-transformer semantics of general recursion
Wim H. Hesselink
Acta Informatica
26
, 1988, pp. 309-332
Interpretations of recursion under unbounded nondeterminacy
Wim H. Hesselink
Theoretical Computer Science
59
, 1988, pp. 211-234
Deadlock and fairness in morphisms of transition systems
Wim H. Hesselink
Theoretical Computer Science
59
, 1988, pp. 235-257