Sciweavers

2 search results - page 1 / 1
» Average-Case Analysis of Approximate Trie Search
Sort
View
STACS
2005
Springer
13 years 10 months ago
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
Carsten Witt