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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Mohamed Aboutabl

dblp:07/1606 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1

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
1 paper
Storage systems · 77% Performance modeling and evaluation · 23%

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

TopicWeightPapersLastEvidence papers
Storage systems › i/o architecture › i/o subsystem
disk access		 0.011998
Temporally Determinate Disk Access: An Experimental Approach (Extended Abstract) · SIGMETRICS 1998
Performance modeling and evaluation
benchmarking		 0.011998
Temporally Determinate Disk Access: An Experimental Approach (Extended Abstract) · SIGMETRICS 1998

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

experimental measurement · 0.0
YearPublicationVenuePosition
2004 Software environment for integrating critical real-time control systems
Mohamed F. Younis, Mohamed Aboutabl, Daeyoung Kim 0001
 J. Syst. Archit.2
1998 Temporally Determinate Disk Access: An Experimental Approach (Extended Abstract)
abstract
No abstract available.
Mohamed Aboutabl, Ashok K. Agrawala, Jean-Dominique Decotignie
 SIGMETRICS1
1996 Neural network approach for solving the maximal common subgraph problem
abstract
A new formulation of the maximal common subgraph problem (MCSP), that is implemented using a two-stage Hopfield neural network, is given. Relative merits of this proposed formulation, with respect to current neural network-based solutions as well as classical sequential-search-based solutions, are discussed.
Amin A. Shoukry, Mohamed Aboutabl
 IEEE Trans. Syst. Man Cybern. Part B2