Marek Piotrów

According to our database, Marek Piotrów authored at least 22 papers between 1987 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Reusing Comparator Networks in Pseudo-Boolean Encodings.

Michal Karpinski, Marek Piotrów

Proceedings of the 34th IEEE International Conference on Tools with Artificial Intelligence, 2022

2020

Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks.

Michal Karpinski, Marek Piotrów

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

UWrMaxSat: Efficient Solver for MaxSAT and Pseudo-Boolean Problems.

Marek Piotrów

Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

2019

Encoding cardinality constraints using multiway merge selection networks.

Michal Karpinski, Marek Piotrów

Constraints An Int. J., 2019

2018

Competitive Sorter-based Encoding of PB-Constraints into SAT.

Michal Karpinski, Marek Piotrów

Proceedings of Pragmatics of SAT 2015, 2018

2017

Encoding Cardinality Constraints using Generalized Selection Networks.

Michal Karpinski, Marek Piotrów

CoRR, 2017

2016

Faster merging networks with a small constant period.

Marek Piotrów

Theor. Comput. Sci., 2016

2015

Smaller Selection Networks for Cardinality Constraints Encoding.

Michal Karpinski, Marek Piotrów

Proceedings of the Principles and Practice of Constraint Programming, 2015

2014

Faster Small-Constant-Periodic Merging Networks.

Marek Piotrów

CoRR, 2014

Faster 3-Periodic Merging Networks.

Marek Piotrów

CoRR, 2014

Brief announcement: faster 3-periodic merging networks.

Marek Piotrów

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2004

Depth Optimal Sorting Networks Resistant to k Passive Faults.

Marek Piotrów

SIAM J. Comput., 2004

2002

A note on constructing binary heaps with periodic networks.

Marek Piotrów

Inf. Process. Lett., 2002

2001

Periodic, random-fault-tolerant correction networks.

Marek Piotrów

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

2000

Reliable Minimum Finding Comparator Networks.

Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów

Fundam. Informaticae, 2000

1999

Correction Networks.

Marcin Kik, Miroslaw Kutylowski, Marek Piotrów

Proceedings of the International Conference on Parallel Processing 1999, 1999

1997

Sequential and Parallel Approximation of Shortest Superstrings.

Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter

J. Algorithms, 1997

1994

Parallel and Sequential Approximations of Shortest Superstrings.

Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter

Proceedings of the Algorithm Theory, 1994

1991

On the Complexity of Counting in the Polynomial Hierarchy.

Marek Piotrów

Theor. Comput. Sci., 1991

1990

ATIME(N) is Closed Under Counting.

Marek Piotrów

Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

1988

On Complexity of Counting.

Marek Piotrów

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987

On Reversal Bounded Alternating Turing Machines.

Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów

Theor. Comput. Sci., 1987