default search action
Marek Piotrów
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c13]Michal Karpinski, Marek Piotrów
:
Reusing Comparator Networks in Pseudo-Boolean Encodings. ICTAI 2022: 760-765 - [i5]Michal Karpinski, Marek Piotrów:
Reusing Comparator Networks in Pseudo-Boolean Encodings. CoRR abs/2205.04129 (2022) - 2020
- [c12]Marek Piotrów
UWrMaxSat: Efficient Solver for MaxSAT and Pseudo-Boolean Problems. ICTAI 2020: 132-136 - [c11]Michal Karpinski
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks. SAT 2020: 519-535
2010 – 2019
- 2019
- [j8]Michal Karpinski
Encoding cardinality constraints using multiway merge selection networks. Constraints An Int. J. 24(3-4): 234-251 (2019) - 2018
- [c10]Michal Karpinski, Marek Piotrów
Competitive Sorter-based Encoding of PB-Constraints into SAT. POS@SAT 2018: 65-78 - 2017
- [i4]Michal Karpinski, Marek Piotrów:
Encoding Cardinality Constraints using Generalized Selection Networks. CoRR abs/1704.04389 (2017) - 2016
- [j7]Marek Piotrów
Faster merging networks with a small constant period. Theor. Comput. Sci. 640: 20-40 (2016) - 2015
- [c9]Michal Karpinski
Smaller Selection Networks for Cardinality Constraints Encoding. CP 2015: 210-225 - [i3]Michal Karpinski, Marek Piotrów:
Smaller Selection Networks for Cardinality Constraints Encoding. CoRR abs/1502.04551 (2015) - 2014
- [c8]Marek Piotrów
Brief announcement: faster 3-periodic merging networks. SPAA 2014: 223-225 - [i2]Marek Piotrów:
Faster 3-Periodic Merging Networks. CoRR abs/1401.0396 (2014) - [i1]Marek Piotrów:
Faster Small-Constant-Periodic Merging Networks. CoRR abs/1409.1749 (2014)
2000 – 2009
- 2004
- [j6]Marek Piotrów
Depth Optimal Sorting Networks Resistant to k Passive Faults. SIAM J. Comput. 33(6): 1484-1512 (2004) - 2002
- [j5]Marek Piotrów
A note on constructing binary heaps with periodic networks. Inf. Process. Lett. 83(3): 129-134 (2002) - 2001
- [c7]Marek Piotrów:
Periodic, random-fault-tolerant correction networks. SPAA 2001: 298-305 - 2000
- [j4]Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
Reliable Minimum Finding Comparator Networks. Fundam. Informaticae 42(3-4): 235-249 (2000)
1990 – 1999
- 1999
- [c6]Marcin Kik, Miroslaw Kutylowski, Marek Piotrów:
Correction Networks. ICPP 1999: 40-47 - 1997
- [j3]Artur Czumaj, Leszek Gasieniec, Marek Piotrów
Sequential and Parallel Approximation of Shortest Superstrings. J. Algorithms 23(1): 74-100 (1997) - 1996
- [c5]Marek Piotrów:
Depth Optimal Sorting Networks Resistant to k Passive Faults. SODA 1996: 242-251 - 1994
- [c4]Piotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów:
Reliable Minimum Finding Comparator Networks. MFCS 1994: 306-315 - [c3]Artur Czumaj, Leszek Gasieniec, Marek Piotrów, Wojciech Rytter:
Parallel and Sequential Approximations of Shortest Superstrings. SWAT 1994: 95-106 - 1991
- [j2]Marek Piotrów
On the Complexity of Counting in the Polynomial Hierarchy. Theor. Comput. Sci. 81(1): 77-95 (1991) - 1990
- [c2]Marek Piotrów
ATIME(N) is Closed Under Counting. MFCS 1990: 457-463
1980 – 1989
- 1988
- [c1]Marek Piotrów
On Complexity of Counting. MFCS 1988: 472-482 - 1987
- [j1]Maciej Liskiewicz, Krzysztof Lorys, Marek Piotrów
On Reversal Bounded Alternating Turing Machines. Theor. Comput. Sci. 54: 331-339 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: