Paris C. Kanellakis

Total Page:16

File Type:pdf, Size:1020Kb

Paris C. Kanellakis In Memoriam Paris C Kanellakis Our colleague and dear friend Paris C Kanellakis died unexp ectedly and tragically on De cemb er together with his wife MariaTeresa Otoya and their b eloved young children Alexandra and Stephanos En route to Cali Colombia for an annual holiday reunion with his wifes family their airplane strayed o course without warning during the night minutes b efore an exp ected landing and crashed in the Andes As researchers we mourn the passing of a creative and thoughtful colleague who was resp ected for his manycontributions b oth technical and professional to the computer science research community As individuals wegrieveover our tragic lossof a friend who was regarded with great aection and of a happy thriving family whose warmth and hospitalitywere gifts appreciated by friends around the world Their deaths create for us a void that cannot b e lled Paris left unnished several pro jects including a pap er on database theory intended for this sp ecial issue of Computing Surveys to b e written during his holiday visit to Colombia Instead we wish to oer here a brief biographyofParis and a description of the research topics that interested Paris over the last few years together with the contributions that he made to these areas It is not our intention to outline denitive surveys or histories of these areas but rather to honor the signicantcontemp orary research of our friend Paris was b orn in Greece in to Eleftherios and Argyroula Kanellakis In he received the Diploma in Electrical Engineering from the National Technical UniversityofAthens his al undergraduate thesis was titled Easytotest Criteria for Weak Stochastic Stability of Dynamic Systems advised by Prof E N Protonotarios Paris continued his studies at the graduate level in Electrical Engineering and Computer Science at the Massachusetts Institute of Technology where he received his M Sc in submitting the thesis Algorithms for a Scheduling Application of the Asymmetric Traveling Salesman Problem sup ervised by Profs R Rivest and M Athans followed by his Ph D in his do ctoral dissertation was On the Complexity of Concurrency Control for Distributed Databases sup ervised by Prof C H Papadimitriou In Paris joined the Computer Science Department of Brown University as assistant professor He was promoted to asso ciate professor with tenure in and to full professor in Intermittent with his app ointment at Brown Paris also held several temp orary p ositions including p osts at the IBM Watson ResearchCenter the MIT Lab oratory for Computer Science GIP Altar and INRIA Ro cquencourt He served as an asso ciate editor of the new journal Constraintsaswell as Information and Computation ACM Transactions on Database Systems SIAM Journal of Computing Theoretical Computer Scienceand Journal of Logic Programming vited sp eaker at Paris served in addition as program committee memb er program chair and in many of the prominent research conferences in computer science We take this opp ortunity to presentsomeofParis contributions to database theory includ ing deductive ob jectoriented and constraint databases as well as his work in faulttolerant distributed computation and in typ e theoryIneach of these areas we recognize research contri butions that were not merely examples of go o d problem solving but also examples of insightful problem formulation In synchrony with his technical ability in solving problems Paris added a mature editorial voice which by prop osing new kinds of research questions and answering some of them in novel and sometimes surprising ways help ed to change our p erceptions of what was technically sig nicant In several casesfor example in deductive databases and typ e theoryParis brought the to ols and techniques of complexity theory and algorithmics to analyze the eciency of con structs in programming language design These themes were found again in the area of constraint databases an area he played a ma jor role in initiating while guiding its development via sound and feasible algorithmic principles In distributed computing Paris advanced new computational frameworks intended to align algorithmic paradigms with salient asp ects of realizable system architectures In ob jectoriented databases Paris worked to build a semantic foundation that provides an implementationindep ende nt meaning for these systems much in the same spirit that the relational mo del provides an implementationindep ende nt meaning for relational databases We recognize in all this work Paris desire to understand b etter the theoretical foundations of practical systems to study them with precise analytical to ols and to use the results to improve the functionality and p erformance of these systems The authors of this technical obituary feel honored by the privilege they had in collab orating with Paris on many of these pro jects In mourning his tragic death we miss his technical facility his broad knowledge his insight his commitment and his humor To write a research pap er with Paris was also an opp ortunity to observe his indefatigable attention to detail and to engage in vigorous debate with his editorial voice To write this obituary allowed us to to feel his voice tist he was and to appreciate his uncommon once more to understand b etter what a go o d scien decency and kindness It is our great loss that we will not hear his voice again Deductive Databases Paris Kanellakis was a ma jor contributor to the theoretical foundations of deductive databases It has b een recognized since the early s that rstorder database query languages suchas SQL are lacking in expressivepower This insight lead to the investigation of many higherorder query languages in particular Datalog the language of logic programs without function symb ols A canonical use of Datalog is to compute transitiveclosurewherewe think of the database as a directed graph pathX Y edge X Y pathX Y pathX Z pathZ Y In this example wetake edge to b e an extensional database EDB predicate representing basic facts stored in the database For example edge is an EDB fact stating that there is an edge b etween vertices and The intensional database IDB predicate path represents facts deduced from the database via the logic program ab ove the rst rule says every directed edge forms a path and the second rule tells how paths can b e joined together We can now query for instance path or pathV to determine resp ectively whether there is a path from vertex tovertex or what vertices V are connected to vertex by a path The path facts are deduced from the edge facts hence the name deductive databases Paris work addressed the problem of nding ecientevaluation metho ds for Datalog queries He viewed the challenge of deductive databases as the need to combine the technology of logic programming with the eciency of database technology providing a concrete step towards a new generation of computing The fo cus of his research in this area was in identifying classes of Datalog queries that can b e evaluated eciently Datalog and Parallel Computation Paris investigated what kind of Datalog queries can b e sp edup by massive parallelism CK Kan He identied sp eedup with the complexity class NC which consists of the problems that can b e computed in p olylogarithmic time through the use of p olynomially b ounded hardware Problems in NC are exactly those with a great deal of p otential parallelism In contrast signicant sp eedups cannot b e achieved for PTIME complete problems unless NCPTIME which is widely b elieved not to b e the case Thus PTIMEcomplete problems are often called inherently sequential Paris prop osed to measure the computational complexity of Datalog programs b oth by their time complexityaswell as by their database complexity which measures the numb er of calls the Datalog query engine makes to the underlying relational database system He proved that there are Datalog queries that are hard to evaluate in parallel regardless of which complexity measure is b eing used For example Paris showed that the query reachX reachY reachZ edge Y X edgeX Z edge Z Y vably sup erp olylogarithmic is PTIMEcomplete and furthermore its database complexityispro The latter b ound is signicant since it do es not dep end on whether NC is a prop er sub class of PTIME Paris also proved a gap theorem for the databasecomplexity measure He showed that the database complexityofevery Datalog query is either O orlogn surprisingly there is nothing in b etween Bounded vs Unb ounded Queries It is clear that recursive applications of Datalog rules make queries hard to evaluate In particular Datalog queries whose database complexityisin O can b e evaluated in NC such queries are called boundedItisknown that a Datalog query is equivalent to a rstorder query i it is b ounded This makes it highly desirable to b e able to identify which Datalog queries are b ounded Unfortunately the distinction b etween b ounded and unb ounded queries can b e quite subtle For example the query buys X Y likes X Y buys X Y trendy X buys Z Y is b ounded while the query buys X Y likes X Y buys X Y knows X Z buys Z Y is unb ounded This subtlety is not accidental it is known that the problem of testing whether a given Datalog query is b ounded or not is undecidable Paris was engaged in a longterm pro ject whose goal was to delineate the b oundary b etween the decidable and undecidable for classes of Datalog queries CGKVAK HKMV that is to identify maximal classes of Datalog queries whose b oundedness problem is decidable and minimal
Recommended publications
  • Tarjan Transcript Final with Timestamps
    A.M. Turing Award Oral History Interview with Robert (Bob) Endre Tarjan by Roy Levin San Mateo, California July 12, 2017 Levin: My name is Roy Levin. Today is July 12th, 2017, and I’m in San Mateo, California at the home of Robert Tarjan, where I’ll be interviewing him for the ACM Turing Award Winners project. Good afternoon, Bob, and thanks for spending the time to talk to me today. Tarjan: You’re welcome. Levin: I’d like to start by talking about your early technical interests and where they came from. When do you first recall being interested in what we might call technical things? Tarjan: Well, the first thing I would say in that direction is my mom took me to the public library in Pomona, where I grew up, which opened up a huge world to me. I started reading science fiction books and stories. Originally, I wanted to be the first person on Mars, that was what I was thinking, and I got interested in astronomy, started reading a lot of science stuff. I got to junior high school and I had an amazing math teacher. His name was Mr. Wall. I had him two years, in the eighth and ninth grade. He was teaching the New Math to us before there was such a thing as “New Math.” He taught us Peano’s axioms and things like that. It was a wonderful thing for a kid like me who was really excited about science and mathematics and so on. The other thing that happened was I discovered Scientific American in the public library and started reading Martin Gardner’s columns on mathematical games and was completely fascinated.
    [Show full text]
  • Understanding the Hidden Web
    Introduction General Framework Different Modules Conclusion Understanding the Hidden Web Pierre Senellart Athens University of Economics & Business, 28 July 2008 Introduction General Framework Different Modules Conclusion Simple problem Contact all co-authors of Serge Abiteboul. It’s easy! You just need to: Find all co-authors. For each of them, find their current email address. Introduction General Framework Different Modules Conclusion Advanced Scholar Search Advanced Search Tips | About Google Scholar Find articles with all of the words with the exact phrase with at least one of the words without the words where my words occur Author Return articles written by e.g., "PJ Hayes" or McCarthy Publication Return articles published in e.g., J Biol Chem or Nature Date Return articles published between — e.g., 1996 Subject Areas Return articles in all subject areas. Return only articles in the following subject areas: Biology, Life Sciences, and Environmental Science Business, Administration, Finance, and Economics Chemistry and Materials Science Engineering, Computer Science, and Mathematics Medicine, Pharmacology, and Veterinary Science Physics, Astronomy, and Planetary Science Social Sciences, Arts, and Humanities ©2007 Google Introduction General Framework Different Modules Conclusion Advanced Scholar Search Advanced Search Tips | About Google Scholar Find articles with all of the words with the exact phrase with at least one of the words without the words where my words occur Author Return articles written by e.g., "PJ Hayes" or McCarthy Publication
    [Show full text]
  • Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University
    Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University. Linda A. Cicero/Stanford News Service. Whitfield Diffie Martin E. Hellman ernment–private sector relations, and attracts billions of Whitfield Diffie, former chief security officer of Sun Mi- dollars in research and development,” said ACM President crosystems, and Martin E. Hellman, professor emeritus Alexander L. Wolf. “In 1976, Diffie and Hellman imagined of electrical engineering at Stanford University, have been a future where people would regularly communicate awarded the 2015 A. M. Turing Award of the Association through electronic networks and be vulnerable to having for Computing Machinery for their critical contributions their communications stolen or altered. Now, after nearly to modern cryptography. forty years, we see that their forecasts were remarkably Citation prescient.” The ability for two parties to use encryption to commu- “Public-key cryptography is fundamental for our indus- nicate privately over an otherwise insecure channel is try,” said Andrei Broder, Google Distinguished Scientist. fundamental for billions of people around the world. On “The ability to protect private data rests on protocols for a daily basis, individuals establish secure online connec- confirming an owner’s identity and for ensuring the integ- tions with banks, e-commerce sites, email servers, and the rity and confidentiality of communications. These widely cloud. Diffie and Hellman’s groundbreaking 1976 paper, used protocols were made possible through the ideas and “New Directions in Cryptography,” introduced the ideas of methods pioneered by Diffie and Hellman.” public-key cryptography and digital signatures, which are Cryptography is a practice that facilitates communi- the foundation for most regularly used security protocols cation between two parties so that the communication on the Internet today.
    [Show full text]
  • The Best Nurturers in Computer Science Research
    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
    [Show full text]
  • Curriculum Vitae
    Massachusetts Institute of Technology School of Engineering Faculty Personnel Record Date: April 1, 2020 Full Name: Charles E. Leiserson Department: Electrical Engineering and Computer Science 1. Date of Birth November 10, 1953 2. Citizenship U.S.A. 3. Education School Degree Date Yale University B. S. (cum laude) May 1975 Carnegie-Mellon University Ph.D. Dec. 1981 4. Title of Thesis for Most Advanced Degree Area-Efficient VLSI Computation 5. Principal Fields of Interest Analysis of algorithms Caching Compilers and runtime systems Computer chess Computer-aided design Computer network architecture Digital hardware and computing machinery Distance education and interaction Fast artificial intelligence Leadership skills for engineering and science faculty Multicore computing Parallel algorithms, architectures, and languages Parallel and distributed computing Performance engineering Scalable computing systems Software performance engineering Supercomputing Theoretical computer science MIT School of Engineering Faculty Personnel Record — Charles E. Leiserson 2 6. Non-MIT Experience Position Date Founder, Chairman of the Board, and Chief Technology Officer, Cilk Arts, 2006 – 2009 Burlington, Massachusetts Director of System Architecture, Akamai Technologies, Cambridge, 1999 – 2001 Massachusetts Shaw Visiting Professor, National University of Singapore, Republic of 1995 – 1996 Singapore Network Architect for Connection Machine Model CM-5 Supercomputer, 1989 – 1990 Thinking Machines Programmer, Computervision Corporation, Bedford, Massachusetts 1975
    [Show full text]
  • Essays Dedicated to Peter Buneman ; [Colloquim in Celebration
    Val Tannen Limsoon Wong Leonid Libkin Wenfei Fan Wang-Chiew Tan Michael Fourman (Eds.) In Search of Elegance in the Theory and Practice of Computation Essays Dedicated to Peter Buneman 4^1 Springer Table of Contents Models for Data-Centric Workflows 1 Serge Abiteboul and Victor Vianu Relational Databases and Bell's Theorem 13 Samson Abramsky High-Level Rules for Integration and Analysis of Data: New Challenges 36 Bogdan Alexe, Douglas Burdick, Mauricio A. Hernandez, Georgia Koutrika, Rajasekar Krishnamurthy, Lucian Popa, Ioana R. Stanoi, and Ryan Wisnesky A New Framework for Designing Schema Mappings 56 Bogdan Alexe and Wang-Chiew Tan User Trust and Judgments in a Curated Database with Explicit Provenance 89 David W. Archer, Lois M.L. Delcambre, and David Maier An Abstract, Reusable, and Extensible Programming Language Design Architecture 112 Hassan Ait-Kaci A Discussion on Pricing Relational Data 167 Magdalena Balazinska, Bill Howe, Paraschos Koutris, Dan Suciu, and Prasang Upadhyaya Tractable Reasoning in Description Logics with Functionality Constraints 174 Andrea Call, Georg Gottlob, and Andreas Pieris Toward a Theory of Self-explaining Computation 193 James Cheney, Umut A. Acar, and Roly Perera To Show or Not to Show in Workflow Provenance 217 Susan B. Davidson, Sanjeev Khanna, and Tova Milo Provenance-Directed Chase&Backchase 227 Alin Deutsch and Richard Hull Data Quality Problems beyond Consistency and Deduplication 237 Wenfei Fan, Floris Geerts, Shuai Ma, Nan Tang, and Wenyuan Yu X Table of Contents 250 Hitting Buneman Circles Michael Paul Fourman 259 Looking at the World Thru Colored Glasses Floris Geerts, Anastasios Kementsietsidis, and Heiko Muller Static Analysis and Query Answering for Incomplete Data Trees with Constraints 273 Amelie Gheerbrant, Leonid Libkin, and Juan Reutter Using SQL for Efficient Generation and Querying of Provenance Information 291 Boris Glavic, Renee J.
    [Show full text]
  • INF2032 2017-2 Tpicos Em Bancos De Dados III ”Foundations of Databases”
    INF2032 2017-2 Tpicos em Bancos de Dados III "Foundations of Databases" Profs. Srgio Lifschitz and Edward Hermann Haeusler August-December 2017 1 Motivation The motivation of this course is to put together theory and practice of database and knowledge base systems. The main content includes a formal approach for the underlying existing technology from the point of view of logical expres- siveness and computational complexity. New and recent database models and systems are discussed from theory to practical issues. 2 Goal of the course The main goal is to introduce the student to the logical and computational foundations of database systems. 3 Sylabus The course in divided in two parts: Classical part: relational database model 1. Revision and formalization of relational databases. Limits of the relational data model; 2. Relational query languages; DataLog and recursion; 3. Logic: Propositional, First-Order, Higher-Order, Second-Order, Fixed points logics; 4. Computational complexity and expressiveness of database query lan- guages; New approaches for database logical models 1. XML-based models, Monadic Second-Order Logic, XPath and XQuery; 2. RDF-based knowledge bases; 3. Decidable Fragments of First-Order logic, Description Logic, OWL dialects; 4. NoSQL and NewSQL databases; 4 Evaluation The evaluation will be based on homework assignments (70 %) and a research manuscript + seminar (30%). 5 Supporting material Lecture notes, slides and articles. Referenced books are freely available online. More details at a wiki-based web page (available from August 7th on) References [ABS00] Serge Abiteboul, Peter Buneman, and Dan Suciu. Data on the Web: From Relations to Semistructured Data and XML.
    [Show full text]
  • Author Template for Journal Articles
    Mining citation information from CiteSeer data Dalibor Fiala University of West Bohemia, Univerzitní 8, 30614 Plzeň, Czech Republic Phone: 00420 377 63 24 29, fax: 00420 377 63 24 01, email: [email protected] Abstract: The CiteSeer digital library is a useful source of bibliographic information. It allows for retrieving citations, co-authorships, addresses, and affiliations of authors and publications. In spite of this, it has been relatively rarely used for automated citation analyses. This article describes our findings after extensively mining from the CiteSeer data. We explored citations between authors and determined rankings of influential scientists using various evaluation methods including cita- tion and in-degree counts, HITS, PageRank, and its variations based on both the citation and colla- boration graphs. We compare the resulting rankings with lists of computer science award winners and find out that award recipients are almost always ranked high. We conclude that CiteSeer is a valuable, yet not fully appreciated, repository of citation data and is appropriate for testing novel bibliometric methods. Keywords: CiteSeer, citation analysis, rankings, evaluation. Introduction Data from CiteSeer have been surprisingly little explored in the scientometric lite- rature. One of the reasons for this may have been fears that the data gathered in an automated way from the Web are inaccurate – incomplete, erroneous, ambiguous, redundant, or simply wrong. Also, the uncontrolled and decentralized nature of the Web is said to simplify manipulating and biasing Web-based publication and citation metrics. However, there have been a few attempts at processing the Cite- Seer data which we will briefly mention. Zhou et al.
    [Show full text]
  • Finding Rising Stars in Co-Author Networks Via Weighted Mutual Influence
    Finding Rising Stars in Co-Author Networks via Weighted Mutual Influence Ali Daud a,b Naif Radi Aljohani a Rabeeh Ayaz Abbasi a,c a Faculty of Computing and a Faculty of Computing and c Department of Computer Science, Information Technology, King Information Technology, King Quaid-i-Azam University, Islamabad, Abdulaziz University, Jeddah, Saudi Abdulaziz University, Jeddah, Saudi Pakistan Arabia Arabia [email protected] [email protected] [email protected] b b d Zahid Rafique Tehmina Amjad Hussain Dawood b Department of Computer Science b Department of Computer Science d Faculty of Computing and and Software Engineering, and Software Engineering, Information Technology, University International Islamic University, International Islamic University, of Jeddah, Jeddah, Saudi Arabia Islamabad, Pakistan Islamabad, Pakistan [email protected] [email protected] [email protected] a Khaled H. Alyoubi a Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia [email protected] ABSTRACT KEYWORDS Finding rising stars is a challenging and interesting task which is Bibliographic databases; Citations; Author Order; Rising Stars; Mutual being investigated recently in co-author networks. Rising stars are Influence; Co-Author Networks authors who have a low research profile in the start of their career but may become experts in the future. This paper introduces a new method Weighted Mutual Influence Rank (WMIRank) for finding 1. INTRODUCTION rising stars. WMIRank exploits influence of co-authors’ citations, The rapid evolution of scientific research has created large order of appearance and publication venues. Comprehensive volumes of publications every year, and is expected to continue in experiments are performed to analyze the performance of near future [21].
    [Show full text]
  • Moshe Y. Vardi
    MOSHE Y. VARDI Address Office Home Department of Computer Science 4515 Merrie Lane Rice University Bellaire, TX 77401 P.O.Box 1892 Houston, TX 77251-1892 Tel: (713) 348-5977 Tel: (713) 665-5900 Fax: (713) 348-5930 Fax: (713) 665-5900 E-mail: [email protected] URL: http://www.cs.rice.edu/∼vardi Research Interests Applications of logic to computer science: • database systems • complexity theory • multi-agent systems • specification and verification of hardware and software Education Sept. 1974 B.Sc. in Physics and Computer Science (Summa cum Laude), Bar-Ilan University, Ramat Gan, Israel May 1980 M.Sc. in Computer Science, The Feinberg Graduate School, The Weizmann Insti- tute of Science, Rehovoth, Israel Thesis: Axiomatization of Functional and Join Dependencies in the Relational Model. Advisors: Prof. C. Beeri (Hebrew University) Prof. P. Rabinowitz Sept 1981 Ph.D. in Computer Science, Hebrew University, Jerusalem, Israel Thesis: The Implication Problem for Data Dependencies in the Relational Model. Advisor: Prof. C. Beeri Professional Experience Nov. 1972 – June 1973 Teaching Assistant, Dept. of Mathematics, Bar-Ilan University. Course: Introduction to computing. 1 Nov. 1978 – June 1979 Programmer, The Weizmann Institute of Science. Assignments: implementing a discrete-event simulation package and writing input-output routines for a database management system. Feb. 1979 – Oct. 1980 Research Assistant, Inst. of Math. and Computer Science, The Hebrew University of Jerusalem. Research subject: Theory of data dependencies. Nov. 1980 – Aug. 1981 Instructor, Inst. of Math. and Computer Science, The Hebrew University of Jerusalem. Course: Advanced topics in database theory. Sep. 1981 – Aug. 1983 Postdoctoral Scholar, Dept. of Computer Science, Stanford Univer- sity.
    [Show full text]
  • Michael Oser Rabin Automata, Logic and Randomness in Computation
    Michael Oser Rabin Automata, Logic and Randomness in Computation Luca Aceto ICE-TCS, School of Computer Science, Reykjavik University Pearls of Computation, 6 November 2015 \One plus one equals zero. We have to get used to this fact of life." (Rabin in a course session dated 30/10/1997) Thanks to Pino Persiano for sharing some anecdotes with me. Luca Aceto The Work of Michael O. Rabin 1 / 16 Michael Rabin's accolades Selected awards and honours Turing Award (1976) Harvey Prize (1980) Israel Prize for Computer Science (1995) Paris Kanellakis Award (2003) Emet Prize for Computer Science (2004) Tel Aviv University Dan David Prize Michael O. Rabin (2010) Dijkstra Prize (2015) \1970 in computer science is not classical; it's sort of ancient. Classical is 1990." (Rabin in a course session dated 17/11/1998) Luca Aceto The Work of Michael O. Rabin 2 / 16 Michael Rabin's work: through the prize citations ACM Turing Award 1976 (joint with Dana Scott) For their joint paper \Finite Automata and Their Decision Problems," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. ACM Paris Kanellakis Award 2003 (joint with Gary Miller, Robert Solovay, and Volker Strassen) For \their contributions to realizing the practical uses of cryptography and for demonstrating the power of algorithms that make random choices", through work which \led to two probabilistic primality tests, known as the Solovay-Strassen test and the Miller-Rabin test". ACM/EATCS Dijkstra Prize 2015 (joint with Michael Ben-Or) For papers that started the field of fault-tolerant randomized distributed algorithms.
    [Show full text]
  • AWARDS SESSION New Orleans Convention Center New Orleans, Louisiana Tuesday, 18 November 2014
    Association for Computing Machinery AWARDS SESSION New Orleans Convention Center New Orleans, Louisiana Tuesday, 18 November 2014 SC14 Awards Session will honor the following individuals for their contributions to the computing profession: Charles E. Leiserson 2014 ACM/IEEE Computer Society Ken Kennedy Award Satoshi Matsuoka 2014 IEEE Computer Society Sidney Fernbach Award Gordon Bell 2014 IEEE Computer Society Seymour Cray Computer Engineering Award The Kennedy Award is presented by ACM President Alexander L. Wolf and Computer Society President Dejan S. Milojičić. The IEEE Computer Society Seymour Cray and Sidney Fernbach Awards are presented by 2014 IEEE Computer Society President Dejan S. Milojičić. The 2014 ACM/IEEE Computer Society Ken Kennedy Award ACM/IEEE Computer Society Ken Kennedy Award The Ken Kennedy Award was established in memory of Ken Kennedy, the founder of Rice University’s nationally ranked computer science program and one of the world’s foremost experts on high-performance computing. The award consists of a certificate and a $5,000 honorarium and is awarded jointly by the ACM and the IEEE Computer Society for outstanding contributions to programmability or productivity in high-performance computing together with significant community service or mentoring contributions. http://awards.acm.org http://computer.org/awards PREVIOUS RECIPIENTS — ACM/IEEE COMPUTER SOCIETY KEN KENNEDY AWARD 2013 - Jack Dongarra 2012 - Mary Lou Soffa 2011 - Susan L. Graham 2010 - David Kuck 2009 - Francine Berman 2014 ACM/IEEE COMPUTER SOCIETY KEN KENNEDY AWARD SUBCOMMITTEE Mary Hall, University of Utah, Chair David Rosenblum, National University of Randy Allen, National Instruments Singapore Keith Cooper, Rice University Valentina Salapura, IBM Susan Graham, University of California, Berkeley* David Padua, University of Illinois at Urbana- Champaign *Previous recipient Charles E.
    [Show full text]