default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYahui Zhu
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j9]Can Qiu, Yahui Zhu, Kang Hao Cheong
, Dengxiu Yu, C. L. Philip Chen:
Continuous action iterated dilemma with data-driven compensation network and limited learning ability. Inf. Sci. 632: 516-528 (2023)- [j8]Dianbiao Dong, Yahui Zhu, Zhize Du, Dengxiu Yu:
Multi-target dynamic hunting strategy based on improved K-means and auction algorithm. Inf. Sci. 640: 119072 (2023) - [j7]Yahui Zhu, Jing Cai, Wei Qin, Wenwen Yang, Jianxin Chen:
Compact input-reflectionless balanced bandpass filter with flexible bandwidth using three-line coupled structure. Frontiers Inf. Technol. Electron. Eng. 24(2): 314-326 (2023) - [j6]Yahui Zhu, Jing Cai, Yue Cao, Jian-Xin Chen:
Compact Wideband Absorptive Filtering Power Divider With a Reused Composite T-Shape Network. IEEE Trans. Circuits Syst. II Express Briefs 70(3): 899-903 (2023) - 2022
- [j5]Yahui Zhu, Jing Cai, Jian-Xin Chen:
Quasi-Reflectionless Double-Sided Parallel-Strip Line Bandpass Filter With Enhanced Selectivity. IEEE Trans. Circuits Syst. II Express Briefs 69(2): 339-343 (2022) - 2020
- [c8]Yahui Zhu:
Multiple-attribute Decision-making of Q-Rung Orthopair Fuzzy Sets Based on Hamacher Norm and Improved MULTIMOORA. CSAE 2020: 160:1-160:6
2010 – 2019
- 2019
- [j4]Jiangping Wan, Yahui Zhu, Qiaowen Jiang:
Study on core essential elements for O2O business model with value net theory. Int. J. Netw. Virtual Organisations 20(3): 215-244 (2019) - 2016
- [c7]Jiangping Wan, Qiaowen Jiang, Yahui Zhu:
Research on Core Essential Elements for O2O Business Model with ANP. WHICEB 2016: 55
1990 – 1999
- 1993
- [j3]Yahui Zhu, Mohan Ahuja:
On Job Scheduling on a Hypercube. IEEE Trans. Parallel Distributed Syst. 4(1): 62-69 (1993) - 1992
- [j2]Yahui Zhu:
Efficient Processor Allocation Strategie for Mesh-Connected Parallel Computers. J. Parallel Distributed Comput. 16(4): 328-337 (1992) - [c6]Yahui Zhu, Carolyn McCreary:
Optimal and Near Optimal Tree Scheduling for Parallel Systems. SPDP 1992: 112-119 - 1991
- [c5]Yahui Zhu:
Workload Scheduling: A New Technique for Scheduling Task Graphs with Communication Costs in Parallel Systems. ICPP (2) 1991: 288-289 - 1990
- [j1]Mohan Ahuja, Yahui Zhu:
An O(n log n) Feasibility Algorithm for Preemptive Scheduling of n Independent Jobs on a Hypercube. Inf. Process. Lett. 35(1): 7-11 (1990) - [c4]Yahui Zhu, Mohan Ahuja:
Job Scheduling on a Hypercube. ICDCS 1990: 510-517 - [c3]Yahui Zhu, Mohan Ahuja:
Preemptive Job Scheduling on a Hypercube. ICPP (1) 1990: 301-304
1980 – 1989
- 1989
- [c2]Mohan Ahuja, Yahui Zhu:
An Efficient Distributed Algorithm for Finding Articulation Points, Bridges, and Biconnected Components in Asynchronous Networks. FSTTCS 1989: 99-108 - [c1]Mohan Ahuja, Yahui Zhu:
A Distributed Algorithm for Minimum Weight Spanning Trees Based on Echo Algorithms. ICDCS 1989: 2-8
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-25 05:45 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:
