scientific article; zbMATH DE number 2127725

MaRDI QIDQ3154671zbMATH OpenFDO

Authors Javiera Barrera, Christian Paroissin

Publication date 14 January 2005

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• On the distribution of the search cost for the move-to-front rule with random weights
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
• On the Optimality of Randomized $\alpha$-$\beta$ Search
• Local search proximal algorithms as decision dynamics with costs to move
• scientific article; zbMATH DE number 3901926
• scientific article; zbMATH DE number 4080680
• The limiting move-to-front search-cost in law of large numbers asymptotic regimes
• Publication:4885223

Cited in

(5)

• Limiting behavior of the search cost distribution for the move-to-front rule in the stable case
• Limits and rates of convergence for the distribution of search cost under the move-to-front rule
• Rates of convergence for the move-to-root Markov chain for binary search trees
• Efficient reorganization of binary search trees
• On the distribution of the search cost for the move-to-front rule with random weights

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3154671)