Submitted by gonenm1 on March 2, 2011 - 22:59
Lecturer :
Petteri Kaski
Event type:
HIIT seminar
Event time:
2011-03-07 13:15 to 14:00
Place:
Computer Science Building, Hall T2
Description:
Our next speaker for HIIT Otaniemi seminar series is Petteri Kaski from the "New Paradigms in Computing" group of the Helsinki Institute for Information Technology HIIT.
All ICS@Aalto researchers are also warmly welcome to attend the seminar!
HIIT Otaniemi Seminar, Monday March 07, 13:15
Location: Computer Science Building, Hall T2
Petteri Kaski
New Paradigms in Computing Group
Helsinki Institute for Information Technology HIIT
Aalto University School of Science
Department of Information and Computer Science
Title:
An excursion into algebraic tools for combinatorial problems
Abstract:
Currently the fastest known algorithms for a number of fundamental combinatorial tasks, including graph coloring, Hamilton path/cycle, k-path, k-clique, Steiner tree, counting bipartite perfect matchings, counting forests, set packing, all-terminal reliability, and so forth, rely on fundamentally algebraic tools. That is, the combinatorial problem is first reduced into an appropriate algebraic representation, and then algebraic algorithms are employed to solve the problem.
This talk makes a brief survey of the area and highlights some potential future directions.
Welcome!
UPCOMING TALKS OF HIIT OTANIEMI SEMINAR SERIES
----
Mar. 14, Simon Rogers
Mar. 28, Antti Oulasvirta/Teemu Roos
--
Mehmet Gönen
Helsinki Institute for Information Technology HIIT
Department of Information and Computer Science
Aalto University School of Science
Last updated on 2 Mar 2011 by Mehmet Gönen - Page created on 2 Mar 2011 by Mehmet Gönen