EDBT 2026 Demo / reviewers in the wild / expert
Michael Kaplan
dblp:34/3644
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorTheory of computation · 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 graphics and multimedia
1 paper |
Rendering · 100% | |
| Computer networks
1 paper |
Physical-layer communications · 33% Wireless networking · 33% Transport protocols and congestion control · 33% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering
hidden surface removal |
0.0 | 1 | 1979 | Parallel processing techniques for hidden surface removal · SIGGRAPH 1979 |
Transport protocols and congestion control › congestion control modeling
congestion control stability |
0.0 | 1 | 1979 | A sufficient condition of nonergodicity of a Markov chain (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Physical-layer communications
multiple access |
0.0 | 1 | 1979 | A sufficient condition of nonergodicity of a Markov chain (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Wireless networking › random access › ALOHA
slotted ALOHA |
0.0 | 1 | 1979 | A sufficient condition of nonergodicity of a Markov chain (Corresp.) · IEEE Trans. Inf. Theory 1979 |
Parallel and multicore computing › parallel algorithms
parallel graphics algorithms |
0.0 | 1 | 1979 | Parallel processing techniques for hidden surface removal · SIGGRAPH 1979 |
Methods — techniques the papers use, named apart from their topics
sorting · 0.0coherence · 0.0sufficient condition derivation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Practical and Accurate Runtime Application Protection Against DoS Attacks
Mohamed Elsabagh, Daniel Fleck, Angelos Stavrou, Michael Kaplan, Thomas Bowen |
RAID | 4 |
| 1979 | Parallel processing techniques for hidden surface removalabstractPrevious work in the hidden-surface problem has revealed two key concepts. First, the removal of non-visible surfaces is essentially a sorting problem. Second, some form of coherence is essential for the efficient solution of this problem. Michael Kaplan, Donald P. Greenberg |
SIGGRAPH | 1 |
| 1979 | A sufficient condition of nonergodicity of a Markov chain (Corresp.)abstractA natural and easily verifiable sufficient condition is given for the nonergodicity of a Markov chain. The result provides a converse to a theorem of Pakes and implies as special cases several recently published sufficient conditions for the instability of various forms of slotted ALOHA systems with Markovian retransmissions. Michael Kaplan |
IEEE Trans. Inf. Theory | 1 |