Karim Douïeb

According to our database1, Karim Douïeb authored at least 18 papers between 2008 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2016
The Power and Limitations of Static Binary Search Trees with Lazy Finger.
Algorithmica, 2016

2013
Fast local searches and updates in bounded universes.
Comput. Geom., 2013

2012
Skip lift: A probabilistic alternative to red-black trees.
J. Discrete Algorithms, 2012

π/2-Angle Yao Graphs are Spanners.
Int. J. Comput. Geom. Appl., 2012

Layered Working-Set Trees.
Algorithmica, 2012

2011
Approximation Algorithms for a Triangle Enclosure Problem.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times
CoRR, 2010

Odds-On Trees
CoRR, 2010

Pi/2-Angle Yao Graphs are Spanners
CoRR, 2010

Point Location in Disconnected Planar Subdivisions
CoRR, 2010

Near-Entropy Hotlink Assignments.
Algorithmica, 2010

An <i>O</i>(log log <i>n</i>)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.
Proceedings of the Algorithm Theory, 2010

<i>pi</i>/2-Angle Yao Graphs Are Spanners.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Should Static Search Trees Ever Be Unbalanced?
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
Efficient Construction of Near-Optimal Binary and Multiway Search Trees.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008
Dynamic Hotlinks.
Algorithmica, 2008

Dynamic optimality for skip lists and B-trees.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008


  Loading...