default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhaled M. Alzoubi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c10]Atif Tirmizi, Osama Abuomar, Khaled M. Alzoubi:
Developing an API for Block-Cipher Encryption powered by Supervised Learning. CSCI 2021: 830-835
2010 – 2019
- 2010
- [j6]Moussa Ayyash, Donald R. Ucci, Khaled M. Alzoubi:
A Proactively Maintained Quality of Service Infrastructure for Wireless Mobile Ad Hoc Networks. Int. J. Commun. Networks Inf. Secur. 2(2) (2010)
2000 – 2009
- 2006
- [c9]Khaled M. Alzoubi, Moussa Ayyash:
Quality of Service Routing Tree for Wireless Ad Hoc Networks. ICWN 2006: 193-198 - [c8]Khaled M. Alzoubi, Moussa Ayyash
:
Maintaining a quality of service routing tree for mobile ad hoc networks. IWCMC 2006: 127-134 - [c7]Moussa Ayyash, Khaled M. Alzoubi, Yazeed Alsbou:
Preemptive quality of service infrastructure for wireless mobile ad hoc networks. IWCMC 2006: 707-712 - 2004
- [j5]Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder:
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. Mob. Networks Appl. 9(2): 141-149 (2004) - [c6]Khaled M. Alzoubi, Mousa S. Ayyash:
Multispanners for robust routing in mobile ad hoc networks. Parallel and Distributed Computing and Networks 2004: 264-269 - 2003
- [j4]Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder:
Maximal Independent Set, Weakly-Connected Dominating Set, and Induced Spanners in Wireless Ad Hoc Networks. Int. J. Found. Comput. Sci. 14(2): 287-303 (2003) - [j3]Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder:
A Simple Heuristic for Minimum Connected Dominating Set in Graphs. Int. J. Found. Comput. Sci. 14(2): 323-333 (2003) - [j2]Khaled M. Alzoubi, Xiang-Yang Li, Yu Wang, Peng-Jun Wan, Ophir Frieder:
Geometric Spanners for Wireless Ad Hoc Networks. IEEE Trans. Parallel Distributed Syst. 14(4): 408-421 (2003) - [c5]Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder:
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad Hoc Networks. ICDCS 2003: 96-104 - [c4]Khaled M. Alzoubi:
Connected Dominating Set and its Induced Position-less Sparse Spanner For Mobile Ad Hoc Networks. ISCC 2003: 209-216 - 2002
- [j1]Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder:
Distributed heuristics for connected dominating sets in wireless ad hoc networks. J. Commun. Networks 4(1): 22-29 (2002) - [c3]Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder:
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks. HICSS 2002: 297 - [c2]Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder:
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks. INFOCOM 2002: 1597-1604 - [c1]Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder:
Message-optimal connected dominating sets in mobile ad hoc networks. MobiHoc 2002: 157-164
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
