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 VLDB 2026 / reviewers in the wild / expert

Stavros G. Papastavridis

dblp:28/5436 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Computer networks · 1 · 1 first-authorTheory of computation · 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

TopicWeightPapersLastEvidence papers
Coding theory › constrained coding
bit-stuffing		 0.011987
On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code · IEEE Trans. Commun. 1987
Coding theory › constrained coding › synchronization codes
prefix-synchronized codes		 0.011987
On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code · IEEE Trans. Commun. 1987

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

combinatorial analysis · 0.0
YearPublicationVenuePosition
1993 Erratum: Binary Vectors with Exactly k Nonoverlapping m-Tuples of Consecutive ones
Frank K. Hwang, Stavros G. Papastavridis
 Discret. Appl. Math.2
1987 On the Mean Number of Stuffing Bits in a Prefix-Synchronized Code
abstract
Artom [1] suggested a bit-stuffing technique to map data blocks into prefix-synchronized code words. In this correspondence we compute the mean number of stuffing bits required. We prove that the average number of stuffing bits per block is quite small.
Stavros G. Papastavridis
 IEEE Trans. Commun.1