Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Karim Douïeb
@article{DBLP:journals/algorithmica/BoseDIL16,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
John Iacono and
Stefan Langerman},
title = {The Power and Limitations of Static Binary Search Trees with Lazy
Finger},
journal = {Algorithmica},
volume = {76},
number = {4},
pages = {1264--1275},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0224-x},
doi = {10.1007/S00453-016-0224-X},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseDIL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BoseDIL14,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
John Iacono and
Stefan Langerman},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {The Power and Limitations of Static Binary Search Trees with Lazy
Finger},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {181--192},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_15},
doi = {10.1007/978-3-319-13075-0\_15},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BoseDIL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BoseDDHM13,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
John Howat and
Pat Morin},
title = {Fast local searches and updates in bounded universes},
journal = {Comput. Geom.},
volume = {46},
number = {2},
pages = {181--189},
year = {2013},
url = {https://doi.org/10.1016/j.comgeo.2012.01.002},
doi = {10.1016/J.COMGEO.2012.01.002},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BoseDDHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-6897,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
John Iacono and
Stefan Langerman},
title = {The Power and Limitations of Static Binary Search Trees with Lazy
Finger},
journal = {CoRR},
volume = {abs/1304.6897},
year = {2013},
url = {http://arxiv.org/abs/1304.6897},
eprinttype = {arXiv},
eprint = {1304.6897},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-6897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BoseDDH12,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
John Howat},
title = {Layered Working-Set Trees},
journal = {Algorithmica},
volume = {63},
number = {1-2},
pages = {476--489},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9542-1},
doi = {10.1007/S00453-011-9542-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BoseDDH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijcga/BoseDDOSSW12,
author = {Prosenjit Bose and
Mirela Damian and
Karim Dou{\"{\i}}eb and
Joseph O'Rourke and
Ben Seamone and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {{\(\pi\)}/2-Angle Yao Graphs are Spanners},
journal = {Int. J. Comput. Geom. Appl.},
volume = {22},
number = {1},
pages = {61--82},
year = {2012},
url = {https://doi.org/10.1142/S0218195912600047},
doi = {10.1142/S0218195912600047},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijcga/BoseDDOSSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/BoseDM12,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Pat Morin},
title = {Skip lift: {A} probabilistic alternative to red-black trees},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {13--20},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.017},
doi = {10.1016/J.JDA.2011.12.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/BoseDM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/DouiebEMS11,
author = {Karim Dou{\"{\i}}eb and
Matthew Eastman and
Anil Maheshwari and
Michiel H. M. Smid},
title = {Approximation Algorithms for a Triangle Enclosure Problem},
booktitle = {Proceedings of the 23rd Annual Canadian Conference on Computational
Geometry, Toronto, Ontario, Canada, August 10-12, 2011},
year = {2011},
url = {http://www.cccg.ca/proceedings/2011/papers/paper75.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cccg/DouiebEMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DouiebL10,
author = {Karim Dou{\"{\i}}eb and
Stefan Langerman},
title = {Near-Entropy Hotlink Assignments},
journal = {Algorithmica},
volume = {58},
number = {2},
pages = {221--244},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9259-y},
doi = {10.1007/S00453-008-9259-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DouiebL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/BoseDDHM10,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
John Howat and
Pat Morin},
title = {Fast local searches and updates in bounded universes},
booktitle = {Proceedings of the 22nd Annual Canadian Conference on Computational
Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010},
pages = {261--264},
year = {2010},
url = {http://cccg.ca/proceedings/2010/paper69.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/BoseDDHM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cgga/AloupisBCDDDDILM10,
author = {Greg Aloupis and
Prosenjit Bose and
S{\'{e}}bastien Collette and
Erik D. Demaine and
Martin L. Demaine and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
John Iacono and
Stefan Langerman and
Pat Morin},
editor = {Jin Akiyama and
Bo Jiang and
Mikio Kano and
Xuehou Tan},
title = {Common Unfoldings of Polyominoes and Polycubes},
booktitle = {Computational Geometry, Graphs and Applications - 9th International
Conference, {CGGA} 2010, Dalian, China, November 3-6, 2010, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7033},
pages = {44--54},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-24983-9\_5},
doi = {10.1007/978-3-642-24983-9\_5},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cgga/AloupisBCDDDDILM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BoseD10,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Should Static Search Trees Ever Be Unbalanced?},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6506},
pages = {109--120},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17517-6\_12},
doi = {10.1007/978-3-642-17517-6\_12},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BoseD10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BoseDDOSSW10,
author = {Prosenjit Bose and
Mirela Damian and
Karim Dou{\"{\i}}eb and
Joseph O'Rourke and
Ben Seamone and
Michiel H. M. Smid and
Stefanie Wuhrer},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {\emph{pi}/2-Angle Yao Graphs Are Spanners},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {446--457},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_38},
doi = {10.1007/978-3-642-17514-5\_38},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BoseDDOSSW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/BoseDM10,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Pat Morin},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Skip Lift: {A} Probabilistic Alternative to Red-Black Trees},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {226--237},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_23},
doi = {10.1007/978-3-642-19222-7\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/BoseDM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BoseDDH10,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
John Howat},
editor = {Alejandro L{\'{o}}pez{-}Ortiz},
title = {Layered Working-Set Trees},
booktitle = {{LATIN} 2010: Theoretical Informatics, 9th Latin American Symposium,
Oaxaca, Mexico, April 19-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6034},
pages = {686--696},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-12200-2\_59},
doi = {10.1007/978-3-642-12200-2\_59},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/BoseDDH10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BoseDDF10,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
Rolf Fagerberg},
editor = {Haim Kaplan},
title = {An \emph{O}(log log \emph{n})-Competitive Binary Search Tree with
Optimal Worst-Case Access Times},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {38--49},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_5},
doi = {10.1007/978-3-642-13731-0\_5},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BoseDDF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-2763,
author = {Prosenjit Bose and
Luc Devroye and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
James King and
Pat Morin},
title = {Point Location in Disconnected Planar Subdivisions},
journal = {CoRR},
volume = {abs/1001.2763},
year = {2010},
url = {http://arxiv.org/abs/1001.2763},
eprinttype = {arXiv},
eprint = {1001.2763},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-2763.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-2913,
author = {Prosenjit Bose and
Mirela Damian and
Karim Dou{\"{\i}}eb and
Joseph O'Rourke and
Ben Seamone and
Michiel H. M. Smid and
Stefanie Wuhrer},
title = {Pi/2-Angle Yao Graphs are Spanners},
journal = {CoRR},
volume = {abs/1001.2913},
year = {2010},
url = {http://arxiv.org/abs/1001.2913},
eprinttype = {arXiv},
eprint = {1001.2913},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-2913.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1002-1092,
author = {Prosenjit Bose and
Luc Devroye and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
James King and
Pat Morin},
title = {Odds-On Trees},
journal = {CoRR},
volume = {abs/1002.1092},
year = {2010},
url = {http://arxiv.org/abs/1002.1092},
eprinttype = {arXiv},
eprint = {1002.1092},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1002-1092.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1003-0139,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
Rolf Fagerberg},
title = {An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case
Access Times},
journal = {CoRR},
volume = {abs/1003.0139},
year = {2010},
url = {http://arxiv.org/abs/1003.0139},
eprinttype = {arXiv},
eprint = {1003.0139},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1003-0139.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1006-3715,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb},
title = {Should Static Search Trees Ever Be Unbalanced?},
journal = {CoRR},
volume = {abs/1006.3715},
year = {2010},
url = {http://arxiv.org/abs/1006.3715},
eprinttype = {arXiv},
eprint = {1006.3715},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1006-3715.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BoseD09,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Efficient Construction of Near-Optimal Binary and Multiway Search
Trees},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {230--241},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_21},
doi = {10.1007/978-3-642-03367-4\_21},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/BoseD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0907-2071,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Vida Dujmovic and
John Howat},
title = {Layered Working-Set Trees},
journal = {CoRR},
volume = {abs/0907.2071},
year = {2009},
url = {http://arxiv.org/abs/0907.2071},
eprinttype = {arXiv},
eprint = {0907.2071},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0907-2071.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DouiebL08,
author = {Karim Dou{\"{\i}}eb and
Stefan Langerman},
title = {Dynamic Hotlinks},
journal = {Algorithmica},
volume = {50},
number = {2},
pages = {208--222},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9060-3},
doi = {10.1007/S00453-007-9060-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/DouiebL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BoseDL08,
author = {Prosenjit Bose and
Karim Dou{\"{\i}}eb and
Stefan Langerman},
editor = {Shang{-}Hua Teng},
title = {Dynamic optimality for skip lists and B-trees},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1106--1114},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347203},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/BoseDL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DouiebL06,
author = {Karim Dou{\"{\i}}eb and
Stefan Langerman},
editor = {Yossi Azar and
Thomas Erlebach},
title = {Near-Entropy Hotlink Assignments},
booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland,
September 11-13, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4168},
pages = {292--303},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11841036\_28},
doi = {10.1007/11841036\_28},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/DouiebL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/DouiebL05,
author = {Karim Dou{\"{\i}}eb and
Stefan Langerman},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Dynamic Hotlinks},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {182--194},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_17},
doi = {10.1007/11534273\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/DouiebL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 02:49 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:
