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

Nabil Shalaby

dblp:26/6389 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2014
0000-0002-7967-5937ORCID · corroborated

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

Security and privacy · 6 · 3 first-authorTheory of computation · 2 · 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › sequences › sequence design
difference triangle sets
0.112005
Using directed hill-climbing for the construction of difference triangle sets · IEEE Trans. Inf. Theory 2005
Coding theory
upper bounds
0.112005
Using directed hill-climbing for the construction of difference triangle sets · IEEE Trans. Inf. Theory 2005

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

directed hill-climbing · 0.1
YearPublicationVenuePosition
2014 The intersection spectrum of hooked Skolem sequences and applications
Nabil Shalaby, Daniela Silvesan
Discret. Appl. Math.1
2012 Cyclic block designs with block size 3 from Skolem-type sequences
Daniela Silvesan, Nabil Shalaby
Des. Codes Cryptogr.2
2011 Hamilton cycles in restricted block-intersection graphs
Andrew T. Jesso, David A. Pike, Nabil Shalaby
Des. Codes Cryptogr.3
2007 Kirkman frames having hole type hu m1 for small h
Gennian Ge, Rolf S. Rees, Nabil Shalaby
Des. Codes Cryptogr.3
2005 Using directed hill-climbing for the construction of difference triangle sets
abstract
This correspondence describes the use of the directed hill-climbing algorithm for finding improved upper bounds of difference triangle sets.
Sharon Koubi, Manrique Mata-Montero, Nabil Shalaby
IEEE Trans. Inf. Theory3
2002 Existence of Perfect 4-Deletion-Correcting Codes with Length Six
Nabil Shalaby, Jianmin Wang 0003, Jianxing Yin
Des. Codes Cryptogr.1
1998 Nested Optimal -Packings and -Coverings of Pairs with Triples
Nabil Shalaby, Jianxing Yin
Des. Codes Cryptogr.1
1995 Directed Packings with Block Size 5 and Even v
Nabil Shalaby, Jianxing Yin
Des. Codes Cryptogr.1