Karim Douïeb - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2016

The Power and Limitations of Static Binary Search Trees with Lazy FingerProsenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman. algorithmica, 76(4):1264-1275, 2016. [doi]

2014

The Power and Limitations of Static Binary Search Trees with Lazy FingerProsenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman. isaac 2014: 181-192 [doi]

2013

Fast local searches and updates in bounded universesProsenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin. comgeo, 46(2):181-189, 2013. [doi]

2012

π/2-Angle Yao Graphs are SpannersProsenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer. ijcga, 22(1):61-82, 2012. [doi]

Layered Working-Set TreesProsenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat. algorithmica, 63(1-2):476-489, 2012. [doi]

Skip lift: A probabilistic alternative to red-black treesProsenjit Bose, Karim Douïeb, Pat Morin. jda, 14:13-20, 2012. [doi]

2011

Approximation Algorithms for a Triangle Enclosure ProblemKarim Douïeb, Matthew Eastman, Anil Maheshwari, Michiel H. M. Smid. cccg 2011: [doi]

2010

Common Unfoldings of Polyominoes and PolycubesGreg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin. cgga 2011: 44-54 [doi]

Should Static Search Trees Ever Be Unbalanced?Prosenjit Bose, Karim Douïeb. isaac 2010: 109-120 [doi]

::::pi::::/2-Angle Yao Graphs Are SpannersProsenjit Bose, Mirela Damian, Karim Douïeb, Joseph O Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer. isaac 2010: 446-457 [doi]

Skip Lift: A Probabilistic Alternative to Red-Black TreesProsenjit Bose, Karim Douïeb, Pat Morin. iwoca 2011: 226-237 [doi]

Layered Working-Set TreesProsenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat. latin 2010: 686-696 [doi]

Fast local searches and updates in bounded universesProsenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin. cccg 2010: 261-264 [doi]

An ::::O::::(log log ::::n::::)-Competitive Binary Search Tree with Optimal Worst-Case Access TimesProsenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg. swat 2010: 38-49 [doi]

Near-Entropy Hotlink AssignmentsKarim Douïeb, Stefan Langerman. algorithmica, 58(2):221-244, 2010. [doi]

2008

Dynamic optimality for skip lists and B-treesProsenjit Bose, Karim Douïeb, Stefan Langerman. soda 2008: 1106-1114 [doi]

Dynamic HotlinksKarim Douïeb, Stefan Langerman. algorithmica, 50(2):208-222, 2008. [doi]

2006

Near-Entropy Hotlink AssignmentsKarim Douïeb, Stefan Langerman. esa 2006: 292-303 [doi]

2005

Dynamic HotlinksKarim Douïeb, Stefan Langerman. wads 2005: 182-194 [doi]

Sign in or sign up to see more results.

runs on WebDSL