VLDB 2026 Research / reviewers in the wild / expert
Ingrid Rinsma-Melchert
dblp:25/2020
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1Security and privacy · 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
1 paper |
Coding theory · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › source coding › entropy coding
arithmetic coding |
0.0 | 1 | 1997 | Integrating error detection into arithmetic coding · IEEE Trans. Commun. 1997 |
Coding theory
source coding |
0.0 | 1 | 1997 | Integrating error detection into arithmetic coding · IEEE Trans. Commun. 1997 |
Methods — techniques the papers use, named apart from their topics
arithmetic coding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Integrating error detection into arithmetic codingabstractArithmetic coding for data compression has gained widespread acceptance as the right method for optimum compression when used with a suitable source model. A technique to implement error detection as part of the arithmetic coding process is described. Heuristic arguments are given to show that a small amount of extra redundancy can be very effective in detecting errors very quickly, and practical tests confirm this prediction. Colin Boyd, John G. Cleary, Sean A. Irvine, Ingrid Rinsma-Melchert, Ian H. Witten |
IEEE Trans. Commun. | 4 |
| 1995 | On the insecurity of arithmetic coding
John G. Cleary, Sean A. Irvine, Ingrid Rinsma-Melchert |
Comput. Secur. | 3 |