|
EATCS
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. The major activities of the EATCS are: * Organization of ICALP, the International Colloquium on Automata, Languages and Programming;Brauer, Ute; Brauer, WilfriedEuropean Association for Theoretical Computer Science / About the Association / Silver Jubilee of EATCS/ref> * Publication of the ''Bulletin of the EATCS''; * Publication of a series of monographs and texts on theoretical computer science; * Publication of the journal ''Theoretical Computer Science''; * Publication of the journal '' Fundamenta Informaticae''. EATCS Award Each year, the EATCS Award is awarded in recognition of a distinguished career in theoretical computer science ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ICALP
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. The ICALP conference series was established by Maurice Nivat, who organized the first ICALP in Paris, France in 1972. The second ICALP was held in 1974, and since 1976 ICALP has been an annual event, nowadays usually taking place in July. Since 1999, the conference was thematically split into two tracks on "Algorithms, Complexity and Games" (Track A) and "Automata, Logic, Semantics, and Theory of Programming" (Track B), corresponding to the (at leas ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Éva Tardos
Éva Tardos (born 1 October 1957) is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University. Tardos's research interest is algorithms. Her work focuses on the design and analysis of efficient methods for combinatorial optimization problems on graphs or networks. She has done some work on network flow algorithms like approximation algorithms for network flows, cut, and clustering problems. Her recent work focuses on algorithmic game theory and simple auctions. Education and career Tardos received her Dipl. Math in 1981 and her Ph.D. 1984 from the Faculty of Sciences of the Eötvös Loránd University under her advisor András Frank. She was the Chair of the Department of Computer Science at Cornell from 2006 to 2010, and she is currently serving as the Associate Dean of the College of Computing and Information Science. She was editor-in-Chief of ''SIAM Journal on Computing'' from 2004 to 2009, and is currently the Economics a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Toniann Pitassi
Toniann Pitassi is a Canadian-American mathematician and computer scientist specializing in computational complexity theory. She is currently Jeffrey L. and Brenda Bleustein Professor of Engineering at Columbia University and was Bell Research Chair at the University of Toronto. Academic career A native of Pittsburgh, Pitassi earned bachelor's and master's degrees at Pennsylvania State University before moving to the University of Toronto for her doctoral studies; she earned her PhD in 1992 from Toronto under the supervision of Stephen Cook. After postdoctoral studies at the University of California, San Diego and faculty positions at the University of Pittsburgh and University of Arizona, she returned to Toronto in 2001, and was a professor in the University of Toronto Department of Computer Science and University of Toronto Department of Mathematics until 2021, when she joined the faculty of Columbia University. She was an invited speaker at International Congress of Mathem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Amos Fiat
Amos Fiat (; born December 1, 1956) is an Israeli computer scientist, a professor of computer science at Tel Aviv University. He is known for his work in cryptography, online algorithms, and algorithmic game theory. Biography Fiat earned his Ph.D. in 1987 from the Weizmann Institute of Science under the supervision of Adi Shamir. After postdoctoral studies with Richard Karp and Manuel Blum at the University of California, Berkeley, he returned to Israel, taking a faculty position at Tel Aviv University. Research Many of Fiat's most highly cited publications concern cryptography, including his work with Adi Shamir on digital signatures (leading to the Fiat–Shamir heuristic for turning interactive identification protocols into signature schemes) and his work with David Chaum and Moni Naor on electronic money, used as the basis for the ecash system. With Shamir and Uriel Feige in 1988, Fiat invented the Feige–Fiat–Shamir identification scheme, a method for using public-key ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Patrick Cousot
Patrick Cousot (born 3 December 1948) is a French computer scientist, currently Silver Professor of Computer Science at the Courant Institute of Mathematical Sciences, New York University, USA. Before he was Professor at the École Normale SupĂ©rieure (ENS), Paris, France, the École Polytechnique, Palaiseau, France and the University of Metz, France and a Research Scientist at the French National Center for Scientific Research (CNRS) at the Joseph Fourier University, Grenoble, France. Together with his wife Radhia Cousot (1947–2014), Patrick Cousot is the originator of abstract interpretation, an influential technique in formal methods. In the 2000s, he has worked on practical methods of static analysis for critical embedded software ( AstrĂ©e), such as found in avionics. In 1999 he received the CNRS Silver Medal and in 2006 the great prize of the EADS Foundation. In 2001, he was bestowed an honorary doctorate by Saarland University, Germany. With Radhia Cousot, he receive ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dexter Kozen
Dexter Campbell Kozen (born December 20, 1951) is an American theoretical computer scientist. He is Professor Emeritus and Joseph Newton Pew, Jr. Professor in Engineering at Cornell University. Career Kozen received his BA in mathematics from Dartmouth College in 1974 and his PhD in computer science in 1977 from Cornell University, where he was advised by Juris Hartmanis on the thesis, ''Complexity of Finitely Presented Algebras''. He is known for his work at the intersection of logic and complexity. He is one of the fathers of dynamic logic and developed the version of the modal ÎĽ-calculus most used today. His work on Kleene algebra with tests was recognized with an Alonzo Church Award in 2022. Moreover, he has written several textbooks on the theory of computation, automata theory, dynamic logic, and algorithms. Kozen was a guitarist, singer, and songwriter in the band "Harmful if Swallowed". He also holds the position of faculty advisor for Cornell's rugby football c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Noam Nisan
Noam Nisan (; born June 20, 1961) is an Israeli computer scientist and professor of computer science at the Hebrew University of Jerusalem. He is known for his research in computational complexity theory and algorithmic game theory. Biography Nisan did his undergraduate studies at the Hebrew University, graduating in 1984. He went to the University of California, Berkeley, for graduate school, and received a Ph.D. in 1988 under the supervision of Richard Karp. After postdoctoral studies at the Massachusetts Institute of Technology he joined the Hebrew University faculty in 1990.Curriculum vitae retrieved 2012-03-01. Selected publications Nisan is the author of[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Christos Papadimitriou
Christos Charilaos Papadimitriou (; born August 16, 1949) is a Greek-American theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University. Education Papadimitriou studied at the National Technical University of Athens, where in 1972 he received his Bachelor of Arts degree in electrical engineering. He then pursued graduate studies at Princeton University, where he received his Ph.D. in electrical engineering and computer science in 1976 after completing a doctoral dissertation titled "The complexity of combinatorial optimization problems." Career Papadimitriou has taught at Harvard, MIT, the National Technical University of Athens, Stanford, UCSD, University of California, Berkeley and is currently the Donovan Family Professor of Computer Science at Columbia University. Papadimitriou co-authored a paper on pancake sorting with Bill Gates, then a Harvard undergraduate. Papadimitriou recalled "Two years later, I called to tell him ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Thomas Henzinger
Thomas Henzinger (born 1962) is an Austrian computer scientist, researcher, and former president of the Institute of Science and Technology, Austria. Early life and education Henzinger was born in Austria. He received his bachelor's degree in computer science from Johannes Kepler University Linz, and his PhD from Stanford University in 1991, advised by Zohar Manna. He is married to Monika Henzinger and has three children. Career Henzinger was successively Assistant Professor of Computer Science at Cornell University (1992–95) and Assistant Professor (1996–97), Associate Professor (1997–98), Professor (1998–2004) and Adjunct Professor (till 2011) of Electrical Engineering and Computer Sciences at the University of California, Berkeley. He was also director of the Max Planck Institute of Computer Science in Saarbrücken, Germany in 1999 and Professor of Computer and Communication Sciences at EPFL (the Swiss Federal Institute of Technology in Lausanne), Switzerland from ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Richard Karp
Richard Manning Karp (born January 3, 1935) is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008. Karp was elected a member of the National Academy of Engineering (1992) for major contributions to the theory and application of NP-completeness, constructing efficient combinatorial algorithms, and applying probabilistic methods in computer science. Biography Born to parents Abraham and Rose Karp in Boston, Massachusetts, Karp has three younger siblings: Robert, David, and Carolyn. His family was Jewish,The Power and Li ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wilfried Brauer
Wilfried Brauer (8 August 1937 – 25 February 2014) was a German computer scientist and Emeritus, professor emeritus at Technical University of Munich. Life and work Brauer studied Mathematics, Physics, and Philosophy at the Free University of Berlin. He received a PhD in Mathematics 1966 from the University of Bonn for a dissertation on the theory of profinite groups. Wilfried Brauer and his wife Ute were two of the 19 founding members of the German Informatics Society. From 1998 to 2001, he was chairman of the German Informatics Society. From 1994 to 1999, he was vice president of the International Federation of Information Processing. He received several awards and honours: * Felix Hausdorff-Gedächtnispreis (1966) * IFIP Silver Core (1986) * honorary doctor of the University of Hamburg (1996) * Werner Heisenberg Medal (2000) * IFIP Isaac L. Auerbach Award (2002) * honorary doctor of the Freie Universität Berlin (2004) * One of ten inaugural fellows of the European Assoc ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
