Alternatives and similar repositories for diagonalsw:

Users that are interested in diagonalsw are comparing it to the libraries listed below

• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 7 months ago
• lemire / costofsafety
  Quick experiment to see how expensive safety is in C, for research
  ☆12Updated 5 years ago
• art4711 / bmap_find
  finding set bits in large bitmaps
  ☆15Updated 9 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• attractivechaos / sann
  Simply feedforward neural network
  ☆19Updated 8 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated 11 months ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆29Updated 2 years ago
• nicola-gigante / bitvector
  A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …
  ☆22Updated 2 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆14Updated 8 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated last year
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated 11 months ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆55Updated last year
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆49Updated 9 months ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago
• wangyi-fudan / wyHLL
  The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.
  ☆55Updated 3 years ago
• schani / linbin
  Linear vs binary search benchmark
  ☆40Updated 5 years ago
• thomasmueller / xorfilter_cpp
  Bloom filter alternative (C++)
  ☆17Updated 6 years ago
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆26Updated 5 years ago
• lemire / programmingishard
  Long-term book project
  ☆34Updated 3 years ago
• WojciechMula / simd-byte-lookup
  SIMDized check which bytes are in a set
  ☆28Updated 6 years ago
• noporpoise / jelly-hash
  Low memory multithreaded hash table
  ☆24Updated 9 years ago
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 2 years ago