## Paolo Penna: Katalogdaten im Frühjahrssemester 2020 |

Name | Herr Dr. Paolo Penna |

paolo.penna@inf.ethz.ch | |

URL | https://www.inf.ethz.ch/personal/pennap/ |

Departement | Informatik |

Beziehung | Dozent |

Nummer | Titel | ECTS | Umfang | Dozierende | |
---|---|---|---|---|---|

252-3002-00L | Algorithms for Database Systems Number of participants limited to 15. The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. | 2 KP | 2S | P. Penna | |

Kurzbeschreibung | Query processing, optimization, stream-based systems, distributed and parallel databases, non-standard databases. | ||||

Lernziel | Develop an understanding of selected problems of current interest in the area of algorithms for database systems. | ||||

252-4303-00L | Topics at the Intersection between Theoretical Computer Science and other Disciplines Number of participants limited to 22. The deadline for deregistering expires at the end of the second week of the semester. Students who are still registered after that date, but do not attend the seminar, will officially fail the seminar. | 2 KP | 2S | P. Penna | |

Kurzbeschreibung | Students present papers in Theoretical Computer Science which have also some "interdisciplinary flavor". Methods in classical theory of computing are used to better understand some fundamental questions in other fields (biology, social science, economics, etc.). The talks give a first outlook of these type of results which typically provide rigorous analysis of algorithms ("prove theorems"). | ||||

Lernziel | Learn how to understand and present the key ideas and mathematical concepts in theory papers; Develop a critical attitude to evaluate the importance of a theoretical result and its practical relevance. | ||||

Inhalt | In this seminar students will present papers in Theoretical Computer Science which have also some "interdisciplinary flavor". For example, they use methods in classical theory of computing to advance our understanding of some fundamental question in other fields (biology, social science, economics, etc.). The talks will give us a first outlook of these type of results which provide rigorous analysis of algorithms ("prove theorems"). In their presentations, students should put the results into context, isolate the "computer science" or "computational" aspect, and its relation to the practical question. |