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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Xianghui Liu

dblp:64/4859 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
0since 2021 · last 2014
—ORCID · none

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

Computer networks · 3 · 1 first-authorSystems, architecture and hardware · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorTheory 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.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › post-quantum cryptography
lattice-based cryptography		 0.212014
A new parallel lattice reduction algorithm for BKZ reduced bases · Sci. China Inf. Sci. 2014
Cryptographic primitives and cryptanalysis › post-quantum cryptography › lattice-based cryptography
lattice reduction		 0.212014
A new parallel lattice reduction algorithm for BKZ reduced bases · Sci. China Inf. Sci. 2014
Cryptographic primitives and cryptanalysis
stream cipher cryptanalysis		 0.212013
An improved attack on clock-controlled shift registers based on hardware implementation · Sci. China Inf. Sci. 2013
Parallel and multicore computing
parallel algorithms		 0.112014
A new parallel lattice reduction algorithm for BKZ reduced bases · Sci. China Inf. Sci. 2014
Cryptographic primitives and cryptanalysis › cryptographic implementation
hardware implementation		 0.012013
An improved attack on clock-controlled shift registers based on hardware implementation · Sci. China Inf. Sci. 2013

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

parallel lattice reduction · 0.4BKZ algorithm · 0.4hardware implementation · 0.2
YearPublicationVenuePosition
2014 A new parallel lattice reduction algorithm for BKZ reduced bases
Xianghui Liu, Xianghui Xie 0001
 Sci. China Inf. Sci.1
2013 An improved attack on clock-controlled shift registers based on hardware implementation
Xianghui Liu, Fenghua Li 0001
 Sci. China Inf. Sci.2
2007 Model for Survivability of Wireless Sensor Network
Xianghui Liu, Jianping Yin
 MSN1
2006 Algorithms for Delay Constrained and Energy Efficiently Routing in Wireless Sensor Network
Yuanli Wang, Xianghui Liu, Jianping Yin, Yongan Wu
 WASA2
2005 An Approximation Algorithm for Weak Vertex Cover Problem in Network Management
Zhiping Cai, Jianping Yin, Xianghui Liu, Shaohe Lv
 AAIM3
2005 Efficiently monitoring link bandwidth in IP networks
abstract
Link bandwidth utilization is obviously critical for numerous network management tasks. Using the flow-conservation law, we could reduce the number of activated monitor agents. The problem of efficiently monitoring link-bandwidth based on flow-conservation law could be reduced to weak vertex cover problem, which is NP-hard. In this paper, we demonstrate an approximation preserving reduction from the vertex cover problem to weak vertex cover problem. Due to this reduction, it follows that it is very difficult to get an approximation algorithm with approximation ratio lower than 2 for weak vertex cover problem. Using the primal-dual method, we give an approximation algorithm with approximation ratio 2 to solve the problem. The effectiveness of our monitoring algorithm is validated by simulations evaluation over a wide range of network topologies. We also demonstrate the problem of weak vertex cover with blackout vertices could be reduce to weak vertex cover problem. Hence we could use the approximation algorithms for weak vertex cover problem to solve the problem of weak vertex cover with blackout vertices.
Zhiping Cai, Jianping Yin, Fang Liu 0002, Xianghui Liu, Shaohe Lv
 GLOBECOM4
2005 Optimizing the Distributed Network Monitoring Model with Bounded Bandwidth and Delay Constraints by Neural Networks
Xianghui Liu, Jianping Yin, Zhiping Cai, Xicheng Lu
 ISNN (1)1
2005 Efficiently Passive Monitoring Flow Bandwidth
Zhiping Cai, Jianping Yin, Fang Liu 0002, Xianghui Liu, Shaohe Lv
 NPC4
2005 Distributed Active Measuring Link Bandwidth in IP Networks
Zhiping Cai, Jianping Yin, Fang Liu 0002, Xianghui Liu, Shaohe Lv
 NPC4