COVID-19 UPDATES • 3/5/2021
Computer science theory assesses which problems are possible and feasible to solve through theories of computability, undecidability, complexity, reducibility, and approximability.
Research in algorithms involves the best ways to formulate computational tasks as well as solve them in various serial, parallel, streaming, and distributed environments.
Computer scientists introduce innovative new work at annual conferences. The most prestigious Theory and Algorithms conferences are:
European Symposium on Algorithms (ESA)
International Colloquium on Automata, Languages and Programming (ICALP)