The DOE SC program in Advanced Scientific Computing Research (ASCR) hereby announces its interest in basic research in the design, development, analysis, and scalability of randomized algorithms for ...

Algorithm design and analysis is fundamental to all areas of computer science and gives a rigorous framework for the study optimization. This course provides an introduction to algorithm design ...

Background: The provision of nutritional support for patients in intensive care units (ICUs) varies widely both within and between institutions. We tested the hypothesis that evidence-based algorithms ...

What’s easy for a computer to do, and what’s almost impossible? Those questions form the core of computational complexity. We present a map of the landscape. How fundamentally difficult is a problem?

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

From Quanta Magazine (find original story here). In a lab at the Georgia Institute of Technology, physicists run experiments with robots that look as though they came from the dollar store. The robots ...