Suchergebnis: Katalogdaten im Frühjahrssemester 2015
|Doktorat Departement Informatik |
Mehr Informationen unter: http://www.ethz.ch/doctorate/programmes
|Lehrangebot Doktorat und Postdoktorat|
|252-0407-00L||Cryptography||W||7 KP||3V + 2U + 1A||U. Maurer|
|Kurzbeschreibung||Fundamentals and applications of cryptography. Cryptography as a mathematical discipline: reductions, constructive cryptography paradigm, security proofs. The discussed primitives include cryptographic functions, pseudo-randomness, symmetric encryption and authentication, public-key encryption, key agreement, and digital signature schemes. Selected cryptanalytic techniques.|
|Lernziel||The goals are:|
(1) understand the basic theoretical concepts and scientific thinking in cryptography;
(2) understand and apply some core cryptographic techniques and security proof methods;
(3) be prepared and motivated to access the scientific literature and attend specialized courses in cryptography.
|Inhalt||See course description.|
|Voraussetzungen / Besonderes||Familiarity with the basic cryptographic concepts as treated for|
example in the course "Information Security" is required but can
in principle also be acquired in parallel to attending the course.
|252-0924-00L||OMS Case Study II||W||2 KP||2S||M. Norrie|
|Kurzbeschreibung||This doctoral seminar consists of a series of talks and discussions covering the history and foundations of OMS, related work and on-going OMS developments and applications.|
|252-0926-00L||Seminar Verteilte Systeme (für Doktorierende)||W||2 KP||2S||F. Mattern|
|Kurzbeschreibung||Es werden aktuelle Themen im Bereich Verteilte Systeme diskutiert.|
|Lernziel||Erwerb von Kenntnissen zu aktuellen Themen im Bereich Verteilte Systeme.|
|Voraussetzungen / Besonderes||Seminar für Doktorierende, Termin nach Vereinbarung|
|252-0912-00L||Experimental Computer Systems |
Für Post/Doktoranden im Institut für Computersysteme. Alle anderen brauchen Bewilligung des Dozenten.
|W||2 KP||2S||T. Gross|
|Kurzbeschreibung||This graduate seminar provides doctoral students in computer science a chance to discuss their research. Enrollement requires permission of the instructor. |
Credit units are granted only to active participants.
|Lernziel||Learn how to present and discuss a reserach contribution. Learn how to provide feedback to research presentations and proposals.|
|Inhalt||The seminar will explore different topics from a research perspective. The seminar is open to assistants of the Departement of Computer Science (Informatik)|
|Skript||Supporting material will be distributed during the seminar.|
|Voraussetzungen / Besonderes||Prerequisites: |
|252-0932-00L||Seminar on Cryptography||W||2 KP||1S||U. Maurer, M. Hirt|
|Kurzbeschreibung||Es werden aktuelle Themen im Fachbereich Kryptographie besprochen.|
|Lernziel||Erwerb von Kenntnissen zu aktuellen Themen im Fachbereich Kryptographie.|
|252-0934-00L||Algorithms and Complexity (FS)||W||1 KP||1S||P. Widmayer, J. Hromkovic|
|Kurzbeschreibung||This seminar treats selected problems of current interest in the area of algorithms and complexity.|
|Lernziel||Develop an understanding of selected problems of current interest in the area of algorithms and complexity.|
|Inhalt||This seminar treats selected problems of current interest in the area of algorithms and complexity.|
|Literatur||Research papers, to be chosen in the seminar.|
|Voraussetzungen / Besonderes||Prerequisites: Basic understanding of algorithms and complexity.|
|252-3600-02L||Ubiquitous Computing Seminar||W||2 KP||2S||F. Mattern, O. Hilliges|
|Kurzbeschreibung||Seminar zu unterschiedlichen Themen aus den Bereichen Pervasive Computing, Ubiquitous Computing, Mensch-Maschine-Interaktion, Verteilte Systeme und verwandter Gebiete.|
|Lernziel||Erwerb von Kenntnissen zu unterschiedlichen aktuellen Themen aus den Bereichen Pervasive Computing, Ubiquitous Computing, Mensch-Maschine Interaktion Verteilte Systeme und verwandter Gebiete.|
|252-4202-00L||Seminar in Theoretical Computer Science||W||2 KP||2S||E. Welzl, B. Gärtner, M. Hoffmann, J. Lengler, A. Steger, B. Sudakov|
|Kurzbeschreibung||Presentation of recent publications in theoretical computer science, including results by diploma, masters and doctoral candidates.|
|Lernziel||To get an overview of current research in the areas covered by the involved research groups. To present results from the literature.|
|263-2100-00L||Research Topics in Software Engineering |
Maximale Teilnehmerzahl: 22
|W||2 KP||2S||T. Hoefler|
|Kurzbeschreibung||This seminar introduces students to fundamental results in parallel programming and design. Students will study and present research papers that span topics in both theory and practice, ranging from foundations parallel computing to applications. The focus will be on fundamental lower and upper bounds, thus, many papers will be dated. Students need a solid mathematical background.|
|Lernziel||At the end of the course, the students should be familiar with a broad range of key research results in the area of parallel computing, know how to read and assess papers in the area, and be able to highlight practical examples/applications, limitations of existing work, and outline potential improvements.|
|Inhalt||A selection of research papers with a focus on foundations of parallel computing/programming.|
|Literatur||The publications to be presented will be announced on the seminar home page at least one week before the first session.|
|Voraussetzungen / Besonderes||Papers will be distributed in the first session.|
|252-4302-00L||Seminar Algorithmic Game Theory||W||2 KP||2S||P. Widmayer, M. Mihalak|
|Kurzbeschreibung||In the seminar we will get familiar with the current original research in the area of algorithmic game theory by reading and presenting selected research papers in that area.|
|Lernziel||Develop an understanding of selected problems of current interest in the area of algorithmic game theory, and a practice of a scientific presentation.|
|Inhalt||Study and understanding of selected topics of current interest in algorithmic game theory such as: Complexity Results (class PPAD, PLS, NP), Sponsored Search, Approximation Algorithms via Algorithmic Game Theory, Price of Anarchy, New paradigms of computation (e.g., envy-fee, truthful), Mechanism Design.|
|Literatur||Selected research articles.|
|Voraussetzungen / Besonderes||You must have passed our "Algorithmic Game Theory" class (or have acquired equivalent knowledge, in exceptional cases).|
|263-2300-00L||How To Write Fast Numerical Code |
Prerequisite: Master student, solid C programming skills.
|W||6 KP||3V + 2U||M. Püschel|
|Kurzbeschreibung||This course introduces the student to the foundations and state-of-the-art techniques in developing high performance software for numerical functionality such as linear algebra and others. The focus is on optimizing for the memory hierarchy and for special instruction sets. Finally, the course will introduce the recent field of automatic performance tuning.|
|Lernziel||Software performance (i.e., runtime) arises through the interaction of algorithm, its implementation, and the microarchitecture the program is run on. The first goal of the course is to provide the student with an understanding of this interaction, and hence software performance, focusing on numerical or mathematical functionality. The second goal is to teach a general systematic strategy how to use this knowledge to write fast software for numerical problems. This strategy will be trained in a few homeworks and semester-long group projects.|
|Inhalt||The fast evolution and increasing complexity of computing platforms pose a major challenge for developers of high performance software for engineering, science, and consumer applications: it becomes increasingly harder to harness the available computing power. Straightforward implementations may lose as much as one or two orders of magnitude in performance. On the other hand, creating optimal implementations requires the developer to have an understanding of algorithms, capabilities and limitations of compilers, and the target platform's architecture and microarchitecture. |
This interdisciplinary course introduces the student to the foundations and state-of-the-art techniques in high performance software development using important functionality such as linear algebra functionality, transforms, filters, and others as examples. The course will explain how to optimize for the memory hierarchy, take advantage of special instruction sets, and, if time permits, how to write multithreaded code for multicore platforms. Much of the material is based on state-of-the-art research.
Further, a general strategy for performance analysis and optimization is introduced that the students will apply in group projects that accompany the course. Finally, the course will introduce the students to the recent field of automatic performance tuning.
|263-2810-00L||Advanced Compiler Design||W||7 KP||3V + 2U + 1A||T. Gross|
|Kurzbeschreibung||This course covers advanced topics in compiler design: SSA intermediate representation and its use in optimization, just-in-time compilation, profile-based compilation, exception handling in modern programming languages.|
|Lernziel||Understand translation of object-oriented programs, opportunities and difficulties in optimizing programs using state-of-the-art techniques (profile-based compilation, just-in-time compilation, runtime system interaction)|
|Inhalt||This course builds conceptually on Compiler Design (a basic class for advanced undergraduates), but this class is not a prerequisite. Students should however have a solid understanding of basic compiler technology. |
The focus is on handling the key features of modern object-oriented programs. We review implementations of single and multiple inheritance (incl. object layout, method dispatch) and optimization opportunities.
Specific topics: intermediate representations (IR) for optimizing compilers, static single assignment (SSA) representation, constant folding, partial redundancy optimizations, profiling, profile-guided code generation. Special topics as time permits: debugging optimized code, multi-threading, data races, object races, memory consistency models, programming language design. Review of single inheritance, multiple inheritance, object layout, method dispatch, type analysis, type propagation and related topics.
This course provides another opportunity to explore software design in a medium-scale software project.
|Literatur||Aho/Lam/Sethi/Ullmann, Compilers - Principles, Techniques, and Tools (2nd Edition). In addition, papers as provided in the class.|
|Voraussetzungen / Besonderes||A basic course on compiler design is helpful but not mandatory. Student should have programming skills/experience to implement an optimizer (or significant parts of an optimizer) for a simple object-oriented language. The programming project is implemented using Java.|
|264-5811-00L||Programming Systems Seminar |
The seminar is open to assistants of the Chair of Programming Methodology and the Software Reliability Lab (Department of Computer Science). Others should contact the instructors.
|W||2 KP||2S||P. Müller, M. Vechev|
|Kurzbeschreibung||This graduate seminar provides doctoral students in computer science a chance to read and discuss current research papers. Enrollment requires permission of the instructors. Credit units are granted only to active participants.|
|Lernziel||Learn about current research results in the area of programming languages, static program analysis, program verification, and related areas; practice of scientific presentations.|
|Inhalt||The seminar will explore different topics from a research perspective.|
|Skript||Supporting material will be distributed during the seminar.|
|Voraussetzungen / Besonderes||The seminar is open to assistants of the Chair of Programming Methodology and the Software Reliability Lab (Department of Computer Science). Others should contact the instructors.|
|264-5800-04L||Doctoral Seminar in Visual Computing (FS15)||W||1 KP||1S||M. Gross, M. Pollefeys, O. Sorkine Hornung|
|Kurzbeschreibung||Current research at the IVC will be presented and discussed.|
|Lernziel||Learn about current research results in the area of Visual Computing, practice of scientific presentations.|
|Inhalt||Current research at the IVC will be presented and discussed.|
|Voraussetzungen / Besonderes||Ungraded semester performance. Presence is mandatory to pass the seminar. Every participant has to present her reseach once a year. The course requires solid knowledge in the area of Computer Graphics and Computer Vision as well as state-of-the-art research.|
|» Auswahl aus sämtlichen Lehrveranstaltungen der ETH Zürich|
|263-4203-00L||Geometry: Combinatorics and Algorithms||W||2 KP||2S||B. Gärtner, M. Hoffmann, E. Welzl|
|Kurzbeschreibung||This seminar is held once a year and complements the course Geometry: Combinatorics & Algorithms. Students of the seminar will present original research papers, some classic and some of them very recent. The seminar is a good preparation for a master, diploma, or semester thesis in the area.|
|Lernziel||Each student is expected to read, understand, and elaborate on a selected research paper. To this end, (s)he should give a 45-min. presentation about the paper. The process includes|
* getting an overview of the related literature;
* understanding and working out the background/motivation:
why and where are the questions addressed relevant?
* understanding the contents of the paper in all details;
* selecting parts suitable for the presentation;
* presenting the selected parts in such a way that an audience
with some basic background in geometry and graph theory can easily understand and appreciate it.
|Voraussetzungen / Besonderes||To attend the seminar, some knowledge in (discrete and computational) geometry and graphs and algorithms is required. Thus, previous participation in the course "Geometry: Combinatorics & Algorithms" or a comparable course is strongly encouraged.|
- Seite 1 von 1