Wojciech Czerwinski

Cited by

	All	Since 2018
Citations	722	499
h-index	16	12
i10-index	22	15

120

20122013201420152016201720182019202020212022202312 24 43 31 33 68 44 77 86 108 108 75

Public access

View all

13 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Slawomir LasotaUniversity of Warsaw, prof. of computer scienceVerified email at mimuw.edu.pl
Wim MartensUniversity of BayreuthVerified email at uni-bayreuth.de
Piotrek HofmanUniversity of WarsawVerified email at mimuw.edu.pl
Paweł ParysUniwersytet WarszawskiVerified email at mimuw.edu.pl
Ranko LazicDepartment of Computer Science, University of WarwickVerified email at warwick.ac.uk
Filip MazowieckiUniversity of WarsawVerified email at mimuw.edu.pl
Łukasz OrlikowskiUniversity of WarsawVerified email at students.mimuw.edu.pl
Jerome LerouxCNRS researcher, LaBRI, FranceVerified email at labri.fr
Georg ZetzscheMPI-SWS, GermanyVerified email at mpi-sws.org
Michał PilipczukUniversity of WarsawVerified email at mimuw.edu.pl
Marcin PilipczukInstytut Informatyki, Uniwersytet WarszawskiVerified email at mimuw.edu.pl
Lorenzo ClementeUniversity of WarsawVerified email at mimuw.edu.pl
Charles PapermanMaitre de Conférence à l'université de LilleVerified email at inria.fr
Tomas MasopustFaculty of Science, Palacky University OlomoucVerified email at upol.cz
Nathanaël FijalkowCNRS, LaBRI, Bordeaux, and University of WarsawVerified email at labri.fr
Laure DaviaudCity, University of LondonVerified email at city.ac.uk
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Roland MeyerProfessor of Theoretical Computer ScienceVerified email at tu-bs.de
Filip MurlakAssociate Professor, University of WarsawVerified email at mimuw.edu.pl
Diego FigueiraCNRS, LaBRI, Univ. BordeauxVerified email at labri.fr

Wojciech Czerwinski

University of Warsaw

Verified email at mimuw.edu.pl - Homepage

automata theory infinite state systems logic


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The reachability problem for Petri nets is not elementary W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki Journal of the ACM (JACM) 68 (1), 1-28, 2020	143	2020
Efficient separability of regular languages by subsequences and suffixes W Czerwiński, W Martens, T Masopust International Colloquium on Automata, Languages, and Programming, 150-161, 2013	70	2013
Reachability in vector addition systems is Ackermann-complete W Czerwiński, Ł Orlikowski 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022	51	2022
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	50	2019
A Characterization for Decidable Separability by Piecewise Testable Languages G Zetzsche, M Zeitoun, L van Rooijen, W Martens, W Czerwiński Discrete Mathematics & Theoretical Computer Science 19, 2017	45*	2017
Deciding definability by deterministic regular expressions W Czerwiński, C David, K Losemann, W Martens Journal of Computer and System Sciences, 2017	33*	2017
Regular Separability of One Counter Automata S Lasota, W Czerwiński Logical Methods in Computer Science 15, 2019	27*	2019
Decidability of branching bisimulation on normed commutative context-free processes W Czerwiński, P Hofman, S Lasota Theory of Computing Systems 55 (1), 136-169, 2014	23	2014
Shortest paths in one-counter systems M Wehar, M Pilipczuk, P Hofman, W Czerwiński, D Chistikov Logical Methods in Computer Science 15, 2019	21*	2019
Regular Separability of Parikh Automata L Clemente, W Czerwiński, S Lasota, C Paperman arXiv preprint arXiv:1612.06233, 2016	21	2016
Fast equivalence-checking for normed context-free processes. W Czerwinski, S Lasota FSTTCS 2010, 260-271, 2010	21	2010
Minimization of Tree Patterns W CzerwiŃski, W Martens, M Niewerth, P Parys Journal of the ACM (JACM) 65 (4), 26, 2018	19*	2018
Regular separability of well structured transition systems W Czerwiński, S Lasota, R Meyer, S Muskalla, KN Kumar, P Saivasan arXiv preprint arXiv:1702.05334, 2017	19	2017
The (almost) complete guide to tree pattern containment W Czerwiński, W Martens, P Parys, M Przybylko Proceedings of the 34th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2015	18	2015
Improved bounds for the excluded-minor approximation of treedepth W Czerwinski, W Nadara, M Pilipczuk SIAM Journal on Discrete Mathematics 35 (2), 934-947, 2021	17	2021
Separability of Reachability Sets of Vector Addition Systems L Clemente, W Czerwiński, S Lasota, C Paperman arXiv preprint arXiv:1609.00214, 2016	17	2016
Reachability Problem for Weak Multi-Pushdown Automata SŁ Lasota, P Hofman, W Czerwiński Logical Methods in Computer Science 9, 2013	15*	2013
Partially-commutative context-free processes: Expressibility and tractability W Czerwiński, S Fröschle, S Lasota Information and Computation 209 (5), 782-798, 2011	15*	2011
Efficient fully dynamic elimination forests with applications to detecting long paths and cycles J Chen, W Czerwiński, Y Disser, AE Feldmann, D Hermelin, W Nadara, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021	14	2021
Partially-commutative context-free languages W Czerwiński, S Lasota arXiv preprint arXiv:1208.2747, 2012	11	2012

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