[mail][print]

Publications

Note that before my marriage my name was Jens Svalgaard Frederiksen. Also note that most of the Journal Papers have appeared in an earlier conference version.

Journal Papers

List factoring and relative worst order analysis
Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
Algorithmica, 66(2):287-309, 2013.
Comparing online algorithms for bin packing problems
Leah Epstein, Lene M. Favrholdt, and Jens S. Kohrt.
Journal of Scheduling, 15(1):13-21, 2012.
A theoretical comparison of LRU and LRU-K
Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
Acta Informatica, 47(7-8):359-374, 2010.
Comparing first-fit and next-fit for online edge coloring
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, and Rodica Mihai.
Theoretical Computer Science, 411:1734-1741, 2010.
Separating online scheduling algorithms with the relative worst order ratio
Leah Epstein, Lene M. Favrholdt, and Jens S. Kohrt.
Journal of Combinatorial Optimization, 12(4):362-385, 2006.
The maximum resource bin packing problem
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, and Sanne W°hlk.
Theoretical Computer Science, 362:127-139, 2006.
On-line seat reservations via off-line seating arrangements
Jens S. Kohrt and Kim S. Larsen.
International Journal of Foundations of Computer Science, 16(2):381-397, April 2005.
Dynamic TCP acknowledgment in the LogP model
Jens S. Frederiksen, Kim S. Larsen, John Noga, and Patchrawat Uthaisombut.
Journal of Algorithms, 48(2):407-428, September 2003.

Conference Papers

List factoring and relative worst order analysis
Martin R. Ehmsen, Jens S. Kohrt, and Kim S. Larsen.
In Proceedings of 8th International Workshop on Approximation and Online Algorithms (WAOA 2010), volume 6534 of Lecture Notes in Computer Science, pages 118-129. Springer-Verlag, 2011.
Comparing first-fit and next-fit for online edge coloring
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, and Rodica Mihai.
In Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), volume 2368 of Lecture Notes in Computer Science, pages 89-99. Springer-Verlag, 2008.
A constant approximation algorithm for sorting buffers
Jens S. Kohrt and Kirk Pruhs.
In Proceedings of the Sixth Latin American Symposium (LATIN 2004), volume 2976 of Lecture Notes in Computer Science, pages 193-202. Springer-Verlag, 2004.
Packet bundling
Jens S. Frederiksen and Kim S. Larsen.
In Proceedings of the Eighth Scandinavian Workshop on Algorithm Theory (SWAT 2002), volume 2368 of Lecture Notes in Computer Science, pages 328-337. Springer-Verlag, 2002.

Ph.D. Thesis

Online Algorithms under New Assumptions
Jens Svalgaard Kohrt.
PhD thesis, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark, 2004.

Co-authors