Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeremy T. Fineman
- > Home > Persons > Jeremy T. Fineman
Publications
- 2023
[i20]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert
, John Kuszmaul, Maxwell Young:
Robust and Listening-Efficient Contention Resolution. CoRR abs/2302.07751 (2023)- 2020
- [c55]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
Contention Resolution with Message Deadlines. SPAA 2020: 23-35 - 2019
- [j8]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
Scaling Exponential Backoff: Constant Throughput, Polylogarithmic Channel-Access Attempts, and Robustness. J. ACM 66(1): 6:1-6:33 (2019) - 2017
- [j6]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Storage Reallocation. ACM Trans. Algorithms 13(3): 38:1-38:20 (2017) - [c44]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Tsvi Kopelowitz, Pablo Montes:
File Maintenance: When in Doubt, Change the Layout! SODA 2017: 1503-1522 - [c43]Peyman Afshani, Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Mayank Goswami, Meng-Tsung Tsai:
Cross-Referenced Dictionaries and the Limits of Write Optimization. SODA 2017: 1523-1532 - 2016
- [j5]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert E. Tarjan:
A New Approach to Incremental Cycle Detection and Related Problems. ACM Trans. Algorithms 12(2): 14:1-14:22 (2016) - [c38]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. SODA 2016: 636-654 - [c36]Michael A. Bender, Erik D. Demaine, Roozbeh Ebrahimi, Jeremy T. Fineman, Rob Johnson, Andrea Lincoln, Jayson Lynch, Samuel McCauley:
Cache-Adaptive Analysis. SPAA 2016: 135-144 - 2015
- [j3]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. Algorithmica 73(2): 389-409 (2015) - [j2]Michael A. Bender, Jeremy T. Fineman, Mahnush Movahedi, Jared Saia, Varsha Dani, Seth Gilbert, Seth Pettie, Maxwell Young:
Resource-Competitive Algorithms. SIGACT News 46(3): 57-71 (2015) - [c32]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Reallocation for Scheduling and Planning. SPAA 2015: 143-154 - 2014
- [c26]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. PODS 2014: 278-288 - [c24]Michael A. Bender, Roozbeh Ebrahimi, Jeremy T. Fineman, Golnaz Ghasemiesfeh, Rob Johnson, Samuel McCauley:
Cache-Adaptive Algorithms. SODA 2014: 958-971 - [i7]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Maxwell Young:
NoiseOFF: A Backoff Protocol for a Dynamic, Noisy World. CoRR abs/1402.5207 (2014) - [i5]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. CoRR abs/1404.2019 (2014) - 2013
- [c16]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. SPAA 2013: 271-279 - [i4]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. CoRR abs/1305.6555 (2013) - 2011
- [i2]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Robert Endre Tarjan:
A New Approach to Incremental Cycle Detection and Related Problems. CoRR abs/1112.0784 (2011) - 2009
- [j1]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
The Worst Page-Replacement Policy. Theory Comput. Syst. 44(2): 175-185 (2009) - [c9]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert:
A new approach to incremental topological ordering. SODA 2009: 1108-1115 - 2007
- [c5]Kunal Agrawal, Michael A. Bender, Jeremy T. Fineman:
The Worst Page-Replacement Policy. FUN 2007: 135-145 - [c4]Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson:
Cache-oblivious streaming B-trees. SPAA 2007: 81-92 - 2006
- [c3]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert:
Contention Resolution with Heterogeneous Job Sizes. ESA 2006: 112-123 - 2005
- [c2]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul:
Concurrent cache-oblivious b-trees. SPAA 2005: 228-237 - 2004
- [c1]Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson:
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. SPAA 2004: 133-144
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-02-07 03:15 CET 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:
