2 citations · 3 across the 5 of their papers we have counts for
6 papers
Conditionally complete sponges: new results on generalized lattices
Jasper J. van de Gronde, Wim H. Hesselink
Sponges were recently proposed as a generalization of lattices, focussing on joins/meets of sets, while letting go of associativity/transitivity. In this work we provide tools for…
A distributed resource allocation algorithm for many processes
Wim H. Hesselink
Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes…
Partial mutual exclusion for infinitely many processes
Wim H. Hesselink
Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical section CS of its code only when some finit…
Kekulé Cells for Molecular Computation
W. H. Hesselink, J. C. Hummelen, H. T. Jonkman +3
The configurations of single and double bonds in polycyclic hydrocarbons are abstracted as Kekulé states of graphs. Sending a so-called soliton over an open channel between ports (…
Lock-free dynamic hash tables with open addressing
Hui Gao, Jan Friso Groote, Wim H. Hesselink
We present an efficient lock-free algorithm for parallel accessible hash tables with open addressing, which promises more robust performance and reliability than conventional lock-…
Eternity variables to prove simulation of specifications
Wim H. Hesselink
Simulations of specifications are introduced as a unification and generalization of refinement mappings, history variables, forward simulations, prophecy variables, and backward si…