Algorithms and Theory
Conferences accepting a broad range of topics from theoretical computer science, including algorithms, data structures, computability, computational complexity, automata theory and formal languages:
- STOC - ACM Symposium on Theory of Computing
- FOCS - IEEE Symposium on Foundations of Computer Science
- ICALP - International Colloquium on Automata, Languages and Programming
- STACS - Symposium on Theoretical Aspects of Computer Science
- ISAAC - International Symposium on Algorithms and Computation
- MFCS - International Symposium on Mathematical Foundations of Computer Science
- FSTTCS - IARCS Conference on Foundations of Software Technology and Theoretical Computer Science
- COCOON - International Computing and Combinatorics Conference
- WoLLIC - Workshop on Logic, Language, Information and Computation
Read more about this topic: List Of Computer Science Conferences
Famous quotes containing the word theory:
“If my theory of relativity is proven correct, Germany will claim me as a German and France will declare that I am a citizen of the world. Should my theory prove untrue, France will say that I am a German and Germany will declare that I am a Jew.”
—Albert Einstein (1879–1955)