Related Research Articles
Theoretical computer science (TCS) is a subset of general computer science and mathematics that focuses on mathematical aspects of computer science such as the theory of computation, lambda calculus, and type theory.
The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer scientists as well as to stimulate cooperation between the theoretical and the practical community in computer science.
Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".
ICALP, the International Colloquium on Automata, Languages, and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics.
ACM SIGACT or SIGACT is the Association for Computing Machinery Special Interest Group on Algorithms and Computation Theory, whose purpose is support of research in theoretical computer science. It was founded in 1968 by Patrick C. Fischer.
Arto K. Salomaa is a Finnish mathematician and computer scientist. His research career, which spans over forty years, is focused on formal languages and automata theory.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
DCFS, the International Workshop on Descriptional Complexity of Formal Systems is an annual academic conference in the field of computer science.
CIAA, the International Conference on Implementation and Application of Automata is an annual academic conference in the field of computer science. Its purpose is to bring together members of the academic, research, and industrial community who have an interest in the theory, implementation, and application of automata and related structures. There, the conference concerns research on all aspects of implementation and application of automata and related structures, including theoretical aspects. In 2000, the conference grew out of the Workshop on Implementation of Automata (WIA).
Yuri Gurevich, Professor Emeritus at the University of Michigan, is an American computer scientist and mathematician and the inventor of abstract state machines.
Michael Ralph Fellows AC HFRSNZ MAE is a computer scientist and the Elite Professor of Computer Science in the Department of Informatics at the University of Bergen, Norway as of January 2016.
Mehryar Mohri is a Professor and theoretical computer scientist at the Courant Institute of Mathematical Sciences. He is also a Research Director at Google Research where he heads the Learning Theory team.
Grzegorz Rozenberg is a Polish and Dutch computer scientist.
Maurice Paul Nivat was a French computer scientist. His research in computer science spanned the areas of formal languages, programming language semantics, and discrete geometry. A 2006 citation for an honorary doctorate (Ph.D.) called Nivat one of the fathers of theoretical computer science. He was a professor at the University Paris Diderot until 2001.
Christopher Umans is a professor of Computer Science in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on algorithms, computational complexity, algebraic complexity, and hardness of approximation.
Gunther Schmidt is a German mathematician who works also in informatics.
Giorgio Ausiello is an Italian computer scientist. Born in 1941, in 1966 he graduated in Physics under the supervision of Corrado Böhm. From 1966 to 1980 he served as researcher at the Italian National Research Council (CNR). In 1980 he became Professor of Compilers and Operating Systems at Sapienza University of Rome and since 1990 he has been Professor of Theoretical Computer Science in the Department of Computer, Control and Management Engineering, where he has been until recently the leader of the research group on Algorithm Engineering. At academic level Giorgio Ausiello has been Chairman of the degree in Computer Engineering, Director of the Graduate School, then member of the Academic Senate and finally Chairman of the Research Committee of Sapienza University. In 2012 he has been nominated Professor Emeritus of Sapienza University of Rome.
ACM SIGLOG or SIGLOG is the Association for Computing Machinery Special Interest Group on Logic and Computation. It publishes a news magazine, and has the annual ACM-IEEE Symposium on Logic in Computer Science (LICS) as its flagship conference. In addition, it publishes an online newsletter, the SIGLOG Monthly Bulletin, and "maintains close ties" with the related academic journal ACM Transactions on Computational Logic.
References
- M. Kudlek. "Report on DLT 2004". Bulletin of the EATCS 85:207-215, February 2005. (available for download)
- M. Daley. "Report on DLT 2006". Bulletin of the EATCS 90:227-229, October 2006. (available for download)
- M. Kudlek. "Report on DLT 2008". Bulletin of the EATCS 97:171-174, February 2009.
- M. Kudlek. "Report on DLT 2009". Bulletin of the EATCS 100:155-159, February 2010.
- M. Kudlek. "Report on DLT 2010". Bulletin of the EATCS 102:227-232, October 2010. (available for download)
