| SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing A Bankevich, S Nurk, D Antipov, AA Gurevich, M Dvorkin, AS Kulikov, ... Journal of computational biology 19 (5), 455-477, 2012 | 24240 | 2012 |
| Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface M Okada, I Satoh Lecture notes in computer science (including subseries lecture notes in …, 2007 | 178* | 2007 |
| SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing B Anton, N Sergey, A Dmitry, AA Gurevich, D Mikhail, AS Kulikov, ... J Comput Biol 19 (5), 455-477, 2012 | 116 | 2012 |
| Finding efficient circuits using SAT-solvers A Kojevnikov, A Kulikov, G Yaroslavtsev Theory and Applications of Satisfiability Testing-SAT 2009, 32-44, 2009 | 59 | 2009 |
| A new approach to proving upper bounds for MAX-2-SAT A Kojevnikov, AS Kulikov Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete …, 2006 | 59 | 2006 |
| New upper bounds on the Boolean circuit complexity of symmetric functions E Demenkov, A Kojevnikov, A Kulikov, G Yaroslavtsev Information Processing Letters 110 (7), 264-267, 2010 | 50 | 2010 |
| On covering graphs by complete bipartite subgraphs S Jukna, AS Kulikov Discrete Mathematics 309 (10), 3399-3403, 2009 | 50 | 2009 |
| An Elementary Proof of a 3n− o (n) Lower Bound on the Circuit Complexity of Affine Dispersers E Demenkov, A Kulikov Mathematical Foundations of Computer Science 2011, 256-265, 2011 | 48 | 2011 |
| A 2^{|E|/4}-Time Algorithm For Max-Cut SS Fedin, AS Kulikov | 46* | 2002 |
| Tight bounds for graph homomorphism and subgraph isomorphism M Cygan, FV Fomin, A Golovnev, AS Kulikov, I Mihajlin, J Pachocki, ... Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016 | 36 | 2016 |
| Tight lower bounds on graph embedding problems M Cygan, FV Fomin, A Golovnev, AS Kulikov, I Mihajlin, J Pachocki, ... Journal of the ACM (JACM) 64 (3), 1-22, 2017 | 29 | 2017 |
| Automated generation of simplification rules for SAT and MAXSAT A Kulikov Theory and Applications of Satisfiability Testing, 43-59, 2005 | 27 | 2005 |
| New bounds for MAX-SAT by clause learning A Kulikov, K Kutzkov Computer Science–Theory and Applications, 194-204, 2007 | 26 | 2007 |
| Automated proofs of upper bounds on the running time of splitting algorithms SS Fedin, AS Kulikov Parameterized and Exact Computation, 248-259, 2004 | 26* | 2004 |
| Approximating shortest superstring problem using de bruijn graphs A Golovnev, AS Kulikov, I Mihajlin Annual Symposium on Combinatorial Pattern Matching, 120-129, 2013 | 25 | 2013 |
| Parameterized complexity of secluded connectivity problems FV Fomin, PA Golovach, N Karpov, AS Kulikov Theory of Computing Systems 61, 795-819, 2017 | 22 | 2017 |
| Circuit complexity and multiplicative complexity of Boolean functions A Kojevnikov, A Kulikov Programs, Proofs, Processes, 239-245, 2010 | 22 | 2010 |
| Computing majority by constant depth majority circuits with low fan-in gates AS Kulikov, VV Podolskii Theory of Computing Systems 63, 956-986, 2019 | 21 | 2019 |
| Circuit depth reductions A Golovnev, AS Kulikov, RR Williams arXiv preprint arXiv:1811.04828, 2018 | 18 | 2018 |
| Weighted gate elimination: Boolean dispersers for quadratic varieties imply improved circuit lower bounds A Golovnev, AS Kulikov Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016 | 17 | 2016 |
Sergey NikolenkoSteklov Institute of Mathematics at St. Petersburg, Russia確認したメール アドレス: logic.pdmi.ras.ru