Demo Data from EDBT 2026 / reviewers in the wild / expert
S. Berkowitz
dblp:02/1154
· DBLP profile ↗
2ranked-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 · 2 · 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
2 papers |
Algorithms and data structures · 43% Computational complexity · 43% Information theory · 14% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% | |
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures
parallel algorithms |
0.0 | 1 | 1983 | Fast Parallel Computation of Polynomials Using Few Processors · SIAM J. Comput. 1983 |
Computational complexity
parallel complexity |
0.0 | 1 | 1983 | Fast Parallel Computation of Polynomials Using Few Processors · SIAM J. Comput. 1983 |
Parallel and multicore computing
parallel algorithms |
0.0 | 1 | 1983 | Fast Parallel Computation of Polynomials Using Few Processors · SIAM J. Comput. 1983 |
Physical-layer communications
signal processing for communications |
0.0 | 1 | 1970 | Block filtering in amplitude-continuous time-discrete channels (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Information theory › channel capacity
additive noise channel |
0.0 | 1 | 1970 | Block filtering in amplitude-continuous time-discrete channels (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Information theory
channel capacity |
0.0 | 1 | 1970 | Block filtering in amplitude-continuous time-discrete channels (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Methods — techniques the papers use, named apart from their topics
parallel algorithm design · 0.0degree reduction · 0.0covariance matrix diagonalization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1983 | Fast Parallel Computation of Polynomials Using Few ProcessorsabstractIt is shown that any multivariate polynomial of degree d that can be computed sequentially in C steps can be computed in parallel in $O((\log d)(\log C + \log d))$ steps using only $(Cd)^{O(1)} $ processors. Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff |
SIAM J. Comput. | 3 |
| 1970 | Block filtering in amplitude-continuous time-discrete channels (Corresp.)abstractA linear amplitude-continuous (LAC) block filter is a real-valued rectangular matrix transformationAof a vector of real-valued zero-mean signal samples with covariance matrixR_x, such thattr(A R_x A ^ T)is invariant withA. The matrixAadds redundancy to the signal by having more rows than columns. A special class of LAC filters, called orthogonal LAC filters, is constrained byA^T A \propto I. For a channel containing zero-mean additive noise, independent of the signal, it is shown that optimum orthogonal LAC filters reduce error by diagonalizing the covariance matrices in the error expression, but are as ineffective as transmission without prefiltering against stationary white noise. On the other hand, this correspondence describes a class of LAC filters that are effective against stationary white noise. S. Berkowitz |
IEEE Trans. Inf. Theory | 1 |