default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAngsheng Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Runze Yang, Hao Peng, Chunyang Liu
, Angsheng Li:
Incremental measurement of structural entropy for dynamic graphs. Artif. Intell. 334: 104175 (2024)- [c28]Xianghua Zeng, Hao Peng, Angsheng Li:
Adversarial Socialbots Modeling Based on Structural Information Principles. AAAI 2024: 392-400 - [c27]Liang Duan, Xiang Chen, Wenjie Liu, Daliang Liu, Kun Yue, Angsheng Li:
Structural Entropy Based Graph Structure Learning for Node Classification. AAAI 2024: 8372-8379 - [c26]Guangjie Zeng, Hao Peng, Angsheng Li, Zhiwei Liu, Runze Yang, Chunyang Liu, Lifang He:
Semi-Supervised Clustering via Structural Entropy with Different Constraints. SDM 2024: 208-216 - [i26]Xianghua Zeng, Hao Peng, Dingli Su, Angsheng Li:
Effective Reinforcement Learning Based on Structural Information Principles. CoRR abs/2404.09760 (2024) - [i25]Hao Peng, Jingyun Zhang, Xiang Huang, Zhifeng Hao, Angsheng Li, Zhengtao Yu, Philip S. Yu:
Unsupervised Social Bot Detection via Structural Information Theory. CoRR abs/2404.13595 (2024) - [i24]Yuwei Cao, Hao Peng, Angsheng Li, Chenyu You, Zhifeng Hao, Philip S. Yu:
Multi-Relational Structural Entropy. CoRR abs/2405.07096 (2024) - 2023
- [c25]Xianghua Zeng, Hao Peng, Angsheng Li:
Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principles. AAAI 2023: 11772-11780 - [c24]Guangjie Zeng, Hao Peng, Angsheng Li, Zhiwei Liu, Chunyang Liu, Philip S. Yu, Lifang He:
Unsupervised Skin Lesion Segmentation via Structural Entropy Minimization on Multi-Scale Superpixel Graphs. ICDM 2023: 768-777 - [c23]Xianghua Zeng, Hao Peng, Angsheng Li, Chunyang Liu, Lifang He, Philip S. Yu:
Hierarchical State Abstraction based on Structural Information Principles. IJCAI 2023: 4549-4557 - [c22]Zhenyu Yang, Ge Zhang, Jia Wu, Jian Yang, Quan Z. Sheng, Hao Peng, Angsheng Li, Shan Xue, Jianlin Su:
Minimum Entropy Principle Guided Graph Neural Networks. WSDM 2023: 114-122 - [i23]Xianghua Zeng, Hao Peng, Angsheng Li:
Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principles. CoRR abs/2304.00755 (2023) - [i22]Xianghua Zeng, Hao Peng, Angsheng Li, Chunyang Liu, Lifang He, Philip S. Yu:
Hierarchical State Abstraction Based on Structural Information Principles. CoRR abs/2304.12000 (2023) - [i21]Guangjie Zeng, Hao Peng, Angsheng Li, Zhiwei Liu, Chunyang Liu, Philip S. Yu, Lifang He:
Unsupervised Skin Lesion Segmentation via Structural Entropy Minimization on Multi-Scale Superpixel Graphs. CoRR abs/2309.01899 (2023) - [i20]Xianghua Zeng, Hao Peng, Angsheng Li:
Adversarial Socialbots Modeling Based on Structural Information Principles. CoRR abs/2312.08098 (2023) - [i19]Guangjie Zeng, Hao Peng, Angsheng Li, Zhiwei Liu, Runze Yang, Chunyang Liu, Lifang He:
Semi-Supervised Clustering via Structural Entropy with Different Constraints. CoRR abs/2312.10917 (2023) - 2022
- [j41]Angsheng Li, Jianer Chen, Qilong Feng, Jinhui Xu:
Preface. Math. Struct. Comput. Sci. 32(2): 125-126 (2022) - [c21]Kaiyu Song, Kun Yue, Liang Duan, Mingze Yang, Angsheng Li:
Mutual information based Bayesian graph neural network for few-shot learning. UAI 2022: 1866-1875 - [i18]Runze Yang, Hao Peng, Angsheng Li:
Dynamic Measurement of Structural Entropy for Dynamic Graphs. CoRR abs/2207.12653 (2022) - 2020
- [i17]Angsheng Li:
Structural Information Learning Machinery: Learning from Observing, Associating, Optimizing, Decoding, and Abstracting. CoRR abs/2001.09637 (2020)
2010 – 2019
- 2019
- [c20]Yiwei Liu, Jiamou Liu, Zijian Zhang, Liehuang Zhu, Angsheng Li:
REM: From Structural Entropy to Community Structure Deception. NeurIPS 2019: 12918-12928 - [c19]Qifu Hu, Angsheng Li, Jiamou Liu, Jun Liu:
Time-Efficient Network Monitoring Through Confined Search and Adaptive Evaluation. PRICAI (2) 2019: 633-646 - [c18]Jun Liu, Yicheng Pan, Qifu Hu, Angsheng Li:
Navigating a Shortest Path with High Probability in Massive Complex Networks. SEA² 2019: 82-97 - 2018
- [j40]Peng Zhang, Yao Xu, Tao Jiang, Angsheng Li, Guohui Lin, Eiji Miyano:
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. Algorithmica 80(5): 1412-1438 (2018) - [j39]Angsheng Li, Mingji Xia:
Splitting and jump inversion in the Turing degrees. Comput. 7(2-3): 133-142 (2018) - [j38]George Barmpalias, Andrew Lewis-Pye, Angsheng Li:
Pointed computations and Martin-Löf randomness. Comput. 7(2-3): 171-177 (2018) - [j37]S. Barry Cooper, Andy Lewis-Pye, Angsheng Li, Yicheng Pan:
Establishing social cooperation: The role of hubs and community structure. Netw. Sci. 6(2): 251-264 (2018) - [i16]Angsheng Li, Yicheng Pan:
Structure Entropy and Resistor Graphs. CoRR abs/1801.03404 (2018) - [i15]George Barmpalias, Neng Huang, Andrew Lewis-Pye, Angsheng Li, Xuechen Li, Yicheng Pan, Tim Roughgarden:
The idemetric property: when most distances are (almost) the same. CoRR abs/1804.11187 (2018) - 2016
- [j36]Angsheng Li, Yicheng Pan:
A Theory of Network Security: Principles of Natural Selection and Combinatorics. Internet Math. 12(3): 145-204 (2016) - [j35]Angsheng Li, Yicheng Pan:
Structural Information and Dynamical Complexity of Networks. IEEE Trans. Inf. Theory 62(6): 3290-3339 (2016) - [i14]George Barmpalias, Andrew Lewis-Pye, Angsheng Li:
Pointed computations and Martin-Löf randomness. CoRR abs/1608.02081 (2016) - 2015
- [j34]Angsheng Li, Xuechen Li, Yicheng Pan, Wei Zhang:
Strategies for network security. Sci. China Inf. Sci. 58(1): 1-14 (2015) - [j33]Peng Zhang, Angsheng Li:
Algorithmic aspects of homophyly of networks. Theor. Comput. Sci. 593: 117-131 (2015) - [c17]Peng Zhang, Tao Jiang, Angsheng Li:
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems. COCOON 2015: 159-170 - [c16]Angsheng Li, Pan Peng:
Testing Small Set Expansion in General Graphs. STACS 2015: 622-635 - 2014
- [j32]Wei Zhang, Yicheng Pan, Pan Peng, Jiankou Li, Xuechen Li, Angsheng Li:
Global core, and galaxy structure of networks. Sci. China Inf. Sci. 57(7): 1-20 (2014) - [c15]T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
A Roadmap for TAMC. TAMC 2014: 1-6 - [e5]T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8402, Springer 2014, ISBN 978-3-319-06088-0 [contents] - 2013
- [j31]George Barmpalias, Angsheng Li:
Kolmogorov complexity and computably enumerable sets. Ann. Pure Appl. Log. 164(12): 1187-1200 (2013) - [j30]Angsheng Li, Peng Zhang:
Unbalanced Graph Partitioning. Theory Comput. Syst. 53(3): 454-466 (2013) - [j29]Jirí Fiala, Jan Kratochvíl, Angsheng Li:
Preface. Theor. Comput. Sci. 494: 1 (2013) - [c14]Angsheng Li, Pan Peng:
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. ISAAC 2013: 655-665 - [i13]Jiankou Li, Angsheng Li:
Characters and patterns of communities in networks. CoRR abs/1301.2957 (2013) - [i12]Angsheng Li, Yicheng Pan, Jiankou Li:
Community Structures Are Definable in Networks: A Structural Theory of Networks. CoRR abs/1310.8038 (2013) - [i11]Angsheng Li, Wei Zhang, Yicheng Pan, Xuechen Li:
Homophyly and Randomness Resist Cascading Failure in Networks. CoRR abs/1310.8040 (2013) - [i10]Angsheng Li, Wei Zhang, Yicheng Pan:
Dimensions, Structures and Security of Networks. CoRR abs/1310.8293 (2013) - [i9]Angsheng Li, Jiankou Li, Yicheng Pan:
Community Structures Are Definable in Networks, and Universal in Real World. CoRR abs/1310.8294 (2013) - [i8]Angsheng Li, Jiankou Li, Yicheng Pan:
Homophyly Networks - A Structural Theory of Networks. CoRR abs/1310.8295 (2013) - [i7]Angsheng Li, Yicheng Pan, Wei Zhang:
Provable Security of Networks. CoRR abs/1310.8388 (2013) - 2012
- [j28]Angsheng Li, Pan Peng:
The small-community phenomenon in networks. Math. Struct. Comput. Sci. 22(3): 373-407 (2012) - [j27]Angsheng Li, Yicheng Pan:
Characterizations of locally testable linear- and affine-invariant families. Theor. Comput. Sci. 414(1): 55-75 (2012) - [e4]Manindra Agrawal, S. Barry Cooper, Angsheng Li:
Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. Lecture Notes in Computer Science 7287, Springer 2012, ISBN 978-3-642-29951-3 [contents] - [i6]Angsheng Li, Peng Zhang:
Algorithmic Aspects of Homophyly of Networks. CoRR abs/1207.0316 (2012) - [i5]Angsheng Li, Pan Peng:
Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure. CoRR abs/1209.5045 (2012) - [i4]Angsheng Li, Pan Peng:
Testing Small Set Expansion in General Graphs. CoRR abs/1209.5052 (2012) - 2011
- [j26]Angsheng Li:
Preface. Int. J. Softw. Informatics 5(4): 547-548 (2011) - [j25]Angsheng Li, Pan Peng:
Community Structures in Classical Network Models. Internet Math. 7(2): 81-106 (2011) - [j24]Bin Fu, Angsheng Li, Liyu Zhang:
Separating NE from some nonuniform nondeterministic complexity classes. J. Comb. Optim. 22(3): 482-493 (2011) - [j23]Manindra Agrawal, Angsheng Li:
Theory and applications of models of computation (TAMC 2008). Theor. Comput. Sci. 412(18): 1645 (2011) - [c13]Angsheng Li, Yicheng Pan:
Characterizations of Locally Testable Linear- and Affine-Invariant Families. COCOON 2011: 467-478 - [c12]Angsheng Li, Linqing Tang:
The Complexity and Approximability of Minimum Contamination Problems. TAMC 2011: 298-307 - [i3]George Barmpalias, Angsheng Li:
Kolmogorov complexity and computably enumerable sets. CoRR abs/1111.4339 (2011) - [i2]Angsheng Li, Yicheng Pan, Pan Peng:
Testing Conductance in General Graphs. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j22]Manindra Agrawal, S. Barry Cooper, Angsheng Li:
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). Math. Struct. Comput. Sci. 20(5): 705-706 (2010) - [c11]Angsheng Li, Peng Zhang:
Unbalanced Graph Partitioning. ISAAC (1) 2010: 218-229 - [e3]Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman:
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6108, Springer 2010, ISBN 978-3-642-13561-3 [contents]
2000 – 2009
- 2009
- [j21]Jin-yi Cai, S. Barry Cooper, Angsheng Li:
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC). Math. Struct. Comput. Sci. 19(1): 5-7 (2009) - [j20]Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang:
Principal filters definable by parameters in EbT. Math. Struct. Comput. Sci. 19(1): 153-167 (2009) - [j19]Angsheng Li:
Elementary differences among jump classes. Theor. Comput. Sci. 410(11): 1042-1053 (2009) - [c10]Bin Fu, Angsheng Li, Liyu Zhang:
Separating NE from Some Nonuniform Nondeterministic Complexity Classes. COCOON 2009: 486-495 - 2008
- [j18]S. Barry Cooper, Angsheng Li:
On Lachlan's major sub-degree problem. Arch. Math. Log. 47(4): 341-434 (2008) - [j17]Paul Brodhead, Angsheng Li, Weilin Li:
Continuity of capping in CbT. Ann. Pure Appl. Log. 155(1): 1-15 (2008) - [c9]Huili Gong, Youquan Zhang, Xiaojuan Li, Angsheng Li, Beibei Chen, Huan Zhou, Yonghua Sun:
Modeling Atmospheric Effects of InSAR Measurements based on Meris and GPS observations. IGARSS (4) 2008: 978-981 - [c8]Youquan Zhang, Huili Gong, Xiaojuan Li, Taiguang Liu, Wen Yang, Beibei Chen, Angsheng Li, Yaoming Su:
Insar Analysis of Land Subsidence Caused by Groundwater Exploitation in Changping, Beijing, China. IGARSS (2) 2008: 1247-1250 - [c7]Angsheng Li, Mingji Xia:
A Theory for Valiant's Matchcircuits (Extended Abstract). STACS 2008: 491-502 - [c6]Angsheng Li, Linqing Tang:
Derandomizing Graph Tests for Homomorphism. TAMC 2008: 105-115 - [c5]Angsheng Li, Weilin Li, Yicheng Pan, Linqing Tang:
Definable Filters in the Structure of Bounded Turing Reductions. TAMC 2008: 116-124 - [e2]Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li:
Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings. Lecture Notes in Computer Science 4978, Springer 2008, ISBN 978-3-540-79227-7 [contents] - [i1]Angsheng Li, Mingji Xia:
A Theory for Valiant's Matchcircuits (Extended Abstract). CoRR abs/0802.2860 (2008) - 2007
- [j16]S. Barry Cooper, Angsheng Li:
Preface: Theory and applications of models of computation. Theor. Comput. Sci. 384(1): 1 (2007) - [c4]Angsheng Li:
Elementary Differences Among Jump Hierarchies. TAMC 2007: 79-88 - 2006
- [j15]Chi Tat Chong, Angsheng Li, Yue Yang:
The existence of high nonbounding degrees in the difference hierarchy. Ann. Pure Appl. Log. 138(1-3): 31-51 (2006) - [j14]Angsheng Li, Guohua Wu, Yue Yang:
Bounding computably enumerable degrees in the Ershov hierarchy. Ann. Pure Appl. Log. 141(1-2): 79-88 (2006) - [j13]Carl G. Jockusch Jr., Angsheng Li:
Restricted jump interpolation in the d.c.e. degrees. Math. Struct. Comput. Sci. 16(5): 841-865 (2006) - [c3]Angsheng Li, Yan Song, Guohua Wu:
Universal Cupping Degrees. TAMC 2006: 721-730 - [c2]Angsheng Li, Guohua Wu, Yue Yang:
On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal. TAMC 2006: 731-736 - [e1]Jin-yi Cai, S. Barry Cooper, Angsheng Li:
Theory and Applications of Models of Computation, Third International Conference, TAMC 2006, Beijing, China, May 15-20, 2006, Proceedings. Lecture Notes in Computer Science 3959, Springer 2006, ISBN 3-540-34021-1 [contents] - 2005
- [j12]S. Barry Cooper, Angsheng Li, Andrea Sorbi, Yue Yang:
Bounding and nonbounding minimal pairs in the enumeration degrees. J. Symb. Log. 70(3): 741-766 (2005) - [c1]Angsheng Li:
The Low Splitting Theorem in the Difference Hierarchy. CiE 2005: 287-296 - 2004
- [j11]Rod Downey, Angsheng Li, Guohua Wu:
Complementing cappable degrees in the difference hierarchy. Ann. Pure Appl. Log. 125(1-3): 101-118 (2004) - [j10]Angsheng Li, Yicheng Zhao:
Plus cupping degrees do not form an ideal. Sci. China Ser. F Inf. Sci. 47(5): 635-654 (2004) - [j9]Marat M. Arslanov, S. Barry Cooper, Angsheng Li:
There is no low maximal d. c. e. degree - Corrigendum. Math. Log. Q. 50(6): 628-636 (2004) - 2003
- [j8]Yong Wang, Angsheng Li:
A hierarchy for the plus cupping Turing degrees. J. Symb. Log. 68(3): 972-988 (2003) - [j7]Dengfeng Li, Angsheng Li:
A minimal pair joining to a plus cupping Turing degree. Math. Log. Q. 49(6): 553-566 (2003) - 2002
- [j6]S. Barry Cooper, Angsheng Li, Xiaoding Yi:
On the distribution of Lachlan nonsplitting bases. Arch. Math. Log. 41(5): 455-482 (2002) - [j5]S. Barry Cooper, Angsheng Li:
Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable. J. Symb. Log. 67(4): 1391-1430 (2002) - 2000
- [j4]Angsheng Li:
On a conjecture of Lempp. Arch. Math. Log. 39(4): 281-309 (2000) - [j3]Angsheng Li:
Bounding cappable degrees. Arch. Math. Log. 39(5): 311-352 (2000) - [j2]Marat M. Arslanov, S. Barry Cooper, Angsheng Li:
There is No Low Maximal D.C.E. Degree. Math. Log. Q. 46(3): 409-416 (2000)
1990 – 1999
- 1998
- [j1]Angsheng Li, Yang Dongping:
Bounding Minimal Degrees by Computably Enumerable Degrees. J. Symb. Log. 63(4): 1319-1347 (1998)
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-10-07 22:22 CEST 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:
