Alternatives and similar repositories for foxxll:

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

• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• pasta-toolbox / bit_vector
  Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.
  ☆29Updated 3 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 8 months ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆45Updated 6 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆30Updated last month
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• lemire / simdpcg
  Vectorized version of the PCG random number generator
  ☆76Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 5 years ago
• STEllAR-GROUP / hpxcl
  This repository contains components that will support percolation via OpenCL and CUDA
  ☆31Updated 3 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• omarobeya / parallel-inplace-radixsort
  ☆21Updated 3 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆105Updated 11 years ago
• tetzank / SIMDSetOperations
  testbed for different SIMD implementations for set intersection and set union
  ☆41Updated 5 years ago
• cmu-sei / gbtl
  GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org
  ☆133Updated last year
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• fast-pack / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆51Updated last year
• marvinwilliams / multiqueue
  ☆17Updated 3 weeks ago
• jwbuurlage / Bulk
  A modern interface for implementing bulk-synchronous parallel programs.
  ☆93Updated 2 years ago
• UWHustle / Efficiently-Searching-In-Memory-Sorted-Arrays
  Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?
  ☆28Updated 3 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 5 months ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆104Updated 10 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago