This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons, into a data structure D' that handles unbounded-length keys whose comparison cost is not a constant.
A general technique for managing strings in comparison-driven data structures / Franceschini, Gianni; Roberto, Grossi. - STAMPA. - 3142:(2004), pp. 606-617. (Intervento presentato al convegno ICALP tenutosi a turku) [10.1007/978-3-540-27836-8_52].
A general technique for managing strings in comparison-driven data structures
FRANCESCHINI, GIANNI;
2004
Abstract
This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons, into a data structure D' that handles unbounded-length keys whose comparison cost is not a constant.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
