 | 2012 |
| 21 |  | Prosenjit Bose,
Karim Douïeb,
Vida Dujmovic,
John Howat:
Layered Working-Set Trees.
Algorithmica 63(1-2): 476-489 (2012) |
| 2011 |
| 20 |  | Karim Douïeb,
Matthew Eastman,
Anil Maheshwari,
Michiel H. M. Smid:
Approximation Algorithms for a Triangle Enclosure Problem.
CCCG 2011 |
| 2010 |
| 19 |  | Prosenjit Bose,
Karim Douïeb,
Vida Dujmovic,
John Howat,
Pat Morin:
Fast local searches and updates in bounded universes.
CCCG 2010: 261-264 |
| 18 |  | 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 |
| 17 |  | Prosenjit Bose,
Karim Douïeb:
Should Static Search Trees Ever Be Unbalanced?
ISAAC (1) 2010: 109-120 |
| 16 |  | 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 |
| 15 |  | Prosenjit Bose,
Karim Douïeb,
Pat Morin:
Skip Lift: A Probabilistic Alternative to Red-Black Trees.
IWOCA 2010: 226-237 |
| 14 |  | Prosenjit Bose,
Karim Douïeb,
Vida Dujmovic,
John Howat:
Layered Working-Set Trees.
LATIN 2010: 686-696 |
| 13 |  | 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 |
| 12 |  | Karim Douïeb,
Stefan Langerman:
Near-Entropy Hotlink Assignments.
Algorithmica 58(2): 221-244 (2010) |
| 11 |  | Prosenjit Bose,
Luc Devroye,
Karim Douïeb,
Vida Dujmovic,
James King,
Pat Morin:
Point Location in Disconnected Planar Subdivisions
CoRR abs/1001.2763: (2010) |
| 10 |  | 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) |
| 9 |  | Prosenjit Bose,
Luc Devroye,
Karim Douïeb,
Vida Dujmovic,
James King,
Pat Morin:
Odds-On Trees
CoRR abs/1002.1092: (2010) |
| 8 |  | 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) |
| 7 |  | Prosenjit Bose,
Karim Douïeb:
Should Static Search Trees Ever Be Unbalanced?
CoRR abs/1006.3715: (2010) |
| 2009 |
| 6 |  | Prosenjit Bose,
Karim Douïeb:
Efficient Construction of Near-Optimal Binary and Multiway Search Trees.
WADS 2009: 230-241 |
| 5 |  | Prosenjit Bose,
Karim Douïeb,
Vida Dujmovic,
John Howat:
Layered Working-Set Trees
CoRR abs/0907.2071: (2009) |
| 2008 |
| 4 |  | Prosenjit Bose,
Karim Douïeb,
Stefan Langerman:
Dynamic optimality for skip lists and B-trees.
SODA 2008: 1106-1114 |
| 3 |  | Karim Douïeb,
Stefan Langerman:
Dynamic Hotlinks.
Algorithmica 50(2): 208-222 (2008) |
| 2006 |
| 2 |  | Karim Douïeb,
Stefan Langerman:
Near-Entropy Hotlink Assignments.
ESA 2006: 292-303 |
| 2005 |
| 1 |  | Karim Douïeb,
Stefan Langerman:
Dynamic Hotlinks.
WADS 2005: 182-194 |