×

Found 20 Documents (Results 1–20)

The \(k\)-th total path length and the total Steiner \(k\)-distance for digital search trees. (English) Zbl 1331.68063

Bousquet-Mélou, Mireille (ed.) et al., Proceeding of the 25th international conference on probabilistic, combinatorial and asymptotic methods in the analysis of algorithms, AofA’14, UPMC-Jussieu, Paris, France, June 16–20, 2014. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science (DMTCS-HAL). Proceedings BA, 265-276 (2014).
PDFBibTeX XMLCite
Full Text: HAL

Filter Results by …

Document Type

all top 3

Main Field

all top 3

Software