Please select the name from the list. If the name is not there, means it is not connected with a GND -ID?
GND: 170020525
Click on the author name for her/his data, if available
List of co-authors associated with the respective author. The font size represents the frequency of co-authorship.
Click on a term to reduce result list
The result list below will be reduced to the selected search terms. The terms are generated from the titles, abstracts and STW thesaurus of publications by the respective author.
b
Match by:
Sort by:
Records:
The information on the author is retrieved from: Entity Facts (by DNB = German National Library data service), DBPedia and Wikidata
Ravindran Kannan
Alternative spellings: Ravi Kannan
B:1953 Biblio: Tätig an der Yale Univ., New Haven, Conn.; Tätig bei Microsoft Research Labs, Bangalore, India; Tätig in dem Massachusetts Inst. of Technology; Tätig in dem Inst. für Ökonometrie u. Operations-Research
Information about the license status of integrated media files (e.g. pictures or videos) can usually be called up by clicking on the Wikimedia Commons URL above.
Ravindran Kannan (Tamil: ரவீந்திரன் கண்ணன்; born 12 March 1953, Madras) is a Principal Researcher at Microsoft Research India, where he leads the algorithms research group. He is also the first adjunct faculty of Computer Science and Automation Department of Indian Institute of Science. Before joining Microsoft, he was the William K. Lanman Jr. Professor of Computer Science and Professor of Applied Mathematics at Yale University. He has also taught at MIT, CMU and IISc. The ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) presented its 2011 Knuth Prize to Ravi Kannan for developing influential algorithmic techniques aimed at solving long-standing computational problems. He also served on the Mathematical Sciences jury for the Infosys Prize in 2012 and 2013. Ravi Kannan did his B.Tech at IIT, Bombay. He received his PhD in 1980 at Cornell University under Leslie Earl Trotter, Jr. His research interests include Algorithms, Theoretical Computer Science and Discrete Mathematics as well as Optimization. His work has mainly focused on efficient algorithms for problems of a mathematical (often geometric) flavor that arise in Computer Science. He has worked on algorithms for integer programming and the geometry of numbers, random walks in n-space, randomized algorithms for linear algebra and learning algorithms for convex sets. (Source: DBPedia)
The result list below will be reduced to the selected search terms. The terms are generated from the titles, abstracts and STW thesaurus of publications by the respective author.
Scopus Preview 