| 2005 |
|---|
| 9 | Worst case constant time priority queue. Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro, J. Ian Munro. Journal of Systems and Software (78): 249-256 (2005). Web SearchBibTeXDownload |
| 2002 |
|---|
| 8 | Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. Int. J. Comput. Geometry Appl. (12): 283-296 (2002). Web SearchBibTeXDownload |
| 2001 |
|---|
| 7 | Worst case constant time priority queue. Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro, J. Ian Munro. SODA 2001, 523-528. Web SearchBibTeXDownload |
| 2000 |
|---|
| 6 | Online Routing in Convex Subdivisions. Prosenjit Bose, Andrej Brodnik, Andrej Brodnik, Svante Carlsson, Rudolf Fleischer, Alejandro López-Ortiz, J. Ian Munro, Alejandro López-Ortiz. ISAAC 2000, 47-59. Web SearchBibTeXDownload |
| 1999 |
|---|
| 5 | Resizable Arrays in Optimal Time and Space. Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick. WADS 1999, 37-48. Web SearchBibTeXDownload |
| 1992 |
|---|
| 4 | A General Approach to Dominance in the Plane. Mark de Berg, Svante Carlsson, Mark H. Overmars. J. Algorithms (13): 274-296 (1992). Web SearchBibTeXDownload |
| 3 | In-place Linear Probing Sort. Svante Carlsson, Jyrki Katajainen, Jukka Teuhola. STACS 1992, 581-587. Web SearchBibTeXDownload |
| 1991 |
|---|
| 2 | A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson. STACS 1991, 296-308. Web SearchBibTeXDownload |
| 1988 |
|---|
| 1 | An Implicit Binomial Queue with Constant Insertion Time. Svante Carlsson, J. Ian Munro, Patricio V. Poblete. SWAT 1988, 1-13. Web SearchBibTeXDownload |
