Demo Data from EDBT 2026 / reviewers in the wild / expert
Hany L. Abdel-Malek
dblp:81/3110
· DBLP profile ↗
5ranked-venue papers
2as first author
1since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 3 · 2 first-authorArtificial intelligence and machine learning · 2 · 1 since 2021
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
2 papers |
Electronic design automation · 100% | |
| Theoretical computer science
2 papers |
Mathematical optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › design for manufacturability › statistical design
design centering |
0.0 | 2 | 1999 | A boundary gradient search technique and its applications in design centering · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999 The ellipsoidal technique for design centering and region approximation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 |
Mathematical optimization › continuous optimization › convex optimization › first-order methods
gradient-based optimization |
0.0 | 1 | 1999 | A boundary gradient search technique and its applications in design centering · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999 |
Mathematical optimization › continuous optimization
convex optimization |
0.0 | 1 | 1991 | The ellipsoidal technique for design centering and region approximation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 |
Electronic design automation
yield analysis |
0.0 | 1 | 1991 | The ellipsoidal technique for design centering and region approximation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991 |
Methods — techniques the papers use, named apart from their topics
gradient search · 0.0ellipsoidal section · 0.0monte carlo method · 0.0ellipsoid method · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Correlation-based pruning algorithm with weight compensation for feedforward neural networksabstractAbstract Optimizing neural network architectures through effective pruning techniques has become essential to balancing model complexity and accuracy. This study introduces a novel correlation-based approach to systematically reduce network size by identifying and removing redundant neurons based on their activation correlations. By selectively pruning neurons while compensating for their contributions, the method maintains model fidelity across diverse datasets. Results demonstrate substantial architecture reductions with minimal performance impact: For the MNIST dataset, the number of neurons in hidden layers was reduced from 128-128 to 118-93, while maintaining a high accuracy of 97.59%. Comparative analysis indicates that this pruning approach achieves competitive or superior results compared to state-of-the-art methods while reducing computational complexity and memory requirements by up to 25%. The findings highlight the potential of correlation-driven pruning strategies to optimize neural networks, making them more efficient and adaptable to resource-constrained environments. Shaimaa E. K. Ebid, Samah El-Tantawy, Doaa M. Shawky, Hany L. Abdel-Malek |
Neural Comput. Appl. | 4 |
| 2005 | A neural-network-based approach for post-fabrication circuit tuning
Mohamed A. El-Gamal, Hany L. Abdel-Malek, M. A. Sorour |
Neural Comput. Appl. | 2 |
| 1999 | A boundary gradient search technique and its applications in design centeringabstractA boundary gradient search technique is introduced. The technique generates a sequence of points on the boundary of the feasible region converging to a fixed point. The gradient of the boundary at this fixed point has a prespecified directional ratio. The boundary search technique is exploited in a modification of the ellipsoidal technique for design centering. This modification allows the use of double-sided ellipsoidal sections instead of single-sided ellipsoidal sections. It improves the speed of convergence of the ellipsoidal technique. Also, a computationally inexpensive technique of determining the gradient of the gain constraints is introduced. Practical examples are given to demonstrate the new technique. Hany L. Abdel-Malek, Abdel-Karim S. O. Hassan, Mohamed H. Heaba |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 1995 | A New Approach for the Selection of Test Points for Fault Diagnosis
Mohamed A. El-Gamal, Abdel-Karim S. O. Hassan, Hany L. Abdel-Malek |
ISCAS | 3 |
| 1991 | The ellipsoidal technique for design centering and region approximationabstractA technique for design centering and feasible region approximation that is based on generating a sequence of ellipsoids of decreasing volume and preserves the property of containing a bounded convex feasible region is introduced. The technique converges to an ellipsoid the center of which is the proposed design center. The ellipsoid matrix can be used to give what is called a preferable covariance matrix, assuming a multinormal distribution of parameters. This covariance matrix is preferred since it significantly increases the production yield for the feasible region under consideration. In addition, an ellipsoidal region approximation can be obtained by scaling the final ellipsoid, which allows an inexpensive yield estimate using the Monte Carlo method. Numerical and practical examples are considered.> Hany L. Abdel-Malek, Abdel-Karim S. O. Hassan |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |