Paris Kanellakis

Paris Kanellakis

Paris Christos Kanellakis (1953 – 1995) was a computer scientist.

Kanellakis was born in Greece as the only child of General Eleftherios and Mrs. Argyroula Kanellakis. In 1976, he received a diploma in Electrical Engineering from the National Technical University of Athens. He continued his studies at the graduate level in Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, where he received an MSc degree in 1978 and a PhD degree in 1982. In 1981, he joined the Computer Science Department of Brown University as an assistant professor; he obtained tenure as an associate professor in 1986, and became a full professor in 1990.

He died on December 23 1995 together with his wife, Maria ­Teresa Otoya, and their children, Alexandra and Stephanos, aboard American Airlines Flight 965 en route to Cali, Colombia for an annual holiday reunion with his wife's family.

His scientific contributions are in the fields of database theory—comprising work on deductive databases, object-oriented databases, and constraint databases—as well as in fault-­tolerant distributed computation and in type theory. He served as an associate editor in a number of respected journals, such as Information and Computation, ACM Transactions on Database Systems, SIAM Journal on Computing, Theoretical Computer Science, and Journal of Logic Programming.

Acknowledging Kanellakis's contributions to computer science the Association for Computing Machinery honored him by instituting the Paris Kanellakis Theory and Practice Award.

External links

* [http://www.cs.brown.edu/people/pck/home.html Paris Kanellakis web site] at Brown University.
* [http://www.cs.brown.edu/publications/conduit/conduit_v5n1.pdf Paris C. Kanellakis 1953–1995] .


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Paris Kanellakis Award — The Paris Kanellakis Theory and Practice Award is granted yearly by the Association for Computing Machinery (ACM) to honor specific theoretical accomplishments that have had a significant and demonstrable effect on the practice of computing. It… …   Wikipedia

  • Paris-Kanellakis-Preis — Der Paris Kanellakis Preis (Paris Kanellakis Theory and Practice Award) ist ein Informatikpreis der Association for Computing Machinery (ACM) für theoretische Errungenschaften, die eine bedeutende Auswirkung in der Praxis des Rechnens haben. Er… …   Deutsch Wikipedia

  • Prix Paris Kanellakis — Le Prix Paris Kanellakis est décerné par l ACM depuis 1996, pour honorer les avancées théoriques ayant un impact important et démontrable sur l informatique pratique. Sommaire 1 Lauréats 2 Voir aussi 2.1 Articles connexes …   Wikipédia en Français

  • Prix Paris Christos Kanellakis — Prix Paris Kanellakis Le Prix Paris Kanellakis est décerné par l ACM depuis 1996, pour honorer les avancées théoriques ayant un impact important et démontrable sur l informatique pratique. Sommaire 1 Lauréats 2 Voir aussi 2.1 Articles connexes …   Wikipédia en Français

  • Prix Kanellakis — Prix Paris Kanellakis Le Prix Paris Kanellakis est décerné par l ACM depuis 1996, pour honorer les avancées théoriques ayant un impact important et démontrable sur l informatique pratique. Sommaire 1 Lauréats 2 Voir aussi 2.1 Articles connexes …   Wikipédia en Français

  • Narendra Karmarkar — Narendra K. Karmarkar (born 1957) is an Indian mathematician, renowned for developing Karmarkar s algorithm. He is listed as an ISI highly cited researcher.[1] Contents 1 Biography 2 Work 2.1 Karmark …   Wikipedia

  • Corinna Cortes — is an American computer scientist who is known for her contributions to the field of machine learning. She is currently the Head of Google Research, New York.[1] Cortes is a recipient of the Paris Kanellakis Theory and Practice Award for her work …   Wikipedia

  • Daniel Sleator — Daniel Dominic Kaplan Sleator is a professor of computer science at Carnegie Mellon University. He discovered amortized analysis and he invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps. He also …   Wikipedia

  • E. Allen Emerson — Ernest Allen Emerson is a computer scientist and endowed professor at the University of Texas, Austin.He won the 2007 A.M. Turing Award along with Edmund M. Clarke and Joseph Sifakis for their pioneering work on Model checking.cite… …   Wikipedia

  • Abraham Lempel — lors de la cérémonie de remise de sa médaille Richard Hamming en 2007 à Haifa en Israël …   Wikipédia en Français

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”