To refer to this page use:
|Abstract:||We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by the model of Markov chains. We are given a fixed graph G, whose nodes are annotated with operations of the type insert, delete, and query. The algorithm responds to the requests as it encounters them during a (adversarial or random) walk in G. We study the limit behavior of such a walk and give an efficient algorithm for recognizing which structures can be generated. We also give a near-optimal algorithm for successor searching if the event graph is a cycle and the walk is adversarial. For a random walk, the algorithm becomes optimal.|
|Citation:||Chazelle, Bernard, and Wolfgang Mulzer. "Data Structures on Event Graphs." European Symposium on Algorithms (2012): pp. 313-324. doi:10.1007/978-3-642-33090-2_28|
|Pages:||313 - 324|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||European Symposium on Algorithms|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.