Marek Piotrów
Marek Piotrów
Instytut Informatyki, Uniwersytet Wrocławski
Zweryfikowany adres z cs.uni.wroc.pl
Tytuł
Cytowane przez
Cytowane przez
Rok
Parallel and sequential approximation of shortest superstrings
A Czumaj, L Gasieniec, M Piotrów, W Rytter
Scandinavian Workshop on Algorithm Theory, 95-106, 1994
421994
Sequential and parallel approximation of shortest superstrings
A Czumaj, L Gąsieniec, M Piotrów, W Rytter
Journal of Algorithms 23 (1), 74-100, 1997
261997
Depth Optimal Sorting Networks Resistant to k Passive Faults.
M Piotrów
SODA, 242-251, 1996
111996
Correction networks
M Kik, M Kutylowski, M Piotrów
Proceedings of the 1999 International Conference on Parallel Processing, 40-47, 1999
101999
Encoding cardinality constraints using multiway merge selection networks
M Karpiński, M Piotrów
Constraints 24 (3-4), 234-251, 2019
82019
UWrMaxSat-a new MiniSat+-based Solver in MaxSAT Evaluation 2019
M Piotrów
MaxSAT Evaluation 2019, 11, 2019
72019
Smaller selection networks for cardinality constraints encoding
M Karpiński, M Piotrów
International Conference on Principles and Practice of Constraint …, 2015
72015
Depth Optimal Sorting Networks Resistant to k Passive Faults
M Piotrów
SIAM Journal on Computing 33 (6), 1484-1512, 2004
72004
Periodic, random-fault-tolerant correction networks
M Piotrów
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001
62001
Parallel and sequential approximation of shortest superstrings, 4th SWAT, LNCS vol. 824
A Czumaj, L Gasieniec, M Piotrow, W Rytter
Springer-Verlag, 1994
61994
On reversal bounded alternating Turing machines
M Liśkiewicz, K Loryś, M Piotrów
Theoretical computer science 54 (2-3), 331-339, 1987
61987
Competitive sorter-based encoding of pb-constraints into sat
M Karpinski, M Piotrów
Proceedings of Pragmatics of SAT, 65-78, 2015
52015
On complexity of counting
M Piotrow
International Symposium on Mathematical Foundations of Computer Science, 472-482, 1988
51988
A note on constructing binary heaps with periodic networks
M Piotrów
Information processing letters 83 (3), 129-134, 2002
42002
Reliable minimum finding comparator networks
P Denejko, K Diks, A Pelc, M Piotrów
International Symposium on Mathematical Foundations of Computer Science, 306-315, 1994
41994
Encoding cardinality constraints using generalized selection networks
M Karpiński, M Piotrów
arXiv preprint arXiv:1704.04389, 2017
32017
Reliable minimum finding comparator networks
P Denejko, K Diks, A Pelc, M Piotrów
Fundamenta Informaticae 42 (3, 4), 235-249, 2000
32000
Incremental encoding of pseudo-boolean goal functions based on comparator networks
M Karpiński, M Piotrów
International Conference on Theory and Applications of Satisfiability …, 2020
22020
Brief announcement: faster 3-periodic merging networks
M Piotrów
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
12014
Faster 3-periodic merging networks
M Piotrów
arXiv preprint arXiv:1401.0396, 2014
12014
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20