default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhaohui Fu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Zhaohui Fu, Jie Shen, Jiang Yang:
Higher-Order Energy-Decreasing Exponential Time Differencing Runge-Kutta methods for Gradient Flows. CoRR abs/2402.15142 (2024)- 2023
- [j7]Xinyu Cheng
, Zhaohui Fu, Brian Wetton:
Equivalent Formulations of the Oxygen Depletion Problem, Other Implicit Moving Boundary Value Problems, and Implications for Numerical Approximation. SIAM J. Appl. Math. 83(1): 52-78 (2023) - 2022
- [j6]Zhaohui Fu, Jiang Yang:
Energy-decreasing exponential time differencing Runge-Kutta methods for phase-field models. J. Comput. Phys. 454: 110943 (2022) - [j5]Zhaohui Fu, Tao Tang, Jiang Yang:
Energy Plus Maximum Bound Preserving Runge-Kutta Methods for the Allen-Cahn Equation. J. Sci. Comput. 92(3): 97 (2022) - [i3]Zhaohui Fu, Tao Tang, Jiang Yang:
Energy plus maximum bound preserving Runge-Kutta methods for the Allen-Cahn equation. CoRR abs/2203.04784 (2022) - [i2]Zhaohui Fu, Tao Tang, Jiang Yang:
Unconditionally energy decreasing high-order Implicit-Explicit Runge-Kutta methods for phase-field models with the Lipschitz nonlinearity. CoRR abs/2203.06034 (2022) - 2021
- [i1]Xinyu Cheng, Zhaohui Fu, Brian Wetton:
Equivalent formulations of the oxygen depletion problem, other implicit free boundary value problems, and implications for numerical approximation. CoRR abs/2105.03538 (2021)
2010 – 2019
- 2019
- [c13]Boyuan Guan, Liting Hu, Pinchao Liu, Hailu Xu, Zhaohui Fu, Qingyang Wang:
dpSmart: A Flexible Group Based Recommendation Framework for Digital Repository Systems. BigData Congress 2019: 111-120
2000 – 2009
- 2008
- [j4]Anubhav Gupta, Kenneth L. McMillan, Zhaohui Fu:
Automated assumption generation for compositional verification. Formal Methods Syst. Des. 32(3): 285-301 (2008) - 2007
- [j3]Zhaohui Fu, Yanzhi Li, Andrew Lim, Brian Rodrigues:
Port space allocation with a time dimension. J. Oper. Res. Soc. 58(6): 797-807 (2007) - [c12]Anubhav Gupta, Kenneth L. McMillan, Zhaohui Fu:
Automated Assumption Generation for Compositional Verification. CAV 2007: 420-432 - [c11]Zhaohui Fu, Sharad Malik:
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions. VLSI Design 2007: 37-42 - 2006
- [c10]Zhaohui Fu, Sharad Malik:
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search. ICCAD 2006: 852-859 - [c9]Zhaohui Fu, Sharad Malik:
On Solving the Partial MAX-SAT Problem. SAT 2006: 252-265 - 2005
- [c8]Zhaohui Fu, Yinlei Yu, Sharad Malik:
Considering Circuit Observability Don't Cares in CNF Satisfiability. DATE 2005: 1108-1113 - 2004
- [j2]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
The Two-Dimensional Packing Problem for Irregular Objects. Int. J. Artif. Intell. Tools 13(3): 429-448 (2004) - [j1]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
Port yard storage optimization. IEEE Trans Autom. Sci. Eng. 1(1): 26-37 (2004) - [c7]Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik:
Zchaff2004: An Efficient SAT Solver. SAT (Selected Papers 2004: 360-375 - 2003
- [c6]Zhaohui Fu, Andy Kurnia, Andrew Lim, Brian Rodrigues:
Shortest path problem with cache dependent path lengths. IEEE Congress on Evolutionary Computation 2003: 2756-2761 - [c5]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
The General Yard Allocation Problem. GECCO 2003: 1986-1997 - [c4]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
Two-Dimensional acking For Irregular Shaped Objects. HICSS 2003: 86 - 2002
- [c3]Ping Chen, Zhaohui Fu, Andrew Lim:
The Yard Allocation Problem. AAAI/IAAI 2002: 3-8 - [c2]Ping Chen, Zhaohui Fu, Andrew Lim:
Using Genetic Algorithms To Solve The Yard Allocation Problem. GECCO 2002: 1049-1056 - 2000
- [c1]Zhaohui Fu, Andrew Lim:
Heuristics for the exam scheduling problem. ICTAI 2000: 172-175
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-10-07 21:23 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:
