Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hao Lee

dblp:94/6636 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Theory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › finite fields
finite field arithmetic
0.212015
Common Subexpression Algorithms for Space-Complexity Reduction of Gaussian Normal Basis Multiplication · IEEE Trans. Inf. Theory 2015

Methods — techniques the papers use, named apart from their topics

common subexpression elimination · 0.2
YearPublicationVenuePosition
2025 Design and Development of a Deformable Spherical Robot for Amphibious Applications*
abstract
This paper presents a deformable spherical robot with a six-strut topological structure capable of achieving multimodal locomotion in complex amphibious environments. The robot realizes isotropic rolling and asymmetric jumping through its innovative geometric-based configuration while integrating an airbag-driven module for underwater buoyancy control. Based on collision dynamics analysis, we develop a prototype of the deformable spherical robot. Experiments conducted on land, in transition zones, and underwater validate the robot’s multimodal locomotion feasibility in multi-medium environments.
Ruoyu Ren, Hao Lee, Hank Zhang, Kaicheng Yu, Siyu Gao
IROS4
2015 Common Subexpression Algorithms for Space-Complexity Reduction of Gaussian Normal Basis Multiplication
abstract
The use of normal bases for representing elements in a binary field is attractive in some applications because it is easy to perform squaring operations in hardware. In such cases, the costs of implementing the multiplication operation become a primary concern. We present new algorithms for reducing the space complexity of Gaussian normal basis multipliers over binary fields GF(2m), where m is odd. Compared with previous results, our approach incurs no additional costs in time complexity, and achieves improvements in space complexity over a wide range of finite fields and digit sizes. For the binary fields specified in the NIST FIPS 186-3 elliptic curve digital signature algorithm standards document, our algorithms reduce by 16% (respectively, 27%) the number of XOR gates needed for the implementation of a digit-level parallel-input parallel-output multiplier over a 163-bit (respectively, 409 bit) binary field.
Reza Azarderakhsh, David Jao, Hao Lee
IEEE Trans. Inf. Theory3
2001 Technological Innovation of High-Tech Industry ad Patent Policy: Agent Based simulation with Double Loop Learning
Hao Lee, Hiroshi Deguchi
PRIMA1