List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Assembling approximately optimal binary search trees efficiently using arithmetics Information Processing Letters | 2010-08-20 | Paper |
| Covering analysis of the greedy algorithm for partial cover Algorithms and Applications | 2010-05-04 | Paper |
| Following the Perturbed Leader to Gamble at Multi-armed Bandits Lecture Notes in Computer Science | 2008-08-19 | Paper |
| Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance Algorithms and Computation | 2008-04-24 | Paper |
| The cost of offline binary search tree algorithms and the complexity of the request sequence Theoretical Computer Science | 2008-04-15 | Paper |
| Algorithmic Learning Theory Lecture Notes in Computer Science | 2006-11-01 | Paper |
Research outcomes over time
This page was built for person: Jussi Kujala
