EDBT 2026 Demo / reviewers in the wild / expert
Jack I. Karush
dblp:79/3889
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1979
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
High-performance computing · 50% Processor architecture and microarchitecture · 50% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing
numerical linear algebra |
0.0 | 1 | 1979 | Odd-Even Reduction for Banded Linear Equations · J. ACM 1979 |
Processor architecture and microarchitecture
vector processing |
0.0 | 1 | 1979 | Odd-Even Reduction for Banded Linear Equations · J. ACM 1979 |
Coding theory › source coding › variable-length codes
kraft inequality |
0.0 | 1 | 1961 | A simple proof of an inequality of McMillan (Corresp.) · IRE Trans. Inf. Theory 1961 |
Coding theory
source coding |
0.0 | 1 | 1961 | A simple proof of an inequality of McMillan (Corresp.) · IRE Trans. Inf. Theory 1961 |
Coding theory › source coding
variable-length codes |
0.0 | 1 | 1961 | A simple proof of an inequality of McMillan (Corresp.) · IRE Trans. Inf. Theory 1961 |
Methods — techniques the papers use, named apart from their topics
odd-even reduction · 0.0mathematical proof · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1979 | Odd-Even Reduction for Banded Linear EquationsabstractThe method of odd-even reduction for trldiagonal systems is generahzed to banded systems The method is developed so that it can be easily implemented on a vector processor such as the CDC STAR-100 Results are presented which describe when this odd-even reduction can be performed on a pentadlagonal system A computational example is given Garry H. Rodrigue, Niel K. Madsen, Jack I. Karush |
J. ACM | 3 |
| 1976 | Matrix Multiplication by Diagonals on a Vector/Parallel Processor
Niel K. Madsen, Garry H. Rodrigue, Jack I. Karush |
Inf. Process. Lett. | 3 |
| 1961 | A simple proof of an inequality of McMillan (Corresp.)
Jack I. Karush |
IRE Trans. Inf. Theory | 1 |