Karim Douïeb

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:36/1268 · DBLP profile ↗

← Back

14ranked-venue papers

4as first author

0since 2021 · last 2016

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 13 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Algorithms and data structures · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

Topic	Weight	Papers	Last	Evidence papers
Algorithms and data structures › data structure design › search structures › search trees › balanced search trees b-trees	0.1	1	2008	Dynamic optimality for skip lists and B-trees · SODA 2008
Algorithms and data structures › data structure design › search structures › search trees › binary search trees dynamic optimality	0.1	1	2008	Dynamic optimality for skip lists and B-trees · SODA 2008
Algorithms and data structures › data structure design › search structures search trees	0.1	1	2008	Dynamic optimality for skip lists and B-trees · SODA 2008
Algorithms and data structures › data structure design › search structures skip list	0.1	1	2008	Dynamic optimality for skip lists and B-trees · SODA 2008

Year	Publication	Venue	Position
2016	The Power and Limitations of Static Binary Search Trees with Lazy Finger Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman	Algorithmica	2
2014	The Power and Limitations of Static Binary Search Trees with Lazy Finger Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman	ISAAC	2
2013	Fast local searches and updates in bounded universes Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin	Comput. Geom.	2
2012	Layered Working-Set Trees Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat	Algorithmica	2
2010	Should Static Search Trees Ever Be Unbalanced? Prosenjit Bose, Karim Douïeb	ISAAC (1)	2
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	ISAAC (2)	3
2010	Skip Lift: A Probabilistic Alternative to Red-Black Trees Prosenjit Bose, Karim Douïeb, Pat Morin	IWOCA	2
2010	Layered Working-Set Trees Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat	LATIN	2
2010	Near-Entropy Hotlink Assignments Karim Douïeb, Stefan Langerman	Algorithmica	1
2009	Efficient Construction of Near-Optimal Binary and Multiway Search Trees Prosenjit Bose, Karim Douïeb	WADS	2
2008	Dynamic optimality for skip lists and B-trees Prosenjit Bose, Karim Douïeb, Stefan Langerman	SODA	2
2008	Dynamic Hotlinks Karim Douïeb, Stefan Langerman	Algorithmica	1
2006	Near-Entropy Hotlink Assignments Karim Douïeb, Stefan Langerman	ESA	1
2005	Dynamic Hotlinks Karim Douïeb, Stefan Langerman	WADS	1