default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHu Zhang 0004
Person information
- affiliation: RBC Financial Group, Toronto, ON, Canada
- affiliation (former): McMaster University, Hamilton, ON, Canada
- affiliation (PhD 2004): University of Kiel, Institute of Computer Science and Applied Mathematics, Germany
Other persons with the same name
- Hu Zhang — disambiguation page
- Hu Zhang 0001
![[0000-0002-2768-7960]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-2768-7960")
— Tianjin Normal University, College of Urban and Environmental Sciences, China (and 1 more) - Hu Zhang 0002 — Beijing Electro-mechanical Engineering Institute, China (and 1 more)
- Hu Zhang 0003 — Shanxi University, School of Computer and Information Technology, Taiyuan, China
- Hu Zhang 0005 — University of Technology Sydney, Ultimo, NSW, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j6]Klaus Jansen, Hu Zhang:
Scheduling malleable tasks with precedence constraints. J. Comput. Syst. Sci. 78(1): 245-259 (2012)
2000 – 2009
- 2008
- [j5]Tamás Terlaky, Anthony Vannelli, Hu Zhang:
On routing in VLSI design and communication networks. Discret. Appl. Math. 156(11): 2178-2194 (2008) - [j4]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang:
Packing trees in communication networks. J. Comb. Optim. 16(4): 402-423 (2008) - [j3]Klaus Jansen, Hu Zhang:
Approximation algorithms for general packing problems and their application to the multicast congestion problem. Math. Program. 114(1): 183-206 (2008) - 2007
- [r1]Hu Zhang, Klaus Jansen:
Scheduling Malleable Tasks. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j2]Janka Chlebíková, Deshi Ye, Hu Zhang:
Assign ranges in general ad-hoc networks. J. Parallel Distributed Comput. 66(4): 489-498 (2006) - [j1]Klaus Jansen, Hu Zhang:
An approximation algorithm for scheduling malleable tasks under general precedence constraints. ACM Trans. Algorithms 2(3): 416-434 (2006) - 2005
- [c8]Janka Chlebíková, Deshi Ye, Hu Zhang:
Assign Ranges in General Ad-Hoc Networks. AAIM 2005: 411-421 - [c7]Klaus Jansen, Hu Zhang:
An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. ISAAC 2005: 236-245 - [c6]Tamás Terlaky, Anthony Vannelli, Hu Zhang:
On Routing in VLSI Design and Communication Networks. ISAAC 2005: 1051-1060 - [c5]Klaus Jansen, Hu Zhang:
Scheduling malleable tasks with precedence constraints. SPAA 2005: 86-95 - [c4]Qiang Lu, Hu Zhang:
Implementation of Approximation Algorithms for the Multicast Congestion Problem. WEA 2005: 152-164 - [c3]Mohamed Saad, Tamás Terlaky, Anthony Vannelli, Hu Zhang:
Packing Trees in Communication Networks. WINE 2005: 688-697 - 2004
- [b1]Hu Zhang:
Approximation algorithms for min-max resource sharing and malleable tasks scheduling. University of Kiel, Germany, 2004, pp. 1-189 - [c2]Deshi Ye, Hu Zhang:
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. SIROCCO 2004: 291-302 - 2002
- [c1]Klaus Jansen, Hu Zhang:
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function. IFIP TCS 2002: 255-266
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-12-23 20:29 CET 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:
