default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFengxia Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j21]Yi Zhang, Yunfan Lu, Fengxia Liu, Cheng Li, Zixian Gong, Zhe Hu, Qun Xu:
Privacy-preserving and communication-efficient stochastic alternating direction method of multipliers for federated learning. Inf. Sci. 691: 121641 (2025)- 2024
- [j20]Yaxin Shi, Fengxia Liu
, Hong-Jian Lai:
On r-hued coloring of connected P5-free tripartite graphs. Appl. Math. Comput. 479: 128861 (2024) - [j19]Fengxia Liu, Zhiyong Zheng, Zixian Gong, Kun Tian, Yi Zhang, Zhe Hu, Jia Li, Qun Xu:
A survey on lattice-based digital signature. Cybersecur. 7(1): 7 (2024) - [j18]Meng Tang, Fengxia Liu, Hong-Jian Lai:
The list r-hued coloring of Km,n. Discret. Appl. Math. 348: 159-164 (2024) - [j17]Fengxia Liu, Zhiming Zheng, Yexuan Shi, Yongxin Tong, Yi Zhang:
A survey on federated learning: a perspective from multi-party computation. Frontiers Comput. Sci. 18(3): 181336 (2024) - 2023
- [j16]Lingmei Liang, Fengxia Liu, Hong-Jian Lai:
On list r-hued coloring of outer-1-planar graphs. Appl. Math. Comput. 440: 127658 (2023) - [j15]Fengxia Liu, Xifeng Zheng, Yu Chen, JunChang Chen, DeJu Huang, Yang Wang, Hui Cao, Xinyue Mao:
Effect of the spatial location of boundary on colour overflow in Gamut conversion. Displays 80: 102556 (2023) - [j14]Wei Xiong, Fengxia Liu, Yang Wu, Mingquan Zhan, Hong-Jian Lai:
Complete family reduction and spanning connectivity in line graphs. Discret. Math. 346(1): 113210 (2023) - 2022
- [j13]Wenjuan Wei, Fengxia Liu, Wei Xiong, Hong-Jian Lai:
On r-hued list coloring of K4(7)-minor free graphs. Discret. Appl. Math. 309: 301-309 (2022) - [j12]Fengxia Liu, Baoyindureng Wu, Jixiang Meng:
Arbitrarily partitionable 2K2, C4-free graphs. Discuss. Math. Graph Theory 42(2): 485-500 (2022) - [j11]Lingmei Liang, Fengxia Liu, Baoyindureng Wu:
On r-hued coloring of product graphs. RAIRO Oper. Res. 56(6): 3845-3852 (2022) - 2021
- [j10]Fengxia Liu, Xirinay Nurmamat, Panpan Zhang:
Arbitrary partitionability of product graphs. Appl. Math. Comput. 408: 126219 (2021) - 2019
- [j9]Bin Zhao, Wengu Chen, Jixiang Meng, Fengxia Liu:
Book embedding of complex network with community structure. Appl. Math. Comput. 361: 747-751 (2019) - 2018
- [j8]Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu:
Connectivity of half vertex transitive digraphs. Appl. Math. Comput. 316: 25-29 (2018) - [j7]Fengxia Liu, Baoyindureng Wu, Jixiang Meng:
Partitioning the Cartesian product of a tree and a cycle. Appl. Math. Comput. 332: 90-95 (2018) - 2015
- [j6]Fengxia Liu, Zhao Zhang, Hong-Jian Lai, Meng Zhang:
Degree sequence realizations with given packing and covering of spanning trees. Discret. Appl. Math. 185: 113-118 (2015) - 2014
- [j5]Fengxia Liu, Zhao Zhang, Jixiang Meng:
The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs. Graphs Comb. 30(3): 699-705 (2014) - 2011
- [j4]Zhao Zhang, Fengxia Liu:
Isoperimetric Edge Connectivity of Line Graphs and Path Graphs. Ars Comb. 98: 483-491 (2011) - 2010
- [j3]Zhenhai Zhang, Jingyin Yu, Daofeng Li, Zuyong Zhang, Fengxia Liu, Xin Zhou, Tao Wang, Yi Ling, Zhen Su:
PMRD: plant microRNA database. Nucleic Acids Res. 38(Database-Issue): 806-813 (2010) - 2008
- [j2]Xueliang Li, Fengxia Liu:
Partitioning 3-Edge-Colored Complete Equi-Bipartite Graphs by Monochromatic Trees under a Color Degree Condition. Electron. J. Comb. 15(1) (2008) - [j1]Fengxia Liu, Jixiang Meng:
Edge-connectivity of regular graphs with two orbits. Discret. Math. 308(16): 3711-3716 (2008)
Conference and Workshop Papers
- 2020
- [c2]Fengxia Liu, Zhanbo Xu, Kun Liu, Jiang Wu, Xiaohong Guan:
Coordinated Optimization of EVs and Multiple Buildings with Renewable Energy. CASE 2020: 1491-1496 - 2018
- [c1]Peiqi Liu, Kehan Wu, Siyuan Xu, Jintao Wu, Fengxia Liu, Dapeng Hu:
Influence of Non-equilibrium Condensation on key Parameter of Gas Wave Refrigerator. IEEA 2018: 82-87
Informal and Other Publications
- 2024
- [i6]Zhiyong Zheng, Fengxia Liu, Kun Tian:
On the MacWilliams Theorem over Codes and Lattices. CoRR abs/2407.20874 (2024) - 2023
- [i5]Zhiyong Zheng, Fengxia Liu, Kun Tian:
An Unbounded Fully Homomorphic Encryption Scheme Based on Ideal Lattices and Chinese Remainder Theorem. CoRR abs/2301.12060 (2023) - [i4]Jacques Peyriére, Fengxia Liu, Zhiyong Zheng, Zixian Gong:
Public key cryptosystems based on Iterated Functions Systems. CoRR abs/2309.05917 (2023) - [i3]Junlong Mao, Huiyi Tang, Yi Zhang, Fengxia Liu, Zhiyong Zheng, Shanxiang Lyu:
FedReverse: Multiparty Reversible Deep Neural Network Watermarking. CoRR abs/2312.05738 (2023) - 2022
- [i2]Zhiyong Zheng, Fengxia Liu:
On the High Dimensional RSA Algorithm - A Public Key Cryptosystem Based on Lattice and Algebraic Number Theory. CoRR abs/2202.02675 (2022) - 2021
- [i1]Zhiyong Zheng, Fengxia Liu, Yunfan Lu, Kun Tian:
Cyclic Lattices, Ideal Lattices and Bounds for the Smoothing Parameter. CoRR abs/2112.13185 (2021)
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-09 23:06 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:
