-
University of California, San Diego
- San Diego
-
16:34
(UTC -08:00) - https://jianshu93.github.io/blog/
- @jansue_chao
- in/jianshu-zhao-9a14a021a
- https://scholar.google.com/citations?user=XFhxv0gAAAAJ&hl=en
- https://knightlab.ucsd.edu/wordpress/?page_id=47
Lists (1)
Sort Name ascending (A-Z)
Stars
A framework for building native applications using React
Parsing gigabytes of JSON per second : used by Facebook/Meta Velox, the Node.js runtime, ClickHouse, WatermelonDB, Apache Doris, Milvus, StarRocks
A family of header-only, very fast and memory-friendly hashmap and btree containers.
A cross platform C99 library to get cpu features at runtime.
Fast Open-Source Search & Clustering engine Γ for Vectors & π Strings Γ in C++, C, Python, JavaScript, Rust, Java, Objective-C, Swift, C#, GoLang, and Wolfram π
Up to 10x faster strings for C, C++, Python, Rust, and Swift, leveraging NEON, AVX2, AVX-512, and SWAR to accelerate search, sort, edit distances, alignment scores, etc π¦
Fast strong hash functions: SipHash/HighwayHash
Fast & memory efficient hashtable based on robin hood hashing for C++11/14/17/20
π°οΈ An approximate nearest-neighbor search library for Python and Java with a focus on ease of use, simplicity, and deployability.
A translator from Intel SSE intrinsics to Arm/Aarch64 NEON implementation
GraphVite: A General and High-performance Graph Embedding System
Graph-structured Indices for Scalable, Fast, Fresh and Filtered Approximate Nearest Neighbor Search
C++ template library for high performance SIMD based sorting algorithms
Navigating Spreading-out Graph For Approximate Nearest Neighbor Search
Repository for nvCOMP docs and examples. nvCOMP is a library for fast lossless compression/decompression on the GPU that can be downloaded from https://developer.nvidia.com/nvcomp.
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
Graph-based alignment (Hierarchical Graph FM index)
RAxML Next Generation: faster, easier-to-use and more flexible
π A C++ library for parallel graph processing (GRAPE) π