| Parallel and sequential approximation of shortest superstrings A Czumaj, L Gasieniec, M Piotrów, W Rytter Algorithm Theory—SWAT'94: 4th Scandinavian Workshop on Algorithm Theory …, 1994 | 46 | 1994 |
| Uwrmaxsat: Efficient solver for maxsat and pseudo-boolean problems M Piotrów 2020 IEEE 32nd International Conference on Tools with Artificial …, 2020 | 38 | 2020 |
| Encoding cardinality constraints using multiway merge selection networks M Karpiński, M Piotrów Constraints 24, 234-251, 2019 | 28 | 2019 |
| 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 | 27 | 1997 |
| Depth Optimal Sorting Networks Resistant to k Passive Faults M Piotrów SIAM Journal on Computing 33 (6), 1484-1512, 2004 | 17 | 2004 |
| Uwrmaxsat-a new minisat+-based solver in maxsat evaluation 2019 M Piotrów MaxSAT Evaluation 2019, 11, 2019 | 15 | 2019 |
| Competitive sorter-based encoding of pb-constraints into sat M Karpinski, M Piotrów, DL Berre, M Jarvisalo Proceedings of Pragmatics of SAT, 65-78, 2015 | 10 | 2015 |
| Correction networks M Kik, M Kutylowski, M Piotrów Proceedings of the 1999 International Conference on Parallel Processing, 40-47, 1999 | 10 | 1999 |
| Smaller selection networks for cardinality constraints encoding M Karpiński, M Piotrów Principles and Practice of Constraint Programming: 21st International …, 2015 | 8 | 2015 |
| Uwrmaxsat in maxsat evaluation 2021 M Piotrów MaxSAT Evaluation 2021, 17, 2021 | 7 | 2021 |
| UWrMaxSat: an efficient solver in MaxSAT Evaluation 2020 M Piotrów MaxSAT Evaluation 2020, 34, 2020 | 6 | 2020 |
| Incremental encoding of pseudo-boolean goal functions based on comparator networks M Karpiński, M Piotrów Theory and Applications of Satisfiability Testing–SAT 2020: 23rd …, 2020 | 6 | 2020 |
| 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 |
| Periodic, random-fault-tolerant correction networks M Piotrów Proceedings of the thirteenth annual ACM symposium on Parallel algorithms …, 2001 | 5 | 2001 |
| On complexity of counting M Piotrow Mathematical Foundations of Computer Science 1988: Proceedings of the 13th …, 1988 | 5 | 1988 |
| The characterization of some complexity classes by recursion schemata M Liskiewicz, K Lorys, M Piotrow Colloquia Mathematica Societatis J anos Bolyai 44, 313-322, 1984 | 5 | 1984 |
| A note on constructing binary heaps with periodic networks M Piotrów Information processing letters 83 (3), 129-134, 2002 | 4 | 2002 |
| Parallel and sequential approximation of shortest superstrings, 4th SWAT, LNCS vol. 824 A Czumaj, L Gasieniec, M Piotrow, W Rytter Springer-Verlag, 1994 | 4 | 1994 |
| Reliable minimum finding comparator networks P Denejko, K Diks, A Pelc, M Piotrów Mathematical Foundations of Computer Science 1994: 19th International …, 1994 | 4 | 1994 |
| Encoding cardinality constraints using generalized selection networks M Karpiński, M Piotrów arXiv preprint arXiv:1704.04389, 2017 | 3 | 2017 |
Artur CzumajProfessor of Computer Science, University of Warwick, UKZweryfikowany adres z warwick.ac.uk
