Angsheng Li

CoRR, May, 2025

Structural Entropy Guided Agent for Detecting and Repairing Knowledge Deficiencies in LLMs.

[BibT_eX]

[DOI]

CoRR, May, 2025

Hierarchical Abstracting Graph Kernel.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., February, 2025

Scalable Semi-Supervised Clustering via Structural Entropy With Different Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., January, 2025

Emergence of Cooperation in Multi-Agent Reinforcement Learning via Coalition Labeling and Structural Entropy.

[BibT_eX]

[DOI]

Proceedings of the 2025 SIAM International Conference on Data Mining, 2025

A Survey of Structural Entropy: Theory, Methods, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

SetKE: Knowledge Editing for Knowledge Elements Overlap.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

2024

Unsupervised Social Bot Detection via Structural Information Theory.

[BibT_eX]

[DOI]

ACM Trans. Inf. Syst., November, 2024

Effective Exploration Based on the Structural Information Principles.

[BibT_eX]

[DOI]

CoRR, 2024

Effective Reinforcement Learning Based on Structural Information Principles.

[BibT_eX]

[DOI]

CoRR, 2024

Incremental measurement of structural entropy for dynamic graphs.

[BibT_eX]

[DOI]

Artif. Intell., 2024

Multi-Relational Structural Entropy.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2024

Semi-Supervised Clustering via Structural Entropy with Different Constraints.

[BibT_eX]

[DOI]

Proceedings of the 2024 SIAM International Conference on Data Mining, 2024

Effective Exploration Based on the Structural Information Principles.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 38: Annual Conference on Neural Information Processing Systems 2024, 2024

Adversarial Socialbots Modeling Based on Structural Information Principles.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Structural Entropy Based Graph Structure Learning for Node Classification.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Minimum Entropy Principle Guided Graph Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

Hierarchical State Abstraction based on Structural Information Principles.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Unsupervised Skin Lesion Segmentation via Structural Entropy Minimization on Multi-Scale Superpixel Graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Data Mining, 2023

Effective and Stable Role-Based Multi-Agent Collaboration by Structural Information Principles.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Preface.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2022

Dynamic Measurement of Structural Entropy for Dynamic Graphs.

[BibT_eX]

[DOI]

Runze Yang

CoRR, 2022

Mutual information based Bayesian graph neural network for few-shot learning.

[BibT_eX]

[DOI]

Proceedings of the Uncertainty in Artificial Intelligence, 2022

2020

Structural Information Learning Machinery: Learning from Observing, Associating, Optimizing, Decoding, and Abstracting.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Emergence of Network Bifurcation Triggered by Entanglement.

[BibT_eX]

[DOI]

Quantum, 2019

Navigating a Shortest Path with High Probability in Massive Complex Networks.

[BibT_eX]

[DOI]

Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

Time-Efficient Network Monitoring Through Confined Search and Adaptive Evaluation.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019

REM: From Structural Entropy to Community Structure Deception.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Establishing social cooperation: The role of hubs and community structure.

[BibT_eX]

[DOI]

Netw. Sci., 2018

The idemetric property: when most distances are (almost) the same.

[BibT_eX]

[DOI]

CoRR, 2018

Structure Entropy and Resistor Graphs.

[BibT_eX]

[DOI]

CoRR, 2018

Splitting and jump inversion in the Turing degrees.

[BibT_eX]

[DOI]

Mingji Xia

Comput., 2018

Pointed computations and Martin-Löf randomness.

[BibT_eX]

[DOI]

George Barmpalias

Andrew Lewis-Pye

Comput., 2018

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.

[BibT_eX]

[DOI]

Algorithmica, 2018

2016

Structural Information and Dynamical Complexity of Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

A Theory of Network Security: Principles of Natural Selection and Combinatorics.

[BibT_eX]

[DOI]

Internet Math., 2016

2015

Algorithmic aspects of homophyly of networks.

[BibT_eX]

[DOI]

Peng Zhang

Theor. Comput. Sci., 2015

Strategies for network security.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2015

Testing Small Set Expansion in General Graphs.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.

[BibT_eX]

[DOI]

Peng Zhang

Tao Jiang

Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014

Global core, and galaxy structure of networks.

[BibT_eX]

[DOI]

Sci. China Inf. Sci., 2014

A Roadmap for TAMC.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2014

2013

Preface.

[BibT_eX]

[DOI]

Jirí Fiala

Jan Kratochvíl

Theor. Comput. Sci., 2013

Characters and patterns of communities in networks

[BibT_eX]

[DOI]

CoRR, 2013

Homophyly and Randomness Resist Cascading Failure in Networks.

[BibT_eX]

[DOI]

CoRR, 2013

Dimensions, Structures and Security of Networks.

[BibT_eX]

[DOI]

Wei Zhang

CoRR, 2013

Provable Security of Networks.

[BibT_eX]

[DOI]

Wei Zhang

CoRR, 2013

Community Structures Are Definable in Networks: A Structural Theory of Networks.

[BibT_eX]

[DOI]

CoRR, 2013

Homophyly Networks - A Structural Theory of Networks.

[BibT_eX]

[DOI]

CoRR, 2013

Community Structures Are Definable in Networks, and Universal in Real World.

[BibT_eX]

[DOI]

CoRR, 2013

Kolmogorov complexity and computably enumerable sets.

[BibT_eX]

[DOI]

George Barmpalias

Ann. Pure Appl. Log., 2013

Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012

The small-community phenomenon in networks.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2012

2011

Theory and applications of models of computation (TAMC 2008).

[BibT_eX]

[DOI]

Manindra Agrawal

Theor. Comput. Sci., 2011

Community Structures in Classical Network Models.

[BibT_eX]

[DOI]

Internet Math., 2011

Preface.

[BibT_eX]

[DOI]

Int. J. Softw. Informatics, 2011

Testing Conductance in General Graphs.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

The Complexity and Approximability of Minimum Contamination Problems.

[BibT_eX]

[DOI]

Linqing Tang

Proceedings of the Theory and Applications of Models of Computation, 2011

Characterizations of Locally Testable Linear- and Affine-Invariant Families.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 17th Annual International Conference, 2011

2010

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009).

[BibT_eX]

[DOI]

Manindra Agrawal

Math. Struct. Comput. Sci., 2010

Unbalanced Graph Partitioning.

[BibT_eX]

[DOI]

Peng Zhang

Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009

Elementary differences among jump classes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Principal filters definable by parameters in EbT.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC).

[BibT_eX]

[DOI]

Jin-yi Cai

Math. Struct. Comput. Sci., 2009

Separating NE from Some Nonuniform Nondeterministic Complexity Classes.

[BibT_eX]

[DOI]

Bin Fu

Liyu Zhang

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Continuity of capping in CbT.

[BibT_eX]

[DOI]

Paul Brodhead

Weilin Li

Ann. Pure Appl. Log., 2008

On Lachlan's major sub-degree problem.

[BibT_eX]

[DOI]

Arch. Math. Log., 2008

Derandomizing Graph Tests for Homomorphism.

[BibT_eX]

[DOI]

Linqing Tang

Proceedings of the Theory and Applications of Models of Computation, 2008

Definable Filters in the Structure of Bounded Turing Reductions.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2008

A Theory for Valiant's Matchcircuits (Extended Abstract).

[BibT_eX]

[DOI]

Mingji Xia

Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, 2008

Insar Analysis of Land Subsidence Caused by Groundwater Exploitation in Changping, Beijing, China.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2008

Modeling Atmospheric Effects of InSAR Measurements based on Meris and GPS observations.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2008

2007

Preface: Theory and applications of models of computation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Elementary Differences Among Jump Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Restricted jump interpolation in the d.c.e. degrees.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

Math. Struct. Comput. Sci., 2006

Bounding computably enumerable degrees in the Ershov hierarchy.

[BibT_eX]

[DOI]

Yue Yang

Ann. Pure Appl. Log., 2006

The existence of high nonbounding degrees in the difference hierarchy.

[BibT_eX]

[DOI]

Chi Tat Chong

Yue Yang

Ann. Pure Appl. Log., 2006

On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal.

[BibT_eX]

[DOI]

Yue Yang

Proceedings of the Theory and Applications of Models of Computation, 2006

Universal Cupping Degrees.

[BibT_eX]

[DOI]

Yan Song

Proceedings of the Theory and Applications of Models of Computation, 2006

2005

Bounding and nonbounding minimal pairs in the enumeration degrees.

[BibT_eX]

[DOI]

J. Symb. Log., 2005

The Low Splitting Theorem in the Difference Hierarchy.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

There is no low maximal d. c. e. degree - Corrigendum.

[BibT_eX]

[DOI]

Marat M. Arslanov

Math. Log. Q., 2004

Plus cupping degrees do not form an ideal.

[BibT_eX]

[DOI]

Yicheng Zhao

Sci. China Ser. F Inf. Sci., 2004

Complementing cappable degrees in the difference hierarchy.

[BibT_eX]

[DOI]

Rod Downey

Ann. Pure Appl. Log., 2004

2003

A minimal pair joining to a plus cupping Turing degree.

[BibT_eX]

[DOI]

Dengfeng Li

Math. Log. Q., 2003

A hierarchy for the plus cupping Turing degrees.

[BibT_eX]

[DOI]

Yong Wang

J. Symb. Log., 2003

2002

Splitting and Nonsplitting, II: A Low2 C.E. Degree above Which 0' Is Not Splittable.

[BibT_eX]

[DOI]

J. Symb. Log., 2002

On the distribution of Lachlan nonsplitting bases.

[BibT_eX]

[DOI]

Xiaoding Yi

Arch. Math. Log., 2002

2000

There is No Low Maximal D.C.E. Degree.

[BibT_eX]

[DOI]

Marat M. Arslanov

Math. Log. Q., 2000

Bounding cappable degrees.

[BibT_eX]

[DOI]

Arch. Math. Log., 2000

On a conjecture of Lempp.

[BibT_eX]

[DOI]

Arch. Math. Log., 2000

1998

Bounding Minimal Degrees by Computably Enumerable Degrees.

[BibT_eX]

[DOI]