default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTracy Kimbrel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j13]Niv Buchbinder
, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61(4): 1014-1029 (2013)
2000 – 2009
- 2009
- [c16]Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko:
On Hardness of Pricing Items for Single-Minded Bidders. APPROX-RANDOM 2009: 202-216 - 2008
- [j12]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber:
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. 42(1): 2-26 (2008) - [j11]Tracy Kimbrel, Maxim Sviridenko:
High-multiplicity cyclic job shop scheduling. Oper. Res. Lett. 36(5): 574-578 (2008) - [c15]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA 2008: 952-961 - 2007
- [j10]Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz:
Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM J. Res. Dev. 51(3/4): 391-408 (2007) - [j9]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Speed scaling to manage energy and temperature. J. ACM 54(1): 3:1-3:39 (2007) - [c14]Matthew Kaplan, Tracy Kimbrel, Kevin Mckenzie, Richard Prewitt, Maxim Sviridenko, Clay Williams, Cemal Yilmaz:
Test Machine Scheduling and Optimization for z/ OS. CISched 2007: 27-34 - 2006
- [j8]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko:
Job Shop Scheduling with Unit Processing Times. Math. Oper. Res. 31(2): 381-389 (2006) - [j7]Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. J. Sched. 9(4): 365-379 (2006) - [j6]Oktay Günlük, Tracy Kimbrel, Laszlo Ladányi, Baruch Schieber, Gregory B. Sorkin:
Vehicle Routing and Staffing for Sedan Service. Transp. Sci. 40(3): 313-326 (2006) - [c13]Alexei A. Karve, Tracy Kimbrel, Giovanni Pacifici, Mike Spreitzer, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi:
Dynamic placement for clustered web applications. WWW 2006: 595-604 - 2005
- [c12]Nikhil Bansal, Tracy Kimbrel, Maxim Sviridenko:
Job shop scheduling with unit processing times. SODA 2005: 207-214 - [c11]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber:
Traffic engineering of management flows by link augmentations on confluent trees. SPAA 2005: 289-298 - [c10]Tracy Kimbrel, Malgorzata Steinder, Maxim Sviridenko, Asser N. Tantawi:
Dynamic Application Placement Under Service and Memory Constraints. WEA 2005: 391-402 - 2004
- [c9]Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Dynamic Speed Scaling to Manage Energy and Temperature. FOCS 2004: 520-529 - [c8]Nikhil Bansal, Lisa Fleischer, Tracy Kimbrel, Mohammad Mahdian, Baruch Schieber, Maxim Sviridenko:
Further Improvements in Competitive Guarantees for QoS Buffering. ICALP 2004: 196-207 - [c7]Tracy Kimbrel, Baruch Schieber, Maxim Sviridenko:
Minimizing migrations in fair multiprocessor scheduling of persistent tasks. SODA 2004: 982-991 - 2002
- [j5]Tracy Kimbrel:
Interleaved Prefetching. Algorithmica 32(1): 107-122 (2002) - 2001
- [j4]Eric J. Anderson, T. S. Jayram, Tracy Kimbrel:
Tighter Bounds on Preemptive Job Shop Scheduling with Two Machines. Computing 67(1): 83-90 (2001) - [j3]Tracy Kimbrel:
Online paging and file caching with expiration times. Theor. Comput. Sci. 268(1): 119-131 (2001) - [c6]T. S. Jayram, Tracy Kimbrel, Robert Krauthgamer, Baruch Schieber, Maxim Sviridenko:
Online server allocation in a server farm via benefit task systems. STOC 2001: 540-549 - 2000
- [j2]Tracy Kimbrel, Anna R. Karlin:
Near-Optimal Parallel Prefetching and Caching. SIAM J. Comput. 29(4): 1051-1082 (2000)
1990 – 1999
- 1999
- [c5]Tracy Kimbrel:
Interleaved Prefetching. SODA 1999: 557-565 - 1998
- [c4]Geoffrey M. Voelker, Eric J. Anderson, Tracy Kimbrel, Michael J. Feeley, Jeffrey S. Chase, Anna R. Karlin, Henry M. Levy:
Implementing Cooperative Prefetching and Caching in a Globally-Managed Memory System. SIGMETRICS 1998: 33-43 - 1997
- [b1]Tracy Kimbrel:
Parallel prefetching and caching. University of Washington, USA, 1997 - 1996
- [c3]Tracy Kimbrel, Anna R. Karlin:
Near-Optimal Parallel Prefetching and Caching. FOCS 1996: 540-549 - [c2]Tracy Kimbrel, Andrew Tomkins, R. Hugo Patterson, Brian N. Bershad, Pei Cao, Edward W. Felten, Garth A. Gibson, Anna R. Karlin, Kai Li:
A Trace-Driven Comparison of Algorithms for Parallel Prefetching and Caching. OSDI 1996: 19-34 - [c1]Tracy Kimbrel, Pei Cao, Edward W. Felten, Anna R. Karlin, Kai Li:
Integrating Parallel Prefetching and Caching. SIGMETRICS 1996: 262-263 - 1993
- [j1]Tracy Kimbrel, Rakesh K. Sinha:
A Probabilistic Algorithm for Verifying Matrix Products Using O(n²) Time and log_2 n + O(1) Random Bits. Inf. Process. Lett. 45(2): 107-110 (1993)
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:57 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:
