2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DC2014
On the Importance of Registers for Computability
Rati Gelashvili, Mohsen Ghaffari, Jerry Li +1
All consensus hierarchies in the literature assume that we have, in addition to copies of a given object, an unbounded number of registers. But why do we really need these register…
cs.DS2014★ 2 cited
Replacing Mark Bits with Randomness in Fibonacci Heaps
Jerry Li, John Peebles
A Fibonacci heap is a deterministic data structure implementing a priority queue with optimal amortized operation costs. An unfortunate aspect of Fibonacci heaps is that they must…