See program guidelines for contact information.
The Algorithmic Foundations (AF) program supports potentially transformative research and education projects advancing design and analysis of algorithms and characterized by algorithmic thinking accompanied by rigorous analysis. Research on algorithms for problems that are central to computer science and engineering as well as new techniques for the rigorous analysis of algorithms are of interest. AF supports theoretical research that bounds the intrinsic difficulty of problems to determine the measures of complexity in formal models of computation, classical or new. The goal is to understand the fundamental limits of resource-bounded computation and to obtain efficient solutions within those limits. Specifically, the time and space complexity of finding exact and approximate solutions in deterministic and randomized models of computation is a central concern of the program. Research on resources other than time and space, such as communication and energy, is also encouraged. In addition to the traditional, sequential computing paradigm, AF supports research on the design and analysis of novel algorithms in parallel and distributed models, in particular, in heterogeneous multi-core and many-core machines; the computational models and algorithms that capture essential aspects of computing over massive data sets; game theory and social networks; and alternative forms of computation and information processing, including quantum computing and biological models of computation.
The program supports research in algorithms needed in all areas, both within and outside computer science. Algorithmic research with applications in databases, machine learning, data mining, networks, communications, operating systems, languages, compilers, and machine abstractions is supported. New techniques for the design and analysis of algorithms in areas such as cryptography, computational geometry, computational biology, game theory, social networks and numerical, symbolic, and algebraic computing are appropriate for this program. Relevance to application areas is important and collaborations with researchers in those areas are encouraged. However, research funded by this program must advance the study of algorithms.
Research on parallelism and scalability that promises to lead to a new era of parallel computing is now supported through a separate program, eXploiting Parallelism and Scalability (XPS; see http://www.nsf.gov/funding/pgm_summ.jsp?pims_id=504842). XPS is particularly interested in “clean-slate” approaches that re-evaluate and possibly re-design the traditional hardware and software stack.
More information on topics appropriate for the Algorithmic Foundations program is available at:
Algorithmic Foundations (AF) Staff
Funding Opportunities for the Algorithmic Foundations Program:
Computing and Communication Foundations (CCF): Core Programs. NSF 15-573
THIS PROGRAM IS PART OF
Computing and Communication Foundations (CCF): Core Programs