Edit Profile Czerwiński, Wojciech Compute Distance To: Compute Author ID: czerwinski.wojciech Published as: Czerwiński, Wojciech Documents Indexed: 27 Publications since 2009 all top 5 Co-Authors 0 single-authored 12 Lasota, Sławomir 6 Hofman, Piotr 6 Martens, Wim 4 David, Claire 4 Parys, Paweł 2 Chistikov, Dmitry V. 2 Clemente, Lorenzo 2 Fröschle, Sibylle B. 2 Jančar, Petr 2 Lazić, Ranko 2 Losemann, Katja 2 Murlak, Filip 2 Paperman, Charles 2 Pilipczuk, Michał 2 van Rooijen, Lorijn 2 Wehar, Michael 2 Zeitoun, Marc 2 Zetzsche, Georg 1 Daviaud, Laure 1 Fijalkow, Nathanaël 1 Gogacz, Tomasz 1 Jurdziński, Marcin 1 Kopczyński, Eryk 1 Kot, Martin 1 Leroux, Jérôme 1 Masopust, Tomáš 1 Mazowiecki, Filip 1 Niewerth, Matthias 1 Sawa, Zdeněk all top 5 Serials 3 Logical Methods in Computer Science 2 Theory of Computing Systems 1 Journal of Computer and System Sciences 1 Information and Computation 1 Journal of the ACM 1 Discrete Mathematics and Theoretical Computer Science. DMTCS 1 Fundamenta Informaticae Fields 26 Computer science (68-XX) 2 Combinatorics (05-XX) 1 Game theory, economics, finance, and other social and behavioral sciences (91-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 17 Publications have been cited 43 times in 38 Documents Cited by ▼ Year ▼ Deciding definability by deterministic regular expressions. Zbl 1260.68199Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim 9 2013 Efficient separability of regular languages by subsequences and suffixes. Zbl 1334.68115Czerwiński, Wojciech; Martens, Wim; Masopust, Tomáš 8 2013 A note on decidable separability by piecewise testable languages. Zbl 1434.68242Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc 4 2015 Fast equivalence-checking for normed context-free processes. Zbl 1245.68134Czerwiński, Wojciech; Lasota, Sławomir 4 2010 The reachability problem for Petri nets is not elementary. Zbl 1433.68245Czerwiński, Wojciech; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Mazowiecki, Filip 3 2019 Shortest paths in one-counter systems. Zbl 06591836Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael 2 2016 Reachability problem for weak multi-pushdown automata. Zbl 1364.68247Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 2 2012 Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 2 2011 Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games. Zbl 1432.68223Czerwiński, Wojciech; Daviaud, Laure; Fijalkow, Nathanaël; Jurdziński, Marcin; Lazić, Ranko; Parys, Paweł 1 2019 Minimization of tree patterns. Zbl 1426.68076Czerwiński, Wojciech; Martens, Wim; Niewerth, Matthias; Parys, Paweł 1 2018 A characterization for decidable separability by piecewise testable languages. Zbl 1400.68101Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc; Zetzsche, Georg 1 2017 Separability of reachability sets of vector addition systems. Zbl 1402.68132Clemente, Lorenzo; Czerwiński, Wojciech; Lasota, Sławomir; Paperman, Charles 1 2017 Deciding definability by deterministic regular expressions. Zbl 1371.68146Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim 1 2017 Branching bisimilarity of normed BPA processes is in NExpTime. Zbl 1392.68292Czerwiński, Wojciech; Jančar, Petr 1 2015 Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 1 2014 Reachability problem for weak multi-pushdown automata. Zbl 1274.68156Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 1 2013 Partially-commutative context-free processes. Zbl 1254.68164Czerwiński, Wojciech; Fröschle, Sibylle; Lasota, Sławomir 1 2009 The reachability problem for Petri nets is not elementary. Zbl 1433.68245Czerwiński, Wojciech; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Mazowiecki, Filip 3 2019 Universal trees grow inside separating automata: quasi-polynomial lower bounds for parity games. Zbl 1432.68223Czerwiński, Wojciech; Daviaud, Laure; Fijalkow, Nathanaël; Jurdziński, Marcin; Lazić, Ranko; Parys, Paweł 1 2019 Minimization of tree patterns. Zbl 1426.68076Czerwiński, Wojciech; Martens, Wim; Niewerth, Matthias; Parys, Paweł 1 2018 A characterization for decidable separability by piecewise testable languages. Zbl 1400.68101Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc; Zetzsche, Georg 1 2017 Separability of reachability sets of vector addition systems. Zbl 1402.68132Clemente, Lorenzo; Czerwiński, Wojciech; Lasota, Sławomir; Paperman, Charles 1 2017 Deciding definability by deterministic regular expressions. Zbl 1371.68146Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim 1 2017 Shortest paths in one-counter systems. Zbl 06591836Chistikov, Dmitry; Czerwiński, Wojciech; Hofman, Piotr; Pilipczuk, Michał; Wehar, Michael 2 2016 A note on decidable separability by piecewise testable languages. Zbl 1434.68242Czerwiński, Wojciech; Martens, Wim; van Rooijen, Lorijn; Zeitoun, Marc 4 2015 Branching bisimilarity of normed BPA processes is in NExpTime. Zbl 1392.68292Czerwiński, Wojciech; Jančar, Petr 1 2015 Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 1 2014 Deciding definability by deterministic regular expressions. Zbl 1260.68199Czerwiński, Wojciech; David, Claire; Losemann, Katja; Martens, Wim 9 2013 Efficient separability of regular languages by subsequences and suffixes. Zbl 1334.68115Czerwiński, Wojciech; Martens, Wim; Masopust, Tomáš 8 2013 Reachability problem for weak multi-pushdown automata. Zbl 1274.68156Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 1 2013 Reachability problem for weak multi-pushdown automata. Zbl 1364.68247Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 2 2012 Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir 2 2011 Fast equivalence-checking for normed context-free processes. Zbl 1245.68134Czerwiński, Wojciech; Lasota, Sławomir 4 2010 Partially-commutative context-free processes. Zbl 1254.68164Czerwiński, Wojciech; Fröschle, Sibylle; Lasota, Sławomir 1 2009 all cited Publications top 5 cited Publications all top 5 Cited by 77 Authors 5 Czerwiński, Wojciech 4 Lasota, Sławomir 4 Place, Thomas 3 Chen, Haiming 3 Hofman, Piotr 3 Jančar, Petr 3 Lu, Ping 3 Martens, Wim 3 Masopust, Tomáš 2 Krishna, Shankara Narayanan 2 Kucera, Antonin 2 Losemann, Katja 2 Parys, Paweł 2 Thomazo, Michaël 2 Zeitoun, Marc 1 Akshay, S. 1 Baez, John C. 1 Bhave, Devendra 1 Björklund, Henrik 1 Böhm, Stanislav 1 Bollig, Benedikt 1 Boneva, Iovka 1 Brázdil, Tomáš 1 Bremer, Joachim 1 Brihaye, Thomas 1 Chatterjee, Krishnendu 1 Chistikov, Dmitry V. 1 Ciucanu, Radu 1 Dave, Vrunda 1 David, Claire 1 Delgrange, Florent 1 Englert, Matthias 1 Forejt, Vojtěch 1 Freydenberger, Dominik D. 1 Fröschle, Sibylle B. 1 Fu, Yuxi 1 Gastin, Paul 1 Göller, Stefan 1 Groz, Benoît 1 Hague, Matthew 1 Holub, Štěpán 1 Huang, Mingzhang 1 Jeż, Artur 1 Karandikar, Prateek 1 Kiefer, Stefan 1 Krötzsch, Markus 1 Kufleitner, Manfred 1 Lazić, Ranko 1 Leroux, Jérôme 1 Lin, Anthony Widjaja 1 Maneth, Sebastian 1 Master, Jade 1 Mayr, Richard M. 1 Niewerth, Matthias 1 Novotný, Petr 1 Oualhadj, Youssouf 1 Peng, Feifei 1 Phawade, Ramchandra 1 Pierron, Théo 1 Pilipczuk, Michał 1 Quaas, Karin 1 Ramanathan, Varun 1 Randour, Mickael 1 Sangnier, Arnaud 1 Schmid, Markus L. 1 Schnoebelen, Philippe 1 Schwentick, Thomas 1 Staworko, Sławek 1 Straszyński, Juliusz 1 Trivedi, Ashutosh 1 Velan, Dominik 1 Wehar, Michael 1 Weil, Pascal 1 Worrell, James B. 1 Wu, Zhilin 1 Yin, Qiang 1 Zheng, Lixiao all top 5 Cited in 8 Serials 9 Logical Methods in Computer Science 6 Journal of Computer and System Sciences 5 Information and Computation 4 Theoretical Computer Science 4 Theory of Computing Systems 2 Information Processing Letters 1 Acta Informatica 1 MSCS. Mathematical Structures in Computer Science Cited in 3 Fields 37 Computer science (68-XX) 6 Mathematical logic and foundations (03-XX) 1 Category theory; homological algebra (18-XX) Citations by Year