77 citations · 269 across the 54 of their papers we have counts for
59 papers
Bloom Filter Look-Up Tables for Private and Secure Distributed Databases in Web3 (Revised Version)
Shlomi Dolev, Ehud Gudes, Daniel Shlomo
The rapid growth of decentralized systems in theWeb3 ecosystem has introduced numerous challenges, particularly in ensuring data security, privacy, and scalability [3, 8]. These sy…
DynamicAdaptiveClimb: Adaptive Cache Replacement with Dynamic Resizing
Daniel Berend, Shlomi Dolev, Sweta Kumari +3
Efficient cache management is critical for optimizing the system performance, and numerous caching mechanisms have been proposed, each exploring various insertion and eviction stra…
Linear time small coresets for k-mean clustering of segments with applications
David Denisov, Shlomi Dolev, Dan Felmdan +1
We study the -means problem for a set of segments, aiming to find centers that minimize $D(\mathcal{S},X)…
The Steiner Shortest Path Tree Problem
Omer Asher, Yefim Dinitz, Shlomi Dolev +2
We introduce and study a novel problem of computing a shortest path tree with a minimum number of non-terminals. It can be viewed as an (unweighted) Steiner Shortest Path Tree (SSP…
Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
Shlomi Dolev
Consider graphs of n nodes, and use a Bloom filter of length 2 log3 n bits. An edge between nodes i and j, with i < j, turns on a certain bit of the Bloom filter according to a has…
Self-Stabilizing Replicated State Machine Coping with Byzantine and Recurring Transient Faults
Shlomi Dolev, Amit Hendin, Maurice Herlihy +2
The ability to perform repeated Byzantine agreement lies at the heart of important applications such as blockchain price oracles or replicated state machines. Any such protocol req…