Alexander S. Kulikov

Cited by

	All	Since 2018
Citations	18982	15111
h-index	17	12
i10-index	31	16

3700

1850

925

2775

20122013201420152016201720182019202020212022202359 76 192 527 1109 1630 1938 2665 3319 3640 3298 245

Public access

View all

11 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Mikhail DvorkinSt. Petersburg Academic UniversityVerified email at rain.ifmo.ru
Alexey GurevichJun. Prof. of Bioinformatics, Helmholtz Inst. for Pharm. Res. Saarland (HIPS) & Saarland UniversityVerified email at helmholtz-hips.de
Anton BankevichPSUVerified email at psu.edu
Sergey NikolenkoSteklov Institute of Mathematics at St. Petersburg, RussiaVerified email at logic.pdmi.ras.ru
Pavel PevznerProfessor of Computer Science, University of California at San DiegoVerified email at eng.ucsd.edu
Max A. AlekseyevGeorge Washington UniversityVerified email at gwu.edu
Son PhamBioTuringVerified email at bioturing.com
Alexander SirotkinNational Research University Higher School of EconomicsVerified email at hse.ru
Nikolay Vyahhi-Verified email at bioinf.spbau.ru
Andrey PrjibelskiSenior Research Fellow @ Saint-Petersburg State UniversityVerified email at spbu.ru
Sergey NurkSenior Applications Bioinformatician, Oxford Nanopore TechnologiesVerified email at nanoporetech.com
Alexander GolovnevGeorgetown UniversityVerified email at cims.nyu.edu
Ivan MihajlinUCSDVerified email at eng.ucsd.edu
Arist KojevnikovSenior Development Engineer, OneSpin Solutions GmbHVerified email at logic.pdmi.ras.ru
Fedor V. FominProfessor of Computer Science, University of BergenVerified email at uib.no
Evgeniy DemenkovVerified email at arrival.com
Edward A. HirschTechnionVerified email at technion.ac.il
Stasys JuknaVilnius University, LithuaniaVerified email at mii.vu.lt
Grigory YaroslavtsevAssistant Professor, George Mason UniversityVerified email at grigory.us
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl

Alexander S. Kulikov

Steklov Institute of Mathematics at St. Petersburg

Verified email at logic.pdmi.ras.ru - Homepage

Algorithms Circuit complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	17783	2012
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006	397*	2006
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	55	2006
Finding efficient circuits using SAT-solvers A Kojevnikov, A Kulikov, G Yaroslavtsev Theory and Applications of Satisfiability Testing-SAT 2009, 32-44, 2009	52	2009
On covering graphs by complete bipartite subgraphs S Jukna, AS Kulikov Discrete Mathematics 309 (10), 3399-3403, 2009	45	2009
A 2^{\|E\|/4}-Time Algorithm For Max-Cut SS Fedin, AS Kulikov	45*	2002
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	42	2010
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	39	2011
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	27	2016
New bounds for MAX-SAT by clause learning A Kulikov, K Kutzkov Computer Science–Theory and Applications, 194-204, 2007	25	2007
Automated generation of simplification rules for SAT and MAXSAT A Kulikov Theory and Applications of Satisfiability Testing, 43-59, 2005	24	2005
Automated proofs of upper bounds on the running time of splitting algorithms SS Fedin, AS Kulikov Parameterized and Exact Computation, 248-259, 2004	24*	2004
Approximating shortest superstring problem using de bruijn graphs A Golovnev, AS Kulikov, I Mihajlin Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad …, 2013	23	2013
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	21	2017
Circuit complexity and multiplicative complexity of Boolean functions A Kojevnikov, A Kulikov Programs, Proofs, Processes, 239-245, 2010	21	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	19	2019
Design and Synthesis of Nitrogen‐Rich Azo‐Bridged Furoxanylazoles as High‐Performance Energetic Materials AA Larin, AV Shaferov, AS Kulikov, AN Pivkina, KA Monogarov, ... Chemistry–A European Journal 27 (59), 14628-14637, 2021	18	2021
An upper bound O(2^0.16254n) for Exact 3-Satisfiability: a simpler proof AS Kulikov Zapiski nauchnykh seminarov POMI 293, 118-128, 2002	17	2002
Parameterized complexity of secluded connectivity problems FV Fomin, PA Golovach, N Karpov, AS Kulikov Theory of Computing Systems 61, 795-819, 2017	13	2017
On convex complexity measures P Hrubeš, S Jukna, A Kulikov, P Pudlak Theoretical Computer Science 411 (16-18), 1842-1854, 2010	13	2010

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors