recentpopularlog in

data-structures

« earlier   
Transparency Logs via Append-Only Authenticated Dictionaries
Unfortunately, without additional trust assumptions, current transparency
logs cannot provide both small-sized lookup proofs and small-sized
append-only proofs. In fact, one of the proofs always requires bandwidth linear in the size of the log, making it expensive for everyone
to query the log. In this paper, we address this gap with a new
primitive called an append-only authenticated dictionary (AAD).
Our construction is the first to achieve (poly)logarithmic size for
both proof types and helps reduce bandwidth consumption in transparency logs. This comes at the cost of increased append times and
high memory usage, both of which remain to be improved to make
practical deployment possible.
append-only  crypto  data-structures  via:randombit 
24 days ago by graydon
GitHub - kyleburton/clj-bloom: Bloom Filter implementation in Clojure
Bloom Filter implementation in Clojure. Contribute to kyleburton/clj-bloom development by creating an account on GitHub.
algorithms  clojure  data-structures  bloom-filter  probablistic-data-structures 
5 weeks ago by id1
Big-O Algorithm Complexity Cheat Sheet
This webpage covers the space and time Big-O complexities of common algorithms used in Computer Science. When preparing for technical interviews in the past, I found myself spending hours crawling the internet putting together the best, average, and worst case complexities for search and sorting algorithms so that I wouldn't be stumped when asked about them.
data-structures  algorithms  performance  cheatsheet  reference 
5 weeks ago by liqweed
Big-O Cheat Sheet
A summary of data structures operations and algorithms costs.
algorithms  data-structures  performance  cheatsheet  reference 
5 weeks ago by liqweed

Copy this bookmark:





to read