default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuangda Hu
Person information
- affiliation: Princeton University, NJ, USA
- affiliation: Tsinghua University, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Weiwei Liu, Jiahe Qiu, Yujiang Wang, Tao Li, Shujie Liu, Guangda Hu, Lin Xue:
Multiscale Feature Fusion Convolutional Neural Network for Surface Damage Detection in Retired Steel Shafts. J. Comput. Inf. Sci. Eng. 24(4) (2024)- 2023
- [j14]Anping Tang
, Guangda Hu, Yuhao Cong:
Sparse feedback stabilisation of linear delay systems by proximal gradient method. Int. J. Control 96(10): 2576-2586 (2023) - 2020
- [j13]Xiulin Hu, Yuhao Cong, Guangda Hu:
Delay-dependent stability of Runge-Kutta methods for linear delay differential-algebraic equations. J. Comput. Appl. Math. 363: 300-311 (2020) - [j12]Guangda Hu, Lizhen Shao:
Delay-dependent stability of linear multi-step methods for linear neutral systems. Kybernetika 56(3): 543-558 (2020)
2010 – 2019
- 2019
- [j11]Guangda Hu, Xiulin Hu:
Stability criteria of matrix polynomials. Int. J. Control 92(12): 2973-2978 (2019) - [j10]Lizhen Shao, Fangyuan Zhao, Guangda Hu:
A numerical method for the approximation of reachable sets of linear control systems. IMA J. Math. Control. Inf. 36(02): 423-441 (2019) - 2018
- [j9]Yuhao Cong, Yanpei Wang, Guangda Hu:
Weak delay-dependent stability of Runge-Kutta methods for differential systems with distributed delays. J. Comput. Appl. Math. 342: 70-82 (2018) - [j8]Xiulin Hu, Yuhao Cong, Guangda Hu:
Delay-dependent stability of linear multistep methods for DAEs with multiple delays. Numer. Algorithms 79(3): 719-739 (2018) - 2017
- [b1]Guangda Hu:
Lower Bounds for Error-Correcting Codes with Local Recovery. Princeton University, USA, 2017 - [j7]Xin Zhao, Jiwei Liu, Guangda Hu:
Exploitation of motion non-stationarity at the encoder and decoder of DVC: a review. Multim. Tools Appl. 76(12): 13703-13738 (2017) - [j6]Xin Zhao, Jiwei Liu, Guangda Hu:
Erratum to: Exploitation of motion non-stationarity at the encoder and decoder of DVC: a review. Multim. Tools Appl. 76(12): 13739 (2017) - [c9]Parikshit Gopalan, Guangda Hu, Swastik Kopparty, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. SODA 2017: 2092-2108 - 2016
- [j5]Zeev Dvir, Guangda Hu:
Sylvester-Gallai for Arrangements of Subspaces. Discret. Comput. Geom. 56(4): 940-965 (2016) - [c8]Guangda Hu, Sergey Yekhanin:
New constructions of SD and MR codes over small finite fields. ISIT 2016: 1591-1595 - [i8]Guangda Hu, Sergey Yekhanin:
New Constructions of SD and MR Codes over Small Finite Fields. CoRR abs/1605.02290 (2016) - [i7]Parikshit Gopalan, Guangda Hu, Shubhangi Saraf, Carol Wang, Sergey Yekhanin:
Maximally Recoverable Codes for Grid-like Topologies. CoRR abs/1605.05412 (2016) - 2015
- [c7]Zeev Dvir, Guangda Hu:
Sylvester-Gallai for Arrangements of Subspaces. SoCG 2015: 29-43 - 2014
- [c6]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. ICALP (1) 2014: 259-270 - [i6]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDC. CoRR abs/1402.6952 (2014) - [i5]Zeev Dvir, Guangda Hu:
Sylvester-Gallai for Arrangements of Subspaces. CoRR abs/1412.0795 (2014) - [i4]Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf:
Lower Bounds for Approximate LDCs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j4]Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney:
On the Hyperbolicity of Small-World and Treelike Random Graphs. Internet Math. 9(4): 434-491 (2013) - [j3]Wei Chen, Guangda Hu, Jialin Zhang:
On the power of breakable objects. Theor. Comput. Sci. 503: 89-108 (2013) - [c5]Zeev Dvir, Guangda Hu:
Matching-Vector Families and LDCs over Large Modulo. APPROX-RANDOM 2013: 513-526 - [i3]Zeev Dvir, Guangda Hu:
Matching-Vector Families and LDCs Over Large Modulo. CoRR abs/1304.4819 (2013) - [i2]Zeev Dvir, Guangda Hu:
Matching-Vector Families and LDCs Over Large Modulo. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [c4]Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney:
On the Hyperbolicity of Small-World and Tree-Like Random Graphs. ISAAC 2012: 278-288 - [i1]Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney:
On the Hyperbolicity of Small-World Networks and Tree-Like Graphs. CoRR abs/1201.1717 (2012) - 2011
- [c3]Xue Chen, Guangda Hu, Xiaoming Sun:
A Better Upper Bound on Weights of Exact Threshold Functions. TAMC 2011: 124-132 - [c2]Xue Chen, Guangda Hu, Pinyan Lu, Lei Wang:
On the Approximation Ratio of k-Lookahead Auction. WINE 2011: 61-71 - 2010
- [j2]Xue Chen, Guangda Hu, Xiaoming Sun:
The Complexity of Word Circuits. Discret. Math. Algorithms Appl. 2(4): 483-492 (2010) - [c1]Xue Chen, Guangda Hu, Xiaoming Sun:
The Complexity of Word Circuits. COCOON 2010: 308-317
2000 – 2009
- 2008
- [j1]Liqun Zhou, Guangda Hu:
Global exponential periodicity and stability of cellular neural networks with variable and distributed delays. Appl. Math. Comput. 195(2): 402-411 (2008)
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-08-20 20:31 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:
