mailund / stralg

Related projects ⓘ

Alternatives and complementary repositories for stralg

• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆28Updated last year
• s3cur3 / llvm-data-structure-benchmarks
  A benchmark for cache efficient data structures.
  ☆29Updated 5 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 3 years ago
• attractivechaos / udb2
  For details, see the blog post:
  ☆31Updated 10 months ago
• Sable / HorsePower
  Optimizing database queries with array programming
  ☆18Updated 4 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆103Updated 5 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆82Updated last month
• travisdowns / sort-bench
  A benchmark for sorting algorithms
  ☆58Updated 3 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆25Updated 5 years ago
• naskitis / Cache-Conscious-Data-Structures
  The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.
  ☆40Updated 7 years ago
• JacksonAllan / c_cpp_hash_tables_benchmark
  A comparative, extendable benchmarking suite for C and C++ hash-table libraries.
  ☆28Updated 5 months ago
• Apress / string-algorithms-in-c
  Source Code for 'String Algorithms in C' by Thomas Mailund
  ☆16Updated 4 years ago
• ktprime / ktprime
  fast prime sieve and hash algorithm
  ☆37Updated 10 months ago
• lemire / FrameOfReference
  C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference
  ☆50Updated 8 months ago
• simdjson / simdjson_experiments_vldb2019
  Detailed experiments over simdjson for VLDB article (2019) and future work
  ☆22Updated 4 years ago
• Const-me / MemoryAccessCosts
  ☆13Updated 6 years ago
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆53Updated 4 years ago
• tarsa / SortingAlgorithmsBenchmark
  ☆15Updated 10 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆44Updated 5 years ago
• coriolanus / libhhash
  Automatically exported from code.google.com/p/libhhash
  ☆32Updated 8 years ago
• fsaintjacques / jitmap
  LLVM-jitted bitmaps
  ☆27Updated 4 years ago
• rmind / rhashmap
  Robin Hood hash map library
  ☆58Updated 3 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆105Updated 6 years ago
• mklarqvist / StormBitmaps
  Fast algorithms for computing XX^T for binary matrices
  ☆14Updated 5 years ago
• RoaringBitmap / CBitmapCompetition
  A comparison between different integer set techniques
  ☆14Updated 6 years ago
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• basic-toolbox-sample-code / basic-toolbox-sample-code
  Sample Code for “Sequential and Parallel Algorithms and Data Structures -- The Basic Toolbox” Book
  ☆23Updated 7 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 …
  ☆21Updated 2 years ago
• jwtowner / lug
  C++ embedded domain specific language for expressing parsers as extended parsing expression grammars (PEGs)
  ☆68Updated 3 months ago