Marek Piotrów

Publication Activity (10 Years)

Years Active: 1987-2022
Publications (10 Years): 8

Top Topics

Combinatorial Problems

Cardinality Constraints

Top Venues

Constraints An Int. J.

Publications

Michal Karpinski, Marek Piotrów
Reusing Comparator Networks in Pseudo-Boolean Encodings. ICTAI (2022)
Michal Karpinski, Marek Piotrów
Reusing Comparator Networks in Pseudo-Boolean Encodings. CoRR (2022)
Michal Karpinski, Marek Piotrów
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks. SAT (2020)
Marek Piotrów
UWrMaxSat: Efficient Solver for MaxSAT and Pseudo-Boolean Problems. ICTAI (2020)
Michal Karpinski, Marek Piotrów
Encoding cardinality constraints using multiway merge selection networks. Constraints An Int. J. 24 (3-4) (2019)
Michal Karpinski, Marek Piotrów
Competitive Sorter-based Encoding of PB-Constraints into SAT. POS@SAT (2018)
Michal Karpinski, Marek Piotrów
Encoding Cardinality Constraints using Generalized Selection Networks. CoRR (2017)
Marek Piotrów
Faster merging networks with a small constant period. Theor. Comput. Sci. 640 (2016)
Michal Karpinski, Marek Piotrów
Smaller Selection Networks for Cardinality Constraints Encoding. CoRR (2015)
Michal Karpinski, Marek Piotrów
Smaller Selection Networks for Cardinality Constraints Encoding. CP (2015)
Marek Piotrów
Faster Small-Constant-Periodic Merging Networks. CoRR (2014)
Marek Piotrów
Faster 3-Periodic Merging Networks. CoRR (2014)
Marek Piotrów
Brief announcement: faster 3-periodic merging networks. SPAA (2014)
Marek Piotrów
Depth Optimal Sorting Networks Resistant to k Passive Faults. SIAM J. Comput. 33 (6) (2004)
Marek Piotrów
A note on constructing binary heaps with periodic networks. Inf. Process. Lett. 83 (3) (2002)
Marek Piotrów
Periodic, random-fault-tolerant correction networks. SPAA (2001)
Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
Reliable Minimum Finding Comparator Networks. Fundam. Informaticae 42 (3-4) (2000)
Marcin Kik, Miroslaw Kutylowski, Marek Piotrów
Correction Networks. ICPP (1999)
Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms 23 (1) (1997)
Marek Piotrów
Depth Optimal Sorting Networks Resistant to k Passive Faults. SODA (1996)
Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów
Reliable Minimum Finding Comparator Networks. MFCS (1994)
Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter
Parallel and Sequential Approximations of Shortest Superstrings. SWAT (1994)
Marek Piotrów
On the Complexity of Counting in the Polynomial Hierarchy. Theor. Comput. Sci. 81 (1) (1991)
Marek Piotrów
ATIME(N) is Closed Under Counting. MFCS (1990)
Marek Piotrów
On Complexity of Counting. MFCS (1988)
Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów
On Reversal Bounded Alternating Turing Machines. Theor. Comput. Sci. 54 (1987)