✦ LIBER ✦

Time–space trade-offs for longest common extensions

✍ Scribed by Bille, Philip; Gørtz, Inge Li; Sach, Benjamin; Vildhøj, Hjalte Wedel

Book ID: 122034545
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 302 KB
Volume: 25
Category: Article
ISSN: 1570-8667
DOI: 10.1016/j.jda.2013.06.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time-space trade-offs for branching prog

Time-space trade-offs for branching programs

✍ Ingo Wegener 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 384 KB

Time-space trade-offs for compressed suf

Time-space trade-offs for compressed suffix arrays

✍ S.Srinivasa Rao 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 70 KB

Given a binary string of length n, we give a representation of its suffix array that takes O(nt (lg n) 1/t ) bits of space such that given i, 1 i n, the ith entry in the suffix array of the string can be retrieved in O(t) time, for any parameter 1 t lg lg n. For t = lg lg n, this gives a compressed

Rigorous Time/Space Trade-offs for Inver

Rigorous Time/Space Trade-offs for Inverting Functions

✍ Fiat, Amos; Naor, Moni 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 347 KB

Time versus space trade-offs for rendezv

Time versus space trade-offs for rendezvous in trees

✍ Czyzowicz, Jurek; Kosowski, Adrian; Pelc, Andrzej 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 286 KB

Extensive simulations for longest common

Extensive simulations for longest common subsequences

✍ J. Boutet de Monvel 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 948 KB

Time-space trade-offs in a pebble game

✍ W. J. Paul; R. E. Tarjan 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 231 KB