1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Optimal Uncoordinated Unique IDs
Peter C. Dillinger, Martín Farach-Colton, Guido Tagliavini +1
In the Uncoordinated Unique Identifiers Problem (UUIDP) there are independent instances of an algorithm that generates IDs from a universe , and…
cs.DS2023★ 1 cited
An Associativity Threshold Phenomenon in Set-Associative Caches
Michael A. Bender, Rathish Das, Martín Farach-Colton +1
In an -way set-associative cache, the cache is partitioned into disjoint sets of size , and each item can only be cached in one set, typically selected via a hash function. S…