Ashok K. Chandra

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

Ashok K. Chandra was a computer scientist at Microsoft Research in Mountain View, California, USA, where he was a general manager at the Internet Services Research Center.[2] 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),[3][4] conjunctive queries in databases (with Philip M. Merlin),[5] computable queries (with David Harel),[6] and multiparty communication complexity (with Merrick L. Furst and Richard J. Lipton).[7]

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.[8] He is an IEEE Fellow.[9]

References

  1. ↑ Ashok K. Chandra at the Mathematics Genealogy Project
  2. ↑ "Ashok K. Chandra profile at Microsoft". Retrieved 31 October 2013.
  3. ↑ 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.
  4. ↑ Chandra, A. K.; Kozen, D. C.; Stockmeyer, L. J. (1981). "Alternation". Journal of the ACM 28 (1): 114–133. doi:10.1145/322234.322243.
  5. ↑ 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.
  6. ↑ 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.
  7. ↑ 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.
  8. ↑ "LICS – Archive". Retrieved 31 October 2013.
  9. ↑ "IEEE Fellows – C". Retrieved 31 October 2013.

External links