1 - 50 out of 54Page size: 50
  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

  27. Preface

    Kulikov, A. S. & Woeginger, G. J., 1 Jan 2016, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9691, p. V

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

  28. Preface

    Goldberg, A. V. & Kulikov, A. S., 1 Jan 2016, 15th International Symposium on Experimental Algorithms, SEA 2016. p. v (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9685).

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

  29. Tight bounds for graph homomorphism and subgraph isomorphism

    Cygan, M., Fomin, F. V., Golovnev, A., Kulikov, A. S., Mihajlin, I., Pachocki, J. & Socala, A., 1 Jan 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). Association for Computing Machinery, p. 1643-1649 7 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 3).

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

  30. 2015

  31. Parameterized complexity of secluded connectivity problems

    Fomin, F. V., Golovach, P. A., Karpov, N. & Kulikov, A. S., 1 Dec 2015, 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2015. Harsha, P. & Ramalingam, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 408-419 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 45).

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

  32. New Lower Bounds on Circuit Size of Multi-output Functions

    Demenkov, E., Kulikov, A. S., Melanich, O. & Mihajlin, I., 1 May 2015, In: Theory of Computing Systems. 56, 4, p. 630-642 13 p.

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

  33. Greedy conjecture for strings of length 4

    Kulikov, A. S., Savinov, S. & Sluzhaev, E., 1 Jan 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Nature, p. 307-315 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

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

  34. Lower bounds for the graph homomorphism problem

    Fomin, F. V., Golovnev, A., Kulikov, A. S. & Mihajlin, I., 1 Jan 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Nature, p. 481-493 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

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

  35. Parameterized complexity of superstring problems

    Bliznets, I., Fomin, F. V., Golovach, P. A., Karpov, N., Kulikov, A. S. & Saurabh, S., 1 Jan 2015, Combinatorial Pattern Matching - 26th Annual Symposium, CPM 2015, Proceedings. Vaccaro, U., Porat, E. & Cicalese, F. (eds.). Springer Nature, p. 89-99 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9133).

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

  36. Preface

    Kulikov, A. S. & Raskhodnikova, S., 2015, Proto-Indo-European Syntax and its Development. John Benjamins Publishing Company, p. v 5 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13296).

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

  37. 2014

  38. Solving SCS for bounded length strings in fewer than 2 n steps

    Golovnev, A., Kulikov, A. S. & Mihajlin, I., Aug 2014, In: Information Processing Letters. 114, 8, p. 421-425 5 p.

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

  39. Families with infants: A general approach to solve hard partition problems

    Golovnev, A., Kulikov, A. S. & Mihajlin, I., 1 Jan 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer Nature, p. 551-562 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

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

  40. Preface

    Kulikov, A. S., Kuznetsov, S. & Pevzner, P., 1 Jan 2014, 25th Annual Symposium on Combinatorial Pattern Matching, CPM 2014. p. V-VI (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8486 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Foreword/postscript

  41. 2013

  42. Solving 3-superstring in 3n/3 time

    Golovnev, A., Kulikov, A. S. & Mihajlin, I., 15 Oct 2013, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. p. 480-491 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8087 LNCS).

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

  43. Approximating shortest superstring problem using de Bruijn graphs

    Golovnev, A., Kulikov, A. S. & Mihajlin, I., 24 Sep 2013, Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings. p. 120-129 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7922 LNCS).

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

  44. 2012

  45. Computing all MOD-functions simultaneously

    Demenkov, E., Kulikov, A. S., Mihajlin, I. & Morizumi, H., 4 Sep 2012, Computer Science - Theory and Applications - 7th International Computer Science Symposium in Russia, CSR 2012, Proceedings. p. 81-88 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7353 LNCS).

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

  46. A 5n - o(n) lower bound on the circuit size over U 2 of a linear Boolean function

    Kulikov, A. S., Melanich, O. & Mihajlin, I., 18 Jun 2012, How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Proceedings. p. 432-439 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7318 LNCS).

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

  47. SPAdes: A new genome assembly algorithm and its applications to single-cell sequencing

    Bankevich, A., Nurk, S., Antipov, D., Gurevich, A. A., Dvorkin, M., Kulikov, A. S., Lesin, V. M., Nikolenko, S. I., Pham, S., Prjibelski, A. D., Pyshkin, A. V., Sirotkin, A. V., Vyahhi, N., Tesler, G., Alekseyev, M. A. & Pevzner, P. A., 1 May 2012, In: Journal of Computational Biology. 19, 5, p. 455-477 23 p.

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

  48. 2011

  49. An elementary proof of a 3n - o(n) lower bound on the circuit complexity of affine dispersers

    Demenkov, E. & Kulikov, A. S., 1 Sep 2011, Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings. p. 256-265 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6907 LNCS).

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

  50. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

    Kulikov, A. & Vereshchagin, N., 23 Jun 2011, In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6651 LNCS, p. VI

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

  51. 2010

  52. Circuit complexity and multiplicative complexity of Boolean functions

    Kojevnikov, A. & Kulikov, A. S., 29 Jul 2010, Programs, Proofs, Processes - 6th Conference on Computability in Europe, CiE 2010, Proceedings. p. 239-245 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6158 LNCS).

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

  53. On convex complexity measures

    Hrubeš, P., Jukna, S., Kulikov, A. & Pudlák, P., 28 Mar 2010, In: Theoretical Computer Science. 411, 16-18, p. 1842-1854 13 p.

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

  54. New upper bounds on the Boolean circuit complexity of symmetric functions

    Demenkov, E., Kojevnikov, A., Kulikov, A. & Yaroslavtsev, G., 1 Mar 2010, In: Information Processing Letters. 110, 7, p. 264-267 4 p.

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

  55. 2009

  56. Finding efficient circuits using SAT-solvers

    Kojevnikov, A., Kulikov, A. S. & Yaroslavtsev, G., 9 Nov 2009, Theory and Applications of Satisfiability Testing - SAT 2009 - 12th International Conference, SAT 2009, Proceedings. p. 32-44 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5584 LNCS).

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

  57. On covering graphs by complete bipartite subgraphs

    Jukna, S. & Kulikov, A. S., 28 May 2009, In: Discrete Mathematics. 309, 10, p. 3399-3403 5 p.

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

  58. New upper bounds for the problem of maximal satisfiability

    Kulikov, A. S. & Kutskov, K., 1 May 2009, In: Discrete Mathematics and Applications. 19, 2, p. 155-172 18 p.

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

  59. 2007

  60. New bounds for MAX-SAT by glause learning

    Kulikov, A. S. & Kutzkov, K., 24 Dec 2007, Computer Science - Theory and Applications - Second International Symposium on Computer Science in Russia, CSR 2007, Proceedings. p. 194-204 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4649 LNCS).

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

  61. 2006

  62. Automated proofs of upper bounds on the running time of splitting algorithms

    Fedin, S. S. & Kulikov, A. S., 1 May 2006, In: Journal of Mathematical Sciences . 134, 5, p. 2383-2391 9 p.

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

  63. A new approach to proving upper bounds for MAX-2-SAT

    Kojevnikov, A. & Kulikov, A. S., 28 Feb 2006, p. 11-17. 7 p.

    Research output: Contribution to conference › Paper › peer-review

  64. Complexity of semialgebraic proofs with restricted degree of falsity

    Kojevnikov, A. & Kulikov, A. S., 1 Jan 2006, Theory and Applications of Satisfiability Testing, SAT 2006 - 9th International Conference, Proceedings. Springer Nature, p. 11-21 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4121 LNCS).

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

  65. 2005

  66. On some problems of computational geometry: Isogeometric smoothing and geometric search

    Kulikov, A., 1 Dec 2005.

    Research output: Contribution to conference › Paper › peer-review

Previous 1 2 Next

ID: 9512817