Access/Impact Problem and the Green and Gold Roads to Open Access. Serials Review: 310–314. doi:10.1016/j.serrev.2004.09.013. "Registry of Open Access Repositories
存档备份,存于互联网档案馆)提出了第一个时间复杂度(线性时间)和空间复杂度(常数空间)都是最优的后缀数组构造算法,解决了该领域长达10年的openproblem。 令字符串 S = S [ 1 ] S [ 2 ] . . . S [ n ] {\displaystyle S=S[1]S[2]...S[n]}
Oppenheim, C.; Stamerjohanns, H.; Hilf, E. The Access/Impact Problem and the Green and Gold Roads to Open Access. Serials Review. 2004, 30 (4): 310–314 [11 January