NSF award 2608359 · New York University

AF: Small: Towards New Relaxations for Online Algorithms

Final report due

28 January 2028

in 467 days · The award ends on 30 September 2027.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Jun 2027in 227 days
award ending 2027-09-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 Aug 2027in 302 days
award ending 2027-09-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Sep 2027in 337 days
award ending 2027-09-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Jan 2028in 467 days
award ending 2027-09-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Jan 2028in 467 days
award ending 2027-09-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Jan 2028in 467 days
award ending 2027-09-30 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 30 September 2027.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 January 2028.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2608359
Period of support: 1 Dec 2025 – 30 Sep 2027
Amount: $600,000
Awardee: New York University, NEW York, NY
Program: Algorithmic Foundations
Directorate: CSE

Abstract

We all are regularly asked to make decisions in the face of uncertainty: we decide how best to drive to work or how and at what prices to buy and sell things (everything from houses to groceries). And our computers make such choices as well to give good performance to their users: which order to process tasks q to maximize the throughput or minimize user delay, or which pages to keep in fast memory (because they…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.