nishihatapalmer/HashChain
View on GitHub ↗ ★ 47 HTML
A very fast online search algorithm
6 mentions on Hacker News by 2 people: 2 stories, 4 comments · first 2025-03-11 · latest 2026-09-11
20082026
-
…verify matches so it has a linear worst case (instead of quadratic, like Boyer Moore Horspool). [1] https://github.com/nishihatapalmer/HashChain
comment by MattPalmer1086 · 2026-09-11 · in Bitap: My favorite string matching algorithm -
…for Experimental Algorithmics in 2024. [1] https://github.com/nishihatapalmer/byteseek [2] https://github.com/nishihatapalmer/HashChain
comment by MattPalmer1086 · 2026-08-22 · in There's no reason for software to be slow anymore -
…gstuhl.de/entities/document/10.4230/LIPIcs.S... [2] https://sea2024.univie.ac.at/accepted-papers/ [3] https://github.com/nishihatapalmer/HashChain
comment by MattPalmer1086 · 2025-11-04 · in Bloom filters are good for search that does not scale -
…sublinear and much faster than Boyer Moore in the average case). Sample code is available here: https://github.com/nishihatapalmer/HashChain If you're interested, let me know.
comment by MattPalmer1086 · 2025-03-11 · in Show HN: Krep a High-Performance String Search Utility Written in C