dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Jens S. Kohrt Home Page Coauthor index pubzone.org

Jens S. Frederiksen

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeah Epstein, Lene M. Favrholdt, Jens S. Kohrt: Comparing online algorithms for bin packing problems. J. Scheduling 15(1): 13-21 (2012)
2010
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen: List Factoring and Relative Worst Order Analysis. WAOA 2010: 118-129
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen: A theoretical comparison of LRU and LRU-K. Acta Inf. 47(7-8): 359-374 (2010)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen: List Factoring and Relative Worst Order Analysis CoRR abs/1009.5787: (2010)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai: Comparing First-Fit and Next-Fit for online edge coloring. Theor. Comput. Sci. 411(16-18): 1734-1741 (2010)
2008
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai: Comparing First-Fit and Next-Fit for Online Edge Coloring. ISAAC 2008: 89-99
2006
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeah Epstein, Lene M. Favrholdt, Jens S. Kohrt: Separating online scheduling algorithms with the relative worst order ratio. J. Comb. Optim. 12(4): 363-386 (2006)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk: The maximum resource bin packing problem. Theor. Comput. Sci. 362(1-3): 127-139 (2006)
2005
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk: The Maximum Resource Bin Packing Problem. FCT 2005: 397-408
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens S. Kohrt, Kim S. Larsen: On-line seat reservations via off-line seating arrangements. Int. J. Found. Comput. Sci. 16(2): 381-397 (2005)
2004
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens S. Kohrt, Kirk Pruhs: A Constant Approximation Algorithm for Sorting Buffers. LATIN 2004: 193-202
2003
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens S. Frederiksen, Kim S. Larsen: Online Seat Reservations via Offine Seating Arrangements. WADS 2003: 174-185
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut: Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003)
2002
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJens S. Frederiksen, Kim S. Larsen: Packet Bundling. SWAT 2002: 328-337

Coauthor Index

1Joan Boyar (Joan B. Plumstead) [6] [7] [12]
2Martin R. Ehmsen [9] [10] [11] [12] [13]
3Leah Epstein [6] [7] [8] [14]
4Lene M. Favrholdt [6] [7] [8] [9] [10] [14]
5Kim S. Larsen [1] [2] [3] [5] [6] [7] [11] [12] [13]
6Rodica Mihai [9] [10]
7John Noga [2]
8Morten Monrad Pedersen [6] [7]
9Kirk Pruhs [4]
10Patchrawat Uthaisombut [2]
11Sanne Wøhlk [6] [7]

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page