1 citations · 2 across the 2 of their papers we have counts for
3 papers
Lock-Free Hopscotch Hashing
Robert Kelly, Barak A. Pearlmutter, Phil Maguire
In this paper we present a lock-free version of Hopscotch Hashing. Hopscotch Hashing is an open addressing algorithm originally proposed by Herlihy, Shavit, and Tzafrir, which is k…
Concurrent Robin Hood Hashing
Robert Kelly, Barak A. Pearlmutter, Phil Maguire
In this paper we examine the issues involved in adding concurrency to the Robin Hood hash table algorithm. We present a non-blocking obstruction-free K-CAS Robin Hood algorithm whi…
Evolving the Incremental λ Calculus into a Model of Forward Automatic Differentiation (AD)
Robert Kelly, Barak A. Pearlmutter, Jeffrey Mark Siskind
Formal transformations somehow resembling the usual derivative are surprisingly common in computer science, with two notable examples being derivatives of regular expressions and d…