1 - 20 out of 54Page size: 20
  1. 2022

  2. SAT-Based Circuit Local Improvement

    Куликов, А. С., Печенев, Д. Е. & Слезкин, Н. Е., 1 Aug 2022, 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022. Szeider, S., Ganian, R. & Silva, A. (eds.). Dagstuhl, Germany: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 p. 68. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 241).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  3. 2021

  4. Minimum common string partition: Exact algorithms

    Cygan, M., Kulikov, A. S., Mihajlin, I., Nikolaev, M. & Reznikov, G., 1 Sep 2021, 29th Annual European Symposium on Algorithms, ESA 2021. Mutzel, P., Pagh, R. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 35. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 204).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  5. Circuit depth reductions

    Golovnev, A., Kulikov, A. S. & Ryan Williams, R., 1 Feb 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 24. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  6. 2019

  7. Complexity of linear operators

    Kulikov, A. S., Mikhailin, I., Mokhov, A. & Podolskii, V., Dec 2019, 30th International Symposium on Algorithms and Computation, ISAAC 2019. Lu, P. & Zhang, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 17. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 149).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  8. Collapsing superstring conjecture

    Golovnev, A., Kulikov, A. S., Logunov, A., Mihajlin, I. & Nikolaev, M., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Achlioptas, D. & Vegh, L. A. (eds.). 26. (Leibniz International Proceedings in Informatics; vol. 145).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  9. Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates

    Kulikov, A. S. & Podolskii, V. V., Jul 2019, In: Theory of Computing Systems. 63, 5, p. 956-986

    Research output: Contribution to journal › Article › peer-review

  10. 2018

  11. On the limits of gate elimination

    Golovnev, A., Hirsch, E. A., Knop, A. & Kulikov, A. S., 1 Sep 2018, In: Journal of Computer and System Sciences. 96, p. 107-119 13 p.

    Research output: Contribution to journal › Article › peer-review

  12. Improving circuit size upper bounds using SAT-solvers

    Kulikov, A. S., 19 Apr 2018, Proceedings of the 2018 Design, Automation and Test in Europe Conference and Exhibition, DATE 2018. Institute of Electrical and Electronics Engineers Inc., p. 305-308 4 p. (Proceedings of the 2018 Design, Automation and Test in Europe Conference and Exhibition, DATE 2018; vol. 2018-January).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  13. Gate elimination: Circuit size lower bounds and #SAT upper bounds

    Golovnev, A., Kulikov, A. S., Smal, A. V. & Tamaki, S., 6 Apr 2018, In: Theoretical Computer Science. 719, p. 46-63 18 p.

    Research output: Contribution to journal › Article › peer-review

  14. Preface to the Special Issue on Computer Science in Russia 2016

    Kulikov, A. S. & Woeginger, G. J., 1 Apr 2018, In: Theory of Computing Systems. 62, 3, p. 465-466 2 p.

    Research output: Contribution to journal › Editorial › peer-review

  15. Lower bounds for unrestricted boolean circuits: Open problems

    Kulikov, A. S., 1 Jan 2018, Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Proceedings. Podolskii, V. V. & Fomin, F. V. (eds.). Springer Nature, p. 15-22 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10846 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  16. 2017

  17. Parameterized Complexity of Superstring Problems

    Bliznets, I., Fomin, F. V., Golovach, P. A., Karpov, N., Kulikov, A. S. & Saurabh, S., 1 Nov 2017, In: Algorithmica. 79, 3, p. 798-813 16 p.

    Research output: Contribution to journal › Article › peer-review

  18. Parameterized Complexity of Secluded Connectivity Problems

    Fomin, F. V., Golovach, P. A., Karpov, N. & Kulikov, A. S., 1 Oct 2017, In: Theory of Computing Systems. 61, 3, p. 795-819 25 p.

    Research output: Contribution to journal › Article › peer-review

  19. Tight lower bounds on graph embedding problems

    Cygan, M., Fomin, F. V., Golovnev, A., Kulikov, A. S., Mihajlin, I., Pachocki, J. & Socała, A., Jun 2017, In: Journal of the ACM. 64, 3, 18.

    Research output: Contribution to journal › Article › peer-review

  20. Computing majority by constant depth majority circuits with low fan-in gates

    Kulikov, A. S. & Podolskii, V. V., 1 Mar 2017, 34th Symposium on Theoretical Aspects of Computer Science, STACS 2017. Vallee, B. & Vollmer, H. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 66).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  21. 2016

  22. A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

    Find, M. G., Golovnev, A., Hirsch, E. A. & Kulikov, A. S., 14 Dec 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. Institute of Electrical and Electronics Engineers Inc., p. 89-98 10 p. 7782921. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  23. Circuit size lower bounds and #SAT upper bounds through a general framework

    Golovnev, A., Kulikov, A. S., Smal, A. V. & Tamaki, S., 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, 45. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  24. On the limits of gate elimination

    Golovnev, A., Hirsch, E. A., Knop, A. & Kulikov, A. S., 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, 46. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

  25. Families with infants: Speeding up algorithms for NP-hard problems using FFT

    Golovnev, A., Kulikov, A. S. & Mihajlin, I., Apr 2016, In: ACM Transactions on Algorithms. 12, 3, 35.

    Research output: Contribution to journal › Article › peer-review

  26. Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds

    Golovnev, A. & Kulikov, A. S., 14 Jan 2016, ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science. Association for Computing Machinery, p. 405-411 7 p. (ITCS 2016 - Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Previous 1 2 3 Next

ID: 9512817