Open Source
Tiny Suffix Arrays
arXiv cs.IR0 views
arXiv:2610.35543v1 Announce Type: cross Abstract: Suffix array and inverse suffix array queries on a text of length $n$ can be answered in $\widetilde{O}(\tau^3)$ time using an auxiliary data structure occupying $O(n/\tau)$ words, for any $\tau \in [1,n]$.
Source：https://arxiv.org/abs/2610.35543PreviousAgreement Between Reconstructed and Native GDELT GKG Records: A Field-Level BaselineNextNavigating Ideation Space: Decomposed Conceptual Representations for Positioning Scientific Ideas
Related posts
Show HN: Open Bot Avatars – a spec and renderer for interactive bot avatars
0Hacker News New
Show HN: Elections Archive: every election in the US, citable and open source
0Hacker News New
Show HN: Relaynet – open-source relay that gives browser tabs a real network
0Hacker News Show
My uninstaller refuses to delete anything it can't prove belongs to the app. Poke holes in my safety rules
0dev.to C#
让 AI 编程助手少返工：10 条命令规则合集（免费读）
0dev.to OpenSource
Discovering contemporaneous and lagged causal relations in autocorrelated nonlinear time series datasets
0arXiv stat.ML