Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A hybrid model for task completion effort estimation., , and . SWAN@SIGSOFT FSE, page 22-28. ACM, (2016)Computing the Asymptotic Expected Multiplicity of Leafless Elementary Trapping Sets (LETSs) in Random Irregular LDPC Code Ensembles., and . ISTC, page 1-5. IEEE, (2018)Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles., and . ISIT, page 1650-1654. IEEE, (2018)Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes., and . IEEE Trans. Inf. Theory, 65 (7): 4307-4315 (2019)Not-All-Equal and 1-in-Degree Decompositions: Algorithmic Complexity and Applications., , and . Algorithmica, 80 (12): 3704-3727 (2018)On the semi-proper orientations of graphs., and . Discret. Appl. Math., (2021)On the semi-proper orientations of graphs.. CoRR, (2019)On the Computational Complexity of Finding Bipartite Graphs with a Small Number of Short Cycles and Large Girth., and . ITW, page 1-5. IEEE, (2019)On the Maximum Number of Non-attacking Rooks on a High-Dimensional Simplicial Chessboard., , and . Graphs Comb., 38 (3): 52 (2022)On the Tanner Graph Cycle Distribution of Random LDPC, Random Protograph-Based LDPC, and Random Quasi-Cyclic LDPC Code Ensembles., and . IEEE Trans. Inf. Theory, 64 (6): 4438-4451 (2018)