Alternatives and similar repositories for IR-unipi:

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

• md-cs-student-unipi / Exams
  Collection of oral questions and exam material
  ☆30Updated last year
• rossanoventurini / adsds
  Page of the course "Algorithms and Data Structures (for Data Science)" at Department of Computer Science, University of Pisa
  ☆64Updated 2 weeks ago
• TusKANNy / seismic
  Official software repository of S. Bruch, F. M. Nardini, C. Rulli, and R. Venturini, "Efficient Inverted Indexes for Approximate Retrieva…
  ☆52Updated 2 months ago
• rossanoventurini / CompetitiveProgramming
  Page of the course "Competitive Programming and Contests" at Department of Computer Science, University of Pisa
  ☆230Updated last year
• md-cs-student-unipi / Materials
  🎓Collection of useful repositories
  ☆143Updated last month
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 8 months ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated last year
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• magemma / Notes-on-Computational-Mathematics
  Notes from the Computational Mathematics course held by professor Antonio Frangioni and professor Federico Poloni at University of Pisa
  ☆12Updated 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
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 5 months ago
• zilliztech / pyglass
  Graph Library for Approximate Similarity Search
  ☆104Updated 9 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• flandolfi / ALE-exercises
  Exercises for the Algorithm Engineering (ALE) course at University of Pisa
  ☆14Updated 6 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆15Updated 3 years ago
• md-cs-student-unipi / ICT-Infrastructures
  Notes of ICT Infrastructures course - University of Pisa (Italy)
  ☆28Updated 3 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• mkarppa / hyperlogloglog
  HyperLogLogLog: Counting Distinct Elements With One Log More
  ☆18Updated 2 years ago
• marcocosta97 / grafite
  Grafite is a data structure that enables fast range emptiness queries using optimal space and time.
  ☆13Updated 2 months ago
• gaurav16gupta / RAMBO_MSMT
  ☆11Updated 2 years ago
• jermp / data_compression_course
  A Crash Course on Data Compression.
  ☆301Updated 11 months ago
• ferragina / AlgorithmEngineering
  This is the material for the course on Algorithm Engineering at the University of Pisa
  ☆9Updated 4 months ago
• hpclab / fast-approximate-filtering
  Official repository of the ACM SIGIR 2019 paper: "Fast Approximate Filtering of Search Results Sorted by Attribute" by Franco Maria Nardi…
  ☆14Updated 5 years ago
• intel / ScalableVectorSearch
  ☆141Updated this week
• Visual-Computing / DynamicExplorationGraph
  Repository related to the Dynamic Exploration Graph and its previous iterations.
  ☆20Updated last month
• 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…
  ☆132Updated last week
• NinhPham / FalconnPP
  Falconn++ is a locality-sensitive filtering (LSF) approach, built on top of cross-polytope LSH (FalconnLib) to answer approximate nearest…
  ☆12Updated 6 months ago
• jermp / clustered_elias_fano_indexes
  Clustered Elias-Fano inverted indexes.
  ☆15Updated 6 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆48Updated 5 years ago