Amjad M. Daoud

13 papers A* 3C 2Journal 2Unranked 5
YearRankTypeTitle / Venue / Authors
2011 — conf
Efficient Non-Quadratic Quick Sort (NQQuickSort).
DEIS
Amjad M. Daoud, Hussein Abdel-jaber, Jafar Ababneh
2011 — conf
Performance Analysis of the Proposed Adaptive Gentle Random Early Detection Method under NonCongestion and Congestion Situations.
DEIS
Hussein Abdel-jaber, Jafar Ababneh, Fadi A. Thabtah, Amjad M. Daoud, Mahmoud Baklizi
2010 — conf
Effective Web and Desktop Retrieval with Enhanced Semantic Spaces.
FGIT-ASEA
Amjad M. Daoud
2007 — conf
Effective ranked conceptual retrieval.
CIMS
Amjad M. Daoud
2007 — conf
Perfect hash functions for large dictionaries.
CIMS
Amjad M. Daoud
2005 C conf
Dynamic Inverted Lists for Searching the WWW.
iiWAS
Amjad M. Daoud
2005 C conf
Perfect Hash Functions for Large Web Repositories.
iiWAS
Amjad M. Daoud
1995 A* conf
Integrating IR and RDBMS Using Cooperative Indexing.
SIGIR
Samuel DeFazio, Amjad M. Daoud, Lisa Ann Smith, Jagannathan Srinivasan, W. Bruce Croft, James P. Callan
1993 A* conf
Development of a Modern OPAC: From REVTOLC to MARIAN.
SIGIR
Edward A. Fox, Robert K. France, Eskinder Sahle, Amjad M. Daoud, Ben E. Cline
1993 — —
Efficient data structures for information retrieval.
Amjad M. Daoud
1992 J jnl
Practical Minimal Perfect Hash Functions for Large Databases.
Commun. ACM
Edward A. Fox, Lenwood S. Heath, Qi Fan Chen, Amjad M. Daoud
1991 J jnl
Order-Preserving Minimal Perfect Hash Functions and Information Retrieval.
ACM Trans. Inf. Syst.
Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath
1990 A* conf
Order Preserving Minimal Perfect Hash Functions and Information Retrieval.
SIGIR
Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath