Talks
  1. Characterizing the continuous degrees
    Logic Colloquium 2017, Stockholm, August 2017.

  2. Generic Muchnik reducibility and expansions of the reals
    AMS Sectional Meeting, Hunter's College, New York City, May 2017.

  3. Logic and degrees
    Marquette University Mathematcis Colloquium, Milwaukee, April 2017.

  4. Seven characterizations of the cototal enumeration degrees
    Southeastern Logic Symposium 2017, University of Florida, Gainesville, March 2017.

  5. Definability in degree structures
    Mathematical Colloquium, University of Wisconsin–Madison, November 2016.

  6. Cototality and the skip operator
    Fall Central Sectional Meeting, Minneapolis, October 2016.

  7. Randomness relative to an enumeration oracle
    The 17th Midwest Computability Seminar, University of Chicago, January 2016.

  8. Definability and automorphisms in the enumeration degrees
    CCR 2016, University of Hawaii, January 2016.

  9. Defining the jump classes in the local structure of the enumeration degrees
    AMS Central Fall Sectional Meeting, Loyola University Chicago, October 2015.

  10. Degree structures and Arithmetic
    Southern Wisconsin Logic Colloquium, September 2015.

  11. Definability of the jump classes in the local structure of the enumeration degrees
    Logic Seminar, University of Siena, June 2015.

  12. Enumeration degrees: Local and global structural interactions
    10th Panhellenic Logic Symposium, Samos, June 2015.

  13. Номерационни степени: връзка между локална и глобална структура
    2015 Spring Scientific Session, FMI, Sofia Univeristy, March 2015.

  14. An automorphism analysis for the $\Delta^0_2$ Turing degrees
    2015 Spring Eastern Sectional Meeting, Georgetown University, March 2015.

  15. Definability, automorphisms and enumeration degrees
    Conference in memory of Ivan Soskov, Giyuletchica, September 2014.
    Logic Colloquium 2014, Vienna Summer of Logic,Technische Univeritaet Vienna,July 2014.

  16. Finite automorphism bases for degree structures
    The Ninth International Conference on Computability Complexity and Randomness, IMS, National Univeristy of Singapore, June 2014.

  17. The definability of the total enumeration degrees and its consequences
    ASL2014 North American Annual Meeting, University of Colorado, Boulder, May 2014.

  18. Effective properties of Marker's Extensions by Ivan Soskov
    Southern Wisconsin Logic Colloquium, University Wisconsin–Madison, February 2014.

  19. Defining totality in the enumeration degrees
    Computability Seminar, UC Berkeley, February 2014.

  20. The automorphism group of the enumeration degrees
    Southern Wisconsin Logic Colloquium, University Wisconsin–Madison, August 2013.
    Logic Colloquium 2013, University of Evora, July 2013.

  21. The Turing universe in the context of enumeration reducibility
    Computability in Europe 2013,The Nature of Computation, University of Milano-Bicocca, July 2013.

  22. Semi-recursive sets and definability in the enumeration degrees
    Computability Seminar at the University of California, Berkely, September 2012.

  23. The Turing universe in the context of enumeration reducibility
    Logic Colloquium 2012, University of Manchester, July 2012.

  24. Определимост на аритметиката в теория на изчислимостта
    Public lecture given at Faculty of Mathematics and Informatics, Sofia University, July 2012.

  25. Extensions of the Turing model for relative definability
    2012 Spring Eastern Sectional Meeting of the AMS, Special Session on Computable Mathematics (in honor of Alan Turing), George Washington University, Washington DC, March 2012.
    Spring 2012 Mid-Atlantic Mathematical Logic Seminar, City University New York, March 2012.

  26. The structure of the omega enumeration degrees
    Computational Prospects of Infinity II, Workshop on Recursion Theory at the Institute for Mathematical Sciences, NUS, August 2011.

  27. Definability in the local structures of the enumeration degrees
    Logic Seminar at the University of Chicago, March 2011.

  28. Definability in the local structures of the enumeration degrees and the omega-enumeration degrees
    Logic Seminar at Cornell University, March 2011.

  29. Local definability of $\mathcal{K}$-pairs in the enumeration degrees.
    Second Session of the Workshop in Computability Theory 2011, University of Chicago Center in Paris, July 2011.

  30. Definability and interpretability in the $\Sigma^0_2$ enumeration degrees.
    Mal'tsev Meeting, Novosibirsk, May 2010.

  31. Charectarizing the strength of the local theory of the enumeration degrees
    14th SouthEastern Logic Symposium, Gainesville, February 2010.

  32. A locally definable det of low enumeration degrees: work in progress
    Dipartimento di Scienze Matematiche ed Informatiche "Roberto Magari", Siena, September 2009.

  33. Embedding partial orderings in degree structures
    Computability in Europe 2009, Heidelberg, July 2009.
    Computability Seminar at the University of Leeds, May 2009.

  34. The local structure of the enumeration degrees
    Proof Theory Seminar, Department of Mathematics, Ludwig Maximilians Universitaet, Munich, July 2008.

  35. The limitations of cupping in the local structure of the enumeration degrees
    Computability in Europe 2008, Athens, June 2008.

  36. Cupping classes of $\Sigma^0_2$ enumeration degrees
    Dipartimento di Scienze Matematiche ed Informatiche "Roberto Magari", Siena, Feb 2008.

  37. Enumeration degrees
    MATHLOGAPS Third Training Workshop, Aussois, June 2007.

  38. A non-splitting theorem in the enumeration degrees
    Computability in Europe 2007, Siena, June 2007.

  39. Cupping $\Delta^0_2$ enumeration degrees to $0'$
    Computability in Europe 2007, Siena, June 2007.

  40. The strongest nonsplitting theorem
    4th International Conference, TAMC 2007, Shanghai, China, May 2007.

  41. A Gentle Approach to Harrington non-splitting and beyond
    Logic Seminar at the University of Leeds, February 2007.

  42. An introduction to a new characterization of the low$_n$ degrees
    Computability Seminar at the University of Leeds, Novemeber 2006. Part 1 , Part 2

  43. A generalization of Harrington's nonsplitting theorem
    MATHLOGAPS Second Training Workshop, Leeds August 2006.

  44. A generalization of Harrington's nonsplitting theorem
    Computability in Europe 2006, Swansea, June 2006.

  45. Introduction to Harrington's nonsplitting theorem
    Computability Seminar at the University of Leeds, May 2006. Part 1 , Part 2

  46. A generic set that does not bound a minimal pair in the enumeration degrees
    Third Annual Conference on Computation and Logic, TAMC06, Beijing, May 2006.

Mariya