✦ LIBER ✦

A fast test for unique decipherability based on suffix trees (Corresp.)

✍ Scribed by Rodeh, M.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pattern Matching Machine implementation

✍ A. Apostolico; R. Giancarlo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 315 KB

A fast algorithm for Huffman decoding ba

✍ Yih-Kai Lin; Shu-Chien Huang; Cheng-Hsing Yang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Fast and versatile algorithm for nearest

✍ Yong-Sheng Chen; Yi-Ping Hung; Ting-Fang Yen; Chiou-Shann Fuh 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 431 KB