Events: Seminar

A Near Optimal Algorithm for Finding Euclidean Shortest Path in Polygonal Domain

Speaker:
R. Inkulu Indian Institute of Technology Department of Computer Science and Engineering Guwahati http://
Date:
Tuesday, 13 Jul 2010 (all day)
Venue:
A-212 (STCS Seminar Room)
Category:

Counting paths in VPA is complete for #NC1

Speaker:
Andreas Krebs Universitat Tubingen Wilhelm-Schickard-Inst. fur Informatik Arbeitsbereich Theoretische Informa
Date:
Thursday, 8 Jul 2010 (all day)
Venue:
A-212 (STCS Seminar Room)
Category:

Complexity of Graphical Realizations of Linear Codes

Speaker:
Navin Kashyap Queen's University Department of Mathematics and Statistics Kingston, Ontario Canada K7L 3N6
Date:
Monday, 5 Jul 2010 (all day)
Venue:
A-212 (STCS Seminar Room)
Category:

A Near-tight Approximation Algorithm for the Robot Localization Problem

Speaker:
Apurva Mudgal Indian Institute of Technology, Ropar Department of Computer Science and Engineering Nangal Roa
Date:
Monday, 28 Jun 2010 (all day)
Venue:
A-212 (STCS Seminar Room)
Category:

Communication in Subclasses of Petri Nets

Speaker:
Kamal Lodaya Institute of Mathematical Sciences CIT Campus Tharamani Chennai 600 113 http://www.imsc.res.
Date:
Friday, 28 May 2010 (all day)
Venue:
A-212 (STCS Seminar Room)
Category: