Informatics Logo
Computer Science Department - Technische Universität München

Chair for Efficient Algorithms

TUM Logo deutsch

Bibliographic Database LEABib

Welcome to the bibliographic database LEABib of the chair for efficient algorithms at the Technische Universität München. The BibTeX database contains more than 72000 citations from theory and foundations of computer science. In order to use this page your browser must be able to handle forms.

Search for

in with misspellings,

case sensitive, match as a word,

and

in with misspellings,

case sensitive, match as a word,

and

in with misspellings,

case sensitive, match as a word,

and

<= year <= .

ignore characters '{', '}', and '\'.


How to form queries

The fields separated by "and" allow you to form Boolean queries. If you put a pattern in more than one of them, then all the patterns you specify will have to appear in the citation. You can restrict a pattern to appear in a specific entry of the citation by selecting the appropriate entry name. By default search is case insensitive and partial matches are recognized.

You can allow a number of misspellings, although we suggest not to allow more than one or two misspellings because you may find too many matches. A misspelling is either an insertion, a deletion, or a substitution in the bibliography or in the pattern.

Patterns can contain any printable character and the pattern matcher does not translate escape sequences. For example "\n" finds all occurrences of the two character sequence "\n" but not a newline.

You can instruct the pattern matcher to ignore the characters '{', '}', and '\' in the database, which is helpful in case a name contains an accent or an umlaut. For example Gröbner is written Gr{\"o}bner in the database but searching for Gr"obner will do the job if ignoring is enabled.

Acknowledgments

This server is based on leagrep, a search tool for fast approximate pattern matching developed by Burkhard Bartsch.

Last Changes: Stefan Pfingstl on 22/9/2003