Search result: Catalogue data in Spring Semester 2022
Computer Science Bachelor ![]() | |||||||||||||||||||||||||||||||||
![]() Students may also choose a seminar from the Master's program in Computer Science. It is their responsibility to make sure that they meet the requirements and conditions for this seminar. | |||||||||||||||||||||||||||||||||
Number | Title | Type | ECTS | Hours | Lecturers | ||||||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
252-2310-00L | Understanding Context-Free Parsing Algorithms ![]() ![]() 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. Number of participants limited to 24. | W | 2 credits | 2S | R. Cotterell | ||||||||||||||||||||||||||||
Abstract | Parsing context-free grammars is a fundamental problem in natural language processing and computer science more broadly. This seminar will explore a classic text that unifies many algorithms for parsing in one framework. | ||||||||||||||||||||||||||||||||
Learning objective | Sikkel's notion of parsing schemata is explored in depth. The students should take away an understanding and fluency with these ideas. | ||||||||||||||||||||||||||||||||
Content | Parsing Schemata: A Framework for Specification and Analysis of Parsing Algorithms | ||||||||||||||||||||||||||||||||
252-2603-00L | Seminar on Systems Security ![]() ![]() 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. | W | 2 credits | 2S | S. Shinde | ||||||||||||||||||||||||||||
Abstract | The seminar focuses on critical thinking and critique of fundamental as well as recent advances in systems security. | ||||||||||||||||||||||||||||||||
Learning objective | The learning objective is to analyze selected research papers published at top systems+security venues and then identify open problems in this space. The seminar will achieve this via several components: reading papers, technical presentations, writing analysis and critique summaries, class discussions, and exploring potential research topics. | ||||||||||||||||||||||||||||||||
Content | Each student will pick one paper from the selected list, present it in the class, and lead the discussion for that paper. During the semester, all students will select, read, and submit critique summaries for at least 8 research papers from the list. | ||||||||||||||||||||||||||||||||
Prerequisites / Notice | Students who are either interested in security research or are exploring thesis topics are highly encouraged to take this course. Students with systems/architecture/verification/PL expertise and basic security understanding are welcome. | ||||||||||||||||||||||||||||||||
Competencies![]() |
| ||||||||||||||||||||||||||||||||
252-3510-00L | Computing Platforms ![]() ![]() 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. | W | 2 credits | 2S | G. Alonso, M. J. Giardino | ||||||||||||||||||||||||||||
Abstract | The seminar covers core concepts and ideas in the general area of computer systems, ranging from software and hardware architectures to system design for operating systems, data processing systems, and distributed systems. | ||||||||||||||||||||||||||||||||
Learning objective | The seminar will cover core concepts and ideas in the general area of computer systems, ranging from software and hardware architectures to system design for operating systems, data processing systems, and distributed systems. The focus will be on fundamental ideas that apply across systems and application areas but with an emphasis on those ideas that apply to cloud platforms and hardware acceler | ||||||||||||||||||||||||||||||||
Content | The seminar will consist on student presentations based on a list of papers that will be provided at the beginning of the course. Presentations will be done in teams. Presentations will be arranged in slots of 30 minutes talk plus 15 minutes questions. Grades will be assigned based on quality of the presentation, coverage of the topic including material not in the original papers, participation during the seminar, and ability to understand, present, and criticize the underlying technology. | ||||||||||||||||||||||||||||||||
252-3800-00L | Advanced Topics in Mixed Reality ![]() ![]() Number of participants limited to 24. 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. | W | 2 credits | 2S | C. Holz | ||||||||||||||||||||||||||||
Abstract | In the recent years, there have been major technological advances in commercial virtual and augmented reality systems. Those advancements lead to many open challenges in terms of perception and interaction as well as technical challenges. In this course, students present and discuss papers from relevant top-tier research venues to extract techniques and insights from MR research. | ||||||||||||||||||||||||||||||||
Learning objective | The objective of the seminar is for participants to collectively learn about the state-of-the-art research in Mixed Reality (primarily augmented and virtual reality) and closely related areas. This includes the ability to concisely present results of pioneering as well as state-of-the-art research. Another objective is to collectively discuss open issues in the field and developing a feeling for what constitutes research questions and outcomes in the field of technical Human-Computer Interaction. | ||||||||||||||||||||||||||||||||
Content | The seminar format is as follows: attendees individually read one full-paper publication, working through its content in detail and possibly covering some of the background if necessary, and present the approach, methodology, research question and implementation as well as the evaluation and discussion in a 20–25 min talk in front of the others. Each presenter will then lead a short discussion about the paper, which is also guided by questions posed to the audience. | ||||||||||||||||||||||||||||||||
Literature | 24 papers will be provided by the lecturer and distributed in the first seminar on a first-come, first-served basis according to participants' preferences. The lecturer will also give a brief run-down across all 24 papers in a fast-forward style, covering each paper in a single-minute presentation, and outline the difficulties of each project. The schedule is fixed throughout the term with easier papers being presented earlier and more comprehensive papers presented later in the term. | ||||||||||||||||||||||||||||||||
Prerequisites / Notice | All students (including students on waiting list) are welcome in the first seminar to see the overview over the papers we will discuss. After assigning papers, the seminar will be limited to 24 attendees, i.e., only enrolled students can participate in the presentations and discussions. | ||||||||||||||||||||||||||||||||
252-3810-00L | Datacenter Network Monitoring and Management ![]() 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. | W | 2 credits | 2S | D. Wagenknecht-Dimitrova | ||||||||||||||||||||||||||||
Abstract | The seminar addresses questions of network monitoring in datacenters, with focus on security. | ||||||||||||||||||||||||||||||||
Learning objective | The seminar addresses questions of network monitoring in datacenters, with focus on security. Students will learn about network threats and approaches to prevent and resolve those. Both traditional distributed and modern programmable networks will be discussed. Special attention will be given to the challenge of data collection and data processing for security purposes. | ||||||||||||||||||||||||||||||||
Content | The seminar focuses on papers in high quality conferences, and whitepapers and blogs from leading industry. Real world incidents will be covered where appropriate. Background reading on datacenter networks and software defined networks is also included. The seminar attempts to strike a balance between understanding the fundamentals and keeping up with novel developments. | ||||||||||||||||||||||||||||||||
Competencies![]() |
| ||||||||||||||||||||||||||||||||
252-4225-00L | Presenting Theoretical Computer Science ![]() Number of participants limited to 24. 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. | W | 2 credits | 2S | B. Gärtner, R. Kyng, A. Steger, D. Steurer, E. Welzl | ||||||||||||||||||||||||||||
Abstract | Students present current or classical results from theoretical computer science. | ||||||||||||||||||||||||||||||||
Learning objective | Students learn to read, understand and present results from theoretical computer science. The main focus and deliverable is a good presentation of 45 minutes that can easily be followed and understood by the audience. | ||||||||||||||||||||||||||||||||
Content | Students present current or classical results from theoretical computer science. | ||||||||||||||||||||||||||||||||
Prerequisites / Notice | The seminar takes place as a block seminar on two Saturdays in April and/or May. Each presentation is jointly prepared and given by two students (procedure according to the seminar's Moodle page). All students must attend all presentations. Participation requires successful completion of the first year, or instructor approval. | ||||||||||||||||||||||||||||||||
252-4910-00L | Randomized Algorithms ![]() ![]() 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. Number of participants limited to 24. | W | 2 credits | 2S | H.‑J. Böckenhauer, R. Kralovic | ||||||||||||||||||||||||||||
Abstract | We look into randomized approaches for dealing with computational problems. A randomized algorithm uses random decisions to guide its computation. Its quality is measured in a worst-case manner over all instances by a probability distribution over the taken random decisions. We analyze different design methods and error models. | ||||||||||||||||||||||||||||||||
Learning objective | To systematically acquire an overview of the methods for designing randomized algorithms. To get deeper knowledge of the classification of randomized algorithms according to error models. To learn how to analyze the error probability of randomized algorithms.To learn about typical applications for randomized computations. | ||||||||||||||||||||||||||||||||
Content | In this seminar, we discuss how randomization can help to speed up algorithms for various computational problems. In the kick-off meeting, we will give a brief overview of modeling and classifying randomized algorithms. Then, each participant will study one aspect of this topic, following a specific scientific publication, and will give a presentation about this topic. The topics will include design methods for randomized algorithms like fingerprinting, foiling an adversary, random sampling, randomized rounding as well as the classification of randomized algorithms according to their error (e.g., Las Vegas vs. Monte Carlo algorithms). The considered problems will include, among others, hashing, primality testing, communication protocols, maximum satisfiability. | ||||||||||||||||||||||||||||||||
Literature | The literature will consist of textbook chapters and original research papers and will be provided during the kick-off meeting. | ||||||||||||||||||||||||||||||||
Prerequisites / Notice | The participants should be familiar with the content of the lectures "Algorithmen und Datenstrukturen" (252-0026-00) and "Theoretische Informatik" (252-0057-00). The presentations will be given in the form of a block course in the second week of June 2022. The language can be mixed in German and English in the following sense: The teaching material will be in English, but it will be possible for at least half of the participants to give their presentations and hand in their written summaries in German. | ||||||||||||||||||||||||||||||||
227-2211-00L | Seminar in Computer Architecture ![]() ![]() 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. | W | 2 credits | 2S | O. Mutlu, M. H. K. Alser, J. Gómez Luna | ||||||||||||||||||||||||||||
Abstract | This seminar course covers fundamental and cutting-edge research papers in computer architecture. It has multiple components that are aimed at improving students' (1) technical skills in computer architecture, (2) critical thinking and analysis abilities on computer architecture concepts, as well as (3) technical presentation of concepts and papers in both spoken and written forms. | ||||||||||||||||||||||||||||||||
Learning objective | The main objective is to learn how to rigorously analyze and present papers and ideas on computer architecture. We will have rigorous presentation and discussion of selected papers during lectures and a written report delivered by each student at the end of the semester. This course is for those interested in computer architecture. Registered students are expected to attend every meeting, participate in the discussion, and create a synthesis report at the end of the course. | ||||||||||||||||||||||||||||||||
Content | Topics will center around computer architecture. We will, for example, discuss papers on hardware security; accelerators for key applications like machine learning, graph processing and bioinformatics; memory systems; interconnects; processing in memory; various fundamental and emerging paradigms in computer architecture; hardware/software co-design and cooperation; fault tolerance; energy efficiency; heterogeneous and parallel systems; new execution models; predictable computing, etc. | ||||||||||||||||||||||||||||||||
Lecture notes | All materials will be posted on the course website: https://safari.ethz.ch/architecture_seminar/ Past course materials, including the synthesis report assignment, can be found in the Fall 2020 website for the course: https://safari.ethz.ch/architecture_seminar/fall2020/doku.php | ||||||||||||||||||||||||||||||||
Literature | Key papers and articles, on both fundamentals and cutting-edge topics in computer architecture will be provided and discussed. These will be posted on the course website. | ||||||||||||||||||||||||||||||||
Prerequisites / Notice | Design of Digital Circuits. Students should (1) have done very well in Design of Digital Circuits and (2) show a genuine interest in Computer Architecture. |
Page 1 of 1