Karim Douïeb

According to our database, Karim Douïeb authored at least 18 papers between 2005 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

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

Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2012

π/2-Angle Yao Graphs are Spanners.

Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer

Int. J. Comput. Geom. Appl., 2012

2011

Approximation Algorithms for a Triangle Enclosure Problem.

Karim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid

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

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg

CoRR, 2010

Odds-On Trees

Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin

CoRR, 2010

Pi/2-Angle Yao Graphs are Spanners

Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer

CoRR, 2010

Point Location in Disconnected Planar Subdivisions

Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin

CoRR, 2010

An <i>O</i>(log log <i>n</i>)-Competitive Binary Search Tree with Optimal Worst-Case Access Times.

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg

Proceedings of the Algorithm Theory, 2010

Layered Working-Set Trees.

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

Skip Lift: A Probabilistic Alternative to Red-Black Trees.

Prosenjit Bose, Karim Douïeb, Pat Morin

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

<i>pi</i>/2-Angle Yao Graphs Are Spanners.

Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Should Static Search Trees Ever Be Unbalanced?

Prosenjit Bose, Karim Douïeb

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Common Unfoldings of Polyominoes and Polycubes.

Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin

Proceedings of the Computational Geometry, Graphs and Applications, 2010

Fast local searches and updates in bounded universes.

Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin

Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009

Efficient Construction of Near-Optimal Binary and Multiway Search Trees.

Prosenjit Bose, Karim Douïeb

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008

Dynamic optimality for skip lists and B-trees.

Prosenjit Bose, Karim Douïeb, Stefan Langerman

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2006

Near-Entropy Hotlink Assignments.

Karim Douïeb, Stefan Langerman

Proceedings of the Algorithms, 2006

2005

Dynamic Hotlinks.

Karim Douïeb, Stefan Langerman

Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005