SEMINAR NOTICE

Semantic Graph Algorithms

Dr. Kishore Kothapally, IIITH

DATE & TIME : 19 September 2014, 4.00 PM

VENUE: Semianr Room, SCIS

Abstract

Graph algorithms have been a popular research topic over the decades. There is now a renewed interest in them driven by a better understanding of the real-world graphs and also due to opportunities of parallellization. In this talk, we argue that real-world graphs have strong structural properties that can be used to improve the state-of-the-art with respect to graph algorithms in the parallel setting. We also discuss two recent such approaches as case-studies. The talk then concludes with possibilities for further work in this direction. The talk does not require background on parallelism, but knowledge of basic algorithms in general, and basic graph algorithmic notions is required.

BIO

Kishore Kothapalli is presently an Associate Professor at the International Institute of Information Technology, Hyderabad where he is working since 2006. Prior to that, he obtained his doctoral degree in Computer Science from the Johns Hopkins University, and his Masters degree in Computer Science from the Indian Institute of Technology, Kanpur. His current research interests are in parallel and distributed algorithms with focus on graphs and matrices.