2 citations · 3 across the 5 of their papers we have counts for
Showing cs.DCShow all
3 papers · 1 filter
cs.DC2024
Distributed Agreement in the Arrovian Framework
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
Preference aggregation is a fundamental problem in voting theory, in which public input rankings of a set of alternatives (called preferences) must be aggregated into a single pref…
cs.DC2024
Optimal Multilevel Slashing for Blockchains
Kenan Wood, Hammurabi Mendes, Jonad Pulaj
We present the notion of multilevel slashing, where proof-of-stake blockchain validators can obtain gradual levels of assurance that a certain block is bound to be finalized in a g…
cs.DC2019
Using Skip Graphs for Increased NUMA Locality
Samuel Thomas, Ana Hayne, Jonad Pulaj +1
We present a data partitioning technique performed over skip graphs that promotes significant quantitative and qualitative improvements on NUMA locality in concurrent data structur…