default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJens S. Kohrt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j8]Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen
:
List Factoring and Relative Worst Order Analysis. Algorithmica 66(2): 287-309 (2013)- 2012
- [j7]Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt:
Comparing online algorithms for bin packing problems. J. Sched. 15(1): 13-21 (2012) - 2010
- [j6]Joan Boyar, Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
A theoretical comparison of LRU and LRU-K. Acta Informatica 47(7-8): 359-374 (2010) - [j5]Martin 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) - [c6]Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
List Factoring and Relative Worst Order Analysis. WAOA 2010: 118-129 - [i1]Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
List Factoring and Relative Worst Order Analysis. CoRR abs/1009.5787 (2010)
2000 – 2009
- 2008
- [c5]Martin 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
- [j4]Leah 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) - [j3]Joan 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
- [j2]Jens S. Kohrt, Kim S. Larsen:
On-line seat reservations via off-line seating arrangements. Int. J. Found. Comput. Sci. 16(2): 381-397 (2005) - [c4]Joan 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 - 2004
- [c3]Jens S. Kohrt, Kirk Pruhs:
A Constant Approximation Algorithm for Sorting Buffers. LATIN 2004: 193-202 - 2003
- [j1]Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut:
Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003) - [c2]Jens S. Frederiksen, Kim S. Larsen:
Online Seat Reservations via Offine Seating Arrangements. WADS 2003: 174-185 - 2002
- [c1]Jens S. Frederiksen, Kim S. Larsen:
Packet Bundling. SWAT 2002: 328-337
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
