Data structures on event graphs

DOI10.1007/s00453-013-9838-4zbMath1325.68073arXiv1206.6193OpenAlexW3098418919MaRDI QIDQ2350906

Bernard Chazelle, Wolfgang Mulzer

Publication date: 25 June 2015

Published in: Algorithmica, Algorithms – ESA 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.6193

zbMATH Keywords

Markov chaindata structurelow entropysuccessor searching

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved algorithms for the range next value problem and applications
• Stochastic rearrangement rules for self-organizing data structures
• A note on predecessor searching in the pointer machine model
• Preserving order in a forest in less than logarithmic time and linear space
• Optimality of move-to-front for self-organizing data structures with locality of references
• Self-organizing files with dependent accesses
• Design and implementation of an efficient priority queue
• On the move-to-front scheme with Markov dependent requests
• Optimal prefetching via data compression
• Markov Paging
• Locality in Page Reference Strings
• Markov incremental constructions

This page was built for publication: Data structures on event graphs