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

Liantao Lan

dblp:188/0262 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0003-2633-7798ORCID · corroborated

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

Security and privacy · 2 · 2 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 since 2021

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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
constant-weight codes		 0.212016
Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions · IEEE Trans. Inf. Theory 2016
Coding theory
upper bounds		 0.112016
Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions · IEEE Trans. Inf. Theory 2016

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

skolem-type sequences · 0.2difference method · 0.2
YearPublicationVenuePosition
2025 Shuffle-Diversity Collaborative Federated Learning for Imbalanced Medical Image Analysis
Wenpeng Gao, Liantao Lan, Ruxin Wang 0001, Xiaomao Fan
 MICCAI (14)2
2025 Enhancing weakly supervised semantic segmentation for fruit defects detection via feature cross-attention fusion and multi-scale similarity quantification
Qiong Huang 0001, Xiaomao Fan, Liantao Lan
 Pattern Anal. Appl.4
2023 An identity-based traceable ring signatures based on lattice
Junbin Liang, Qiong Huang 0001, Jianye Huang 0001, Liantao Lan, Man Ho Au
 Peer Peer Netw. Appl.4
2022 The completion of optimal cyclic quaternary codes of weight 3 and distance 3
Liantao Lan, Yanxun Chang
 Des. Codes Cryptogr.1
2018 Constructions of cyclic quaternary constant-weight codes of weight three and distance four
Liantao Lan, Yanxun Chang
 Des. Codes Cryptogr.1
2016 Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions
abstract
In this paper, we consider optimal q-ary cyclic constant-weight codes of length n, minimum distance d, and weight w, briefly cyclic (n, d, w)qcodes. We introduce the pure and mixed difference method to present a combinatorial description for a cyclic (n, d, w)qcode and then obtain some tight upper bounds on the sizes of optimal cyclic (n, d, w)qcodes. Finally, by using Skolem-type sequences, we completely determine the sizes of optimal cyclic (n, d, 3)3codes with minimum distance 1 ≤ d ≤ 6.
Liantao Lan, Yanxun Chang
 IEEE Trans. Inf. Theory1