Concepedia

Alexander Leitsch

AL

Statistics

Publications

15

Citations

524

H-Index

12

Active since

1985

Affiliations

TU Wien(Current)

Alexander Leitsch is an author at TU Wien specializing in computer science, computing, and mathematics.

ORCID

Publications per year

1985–2018

15

Publications

15

ON SKOLEMIZATION AND PROOF COMPLEXITY

Matthias Baaz, Alexander Leitsch · Fundamenta Informaticae · 1994 · 83 citations

, , +11

Cut-elimination and Redundancy-elimination by Resolution

Matthias Baaz, Alexander Leitsch · Journal of Symbolic Computation · 2000 · 74 citations

, , +4

On the efficiency of subsumption algorithms

Georg Gottlob, Alexander Leitsch · Journal of the ACM · 1985 · 67 citations · Full text

, , +12

Cut normal forms and proof complexity

Matthias Baaz, Alexander Leitsch · Annals of Pure and Applied Logic · 1999 · 40 citations

, , +9

CERES: An analysis of Fürstenberg’s proof of the infinity of primes

Matthias Baaz, Stefan Hetzl, Alexander Leitsch et al. · Theoretical Computer Science · 2008 · 39 citations

, , +7

1–5 of 15