Marek Piotrów - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2022

Reusing Comparator Networks in Pseudo-Boolean EncodingsMichal Karpinski, Marek Piotrów. ictai 2022: 760-765 [doi]

2020

Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator NetworksMichal Karpinski, Marek Piotrów. sat 2020: 519-535 [doi]

UWrMaxSat: Efficient Solver for MaxSAT and Pseudo-Boolean ProblemsMarek Piotrów. ictai 2020: 132-136 [doi]

2019

Encoding cardinality constraints using multiway merge selection networksMichal Karpinski, Marek Piotrów. constraints, 24(3-4):234-251, 2019. [doi]

2018

Competitive Sorter-based Encoding of PB-Constraints into SATMichal Karpinski, Marek Piotrów. sat 2019: 65-78 [doi]

2016

Faster merging networks with a small constant periodMarek Piotrów. TCS, 640:20-40, 2016. [doi]

2015

Smaller Selection Networks for Cardinality Constraints EncodingMichal Karpinski, Marek Piotrów. cp 2015: 210-225 [doi]

2014

Brief announcement: faster 3-periodic merging networksMarek Piotrów. spaa 2014: 223-225 [doi]

2004

Depth Optimal Sorting Networks Resistant to k Passive FaultsMarek Piotrów. SICOMP, 33(6):1484-1512, 2004. [doi]

2002

A note on constructing binary heaps with periodic networksMarek Piotrów. ipl, 83(3):129-134, 2002. [doi]

2001

Periodic, random-fault-tolerant correction networksMarek Piotrów. spaa 2001: 298-305 [doi]

2000

Reliable Minimum Finding Comparator NetworksPiotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów. FUIN, 42(3-4):235-249, 2000.

1999

Correction NetworksMarcin Kik, Miroslaw Kutylowski, Marek Piotrów. icpp 1999: 40-47 [doi]

1997

Sequential and Parallel Approximation of Shortest SuperstringsArtur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter. jal, 23(1):74-100, 1997.

1996

Depth Optimal Sorting Networks Resistant to k Passive FaultsMarek Piotrów. soda 1996: 242-251

1994

Parallel and Sequential Approximations of Shortest SuperstringsArtur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter. swat 1994: 95-106

Reliable Minimum Finding Comparator NetworksPiotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów. mfcs 1994: 306-315

1991

On the Complexity of Counting in the Polynomial HierarchyMarek Piotrów. TCS, 81(1):77-95, 1991.

1988

On Complexity of CountingMarek Piotrów. mfcs 1988: 472-482

1987

On Reversal Bounded Alternating Turing MachinesMaciej Liskiewicz, Krzysztof Lorys, Marek Piotrów. TCS, 54:331-339, 1987.

Sign in or sign up to see more results.

runs on WebDSL