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

- 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 less than once a month).
- Phone: (+972-4)-8293967; Fax: (+972-4)-8293900.
- I generally do not use social networks. Plain email is the best way to contact me.
- Last update to this page: 25.12.2014. The publication page was last updated on 12.11.1013.
**This site is no longer updated:**Since a move to the new website is planned, all updates will happen there.

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

**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.

Probabilistic Methods and Algorithms (236374).

Database management systems (236363).

An advanced seminar revolving around the reading and analysis of a hard research paper(s).

Introduction to computing (234112) (management only).

File systems (234322) (once).