| Publication | Date of Publication | Type |
|---|
Incremental measurement of structural entropy for dynamic graphs
Artificial Intelligence | 2024-08-26 | Paper |
The idemetric property: when most distances are (almost) the same
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
A Theory of Network Security: Principles of Natural Selection and Combinatorics
Internet Mathematics | 2021-03-26 | Paper |
Splitting and jump inversion in the Turing degrees
Computability | 2018-09-20 | Paper |
Equilibrium games in networks
Physica A | 2018-09-20 | Paper |
Pointed computations and Martin-Löf randomness
Computability | 2018-09-20 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Algorithmica | 2018-05-18 | Paper |
Dynamics, morphogenesis and convergence of evolutionary quantum prisoner's dilemma games on networks
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-09-29 | Paper |
Structural Information and Dynamical Complexity of Networks
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Testing small set expansion in general graphs
(available as arXiv preprint) | 2017-01-24 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Algorithmic aspects of homophyly of networks
Theoretical Computer Science | 2015-10-08 | Paper |
Kolmogorov complexity and computably enumerable sets
Annals of Pure and Applied Logic | 2015-08-27 | Paper |
A roadmap for TAMC
Lecture Notes in Computer Science | 2014-04-16 | Paper |
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
Algorithms and Computation | 2014-01-14 | Paper |
Unbalanced graph partitioning
Theory of Computing Systems | 2013-10-21 | Paper |
| A theory for Valiant's matchcircuits (Extended abstract) | 2013-03-19 | Paper |
Community structures in classical network models
Internet Mathematics | 2012-08-29 | Paper |
The small-community phenomenon in networks
MSCS. Mathematical Structures in Computer Science | 2012-06-04 | Paper |
Characterizations of locally testable linear- and affine-invariant families
Theoretical Computer Science | 2012-03-13 | Paper |
Separating NE from some nonuniform nondeterministic complexity classes
Journal of Combinatorial Optimization | 2011-12-15 | Paper |
Characterizations of locally testable linear- and affine-invariant families
Lecture Notes in Computer Science | 2011-08-17 | Paper |
The complexity and approximability of minimum contamination problems
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Unbalanced graph partitioning
Algorithms and Computation | 2010-12-09 | Paper |
Separating NE from Some Nonuniform Nondeterministic Complexity Classes
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Principal filters definable by parameters in 𝓔bT
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
Elementary differences among jump classes
Theoretical Computer Science | 2009-03-20 | Paper |
Continuity of capping in \(\mathcal C_{\text{bT}}\)
Annals of Pure and Applied Logic | 2008-09-29 | Paper |
On Lachlan's major sub-degree problem
Archive for Mathematical Logic | 2008-09-09 | Paper |
Definable Filters in the Structure of Bounded Turing Reductions
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Derandomizing Graph Tests for Homomorphism
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Elementary Differences Among Jump Hierarchies
Lecture Notes in Computer Science | 2007-11-13 | Paper |
There exists a maximal 3-c.e. enumeration degree
Israel Journal of Mathematics | 2007-09-28 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
Plus cupping degrees do not form an ideal
Science in China. Series F | 2007-02-20 | Paper |
Restricted jump interpolation in the d.c.e. degrees
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
Splitting and cone avoidance in the d.c.e. degrees
Science in China. Series A | 2006-09-22 | Paper |
Bounding computably enumerable degrees in the Ershov hierarchy
Annals of Pure and Applied Logic | 2006-08-16 | Paper |
Bounding and nonbounding minimal pairs in the enumeration degrees
Journal of Symbolic Logic | 2006-01-16 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
The existence of high nonbounding degrees in the difference hierarchy
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
A hierarchy for the plus cupping Turing degrees
Journal of Symbolic Logic | 2005-02-09 | Paper |
A join theorem for the computably enumerable degrees
Transactions of the American Mathematical Society | 2004-08-13 | Paper |
Turing Definability in the Ershov Hierarchy
Journal of the London Mathematical Society | 2004-06-10 | Paper |
| scientific article; zbMATH DE number 2063225 (Why is no real title available?) | 2004-03-29 | Paper |
Complementing cappable degrees in the difference hierarchy.
Annals of Pure and Applied Logic | 2004-03-14 | Paper |
Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable
Journal of Symbolic Logic | 2004-03-01 | Paper |
A minimal pair joining to a plus cupping Turing degree
Mathematical Logic Quarterly | 2004-02-12 | Paper |
Non-uniformity and generalised Sacks splitting
Acta Mathematica Sinica, English Series | 2003-10-16 | Paper |
On the distribution of Lachlan nonsplitting bases
Archive for Mathematical Logic | 2003-09-16 | Paper |
Bounding cappable degrees
Archive for Mathematical Logic | 2001-10-07 | Paper |
A hierarchy for cuppable degrees
Illinois Journal of Mathematics | 2001-09-03 | Paper |
| scientific article; zbMATH DE number 1523417 (Why is no real title available?) | 2001-03-15 | Paper |
On a conjecture of Lempp
Archive for Mathematical Logic | 2000-10-25 | Paper |
Cupping the Recursively Enumerable Degrees by D.R.E. Degrees
Proceedings of the London Mathematical Society | 2000-06-22 | Paper |
Bounding minimal degrees by computably enumerable degrees
Journal of Symbolic Logic | 1999-06-29 | Paper |
The extendibility of relatively capping degrees under the weak truth table reducibility
Science in China. Series A | 1995-08-10 | Paper |
| scientific article; zbMATH DE number 468962 (Why is no real title available?) | 1994-09-29 | Paper |
A result about pseudo jump operators
Chinese Science Bulletin | 1993-12-20 | Paper |
A decomposition theorem of \(\text \textbf{0}^ \prime\)
Science in China. Series A | 1993-08-24 | Paper |
| scientific article; zbMATH DE number 147666 (Why is no real title available?) | 1993-04-01 | Paper |
