( en | de | ru )

 

Disambiguation of "Dzhafarov, Damir D."

Author of the publication

copydeleteadd this publication to your clipboard
Notions of robust information coding.

, and . Comput., 6 (2): 105-124 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Purevsuren Damiran

Shaeddin Damirchi

Sabine Damir-Geilsdorf

Sabine Damir-Geilsdorf

Sabine Damir-Geilsdorf

 

Other publications of authors with the same name

Infinite Saturated Orders.. Order, 28 (2): 163-172 (2011)Some results concerning the SRT22 vs. COH problem., , , and . Comput., 9 (3-4): 193-217 (2020)Dagstuhl Seminar on Measuring the Complexity of Computational Content 2018., , , and . Comput., 9 (3-4): 167-168 (2020)Effectiveness of Hindman's Theorem for Bounded Sums., , , and . Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 134-142. Springer, (2017)Π01 Classes, Peano Arithmetic, Randomness, and Computable Domination., , and . Notre Dame J. Formal Log., 51 (1): 127-159 (2010)The Complexity of Primes in Computable Unique Factorization Domains., and . Notre Dame J. Formal Log., 59 (2): 139-156 (2018)Notions of robust information coding., and . Comput., 6 (2): 105-124 (2017)On Mathias Generic Sets., , and . CiE, volume 7318 of Lecture Notes in Computer Science, page 129-138. Springer, (2012)Ramsey's theorem and products in the Weihrauch degrees., , , , and . Comput., 9 (2): 85-110 (2020)Computably Enumerable Partial Orders., , , and . Comput., 1 (2): 99-107 (2012)