Alternatives and similar repositories for IR-unipi

Users that are interested in IR-unipi are comparing it to the libraries listed below

• and-gue / NeaTS
  ☆11Updated 2 months ago
• md-cs-student-unipi / Exams
  Collection of oral questions and exam material
  ☆32Updated last year
• md-cs-student-unipi / Materials
  🎓Collection of useful repositories
  ☆148Updated 5 months ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 4 months ago
• rossanoventurini / adsds
  Page of the course "Algorithms and Data Structures (for Data Science)" at Department of Computer Science, University of Pisa
  ☆64Updated last month
• rossanoventurini / CompetitiveProgramming
  Page of the course "Competitive Programming and Contests" at Department of Computer Science, University of Pisa
  ☆229Updated last year
• 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
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆42Updated last month
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 4 years ago
• mti-lab / rnn-descent
  ☆22Updated last year
• ferragina / AlgorithmEngineering
  This is the material for the course on Algorithm Engineering at the University of Pisa
  ☆9Updated 9 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• fastflow / fastflow
  FastFlow pattern-based parallel programming framework (formerly on sourceforge)
  ☆293Updated 3 weeks ago
• intel / ScalableVectorSearch
  ☆167Updated this week
• IntelLabs / VectorSearchDatasets
  ☆24Updated 4 months ago
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆14Updated 3 years ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆121Updated 2 weeks ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• cmuparlay / ParlayANN
  A library of algorithms for approximate nearest neighbor search in high dimensions, along with a set of useful tools for designing such a…
  ☆148Updated this week
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 6 months ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆58Updated last week
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated 2 years ago
• zilliztech / BBAnn
  Block-based Approximate Nearest Neighbor
  ☆35Updated 3 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 11 years ago
• Visual-Computing / DynamicExplorationGraph
  Repository related to the Dynamic Exploration Graph and its previous iterations.
  ☆26Updated 2 weeks ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• guestrin-lab / ACORN
  state-of-the-art search over vector embeddings and structured data (SIGMOD '24)
  ☆79Updated 3 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• rutgers-db / SeRF
  SeRF: Segment Graph for Range-Filtering Approximate Nearest Neighbor Search
  ☆33Updated 3 months ago