🗂️ Data Structures - teslartifex · Scour

Sampling Directed Eulerian Tours in $\widetilde O(m^{3/2})$ Time 🔮Speculative Decoding

Rapid GPU-Based Pangenome Graph Layout 🧠Memory Models

Show HN: blqsort – Fast Branchless Quicksort with C++ Interface 🧠Memory Models

github.com·2d·Hacker News

TC-MIS: Maximal Independent Set on Tensor-cores 🕸️Distributed Systems

yamafaktory/hypergraph: Hypergraph is a data structure library to create a directed hypergraph in which a hyperedge can join any number of vertices. 🕸️Knowledge Graphs

github.com·4d·Hacker News

Tree Search With Predictions 🗄️Vector Databases

An experiment with an unforgiving, draconic LSP to help counteract slop ✍️Prompt Engineering

github.com·4d·r/vibecoding

E-Path: Equality Saturation for Control-Flow Graphs 🔬eBPF

Fault-Tolerant ST-Diameter Oracles 🕸️Distributed Systems

ycetl — a header-only library for building data structures at constexpr time and using them at runtime (C++20, no C++26 needed) 🦀Rust Macros

github.com·5d·r/cpp

Agentic Separation Logic Specification Synthesis ⚙️Concurrency Models

fcecin/ces: A client-server Public Computing stack. 🔗IPC

github.com·5d·Hacker News

Covering vertices by sequential stars 🕸️Distributed Systems

PauLIB: A High-Performance Library for Processing Pauli Strings 🔮Speculative Decoding

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth 🤖LLM Inference

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64 🧠Memory Models

A Tight Bound on Localization of Electrical Flows 🔬eBPF

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs 🕸️Network Theory

Log in to enable infinite scrolling