🌳 Data Structures - emschwartz · Scour

Near-Optimal Heaps and Dijkstra on Pointer Machines 🌳B+ Trees

Best practices for hashing variable-length data structures 💾Binary Formats

dynatrace.com·6d

What are skiplists good for (HN) 🌳B+ Trees

news.ycombinator.com·7h·Hacker News

Quickheap: the fastest comparison-based heap? 🚀Async Optimization

curiouscoding.nl·1d

Getting Started Hash-Based Data Structures in Rust. 🦀Rust

·3d

Show HN: 1990s Game Dev Algorithms for Distributed Systems 🔐MVCC

docs.merca.earth·2d·Hacker News

Algorithms in Java Series 🧮SMT Solvers

baeldung.com·1d

New Techniques for Communication-Efficient Secure Comparison Protocols 🔐Cryptography

eprint.iacr.org·6d

Trial by Fire: From Garbage Excel to Relational Graph with Python and Pandas ⚡ClickHouse

colab.research.google.com·5d·DEV

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs 🔬RaBitQ

Arboretum.hs: Symbolic manipulation for algebras of graphs 🌳B+ Trees

SimdQuickHeap: The QuickHeap Reconsidered ⚡Vectorized Execution

Turnstile Streaming Algorithms Might (Still) as Well Be Linear Sketches, for Polynomial-Length Streams 🔬RaBitQ

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs 🌳B+ Trees

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study 🧮LSH

Navigating Order-(Dis)Order Family Trees via Group-Subgroup Transitions 📑Inverted Indexes

Two Efficient Message-passing Exclusive Scan Algorithms 🔓Lock-Free Structures

The Blockchain Execution Dilemma: Optimizing Revenue XOR Fair Ordering 🚀Async Optimization

Cuts and Gauges for Submodular Width 💰Cost-Based Optimization

A more versatile model for enumerative kernelization: a case study for Vertex Cover 🕸️HNSW

Log in to enable infinite scrolling