Project Grant 2442250
Award Date
10/1/25
Completion Date
9/30/30
Dollars Obligated
$271K
Federal Agency
Division of Computing and Communication Foundations
Federal Grant Program
47.070
Assistance Type
Project Grant
Place of Performance
Boston, MA 02215, USA
Similar Awards
This $443,217 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports research on fast combinatorial algorithms for graph problems such as maximum matching, maximum flow, and shortest paths. The award aims to develop new algorithms for dynamic graphs, where the graph structure changes over time, as well as improve expander-related tools that can serve as building blocks for many graph algorithms....
This $255,353 federal Project Grant award, funded by the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070), supports research on sublinear-time graph algorithms. The award aims to develop more efficient and optimal sublinear-time algorithms for foundational graph problems, understand the limitations of such algorithms through query lower bounds, and explore connections between sublinear-time graph algorithms and other...
This Project Grant award under the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) will support the development of general algorithmic frameworks and frameworks for analyzing and manipulating various types of real-world networks, such as gene regulatory networks, brain networks, and online social networks. The $320,000 award to the Massachusetts Institute of Technology (MIT) will fund research to create provably-efficient...
This $442,096 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports research by the University of Pennsylvania on fast combinatorial algorithms for dynamic matching and shortest paths problems in graphs. The research aims to develop advanced algorithms and techniques that can efficiently solve fundamental graph problems, with applications in areas such as road networks, computer networks, and social...
This $299,996 Project Grant award from the National Science Foundation (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports research to develop novel distributed processing algorithms and frameworks for analyzing massive datasets. The key objectives are to create iterative algorithms that can effectively handle distributed, dynamic, and stochastic data processing scenarios, going beyond the limitations of synchronous, error-free data processing. The...
This National Science Foundation (NSF) Project Grant, awarded under the Mathematical and Physical Sciences grant program (CFDA 47.049), supports fundamental and applied research on edge coloring and edge packing in graphs. The $137,955 award, with a performance period from January 15, 2025, to December 31, 2027, will fund the University of Massachusetts Lowell to explore the theoretical and algorithmic aspects of these graph-based optimization problems, which have applications in areas like...
This $330,000 Project Grant award from the National Science Foundation's Division of Information and Intelligent Systems (CFDA 47.070 - Computer and Information Science and Engineering) supports collaborative research at the Massachusetts Institute of Technology (MIT) to accelerate the execution of large graph problems on large, distributed computing systems. The project aims to develop new algorithms, software frameworks, and specialized hardware to enable more efficient processing of graph...
This $600,000 Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering (CISE) program (CFDA 47.070) supports fundamental research into the mathematical foundations for using graph-structured data in machine learning applications. The key products and services to be delivered under this 3-year award include: Characterizing how the geometry of the underlying latent space affects structural and combinatorial properties of graphs, to enable...
This Project Grant award from the National Science Foundation's (NSF) Computer and Information Science and Engineering program (CFDA 47.070) supports a collaborative research effort to accelerate the execution of large-scale graph problems on distributed computing systems. The $2,656,268 award, active from August 1, 2023 to July 31, 2028, aims to develop new algorithms, software frameworks, and hardware accelerators to efficiently process large graph datasets in domains like computational...
This National Science Foundation (NSF) award under the Computer and Information Science and Engineering (CFDA 47.070) program provides $245,755 to the Regents of the University of California at Riverside to conduct research on developing efficient approximation algorithms for constraint satisfaction problems. The project aims to advance the theoretical understanding of optimization and computation by leveraging mathematical disciplines such as graph theory, algebra, and topology. The research...