Karim Douïeb

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The power and limitations of static binary search trees with lazy finger Algorithmica	2016-12-21	Paper
The power and limitations of static binary search trees with lazy finger Lecture Notes in Computer Science	2015-09-11	Paper
Fast local searches and updates in bounded universes Computational Geometry	2012-12-04	Paper
\(\pi /2\)-angle Xao graphs are spanners International Journal of Computational Geometry & Applications	2012-11-23	Paper
Skip lift: a probabilistic alternative to red-black trees Journal of Discrete Algorithms	2012-09-13	Paper
Layered working-set trees Algorithmica	2012-04-26	Paper
Common unfoldings of polyominoes and polycubes Lecture Notes in Computer Science	2011-11-11	Paper
Skip lift: a probabilistic alternative to red-black trees Lecture Notes in Computer Science	2011-05-19	Paper
π/2-Angle Yao Graphs Are Spanners Algorithms and Computation	2010-12-09	Paper
Should static search trees ever be unbalanced? Algorithms and Computation	2010-12-09	Paper
Near-entropy hotlink assignments Algorithmica	2010-09-16	Paper
scientific article; zbMATH DE number 5764838 (Why is no real title available?)	2010-08-06	Paper
An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times Lecture Notes in Computer Science	2010-06-22	Paper
Layered working-set trees LATIN 2010: Theoretical Informatics	2010-04-27	Paper
Efficient Construction of Near-Optimal Binary and Multiway Search Trees Lecture Notes in Computer Science	2009-10-20	Paper
Dynamic hotlinks Algorithmica	2008-04-03	Paper
Near-Entropy Hotlink Assignments Lecture Notes in Computer Science	2008-03-11	Paper
Algorithms and Data Structures Lecture Notes in Computer Science	2006-10-25	Paper

Research outcomes over time

This page was built for person: Karim Douïeb