Eldar Fischer's Home Page

If you have difficulties loading parts of the site: This probably means that you are accessing the site through the "˜eldar" web address using Windows XP. Please try this address instead.

• Address: Computer Science Department, Technion, Technion City, Haifa 32000, Israel.
• Email: eldar@cs.technion.ac.il. If I seem to not get an email, send it again, sometimes the email system is not 100% reliable. Also, do not use the address with "csa" in it (email will not get through) or the address without "cs" (email will get through but I check that account only once a month).
• Phone: (+972-4)-8293967; Fax: (+972-4)-8293900.
• Last update to this page: 4.9.2009. There are important news about the Probabilistic Methods course.

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

Research interests

Property testing: A topic in which I am quite involved in the last years. Basically this deals with an approximation notion that for many problems allows for the construction of extremely fast (at times even "constant time") algorithms. This is a relatively young topic that is currently enjoying rapid growth.

Graph theory: Mathematically speaking I "grew up" on graph theory, as a brief glimpse in 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 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 to verify. It has also some connections with property testing.

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 parallel algorithms.

Courses

Every winter semester I am giving the course Probabilistic Methods and Algorithms; there is a small preparatory work for this course, so please head for its page for details. The course will be given in the 2009-2010 Winter semester. Due to an error it was marked until now as not given, but it will take place on Thursdays 14:30-16:30.

In the 2009 Spring semester I tried something new, an advanced seminar revolving around the reading and analysis of a hard research paper(s). If you are interested in participating the next time this seminar comes around, please email me.

Every spring semester from 2002 to 2008 I gave a property testing seminar. Future plans are not finalized, but I am considering giving from now on the testing seminar on even years and the advanced seminar (see above) on odd years. Please email if you wish to participate in this seminar, it may affect my plans. Property testing is one of my primary research interests so feel free to browse the seminar page also if you are not planning to participate in such a seminar.

I will be teaching the course Database management systems (236363) for the seventh time in the 2009-2010 Winter semester.

I have managed (but not taught) Introduction to computing (234112) in the 2008-2009 Winter semester.

I have also given the course File systems (234322) in the 2003 Spring semester.