UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Lock-free dynamic hash tables with open addressing

Distributed computing, 2005-07, Vol.18 (1), p.21-42

2005

Volltextzugriff (PDF)

Splitting forward simulations to cope with liveness

Acta informatica, 2006-04, Vol.42 (8-9), p.583-602

HESSELINK, Wim H

2006

Volltextzugriff (PDF)

Using eternity variables to specify and prove a serializable database interface

Science of computer programming, 2004-05, Vol.51 (1), p.47-85

Hesselink, Wim H.

2004

Volltextzugriff (PDF)

Eternity Variables to Simulate Specifications

Lecture notes in computer science, 2002, p.117-130

2002

Volltextzugriff (PDF)

Salembier's Min-tree algorithm turned into breadth first search

Information processing letters, 2003-12, Vol.88 (5), p.225-229

Hesselink, Wim H.

2003

Volltextzugriff (PDF)

An assertional proof for a construction of an atomic variable

Formal aspects of computing, 2004-11, Vol.16 (4), p.387-393

HESSELINK, Wim H

2004

Volltextzugriff (PDF)

A Formal Reduction for Lock-Free Parallel Algorithms

Computer Aided Verification, 2004, p.44-56

2004

Volltextzugriff (PDF)

A generalization of Naundorf's fixpoint theorem

Theoretical computer science, 2000-09, Vol.247 (1), p.291-296

Hesselink, Wim H.

2000

Volltextzugriff (PDF)

Preference rankings in the face of uncertainty

Acta informatica, 2003-03, Vol.39 (3), p.211-231

HESSELINK, Wim H

2003

Volltextzugriff (PDF)

Fixpoint semantics and simulation

Theoretical computer science, 2000-05, Vol.238 (1), p.275-311

2000

Volltextzugriff (PDF)

An algorithm for the asynchronous Write-All problem based on process collision

Distributed computing, 2001-04, Vol.14 (2), p.75-81

2001

Volltextzugriff (PDF)

Invariants for the construction of a handshake register

Information processing letters, 1998-11, Vol.68 (4), p.173-177

Hesselink, Wim H.

1998

Volltextzugriff (PDF)

Concurrent determination of connected components

Science of computer programming, 2001-10, Vol.41 (2), p.173-194

2001

Volltextzugriff (PDF)

Lock-Free Parallel Garbage Collection

Lecture notes in computer science, 2005, p.263-274

2005

Volltextzugriff (PDF)

Progress under bounded fairness

Distributed computing, 1999-09, Vol.12 (4), p.197-207

Hesselink, Wim H.

1999

Volltextzugriff (PDF)

Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)

Distributed computing, 2001-01, Vol.14 (1), p.31-39

2001

Volltextzugriff (PDF)

Nondeterminacy and recursion via stacks and games

Theoretical computer science, 1994-02, Vol.124 (2), p.273-295

Hesselink, Wim H

1994

Volltextzugriff (PDF)

Wait-free linearization with an assertional proof

Distributed computing, 1994-10, Vol.8 (2), p.65-80

Hesselink, Wim H.

1994

Volltextzugriff (PDF)

Bounded delay for a free address

Acta informatica, 1996-05, Vol.33 (3), p.233-254

HESSELINK, W. H

1996

Volltextzugriff (PDF)

Processes and formalisms for unbounded choice

Theoretical computer science, 1992-06, Vol.99 (1), p.105-119

Hesselink, Wim H.

1992

Volltextzugriff (PDF)

LR-parsing derived

Science of computer programming, 1992-11, Vol.19 (2), p.171-196

Hesselink, Wim H.

1992

Volltextzugriff (PDF)

Repetitions, known or unknown?

Information processing letters, 1991-10, Vol.40 (1), p.51-57

Hesselink, Wim H.

1991

Volltextzugriff (PDF)

Interpretations of recursion under unbounded nondeterminacy

Theoretical computer science, 1988-01, Vol.59 (3), p.211-234

Hesselink, Wim H.

1988

Volltextzugriff (PDF)

Deadlock and fairness in morphisms of transition systems

Theoretical computer science, 1988-01, Vol.59 (3), p.235-257

Hesselink, Wim H.

1988

Volltextzugriff (PDF)

A mathematical approach to nondeterminism in data types

ACM transactions on programming languages and systems, 1988-01, Vol.10 (1), p.87-117

Hesselink, Wim H.

1988

Volltextzugriff (PDF)

1 – 25 von 53

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(44)
Mit Volltextzugriff
(51)

Publikationsform

Sprache

Englisch
(53)

Erscheinungsjahr

n.n

Menü

Weitere Dienste

Einstellungen

Lock-free dynamic hash tables with open addressing

Splitting forward simulations to cope with liveness

Using eternity variables to specify and prove a serializable database interface

Eternity Variables to Simulate Specifications

Salembier's Min-tree algorithm turned into breadth first search

An assertional proof for a construction of an atomic variable

A Formal Reduction for Lock-Free Parallel Algorithms

A generalization of Naundorf's fixpoint theorem

Preference rankings in the face of uncertainty

Fixpoint semantics and simulation

An algorithm for the asynchronous Write-All problem based on process collision

Invariants for the construction of a handshake register

Concurrent determination of connected components

Lock-Free Parallel Garbage Collection

Progress under bounded fairness

Wait-free concurrent memory management by Create and Read until Deletion (CaRuD)

Nondeterminacy and recursion via stacks and games

Wait-free linearization with an assertional proof

Bounded delay for a free address

Processes and formalisms for unbounded choice

LR-parsing derived

Repetitions, known or unknown?

Interpretations of recursion under unbounded nondeterminacy

Deadlock and fairness in morphisms of transition systems

A mathematical approach to nondeterminism in data types

Suchergebnisse filtern