Jens S. Kohrt

According to our database, Jens S. Kohrt authored at least 11 papers between 2002 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

List Factoring and Relative Worst Order Analysis.

Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen

Algorithmica, 2013

2012

Comparing online algorithms for bin packing problems.

Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt

J. Sched., 2012

2010

Comparing First-Fit and Next-Fit for online edge coloring.

Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai

Theor. Comput. Sci., 2010

A theoretical comparison of LRU and LRU-K.

Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen

Acta Informatica, 2010

2006

The maximum resource bin packing problem.

Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt, Kim S. Larsen, Morten Monrad Pedersen, Sanne Wøhlk

Theor. Comput. Sci., 2006

Separating online scheduling algorithms with the relative worst order ratio.

Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt

J. Comb. Optim., 2006

2005

On-line seat reservations via off-line seating arrangements.

Jens S. Kohrt, Kim S. Larsen

Int. J. Found. Comput. Sci., 2005

2004

A Constant Approximation Algorithm for Sorting Buffers.

Jens S. Kohrt, Kirk Pruhs

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

Dynamic TCP acknowledgment in the LogP model.

Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut

J. Algorithms, 2003

Online Seat Reservations via Offine Seating Arrangements.

Jens S. Frederiksen, Kim S. Larsen

Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

2002

Packet Bundling.

Jens S. Frederiksen, Kim S. Larsen

Proceedings of the Algorithm Theory, 2002