Demo Data from EDBT 2026 / reviewers in the wild / expert
H. Paul Zeiger
dblp:12/2970
· DBLP profile ↗
10ranked-venue papers
6as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 9 · 6 first-authorArtificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
5 papers |
Automata and formal languages · 64% Computational complexity · 25% Logic in computer science · 6% | |
| Software engineering, system software, and programming languages
1 paper |
Programming languages and type systems · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Automata and formal languages › formal language classes
recursively enumerable languages |
0.0 | 1 | 1980 | Very Special Languages and Representations of Recursively Enumerable Languages via Computation Histories · Inf. Control. 1980 |
Computational complexity
complexity measures |
0.0 | 1 | 1974 | Complexity Measures for Regular Expressions · STOC 1974 |
Computational complexity
descriptive complexity |
0.0 | 1 | 1974 | Complexity Measures for Regular Expressions · STOC 1974 |
Automata and formal languages › regular languages
regular expressions |
0.0 | 1 | 1974 | Complexity Measures for Regular Expressions · STOC 1974 |
Automata and formal languages › regular languages
star height |
0.0 | 1 | 1974 | Complexity Measures for Regular Expressions · STOC 1974 |
Programming languages and type systems
language design |
0.0 | 1 | 1969 | Formal Models for Some Features of Programming Languages · STOC 1969 |
Logic in computer science
formal semantics |
0.0 | 1 | 1969 | Formal Models for Some Features of Programming Languages · STOC 1969 |
Automata and formal languages › algebraic automata theory › automata decomposition
cascade synthesis |
0.0 | 1 | 1967 | Cascade Synthesis of Finite-State Machines · Inf. Control. 1967 |
Automata and formal languages
finite automata |
0.0 | 1 | 1967 | Cascade Synthesis of Finite-State Machines · Inf. Control. 1967 |
Algorithms and data structures › numerical linear algebra
linear system solving |
0.0 | 1 | 1967 | Ho's Algorithm, Commutative Diagrams, and the Uniqueness of Minimal Linear Systems · Inf. Control. 1967 |
Methods — techniques the papers use, named apart from their topics
constructive method · 0.0combinatorial analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | LDS/UCC: Intelligent control of the loan documentation processabstractNo abstract available. H. Joel Jeffrey, H. Paul Zeiger, Anthony O. Putnam |
IEA/AIE (2) | 2 |
| 1980 | Very Special Languages and Representations of Recursively Enumerable Languages via Computation Histories
David Haussler, H. Paul Zeiger |
Inf. Control. | 2 |
| 1976 | Complexity Measures for Regular Expressions
Andrzej Ehrenfeucht, H. Paul Zeiger |
J. Comput. Syst. Sci. | 2 |
| 1974 | Complexity Measures for Regular ExpressionsabstractSeveral measures of complexity of a regular expression are defined. (Star height and number of alphabetical symbols are two of them.) Upper and lower estimates for the complexities of expressions for certain standard sets (e.g. the set of all paths on a complete graph) are derived. Andrzej Ehrenfeucht, H. Paul Zeiger |
STOC | 2 |
| 1969 | Formal Models for Some Features of Programming LanguagesabstractIn this paper we attempt to tighten the connections between classical mathematics, automata theory, and the theory of programming languages. Formal linguistic objects corresponding to programs are defined via sets of functional equations; two interpretations of such an object are given, one in classical mathematics, and one in terms of an abstract machine that executes the program. Within this framework we examine flow charts, recursion, parameterization, and declaration. H. Paul Zeiger |
STOC | 1 |
| 1968 | Correction: Yet Another Proof of the Cascade Decomposition Theorem for Finite Automata
H. Paul Zeiger |
Math. Syst. Theory | 1 |
| 1967 | Cascade Synthesis of Finite-State Machines
H. Paul Zeiger |
Inf. Control. | 1 |
| 1967 | Ho's Algorithm, Commutative Diagrams, and the Uniqueness of Minimal Linear Systems
H. Paul Zeiger |
Inf. Control. | 1 |
| 1967 | Erratum: "Cascade Synthesis of Finite-State Machines"
H. Paul Zeiger |
Inf. Control. | 1 |
| 1967 | Yet Another Proof of the Cascade Decomposition Theorem for Finite Automata
H. Paul Zeiger |
Math. Syst. Theory | 1 |