Angsheng Li

According to our database1, Angsheng Li authored at least 73 papers between 1998 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Establishing social cooperation: The role of hubs and community structure.
Network Science, 2018

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

Structure Entropy and Resistor Graphs.
CoRR, 2018

Splitting and jump inversion in the Turing degrees.
Computability, 2018

Pointed computations and Martin-Löf randomness.
Computability, 2018

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

2016
Structural Information and Dynamical Complexity of Networks.
IEEE Trans. Information Theory, 2016

A Theory of Network Security: Principles of Natural Selection and Combinatorics.
Internet Mathematics, 2016

Pointed computations and Martin-Löf randomness.
CoRR, 2016

2015
Algorithmic aspects of homophyly of networks.
Theor. Comput. Sci., 2015

Strategies for network security.
SCIENCE CHINA Information Sciences, 2015

Testing Small Set Expansion in General Graphs.
Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems.
Proceedings of the Computing and Combinatorics - 21st International Conference, 2015

2014
Global core, and galaxy structure of networks.
SCIENCE CHINA Information Sciences, 2014

A Roadmap for TAMC.
Proceedings of the Theory and Applications of Models of Computation, 2014

2013
Preface.
Theor. Comput. Sci., 2013

Unbalanced Graph Partitioning.
Theory Comput. Syst., 2013

Characters and patterns of communities in networks
CoRR, 2013

Homophyly and Randomness Resist Cascading Failure in Networks.
CoRR, 2013

Dimensions, Structures and Security of Networks.
CoRR, 2013

Provable Security of Networks.
CoRR, 2013

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

Homophyly Networks - A Structural Theory of Networks.
CoRR, 2013

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

Kolmogorov complexity and computably enumerable sets.
Ann. Pure Appl. Logic, 2013

Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Characterizations of locally testable linear- and affine-invariant families.
Theor. Comput. Sci., 2012

The small-community phenomenon in networks.
Mathematical Structures in Computer Science, 2012

Testing Small Set Expansion in General Graphs
CoRR, 2012

Detecting and Characterizing Small Dense Bipartite-like Subgraphs by the Bipartiteness Ratio Measure
CoRR, 2012

Algorithmic Aspects of Homophyly of Networks
CoRR, 2012

2011
Theory and applications of models of computation (TAMC 2008).
Theor. Comput. Sci., 2011

Separating NE from some nonuniform nondeterministic complexity classes.
J. Comb. Optim., 2011

Community Structures in Classical Network Models.
Internet Mathematics, 2011

Preface.
Int. J. Software and Informatics, 2011

Testing Conductance in General Graphs.
Electronic Colloquium on Computational Complexity (ECCC), 2011

Kolmogorov complexity and computably enumerable sets
CoRR, 2011

The Complexity and Approximability of Minimum Contamination Problems.
Proceedings of the Theory and Applications of Models of Computation, 2011

Characterizations of Locally Testable Linear- and Affine-Invariant Families.
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).
Mathematical Structures in Computer Science, 2010

Unbalanced Graph Partitioning.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

2009
Elementary differences among jump classes.
Theor. Comput. Sci., 2009

Principal filters definable by parameters in EbT.
Mathematical Structures in Computer Science, 2009

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC).
Mathematical Structures in Computer Science, 2009

Separating NE from Some Nonuniform Nondeterministic Complexity Classes.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
A Theory for Valiant's Matchcircuits (Extended Abstract)
CoRR, 2008

Continuity of capping in CbT.
Ann. Pure Appl. Logic, 2008

On Lachlan's major sub-degree problem.
Arch. Math. Log., 2008

Derandomizing Graph Tests for Homomorphism.
Proceedings of the Theory and Applications of Models of Computation, 2008

Definable Filters in the Structure of Bounded Turing Reductions.
Proceedings of the Theory and Applications of Models of Computation, 2008

A Theory for Valiant's Matchcircuits (Extended Abstract).
Proceedings of the STACS 2008, 2008

Insar Analysis of Land Subsidence Caused by Groundwater Exploitation in Changping, Beijing, China.
Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2008

Modeling Atmospheric Effects of InSAR Measurements based on Meris and GPS observations.
Proceedings of the IEEE International Geoscience & Remote Sensing Symposium, 2008

2007
Preface: Theory and applications of models of computation.
Theor. Comput. Sci., 2007

Elementary Differences Among Jump Hierarchies.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
Restricted jump interpolation in the d.c.e. degrees.
Mathematical Structures in Computer Science, 2006

Bounding computably enumerable degrees in the Ershov hierarchy.
Ann. Pure Appl. Logic, 2006

The existence of high nonbounding degrees in the difference hierarchy.
Ann. Pure Appl. Logic, 2006

On the Quotient Structure of Computably Enumerable Degrees Modulo the Noncuppable Ideal.
Proceedings of the Theory and Applications of Models of Computation, 2006

Universal Cupping Degrees.
Proceedings of the Theory and Applications of Models of Computation, 2006

2005
Bounding and nonbounding minimal pairs in the enumeration degrees.
J. Symb. Log., 2005

The Low Splitting Theorem in the Difference Hierarchy.
Proceedings of the New Computational Paradigms, 2005

2004
There is no low maximal d. c. e. degree - Corrigendum.
Math. Log. Q., 2004

Plus cupping degrees do not form an ideal.
Science in China Series F: Information Sciences, 2004

Complementing cappable degrees in the difference hierarchy.
Ann. Pure Appl. Logic, 2004

2003
A minimal pair joining to a plus cupping Turing degree.
Math. Log. Q., 2003

A hierarchy for the plus cupping Turing degrees.
J. Symb. Log., 2003

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

On the distribution of Lachlan nonsplitting bases.
Arch. Math. Log., 2002

2000
There is No Low Maximal D.C.E. Degree.
Math. Log. Q., 2000

Bounding cappable degrees.
Arch. Math. Log., 2000

On a conjecture of Lempp.
Arch. Math. Log., 2000

1998
Bounding Minimal Degrees by Computably Enumerable Degrees.
J. Symb. Log., 1998


  Loading...