Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Czerwiński, Wojciech
293  Ergebnisse:
Personensuche X
?
1

The boundedness and zero isolation problems for weighted au..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,
Czerwiński, Wojciech ; Lefaucheux, Engel ; Mazowiecki, Filip.. - p. 1-13 , 2022
Link: https://dl.acm.org/doi/1..
 
?
2

Reachability in Vector Addition Systems is Ackermann-comple..:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Czerwinski, Wojciech ; Orlikowski, Lukasz - p. 1229-1240 , 2022
Link: https://doi.org/10.1109/..
 
?
3

Lower Bounds for the Reachability Problem in Fixed Dimensio..:

, In: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science,
Czerwinski, Wojciech ; Orlikowski, Lukasz - p. 1-12 , 2022
Link: https://dl.acm.org/doi/1..
 
?
4

Improved Bounds for the Excluded-Minor Approximation of Tre..:

Czerwiński, Wojciech ; Nadara, Wojciech ; Pilipczuk, Marcin
SIAM Journal on Discrete Mathematics.  35 (2021)  2 - p. 934-947 , 2021
Link: https://doi.org/10.1137/..
 
?
5

Efficient fully dynamic elimination forests with applicatio..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,
Chen, Jiehua ; Czerwiński, Wojciech ; Disser, Yann... - p. 796-809 , 2021
Link: https://dl.acm.org/doi/1..
 
?
6

Efficient fully dynamic elimination forests with applicatio..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),
Chen, Jiehua ; Czerwiński, Wojciech ; Disser, Yann... - p. 796-809 , 2021
Link: https://doi.org/10.1137/..
 
?
7

The Reachability Problem for Petri Nets Is Not Elementary:

Czerwiński, Wojciech ; Lasota, Sławomir ; Lazić, Ranko..
Journal of the ACM.  68 (2020)  1 - p. 1-28 , 2020
Link: https://doi.org/10.1145/..
 
?
8

An Approach to Regular Separability in Vector Addition Syst..:

, In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
Czerwiński, Wojciech ; Zetzsche, Georg - p. 341-354 , 2020
Link: https://dl.acm.org/doi/1..
 
?
9

Influence of heart rate on FFR measurements: An experimenta..:

Kwasiborski, Przemysław J. ; Czerwiński, Wojciech ; Kowalczyk, Paweł...
International Journal of Cardiology.  317 (2020)  - p. 13-17 , 2020
Link: https://doi.org/10.1016/..
 
?
10

The Reachability Problem for Petri Nets Is Not Elementary:

Czerwiński, Wojciech ; Lasota, Sławomir ; Lazić, Ranko..
Journal of the ACM (JACM).  68 (2020)  1 - p. 1-28 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

Universal trees grow inside separating automata : quasi-..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
Czerwiński, Wojciech ; Daviaud, Laure ; Fijalkow, Nathanaël... - p. 2333-2349 , 2019
Link: https://dl.acm.org/doi/1..
 
?
12

The reachability problem for Petri nets is not elementary:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,
Czerwiński, Wojciech ; Lasota, Sławomir ; Lazić, Ranko.. - p. 24-33 , 2019
Link: https://dl.acm.org/doi/1..
 
?
13

Minimization of Tree Patterns:

CzerwiŃski, Wojciech ; Martens, Wim ; Niewerth, Matthias.
Journal of the ACM.  65 (2018)  4 - p. 1-46 , 2018
Link: https://doi.org/10.1145/..
 
?
14

Minimization of Tree Patterns:

CzerwiŃski, Wojciech ; Martens, Wim ; Niewerth, Matthias.
Journal of the ACM (JACM).  65 (2018)  4 - p. 1-46 , 2018
Link: https://dl.acm.org/doi/1..
 
?
15

Optimizing Tree Patterns for Querying Graph- and Tree-Struc..:

Czerwinski, Wojciech ; Martens, Wim ; Niewerth, Matthias.
ACM SIGMOD Record.  46 (2017)  1 - p. 15-22 , 2017
Link: https://doi.org/10.1145/..
 
1-15