Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits
☆17Oct 15, 2024Updated last year
Alternatives and similar repositories for hyperbitbit
Users that are interested in hyperbitbit are comparing it to the libraries listed below
Sorting:
- HyperTwoBits implementation☆17Aug 29, 2025Updated 6 months ago
- Code for experiments with nearly optimally adaptive mergesort variants peeksort and powersort☆18Dec 3, 2018Updated 7 years ago
- A short book on teaching in the University of Washington Informatics undergraduate program.☆11Mar 12, 2024Updated 2 years ago
- Utility library for the Princeton COS' LIFT.☆14Dec 8, 2022Updated 3 years ago
- Four-year course planner for Princeton University students☆18Feb 24, 2026Updated 3 weeks ago
- Supplementary material for solving projects assigned in The Data Mine.☆27Mar 12, 2026Updated last week
- Amy's faculty webpage☆25Updated this week
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆11Jan 8, 2024Updated 2 years ago
- fast kernel evaluation in high dimensions via hashing☆25Oct 21, 2020Updated 5 years ago
- SuperMinHash: A New Minwise Hashing Algorithm for Jaccard Similarity Estimation☆25Jan 1, 2018Updated 8 years ago
- ☆19Updated this week
- Erlang implementation of strftime☆14Oct 27, 2016Updated 9 years ago
- Count how many bits are set (population count) in C++ using POPCNT via inline assembly and gcc intrinsics (with benchmarks)☆16May 9, 2011Updated 14 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- Scalable DBSCAN and OPTICS for clustering high-dimensional datasets using random projections☆13Nov 1, 2024Updated last year
- KaPoCE is a framework for solving the cluster editing problem that asks to transform an input graph into a cluster graph (a disjoint unio…☆11Dec 19, 2022Updated 3 years ago
- Subsampled Graph-Based DBSCAN☆11Oct 21, 2020Updated 5 years ago
- LogLog based Cardinality Estimator☆63Nov 14, 2017Updated 8 years ago
- Test Kitchen for LX Zones☆12May 8, 2018Updated 7 years ago
- A library to compile USDT probes into a Rust library☆48Aug 27, 2024Updated last year
- Tremor Language Server (Trill)☆13Apr 18, 2024Updated last year
- Fast, vector-based map implementation that preserves insertion order.☆14May 1, 2020Updated 5 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆14Mar 4, 2020Updated 6 years ago
- LAN discovery and presence in Erlang.☆39Aug 8, 2014Updated 11 years ago
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆13Sep 5, 2021Updated 4 years ago
- C++ implementations of Powersort and 4-way Powersort☆26Jan 7, 2025Updated last year
- HyperBitBit☆136Mar 21, 2017Updated 8 years ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 7 months ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated last week
- ☆12Jul 4, 2020Updated 5 years ago
- Falconn++ is a locality-sensitive filtering (LSF) approach, built on top of cross-polytope LSH (FalconnLib) to answer approximate nearest…☆13Aug 5, 2024Updated last year
- Automated detection of gaps in bicycle networks: source code for IPDC procedure☆14Jul 12, 2022Updated 3 years ago
- Vector Index Benchmark for Embeddings (VIBE) is an extensible benchmark for approximate nearest neighbor search methods, or vector index…☆36Mar 4, 2026Updated 2 weeks ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Aug 11, 2021Updated 4 years ago
- Splice two UDP sockets in kernel space to get the best performance☆11Oct 22, 2017Updated 8 years ago
- C library to compute the Hamming weight of arrays☆51Dec 9, 2018Updated 7 years ago
- 🕵️♀️ Observatoire de la qualité des démarches en ligne☆11Feb 27, 2024Updated 2 years ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆18Apr 27, 2023Updated 2 years ago