Karim Douïeb

Available identifiers

Publication	Date of Publication	Type
The power and limitations of static binary search trees with lazy finger	2016-12-21	Paper
The power and limitations of static binary search trees with lazy finger	2015-09-11	Paper
Fast local searches and updates in bounded universes	2012-12-04	Paper
π/2-ANGLE YAO GRAPHS ARE SPANNERS	2012-11-23	Paper
Skip lift: a probabilistic alternative to red-black trees	2012-09-13	Paper
Layered working-set trees	2012-04-26	Paper
Common Unfoldings of Polyominoes and Polycubes	2011-11-11	Paper
Skip Lift: A Probabilistic Alternative to Red-Black Trees	2011-05-19	Paper
π/2-Angle Yao Graphs Are Spanners	2010-12-09	Paper
Should Static Search Trees Ever Be Unbalanced?	2010-12-09	Paper
Near-entropy hotlink assignments	2010-09-16	Paper
https://portal.mardi4nfdi.de/entity/Q3579430	2010-08-06	Paper
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times	2010-06-22	Paper
Layered Working-Set Trees	2010-04-27	Paper
Efficient Construction of Near-Optimal Binary and Multiway Search Trees	2009-10-20	Paper
Dynamic hotlinks	2008-04-03	Paper
Near-Entropy Hotlink Assignments	2008-03-11	Paper
Algorithms and Data Structures	2006-10-25	Paper

This page was built for person: Karim Douïeb