Demo Data from EDBT 2026 / reviewers in the wild / expert
Brian Gluss
dblp:70/2463
· DBLP profile ↗
7ranked-venue papers
6as first author
0since 2021 · last 1965
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 5 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 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
6 papers |
Algorithms and data structures · 37% Mathematical optimization · 29% Computational geometry · 27% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Computational geometry › shape analysis › shape fitting
curve fitting |
0.0 | 2 | 1964 | An Alternative Method for Continuous Line Segment Curve-Fitting · Inf. Control. 1964 A Line Segment Curve-Fitting Algorithm Related to Optimal Encoding of Information · Inf. Control. 1962 |
Algorithms and data structures
dynamic programming |
0.0 | 1 | 1963 | A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory · J. ACM 1963 |
Algorithms and data structures
group testing |
0.0 | 1 | 1963 | A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information Theory · J. ACM 1963 |
Algorithms and data structures › search algorithms
combinatorial search |
0.0 | 1 | 1961 | On Various Versions of the Defective Coin Problem · Inf. Control. 1961 |
Mathematical optimization
scheduling |
0.0 | 1 | 1962 | A Note on a Computational Approximation to the Two-Machine Problem · Inf. Control. 1962 |
Computational complexity
decision problems |
0.0 | 1 | 1961 | On Various Versions of the Defective Coin Problem · Inf. Control. 1961 |
Coding theory › source coding
optimal encoding |
0.0 | 1 | 1962 | A Line Segment Curve-Fitting Algorithm Related to Optimal Encoding of Information · Inf. Control. 1962 |
Methods — techniques the papers use, named apart from their topics
information theory · 0.0dynamic programming · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1965 | A Note on the Solution of a Communication Jamming Problem of Root
Brian Gluss |
Inf. Control. | 1 |
| 1965 | Correction to a result of Dobrushin (Corresp.)
Brian Gluss |
IEEE Trans. Inf. Theory | 1 |
| 1964 | An Alternative Method for Continuous Line Segment Curve-Fitting
Brian Gluss |
Inf. Control. | 1 |
| 1963 | A Method for Obtaining Suboptimal Group-Testing Policies Using Dynamic Programming and Information TheoryabstractA method is described for obtaining suboptimal group-testing policies when the control process can be given a dynamic programming formulation and when information theoretic lower bounds on the cost criteria can be derived.The method, while in some cases probably not producing as good policies as a straight-forward solution of the dynamic programming functional equation, has the advantages of requiring little computer storage space and comput.ation.In the last section of the paper, an example model is evabmted. Brian Gluss |
J. ACM | 1 |
| 1962 | A Line Segment Curve-Fitting Algorithm Related to Optimal Encoding of Information
Brian Gluss |
Inf. Control. | 1 |
| 1962 | A Note on a Computational Approximation to the Two-Machine Problem
Brian Gluss |
Inf. Control. | 1 |
| 1961 | On Various Versions of the Defective Coin Problem
Richard Bellman, Brian Gluss |
Inf. Control. | 2 |