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

Giacomo Giannini

dblp:58/4222 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › group communication
causal broadcast		 0.012004
On Causal Broadcasting with Positive Acknowledgments and Bounded-Length Counters · IEEE Trans. Computers 2004
Distributed systems
fault tolerance		 0.012004
On Causal Broadcasting with Positive Acknowledgments and Bounded-Length Counters · IEEE Trans. Computers 2004
Distributed systems › distributed system verification
protocol verification		 0.012004
On Causal Broadcasting with Positive Acknowledgments and Bounded-Length Counters · IEEE Trans. Computers 2004

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

formal proof · 0.0
YearPublicationVenuePosition
2004 On Causal Broadcasting with Positive Acknowledgments and Bounded-Length Counters
abstract
A causal broadcast protocol was proposed earlier in [R. Baldoni (1998)]. Two extensions of the protocol were also proposed in order to improve its throughput and bandwidth utilization. We show that both extensions are not live, i.e., there may be execution patterns in which processes stop delivering messages. We also show that the algorithm for the second extension does not satisfy the requirements on which its correctness was established. Finally, we provide fixed versions of both extensions and prove their correctness.
Giuseppe Anastasi, Alberto Bartoli, Giacomo Giannini
 IEEE Trans. Computers3