Eldar Fischer's Home Page

If you have difficulties loading parts of the site, it sometimes helps to use this address instead of the one with a "˜" in it.

Publication list: Click here (most articles are available for download).

Research interests

Property testing: A topic in which I am very involved in the last years. Basically this deals with an approximation notion that for many problems allows for the construction algorithms that can resolve it without reading the entire input, and many times have a correspondingly sublinear running time. This is a relatively young topic that is still growing.

Graph theory: Mathematically speaking I grew up on graph theory, as my publications from the time of my Ph.D. studies would confirm. I am still very interested in this topic, and especially in applications of the Regularity Lemma. I am also interested in applications of combinatorial theory, and graph theory in particular, to property testing, logic (see below), and computational theory in general.

Formal logic and finite model theory: This is an exciting field that has a lot in common with combinatorial theory. It basically deals with asking what structures can be easily described, and what properties can be easily calculated, within a given language and under a given set of restrictions.

Probabilistically Checkable Proofs: As the name suggests, this deals with proof protocols that are easy (in that they take only a few queries) to verify, though the theory of constructing such proofs is not easy at all. In essence the existence of an easy to verify proof may mean that a certain approximation problem is hard, because such a proof may serve as a reduction to an NP-Hard problem. This has some connections with property testing, since a verification of a proof can start with a property test for a feature that once guaranteed makes the proof easier to verify.

Other topics in computational theory and combinatorics: The above list of course does not exclude other topics from catching my attention. In particular, I have also some interests in statistical deduction algorithms, coding theory, and database query evaluation algorithms.


Given in the year 2013-2014 Semester A

Probabilistic Methods and Algorithms (first given 2002-2003, expanded 2011).

Given in the year 2014 Semester B

Database management systems (236363) (first given 2004).

Given in the past

The property testing seminar. It will probably be put on hold for a few years now, unless I receive sufficiently many requests to hold it again.

An advanced seminar revolving around the reading and analysis of a hard research paper(s) (given in 2009 and 2010). I will consider holding it again if I get sufficiently many commitments to attend.

Introduction to computing (234112) (only managed, in 2008-2009).

File systems (234322) (2003).

Publication list ¦ Probabilistic methods course ¦ DBMS course ¦ Back to the CS home page