default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarim Douïeb
- > Home > Persons > Karim Douïeb
Publications
- 2016
[j7]Prosenjit Bose
, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. Algorithmica 76(4): 1264-1275 (2016)- 2014
- [c13]Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC 2014: 181-192 - 2013
- [j6]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. Comput. Geom. 46(2): 181-189 (2013) - [i7]Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. CoRR abs/1304.6897 (2013) - 2012
- [j5]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. Algorithmica 63(1-2): 476-489 (2012) - [j4]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
π/2-Angle Yao Graphs are Spanners. Int. J. Comput. Geom. Appl. 22(1): 61-82 (2012) - [j3]Prosenjit Bose, Karim Douïeb, Pat Morin:
Skip lift: A probabilistic alternative to red-black trees. J. Discrete Algorithms 14: 13-20 (2012) - 2010
- [c11]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat, Pat Morin:
Fast local searches and updates in bounded universes. CCCG 2010: 261-264 - [c10]Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54 - [c9]Prosenjit Bose, Karim Douïeb:
Should Static Search Trees Ever Be Unbalanced? ISAAC (1) 2010: 109-120 - [c8]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
pi/2-Angle Yao Graphs Are Spanners. ISAAC (2) 2010: 446-457 - [c7]Prosenjit Bose, Karim Douïeb, Pat Morin:
Skip Lift: A Probabilistic Alternative to Red-Black Trees. IWOCA 2010: 226-237 - [c6]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. LATIN 2010: 686-696 - [c5]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(log log n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. SWAT 2010: 38-49 - [i6]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Point Location in Disconnected Planar Subdivisions. CoRR abs/1001.2763 (2010) - [i5]Prosenjit Bose, Mirela Damian, Karim Douïeb, Joseph O'Rourke, Ben Seamone, Michiel H. M. Smid, Stefanie Wuhrer:
Pi/2-Angle Yao Graphs are Spanners. CoRR abs/1001.2913 (2010) - [i4]Prosenjit Bose, Luc Devroye, Karim Douïeb, Vida Dujmovic, James King, Pat Morin:
Odds-On Trees. CoRR abs/1002.1092 (2010) - [i3]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, Rolf Fagerberg:
An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times. CoRR abs/1003.0139 (2010) - [i2]Prosenjit Bose, Karim Douïeb:
Should Static Search Trees Ever Be Unbalanced? CoRR abs/1006.3715 (2010) - 2009
- [c4]Prosenjit Bose, Karim Douïeb:
Efficient Construction of Near-Optimal Binary and Multiway Search Trees. WADS 2009: 230-241 - [i1]Prosenjit Bose, Karim Douïeb, Vida Dujmovic, John Howat:
Layered Working-Set Trees. CoRR abs/0907.2071 (2009) - 2008
- [c3]Prosenjit Bose, Karim Douïeb, Stefan Langerman:
Dynamic optimality for skip lists and B-trees. SODA 2008: 1106-1114
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
