Publication | Date of Publication | Type |
---|
The idemetric property: when most distances are (almost) the same | 2021-10-29 | Paper |
A Theory of Network Security: Principles of Natural Selection and Combinatorics | 2021-03-26 | Paper |
Equilibrium games in networks | 2018-09-20 | Paper |
Splitting and jump inversion in the Turing degrees | 2018-09-20 | Paper |
Pointed computations and Martin-Löf randomness | 2018-09-20 | Paper |
Improved approximation algorithms for the maximum happy vertices and edges problems | 2018-05-18 | Paper |
Dynamics, morphogenesis and convergence of evolutionary quantum Prisoner's Dilemma games on networks | 2017-09-29 | Paper |
Structural Information and Dynamical Complexity of Networks | 2017-04-28 | Paper |
Testing Small Set Expansion in General Graphs | 2017-01-24 | Paper |
Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems | 2015-10-29 | Paper |
Algorithmic aspects of homophyly of networks | 2015-10-08 | Paper |
Kolmogorov complexity and computably enumerable sets | 2015-08-27 | Paper |
A Roadmap for TAMC | 2014-04-16 | Paper |
Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure | 2014-01-14 | Paper |
Unbalanced graph partitioning | 2013-10-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4910745 | 2013-03-19 | Paper |
Community Structures in Classical Network Models | 2012-08-29 | Paper |
The small-community phenomenon in networks | 2012-06-04 | Paper |
Characterizations of locally testable linear- and affine-invariant families | 2012-03-13 | Paper |
Separating NE from some nonuniform nondeterministic complexity classes | 2011-12-15 | Paper |
Characterizations of Locally Testable Linear- and Affine-Invariant Families | 2011-08-17 | Paper |
The Complexity and Approximability of Minimum Contamination Problems | 2011-07-01 | Paper |
Unbalanced Graph Partitioning | 2010-12-09 | Paper |
Separating NE from Some Nonuniform Nondeterministic Complexity Classes | 2009-07-23 | Paper |
Principal filters definable by parameters in 𝓔bT | 2009-03-24 | Paper |
Elementary differences among jump classes | 2009-03-20 | Paper |
Continuity of capping in \(\mathcal C_{\text{bT}}\) | 2008-09-29 | Paper |
On Lachlan's major sub-degree problem | 2008-09-09 | Paper |
Derandomizing Graph Tests for Homomorphism | 2008-05-27 | Paper |
Definable Filters in the Structure of Bounded Turing Reductions | 2008-05-27 | Paper |
Elementary Differences Among Jump Hierarchies | 2007-11-13 | Paper |
There exists a maximal 3-c.e. enumeration degree | 2007-09-28 | Paper |
Theory and Applications of Models of Computation | 2007-04-30 | Paper |
Theory and Applications of Models of Computation | 2007-04-30 | Paper |
Plus cupping degrees do not form an ideal | 2007-02-20 | Paper |
Restricted jump interpolation in the d.c.e. degrees | 2007-02-09 | Paper |
Splitting and cone avoidance in the d.c.e. degrees | 2006-09-22 | Paper |
Bounding computably enumerable degrees in the Ershov hierarchy | 2006-08-16 | Paper |
Bounding and nonbounding minimal pairs in the enumeration degrees | 2006-01-16 | Paper |
New Computational Paradigms | 2006-01-11 | Paper |
The existence of high nonbounding degrees in the difference hierarchy | 2005-12-29 | Paper |
A hierarchy for the plus cupping Turing degrees | 2005-02-09 | Paper |
A join theorem for the computably enumerable degrees | 2004-08-13 | Paper |
Turing Definability in the Ershov Hierarchy | 2004-06-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4460841 | 2004-03-29 | Paper |
Complementing cappable degrees in the difference hierarchy. | 2004-03-14 | Paper |
Splitting and nonsplitting, II: A low2 c.e. degree above which 0′ is not splittable | 2004-03-01 | Paper |
A minimal pair joining to a plus cupping Turing degree | 2004-02-12 | Paper |
Non-uniformity and generalised Sacks splitting | 2003-10-16 | Paper |
On the distribution of Lachlan nonsplitting bases | 2003-09-16 | Paper |
Bounding cappable degrees | 2001-10-07 | Paper |
A hierarchy for cuppable degrees | 2001-09-03 | Paper |
https://portal.mardi4nfdi.de/entity/Q4511553 | 2001-03-15 | Paper |
On a conjecture of Lempp | 2000-10-25 | Paper |
Cupping the Recursively Enumerable Degrees by D.R.E. Degrees | 2000-06-22 | Paper |
Bounding minimal degrees by computably enumerable degrees | 1999-06-29 | Paper |
The extendibility of relatively capping degrees under the weak truth table reducibility | 1995-08-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q4272373 | 1994-09-29 | Paper |
A result about pseudo jump operators | 1993-12-20 | Paper |
A decomposition theorem of \(\text \textbf{0}^ \prime\) | 1993-08-24 | Paper |
https://portal.mardi4nfdi.de/entity/Q4030575 | 1993-04-01 | Paper |