| Parallel and sequential approximation of shortest superstrings A Czumaj, L Gasieniec, M Piotrów, W Rytter Scandinavian Workshop on Algorithm Theory, 95-106, 1994 | 42 | 1994 |
| 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 | 26 | 1997 |
| Depth Optimal Sorting Networks Resistant to k Passive Faults. M Piotrów SODA, 242-251, 1996 | 11 | 1996 |
| Correction networks M Kik, M Kutylowski, M Piotrów Proceedings of the 1999 International Conference on Parallel Processing, 40-47, 1999 | 10 | 1999 |
| Encoding cardinality constraints using multiway merge selection networks M Karpiński, M Piotrów Constraints 24 (3-4), 234-251, 2019 | 8 | 2019 |
| UWrMaxSat-a new MiniSat+-based Solver in MaxSAT Evaluation 2019 M Piotrów MaxSAT Evaluation 2019, 11, 2019 | 7 | 2019 |
| Smaller selection networks for cardinality constraints encoding M Karpiński, M Piotrów International Conference on Principles and Practice of Constraint …, 2015 | 7 | 2015 |
| Depth Optimal Sorting Networks Resistant to k Passive Faults M Piotrów SIAM Journal on Computing 33 (6), 1484-1512, 2004 | 7 | 2004 |
| Periodic, random-fault-tolerant correction networks M Piotrów Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001 | 6 | 2001 |
| Parallel and sequential approximation of shortest superstrings, 4th SWAT, LNCS vol. 824 A Czumaj, L Gasieniec, M Piotrow, W Rytter Springer-Verlag, 1994 | 6 | 1994 |
| On reversal bounded alternating Turing machines M Liśkiewicz, K Loryś, M Piotrów Theoretical computer science 54 (2-3), 331-339, 1987 | 6 | 1987 |
| Competitive sorter-based encoding of pb-constraints into sat M Karpinski, M Piotrów Proceedings of Pragmatics of SAT, 65-78, 2015 | 5 | 2015 |
| On complexity of counting M Piotrow International Symposium on Mathematical Foundations of Computer Science, 472-482, 1988 | 5 | 1988 |
| A note on constructing binary heaps with periodic networks M Piotrów Information processing letters 83 (3), 129-134, 2002 | 4 | 2002 |
| 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 | 4 | 1994 |
| Encoding cardinality constraints using generalized selection networks M Karpiński, M Piotrów arXiv preprint arXiv:1704.04389, 2017 | 3 | 2017 |
| Reliable minimum finding comparator networks P Denejko, K Diks, A Pelc, M Piotrów Fundamenta Informaticae 42 (3, 4), 235-249, 2000 | 3 | 2000 |
| 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 | 2 | 2020 |
| Brief announcement: faster 3-periodic merging networks M Piotrów Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014 | 1 | 2014 |
| Faster 3-periodic merging networks M Piotrów arXiv preprint arXiv:1401.0396, 2014 | 1 | 2014 |
Artur CzumajProfessor of Computer Science, University of Warwick, UKZweryfikowany adres z warwick.ac.uk
