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.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Florin Avram

dblp:81/1914 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2003
0000-0002-2615-0950ORCID · verified

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

Theory of computation · 2 · 2 first-authorSystems, architecture and hardware · 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
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › source modeling
markov sources		 0.011985
On critical distortion for Markov sources · IEEE Trans. Inf. Theory 1985
Coding theory › source coding
rate-distortion theory		 0.011985
On critical distortion for Markov sources · IEEE Trans. Inf. Theory 1985
Coding theory › source coding › rate-distortion theory
shannon lower bound		 0.011985
On critical distortion for Markov sources · IEEE Trans. Inf. Theory 1985
Coding theory
source coding		 0.011985
On critical distortion for Markov sources · IEEE Trans. Inf. Theory 1985
Coding theory › source coding › rate-distortion theory
fidelity criterion		 0.011985
On critical distortion for Markov sources · IEEE Trans. Inf. Theory 1985

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

rate-distortion analysis · 0.0
YearPublicationVenuePosition
2003 On the large deviations approximation for the stationary distribution of skip-free regulated queueing networks
Florin Avram
 Perform. Evaluation1
1993 On a characterization of the minimum assignment and matching in the independent random model
Florin Avram, Dimitris Bertsimas
 IPCO1
1985 On critical distortion for Markov sources
abstract
The authors underbound the critical distortion below which the rate-distortion function of a Markov chain equals its Shannon lower bound. The bound is tight in all cases in which the exact answer is currently known.
Florin Avram, Toby Berger
 IEEE Trans. Inf. Theory1