Name
Papers
Collaborators
MARIYA IVANOVA SOSKOVA
27
31
Citations 
PageRank 
Referers 
21
10.54
10
Referees 
References 
49
61
Title
Citations
PageRank
Year
A Structural Dichotomy in the Enumeration Degrees00.342022
Descriptive Set Theory and Computable Topology (Dagstuhl Seminar 21461).00.342021
S.Barry Cooper (1943-2015)00.342018
The Jump Hierarchy In The Enumeration Degrees00.342018
Corrigendum to "Advice classes of parameterized tractability" [Ann. Pure Appl. Logic 84 (1) (1997) 119-138].00.342018
Enumeration 1-Genericity in the Local Enumeration Degrees.00.342018
Nondensity of Double Bubbles in the D.C.E. Degrees.00.342017
The automorphism group of the enumeration degrees.00.342016
The Turing Universe in the Context of Enumeration Reducibility.00.342013
The incomputable.00.342013
Interpreting true arithmetic in the local structure of the enumeration degrees.10.392012
The high/low hierarchy in the local structure of the omega-enumeration degrees.00.342012
Cupping and definability in the local structure of the enumeration degrees.10.392012
Embedding distributive lattices in the Σ02 enumeration degrees20.502012
Kalimullin Pairs of §02 w-Enumeration Degrees.00.342011
The limitations of cupping in the local structure of the enumeration degrees00.342010
A non-splitting theorem in the enumeration degrees20.492009
Cupping Delta20 enumeration degrees to 0 e00.342009
Total Degrees and Nonsplitting Properties of Enumeration Degrees00.342008
Cupping Classes of Enumeration Degrees00.342008
Randomness, lowness and degrees131.232008
How enumeration reducibility yields extended Harrington non-splitting10.422008
Genericity and Non-bounding in the Enumeration degrees00.342007
Cupping D20 Enumeration Degrees to 0 e 00.342007
Working with the LR degrees10.382007
The strongest nonsplitting theorem00.342007
A generic set that does not bound a minimal pair00.342006