🌳 Data Structures - tyler · Scour

Near-Optimal Heaps and Dijkstra on Pointer Machines ⚙️Systems Programming

Algorithms in Java Series 🔄Concurrency

baeldung.com·1d

What are skiplists good for (HN) ⚙️Systems Programming

news.ycombinator.com·9h·Hacker News

Quickheap: the fastest comparison-based heap? ⚙️Systems Programming

curiouscoding.nl·1d

I made my C++ vector search engine 16x faster by changing data layout, not the algorithm 🗂️Vector Databases

dubeykartikay.com·5d·Hacker News, r/cpp, r/programming

Issue 334 - ArrayList vs LinkedList Puzzle λFunctional Programming

javaspecialists.eu·1d

Show HN: 1990s Game Dev Algorithms for Distributed Systems 🔲Cellular Automata

docs.merca.earth·2d·Hacker News

New Techniques for Communication-Efficient Secure Comparison Protocols 🔐Cryptography

eprint.iacr.org·6d

Design and Analysis of Algorithms | Electrical Engineering and Computer Science 🔄Concurrency

ocw.mit.edu·4d

Arboretum.hs: Symbolic manipulation for algebras of graphs λFunctional Programming

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study 🌸Bloom Filters

Incremental Strongly Connected Components with Predictions 🗂️Vector Databases

A more versatile model for enumerative kernelization: a case study for Vertex Cover 🗂️Vector Databases

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs 🔄Concurrency

Two Efficient Message-passing Exclusive Scan Algorithms 🔐Cryptography

Maximum Matching and Related Problems in Catalytic Logspace 🌸Bloom Filters

Small Independent Sets versus Small Separator in Geometric Intersection Graphs 🗂️Vector Databases

On the Hardness of Finding Temporally Connected Subgraphs of Any Size 🌸Bloom Filters

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width 🌸Bloom Filters

SimdQuickHeap: The QuickHeap Reconsidered ⚡SIMD

Log in to enable infinite scrolling