We stand with Ukraine  

Ahmed A. Belal

Orcid: 0000-0002-3854-6039

According to our database1, Ahmed A. Belal authored at least 7 papers between 1997 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Optimal prefix codes with fewer distinct codeword lengths are faster to construct.
[BibTeX]
[DOI]
Ahmed A. Belal
,
Amr Elmasry
Inf. Comput., 2019

2006
Verification of minimum-redundancy prefix codes.
[BibTeX]
[DOI]
Ahmed A. Belal
,
Amr Elmasry
IEEE Trans. Inf. Theory, 2006

Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes.
[BibTeX]
[DOI]
Ahmed A. Belal
,
Amr Elmasry
Proceedings of the STACS 2006, 2006

2005
Finding maximum-cost minimum spanning trees.
[BibTeX]
[DOI]
Ahmed A. Belal
,
Amr Elmasry
Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), 2005

Secure transmission of sensitive data using multiple channels.
[BibTeX]
[DOI]
Abdelhamid S. Abdelhamid
,
Ahmed A. Belal
Proceedings of the 2005 ACS / IEEE International Conference on Computer Systems and Applications (AICCSA 2005), 2005

1998
Reaching the Bound in the (2, n) merging Problem.
[BibTeX]
[DOI]
Ahmed A. Belal
,
Amr Elmasry
Inf. Sci., 1998

1997
Optimal Insertion in Two-Dimensional Arrays.
[BibTeX]
[DOI]
Magdy A. Ahmed
,
Ahmed A. Belal
,
Khalil M. Ahmed
Inf. Sci., 1997


  Loading...