Demo Data from VLDB 2026 / reviewers in the wild / expert
Wolfgang Engels
dblp:20/3041
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 1983
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 1 first-author
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
4 papers |
Information theory · 84% Coding theory · 10% Algorithms and data structures · 6% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › signal processing
sampling theory |
0.0 | 3 | 1983 | On the implementation of the Shannon sampling series for band-limited signals · IEEE Trans. Inf. Theory 1983 Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. II: Applications to Dyadic Sampling Representations · Inf. Control. 1982 Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. I: General Theory · Inf. Control. 1982 |
Information theory › signal processing
band-limited signals |
0.0 | 1 | 1983 | On the implementation of the Shannon sampling series for band-limited signals · IEEE Trans. Inf. Theory 1983 |
Information theory › signal processing › sampling theory
shannon sampling |
0.0 | 1 | 1983 | On the implementation of the Shannon sampling series for band-limited signals · IEEE Trans. Inf. Theory 1983 |
Information theory › signal processing
signal recovery |
0.0 | 1 | 1983 | On the implementation of the Shannon sampling series for band-limited signals · IEEE Trans. Inf. Theory 1983 |
Information theory › signal processing › sampling theory
sampling theorem |
0.0 | 1 | 1982 | On Walsh differentiable dyadically stationary random processes · IEEE Trans. Inf. Theory 1982 |
Information theory › probability theory
stochastic processes |
0.0 | 1 | 1982 | On Walsh differentiable dyadically stationary random processes · IEEE Trans. Inf. Theory 1982 |
Coding theory › boolean functions
walsh functions |
0.0 | 1 | 1982 | On Walsh differentiable dyadically stationary random processes · IEEE Trans. Inf. Theory 1982 |
Methods — techniques the papers use, named apart from their topics
sampling theorem · 0.0dyadic calculus · 0.0sinc function approximation · 0.0algebraic polynomial approximation · 0.0dyadic derivative · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1983 | On the implementation of the Shannon sampling series for band-limited signalsabstractThe sinc function occuring in the classical Shannon sampling theorem is replaced by algebraic polynomials. It turns out that it is not necessary to take the algebraic polynomial of best approximation to sinct;a finite sum of the Taylor series expansion already suffices. The basic problem is to couple the number of terms taken of the truncated sampling expansion with that of the Taylor expansion in such a fashion that convergence of the modified sampling expansion is guaranteed. The resulting error is additive to the truncation error and is negligible in comparison with the latter. The results are illustrated by two representative examples. P. L. Butzer, Wolfgang Engels |
IEEE Trans. Inf. Theory | 2 |
| 1982 | Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. I: General Theory
P. L. Butzer, Wolfgang Engels |
Inf. Control. | 2 |
| 1982 | Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. II: Applications to Dyadic Sampling Representations
P. L. Butzer, Wolfgang Engels |
Inf. Control. | 2 |
| 1982 | On Walsh differentiable dyadically stationary random processesabstractSome basic properties of dyadically stationary (DS) processes are introduced, including continuity and spectral representation. A sampling theorem based on the Walsh functions is investigated for random signals that are not necessarily sequency-limited. By using the concept of a dyadic derivative, the resulting aliasing error is calculated together with the speed of convergence. An example gives a glimpse into the possibilities of applying the sampling theorem as well as the dyadic derivative. Wolfgang Engels, Wolfgang Splettstösser |
IEEE Trans. Inf. Theory | 1 |