×

Found 9 Documents (Results 1–9)

From time to space: fast algorithms that yield small and fast data structures. (English) Zbl 1394.68089

Brodnik, Andrej (ed.) et al., Space-efficient data structures, streams, and algorithms. Papers in honor of J. Ian Munro on the occasion of his 66th birthday. Berlin: Springer (ISBN 978-3-642-40272-2/pbk). Lecture Notes in Computer Science 8066, 97-111 (2013).
MSC:  68P05 68P10 68W40
PDFBibTeX XMLCite
Full Text: DOI

LRM-trees: compressed indices, adaptive sorting, and compressed permutations. (English) Zbl 1339.68048

Giancarlo, Raffaele (ed.) et al., Combinatorial pattern matching. 22nd annual symposium, CPM 2011, Palermo, Italy, June 27–29, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21457-8/pbk). Lecture Notes in Computer Science 6661, 285-298 (2011).
MSC:  68P05 68P10 68W32
PDFBibTeX XMLCite
Full Text: DOI arXiv Link

Succinct representation of labeled graphs. (English) Zbl 1193.05142

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 316-328 (2007).
MSC:  05C78 05C62 68R10
PDFBibTeX XMLCite
Full Text: DOI HAL

Filter Results by …

Document Type

Year of Publication

Main Field

Software