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

Hasan Md. Sayeed

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

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

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

Network and information security
1 paper
Cryptographic protocols and secure computation · 100%
Theoretical computer science
1 paper
Distributed computing theory · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › secure message transmission
perfectly secure message transmission
0.011996
Efficient Perfectly Secure Message Transmission in Synchronous Networks · Inf. Comput. 1996
Cryptographic protocols and secure computation
secure message transmission
0.011996
Efficient Perfectly Secure Message Transmission in Synchronous Networks · Inf. Comput. 1996
Distributed computing theory › timing models
synchronous network
0.011996
Efficient Perfectly Secure Message Transmission in Synchronous Networks · Inf. Comput. 1996
YearPublicationVenuePosition
1996 Efficient Perfectly Secure Message Transmission in Synchronous Networks
Hasan Md. Sayeed, Hosame Abu-Amara
Inf. Comput.1
1995 Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links
Hasan Md. Sayeed, Marwan H. Abu-Amara, Hosame Abu-Amara
Distributed Comput.1