Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
EDBT 2026 Demo / reviewers in the wild / expert

Daniel G. Jablonski

dblp:322/6290 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1990
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2 · 2 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 architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms › non-von neumann architecture
reversible computing		 0.011990
A heat engine model of a reversible computation · Proc. IEEE 1990
Computational complexity › computational models
reversible computation		 0.011990
A heat engine model of a reversible computation · Proc. IEEE 1990

Methods — techniques the papers use, named apart from their topics

information theory · 0.0carnot cycle model · 0.0
YearPublicationVenuePosition
1990 A heat engine model of a reversible computation
abstract
Using the tools of information theory and thermodynamics, reversible computation at the binary level is modeled as a heat engine operating in a Carnot cycle. The model defines an information-theoretic temperature for a binary system and predicts that reversible computation can be accomplished without the dissipation of energy. However, in the worst-case limit, kT log 2 joules of stored energy operation per bit are required, where T is not the ambient temperature but the information-theoretic temperature, which for this case is infinite.
Daniel G. Jablonski
 Proc. IEEE1
1986 A pole-zero deletion method for calculating pade approximates
abstract
A practical method for computing Pade approximates of nonrational functions is demonstrated.
Daniel G. Jablonski
 Proc. IEEE1