Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Larsen, Kim S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Relative interval analysis of paging algorithms on access graphs
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Theoretical Computer Science
568
, 2015, pp. 28-48
Online bin packing with advice
Joan Boyar
,
Shahin Kamali
,
Kim S. Larsen
,
Alejandro López-Ortiz
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 174-186
A comparison of performance measures via online search
Joan Boyar
,
Kim S. Larsen
,
Abyayananda Maiti
Theoretical Computer Science
532
, 2014, pp. 2-13
Online bin covering: Expectations vs. guarantees
Marie G. Christ
,
Lene M. Favrholdt
,
Kim S. Larsen
Theoretical Computer Science
556
, 2014, pp. 71-84
Relative interval analysis of paging algorithms on access graphs
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Lecture Notes in Computer Science
8037
, 2013, pp. 195-206
Online multi-coloring on the path revisited
Marie G. Christ
,
Lene M. Favrholdt
,
Kim S. Larsen
Acta Informatica
50
(5-6), 2013, pp. 343-357
List factoring and relative worst order analysis
Martin R. Ehmsen
,
Jens S. Kohrt
,
Kim S. Larsen
Algorithmica
66
(2), 2013, pp. 287-309
A technique for exact computation of precoloring extension on interval graphs
Martin R. Ehmsen
,
Kim S. Larsen
International Journal of Foundations of Computer Science
24
(1), 2013, pp. 109-122
Better bounds on online unit clustering
Martin R. Ehmsen
,
Kim S. Larsen
Theoretical Computer Science
500
, 2013, pp. 1-24
Access graphs results for LRU versus FIFO under relative worst order analysis
Joan Boyar
,
Sushmita Gupta
,
Kim S. Larsen
Lecture Notes in Computer Science
7357
, 2012, pp. 328-339
A theoretical comparison of LRU and LRU-K
Joan Boyar
,
Martin R. Ehmsen
,
Jens S. Kohrt
,
Kim S. Larsen
Acta Informatica
47
(7-8), 2011, pp. 359-374
Priority algorithms for graph optimization problems
Allan Borodin
,
Joan Boyar
,
Kim S. Larsen
,
Nazanin Mirmohammadi
Theoretical Computer Science
411
(1), 2010, pp. 239-258
Better bounds on online unit clustering
Martin R. Ehmsen
,
Kim S. Larsen
Lecture Notes in Computer Science
6139
, 2010, pp. 371-382
A comparison of performance measures for online algorithms
Joan Boyar
,
Sandy Irani
,
Kim S. Larsen
Lecture Notes in Computer Science
5664
, 2009, pp. 119-130
The relative worst-order ratio applied to paging
Joan Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
Journal of Computer and System Sciences
73
(5), 2007, pp. 818-843
The maximum resource bin packing problem
Joan Boyar
,
Leah Epstein
,
Lene M. Favrholdt
,
Jens S. Kohrt
,
Kim S. Larsen
,
Morten M. Pedersen
,
Sanne Whlk
Theoretical Computer Science
362
(1-3), 2006, pp. 127-139
Priority algorithms for graph optimization problems
Allan Borodin
,
Joan Boyar
,
Kim S. Larsen
Lecture Notes in Computer Science
3351
, 2005, pp. 126-139
On-line seat reservations via off-line seating arrangements
Jens S. Kohrt
,
Kim S. Larsen
International Journal of Foundations of Computer Science
16
(2), 2005, pp. 381-397
Extending the accommodating function
Joan Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Acta Informatica
40
(1), 2003, pp. 3-35
Dynamic TCP acknowledgment in the LogP model
Jens S. Frederiksen
,
Kim S. Larsen
,
John Noga
,
Patchrawat Uthaisombut
Journal of Algorithms
48
(2), 2003, pp. 407-428
Online seat reservations via offline seating arrangements
Jens S. Frederiksen
,
Kim S. Larsen
Lecture Notes in Computer Science
2748
, 2003, pp. 174-185
Relaxed multi-way trees with group updates
Kim S. Larsen
Journal of Computer and System Sciences
66
(4), 2003, pp. 657-670
Fair versus unrestricted bin packing
Yossi Azar
,
Joan Boyar
,
Leah Epstein
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Algorithmica
34
(2), 2002, pp. 181-196
Extending the accommodating function
Joan Boyar
,
Lene M. Favrholdt
,
Kim S. Larsen
,
Morten N. Nielsen
Lecture Notes in Computer Science
2387
, 2002, pp. 87-96
Packet bundling
Jens S. Frederiksen
,
Kim S. Larsen
Lecture Notes in Computer Science
2368
, 2002, pp. 328-337
Seiten 1
2
3
>