|
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 least ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
International Colloquium On Automata, Languages And Programming
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-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-2009, and is currently the Economics and Com ... [...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 Limit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moshe Vardi
, honorific_suffix = , image = Moshe Vardi IMG 0010.jpg , birth_date = , birth_place = Israel , workplaces = Rice UniversityIBM ResearchStanford University , alma_mater = , thesis_title = The Implication Problem for Data Dependencies in the Relational Model , thesis_url = , thesis_year = 1981 , doctoral_advisor = Catriel Beeri , doctoral_students = Kristin Yvonne Rozier , fields = LogicComputation , awards = , website = Moshe Ya'akov Vardi ( he, משה יעקב ורדי) is an Israeli mathematician and computer scientist. He is a Professor of Computer Science at Rice University, United States. He is University Professor, the Karen Ostrum George Professor in Computational Engineering, Distinguished Service Professor, and director of the Ken Kennedy Institute for Information Technology. His interests focus on applications of logic to computer science, including database theory, finite mode ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wilfried Brauer
Wilfried Brauer (8 August 1937 – 25 February 2014) was a German computer scientist and 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 Association fo ... [...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 Joseph Newton Pew, Jr. Professor in Engineering at Cornell University. He received his B.A. from Dartmouth College in 1974 and his PhD in computer science in 1977 from Cornell University, where he was advised by Juris Hartmanis. He advised numerous Ph.D. students. He is a Fellow of the Association for Computing Machinery, a Guggenheim Fellow, and has received an Outstanding Innovation Award from IBM Corporation. He has also been named Faculty of the Year by the Association of Computer Science Undergraduates at Cornell. Dexter Kozen was one of the first professors to receive the honor of a professorship at The Radboud Excellence Initiative at Radboud University Nijmegen in the Netherlands. 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. Moreover, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Martin Dyer
Martin Edward Dyer (born 16 July 1946 in Ryde, Isle of Wight, England) is a professor in the School of Computing at the University of Leeds, Leeds, England. He graduated from the University of Leeds in 1967, obtained his MSc from Imperial College London in 1968 and his PhD from the University of Leeds in 1979. His research interests lie in theoretical computer science, discrete optimization and combinatorics. Currently, he focuses on the complexity of counting and the efficiency of Markov chain algorithms for approximate counting. Key contributions Four key contributions made by Martin Dyer are: #polynomial time algorithm for approximating the volume of convex bodies (with Alan Frieze and Ravindran Kannan) #linear programming in fixed dimensions #the path coupling method for proving mixing of Markov chains (with Russ Bubley) #complexity of counting constraint satisfaction problems Awards and honours In 1991, Professor Dyer received the Fulkerson Prize in Discrete Mathem ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Christos Papadimitriou
Christos Charilaos Papadimitriou ( el, Χρήστος Χαρίλαος "Χρίστος" Παπαδημητρίου; born August 16, 1949) is a Greek 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 undergra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Noam Nisan
Noam Nisan ( he, נעם ניסן; born June 20, 1961) is an Israeli computer scientist, a 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] |
Toniann Pitassi
Toniann Pitassi is a Canadian and 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 Ph.D. 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 Ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gordon Plotkin
Gordon David Plotkin, (born 9 September 1946) is a theoretical computer scientist in the School of Informatics at the University of Edinburgh. Plotkin is probably best known for his introduction of structural operational semantics (SOS) and his work on denotational semantics. In particular, his notes on ''A Structural Approach to Operational Semantics'' were very influential. He has contributed to many other areas of computer science. Education Plotkin was educated at the University of Glasgow and the University of Edinburgh, gaining his Bachelor of Science degree in 1967 and PhD in 1972 supervised by Rod Burstall. Career and research Plotkin has remained at Edinburgh, and was, with Burstall and Robin Milner, a co-founder of the Laboratory for Foundations of Computer Science (LFCS). His former doctoral students include Luca Cardelli, Philippa Gardner, Doug Gurr, Eugenio Moggi, and Lǐ Wèi. Awards and honours Plotkin was elected a Fellow of the Royal Society (FRS) in 19 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
