Alexander S. Kulikov

Cited by

	All	Since 2015
Citations	11190	10645
h-index	16	12
i10-index	26	15

3200

1600

800

2400

20122013201420152016201720182019202042 77 195 522 1015 1471 1873 2587 3171

Co-authors

Sergey NikolenkoSteklov Institute of Mathematics at St. Petersburg, RussiaVerified email at logic.pdmi.ras.ru
Mikhail DvorkinSt. Petersburg Academic UniversityVerified email at rain.ifmo.ru
Alexey GurevichSenior Researcher @ Center for Algorithmic Biotechnology, Saint Petersburg State UniversityVerified email at spbu.ru
Anton BankevichUCSDVerified email at eng.ucsd.edu
Son PhamUCSDVerified email at eng.ucsd.edu
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
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 NurkVisiting Fellow, NHGRI, NIHVerified email at nih.gov
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
Edward A. HirschResearch Lead, Steklov Institute of Mathematics at St.PetersburgVerified email at pdmi.ras.ru
Grigory YaroslavtsevAssistant Professor, Indiana University, BloomingtonVerified email at grigory.us
Marek CyganUniversity of WarsawVerified email at mimuw.edu.pl
Arkadiusz SocałaUniversity of WarsawVerified email at mimuw.edu.pl
Konstantin KutzkovAmalfi AnalyticsVerified email at amalfianalytics.com

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	10515	2012
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	51	2006
A 2^{\|E\|/4}-Time Algorithm For Max-Cut SS Fedin, AS Kulikov	45*	2002
Finding efficient circuits using SAT-solvers A Kojevnikov, A Kulikov, G Yaroslavtsev Theory and Applications of Satisfiability Testing-SAT 2009, 32-44, 2009	42	2009
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	40*	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	37	2010
On covering graphs by complete bipartite subgraphs S Jukna, AS Kulikov Discrete Mathematics 309 (10), 3399-3403, 2009	34	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	31	2011
New bounds for MAX-SAT by clause learning A Kulikov, K Kutzkov Computer Science–Theory and Applications, 194-204, 2007	25	2007
Automated proofs of upper bounds on the running time of splitting algorithms SS Fedin, AS Kulikov Parameterized and Exact Computation, 248-259, 2004	23*	2004
Automated generation of simplification rules for SAT and MAXSAT A Kulikov Theory and Applications of Satisfiability Testing, 43-59, 2005	22	2005
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	20	2016
Approximating shortest superstring problem using de bruijn graphs A Golovnev, AS Kulikov, I Mihajlin Annual Symposium on Combinatorial Pattern Matching, 120-129, 2013	20	2013
Circuit complexity and multiplicative complexity of Boolean functions A Kojevnikov, A Kulikov Programs, Proofs, Processes, 239-245, 2010	19	2010
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	18	2017
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
Computing majority by constant depth majority circuits with low fan-in gates AS Kulikov, VV Podolskii Theory of Computing Systems 63 (5), 956-986, 2019	15	2019
Parameterized complexity of secluded connectivity problems FV Fomin, PA Golovach, N Karpov, AS Kulikov Theory of Computing Systems 61 (3), 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
Theory and Applications of Satisfiability Testing F Bacchus, T Walsh Springer Berlin/Heidelberg., 2005	12	2005

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

Upload PDF

Follow this author

Cited by

Co-authors