Guangda Hu

Orcid: 0000-0002-9590-201X

Affiliations:
  • Princeton University, NJ, USA
  • Tsinghua University, China


According to our database1, Guangda Hu authored at least 26 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Multiscale Feature Fusion Convolutional Neural Network for Surface Damage Detection in Retired Steel Shafts.
J. Comput. Inf. Sci. Eng., April, 2024

2023
Sparse feedback stabilisation of linear delay systems by proximal gradient method.
Int. J. Control, October, 2023

2020
Delay-dependent stability of linear multi-step methods for linear neutral systems.
Kybernetika, 2020

Delay-dependent stability of Runge-Kutta methods for linear delay differential-algebraic equations.
J. Comput. Appl. Math., 2020

2019
A numerical method for the approximation of reachable sets of linear control systems.
IMA J. Math. Control. Inf., 2019

Stability criteria of matrix polynomials.
Int. J. Control, 2019

2018
Delay-dependent stability of linear multistep methods for DAEs with multiple delays.
Numer. Algorithms, 2018

Weak delay-dependent stability of Runge-Kutta methods for differential systems with distributed delays.
J. Comput. Appl. Math., 2018

2017
Lower Bounds for Error-Correcting Codes with Local Recovery
PhD thesis, 2017

Erratum to: Exploitation of motion non-stationarity at the encoder and decoder of DVC: a review.
Multim. Tools Appl., 2017

Exploitation of motion non-stationarity at the encoder and decoder of DVC: a review.
Multim. Tools Appl., 2017

Maximally Recoverable Codes for Grid-like Topologies.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

2016
Sylvester-Gallai for Arrangements of Subspaces.
Discret. Comput. Geom., 2016

Maximally Recoverable Codes for Grid-like Topologies.
CoRR, 2016

New constructions of SD and MR codes over small finite fields.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2014
Lower Bounds for Approximate LDCs.
Electron. Colloquium Comput. Complex., 2014

Lower Bounds for Approximate LDC.
CoRR, 2014

2013
On the power of breakable objects.
Theor. Comput. Sci., 2013

On the Hyperbolicity of Small-World and Treelike Random Graphs.
Internet Math., 2013

Matching-Vector Families and LDCs Over Large Modulo.
Electron. Colloquium Comput. Complex., 2013

2012
On the Hyperbolicity of Small-World Networks and Tree-Like Graphs
CoRR, 2012

On the Hyperbolicity of Small-World and Tree-Like Random Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

2011
On the Approximation Ratio of k-Lookahead Auction.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

A Better Upper Bound on Weights of Exact Threshold Functions.
Proceedings of the Theory and Applications of Models of Computation, 2011

2010
The Complexity of Word Circuits.
Discret. Math. Algorithms Appl., 2010

2008
Global exponential periodicity and stability of cellular neural networks with variable and distributed delays.
Appl. Math. Comput., 2008


  Loading...