Ashok K. Chandra

Ashok K. Chandra
Born 1948-07-30
Died November 15, 2014[1]
California
Fields computer science
Institutions IBM Research
Microsoft Research
Alma mater Berkeley
Doctoral advisor Zohar Manna[2]
Known for conjunctive queries, alternating Turing machines

Ashok K. Chandra was a computer scientist at Microsoft Research in Mountain View, California, United States, where he was a general manager at the Internet Services Research Center.[3] Chandra received his PhD in Computer Science from Stanford University, an MS from University of California, Berkeley, and a BTech from IIT Kanpur. He was previously Director of Database and Distributed Systems at IBM Almaden Research Center.

Chandra co-authored several key papers in theoretical computer science. Among other contributions, he introduced alternating Turing machines in computational complexity (with Dexter Kozen and Larry Stockmeyer),[4][5] conjunctive queries in databases (with Philip M. Merlin),[6] computable queries (with David Harel),[7] and multiparty communication complexity (with Merrick L. Furst and Richard J. Lipton).[8]

He was a founder of the annual IEEE Symposium on Logic in Computer Science and served as conference chair of the first three conferences, in 1986–8.[9] He was an IEEE Fellow.[10]

References

  1. ↑ "Dr. Ashok Kumar Chandra Obituary". Retrieved 29 May 2015.
  2. ↑ Ashok K. Chandra at the Mathematics Genealogy Project
  3. ↑ "Ashok K. Chandra profile at Microsoft". Archived from the original on November 2, 2013. Retrieved 31 October 2013.
  4. ↑ Chandra, A. K.; Stockmeyer, L. J. (1976). Alternation. FOCS '76: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science. Houston, Texas. pp. 98–108. doi:10.1109/SFCS.1976.4.
  5. ↑ Chandra, A. K.; Kozen, D. C.; Stockmeyer, L. J. (1981). "Alternation". Journal of the ACM. 28 (1): 114–133. doi:10.1145/322234.322243.
  6. ↑ Chandra, Ashok K.; Merlin, Philip M. (1977). Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computing. pp. 77–90. doi:10.1145/800105.803397.
  7. ↑ Chandra, Ashok K.; Harel, David (1980). "Computable Queries for Relational Data Bases". Journal of Computer and System Sciences. 21 (2): 156–178. doi:10.1016/0022-0000(80)90032-X.
  8. ↑ Chadra, Ashok K.; Furst, Merrick L.; Lipton, Richard J. (1983). Multi-party protocols. STOC '83: Proceedings of the fifteenth annual ACM symposium on Theory of computing. pp. 94–99. doi:10.1145/800061.808737.
  9. ↑ "LICS – Archive". Archived from the original on March 11, 2012. Retrieved 31 October 2013.
  10. ↑ "IEEE Fellows – C". Archived from the original on November 2, 2013. Retrieved 31 October 2013.

External links

This article is issued from Wikipedia - version of the 9/13/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.