An Influential Theoretician.
The article announces that the computer scientist Sanjeev Arora has been awarded the 2011 ACM-Infosys Award and discusses his research on computational complexity and the PCP Theorem, optimization, and algorithms.
| Published in: | Communications of the ACM Vol. 55; no. 6; pp. 24 - 25 |
|---|---|
| Format: | Article |
| Published: |
Association for Computing Machinery
Jun2012
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |
| Summary: | The article announces that the computer scientist Sanjeev Arora has been awarded the 2011 ACM-Infosys Award and discusses his research on computational complexity and the PCP Theorem, optimization, and algorithms. |
|---|