Demo Data from EDBT 2026 / reviewers in the wild / expert
Theresa C. Maxino
dblp:307/2690
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 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.
| Computer networks
1 paper |
Transport protocols and congestion control · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transport protocols and congestion control › error control
error detection |
0.1 | 1 | 2009 | The Effectiveness of Checksums for Embedded Control Networks · IEEE Trans. Dependable Secur. Comput. 2009 |
Coding theory › error-correcting codes › error detection
cyclic redundancy check |
0.0 | 1 | 2009 | The Effectiveness of Checksums for Embedded Control Networks · IEEE Trans. Dependable Secur. Comput. 2009 |
Methods — techniques the papers use, named apart from their topics
error detection analysis · 0.3checksum computation · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | The Effectiveness of Checksums for Embedded Control NetworksabstractEmbedded control networks commonly use checksums to detect data transmission errors. However, design decisions about which checksum to use are difficult because of a lack of information about the relative effectiveness of available options. We study the error detection effectiveness of the following commonly used checksum computations: exclusive or (XOR), two's complement addition, one's complement addition, Fletcher checksum, Adler checksum, and cyclic redundancy codes (CRCs). A study of error detection capabilities for random independent bit errors and burst errors reveals that XOR, two's complement addition, and Adler checksums are suboptimal for typical network use. Instead, one's complement addition should be used for networks willing to sacrifice error detection effectiveness to reduce compute cost, Fletcher checksum for networks looking for a balance of error detection and compute cost, and CRCs for networks willing to pay a higher compute cost for significantly improved error detection. Theresa C. Maxino, Philip Koopman |
IEEE Trans. Dependable Secur. Comput. | 1 |