Gregable / pq-trees

Related projects ⓘ

Alternatives and complementary repositories for pq-trees

• omarobeya / parallel-inplace-radixsort
  ☆20Updated 3 years ago
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 4 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆30Updated 3 months ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆35Updated last week
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated 9 months ago
• AntonioL / leapfrog-join
  Implementation of the unary leapfrog join for efficient intersection of sorted sets.
  ☆9Updated 4 years 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.
  ☆26Updated 2 months ago
• Gecode / MPG
  Modeling and Programming with Gecode
  ☆45Updated last year
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆24Updated 2 months ago
• BlairArchibald / YewPar
  A Collection of High Performance Parallel Skeletons for Tree Search Problems
  ☆21Updated 6 months ago
• LijunChang / Near-Maximum-Independent-Set
  Near-linear time algorithm for computing near-maximum independent set
  ☆17Updated 2 years ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆39Updated last month
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• cmuparlay / PAM
  Parallel Balanced Binary Tree Structures
  ☆111Updated this week
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆14Updated last month
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 2 months ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆21Updated last month
• scipopt / soplex
  Sequential object-oriented simPlex
  ☆61Updated this week
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆154Updated 3 months ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆70Updated this week
• Algebraic-Programming / ALP
  Home of ALP/GraphBLAS and ALP/Pregel, featuring shared- and distributed-memory auto-parallelisation of linear algebraic and vertex-centri…
  ☆25Updated this week
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆27Updated 7 months ago
• wheatman / BP-Tree
  ☆9Updated 2 weeks ago
• KarypisLab / K-Truss
  OpenMP-based parallel software for computing the truss decomposition of a graph.
  ☆12Updated 6 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆45Updated 2 years ago
• robmccoll / graphdb-testing
  Benchmarking various graph databases, engines, datastructures, and data stores.
  ☆35Updated 10 years ago
• mabseher / htd
  A small but efficient C++ library for computing (customized) tree and hypertree decompositions.
  ☆48Updated last year