1. 2016
  2. Computational and proof complexity of partial string avoidability

    Itsykson, D., Okhotin, A. & Oparin, V., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  3. Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles

    Itsykson, D., Oparin, V., Slabodkin, M. & Sokolov, D., 1 Jan 2016, In: Fundamenta Informaticae. 145, 3, p. 229-242 14 p.

    Research output: Contribution to journalArticlepeer-review

  4. 2015
  5. Heuristic time hierarchies via hierarchies for sampling distributions

    Itsykson, D., Knop, A. & Sokolov, D., 1 Jan 2015, Algorithms and Computation - 26th International Symposium, ISAAC 2015, Proceedings. Elbassioni, K. & Makino, K. (eds.). Springer Nature, p. 201-211 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9472).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  6. Resolution complexity of perfect matching principles for sparse graphs

    Itsykson, D., Slabodkin, M. & Sokolov, D., 1 Jan 2015, Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Proceedings. Beklemishev, L. D., Musatov, D. V. & Musatov, D. V. (eds.). Springer Nature, p. 219-230 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9139).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  7. 2014
  8. Lower Bound on Average-Case Complexity of Inversion of Goldreich's Function by Drunken Backtracking Algorithms

    Itsykson, D., 1 Feb 2014, In: Theory of Computing Systems. 54, 2, p. 261-276 16 p.

    Research output: Contribution to journalArticlepeer-review

  9. Lower bounds for splittings by linear combinations

    Itsykson, D. & Sokolov, D., 1 Jan 2014, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 2 ed. Springer Nature, p. 372-383 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8635 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  10. On fast heuristic non-deterministic algorithms and short heuristic proofs

    Itsykson, D. & Sokolov, D., 2014, In: Fundamenta Informaticae. 132, 1, p. 113-129 17 p.

    Research output: Contribution to journalArticlepeer-review

  11. 2013
  12. Graph expansion, tseitin formulas and resolution proofs for CSP

    Itsykson, D. & Oparin, V., 29 Nov 2013, Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, CSR 2013. p. 162-173 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7913 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  13. Optimal heuristic algorithms for the image of an injective function

    Hirsch, E. A., Itsykson, D. M., Nikolaenko, V. O. & Smal, A. V., 1 Jan 2013, In: Journal of Mathematical Sciences (United States). 188, 1, p. 7-16 10 p.

    Research output: Contribution to journalArticlepeer-review

  14. The complexity of inverting explicit Goldreich's function by DPLL algorithms

    Itsykson, D. M. & Sokolov, D. O., 1 Jan 2013, In: Journal of Mathematical Sciences (United States). 188, 1, p. 47-58 12 p.

    Research output: Contribution to journalArticlepeer-review

ID: 35825084