Prosenjit Bose (1)

Identifiers

• name variant Prosenjit Bose (1) 0.60 · backfill

Papers (1)

1. An O(loglog n)-Competitive Binary Search Tree with Optimal Worst-Case Access Times cs.DS · 2010 · author #1

Mentions

• 1003.0139 #1 · backfill · confidence 0.70 Prosenjit Bose (1)

Frequent Coauthors

• (2) Department of Mathematics 1 shared papers
• Carleton University 1 shared papers
• Computer Science 1 shared papers
• Karim Dou\"ieb (1) 1 shared papers
• Rolf Fagerberg (2) ((1) School of Computer Science 1 shared papers
• University of Southern Denmark) 1 shared papers
• Vida Dujmovic (1) 1 shared papers