Heykuki News
Top
New
Best
Ask
Show
Jobs
Toggle theme
Login
Top
New
Best
Ask
Show
Jobs
31.
▲
Boyer Moore Vote Algorithm O(1) Space O(N) Time
(github.com/raghavan)
1 point
raghavankl
2 years ago
discuss
32.
▲
Boyer Moore Majority Vote Algorithm – Counting Most Repeated Characters in O(n)
(github.com/raghavan)
1 point
raghavankl
2 years ago
discuss
33.
▲
Show HN: rapidstring – Maybe the fastest string library ever
(github.com/boyerjohn)
1 point
johnboyer
8 years ago
discuss
34.
▲
Fix Boyer-Moore searcher with the Rytter correction
(github.com/microsoft)
193 points
HenryR
6 years ago
53 comments
35.
▲
Nqthm – the original Boyer-Moore theorem prover, from 1992
(github.com/John-Nagle)
2 points
jaredsohn
10 years ago
discuss
36.
▲
Show HN: 500x faster string matching for Linux Netfilter (O(1) vs. O(N))
(github.com/landerrosette)
4 points
landerrosette
4 months ago
discuss
37.
▲
Show HN: ShadowStrike – building an open-source EDR from scratch
(github.com/Soocile)
1 point
Soocile
4 months ago
2 comments
38.
▲
Cross platform code coverage library for .NET Core
(github.com/tonerdo)
1 point
spboyer
8 years ago
discuss