182 citations · 515 across the 59 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012
Data Structures on Event Graphs
Bernard Chazelle, Wolfgang Mulzer
We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by Markov chains. We are given a fixed graph G,…
cs.DS2009★ 19 cited
Self-Improving Algorithms
Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson +3
We investigate ways in which an algorithm can improve its expected performance by fine-tuning itself automatically with respect to an unknown input distribution D. We assume here t…