default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarek Palkowski
Person information
- affiliation: West Pomeranian University of Technology in Szczecin, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j13]Marek Palkowski
, Wlodzimierz Bielecki:
NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers. Parallel Comput. 116: 103016 (2023)- 2020
- [j12]Marek Palkowski, Wlodzimierz Bielecki:
Parallel tiled cache and energy efficient codes for O(n4) RNA folding algorithms. J. Parallel Distributed Comput. 137: 252-258 (2020) - 2019
- [j11]Marek Palkowski, Wlodzimierz Bielecki:
Tiling Nussinov's RNA folding loop nest with a space-time approach. BMC Bioinform. 20(1): 208:1-208:11 (2019) - 2018
- [j10]Marek Palkowski, Wlodzimierz Bielecki:
Tuning iteration space slicing based tiled multi-core code implementing Nussinov's RNA folding. BMC Bioinform. 19(1): 12:1-12:12 (2018) - [j9]Wlodzimierz Bielecki, Marek Palkowski, Piotr Skotnicki:
Generation of parallel synchronization-free tiled code. Computing 100(3): 277-302 (2018) - [j8]Marek Palkowski, Wlodzimierz Bielecki:
Parallel Tiled Codes Implementing the Smith-Waterman Alignment Algorithm for Two and Three Sequences. J. Comput. Biol. 25(10): 1106-1119 (2018) - 2017
- [j7]Marek Palkowski, Wlodzimierz Bielecki:
Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing. BMC Bioinform. 18(1): 290 (2017) - [j6]Marek Palkowski, Wlodzimierz Bielecki:
Parallel Tiled Code Generation with Loop Permutation within Tiles. Comput. Informatics 36(6): 1261-1282 (2017) - 2016
- [j5]Wlodzimierz Bielecki, Marek Palkowski:
Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs. Int. J. Appl. Math. Comput. Sci. 26(4): 919-939 (2016) - [j4]Marek Palkowski, Wlodzimierz Bielecki:
TRACO: Source-to-Source Parallelizing Compiler. Comput. Informatics 35(6): 1277-1306 (2016) - 2012
- [j3]Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska:
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parametrized Affine Integer Tuple Relations. Discret. Math. Algorithms Appl. 4(1) (2012) - [j2]Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek:
Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Comput. 38(9): 518-532 (2012) - 2011
- [j1]Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski, Krzysztof Siedlecki:
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations. Parallel Comput. 37(8): 479-497 (2011)
Conference and Workshop Papers
- 2023
- [c35]Wlodzimierz Bielecki, Marek Palkowski, Piotr Blaszynski, Maciej Poliwoda:
Polyhedral Tiling Strategies for the Zuker Algorithm Optimization. FedCSIS (Communication Papers) 2023: 37-41 - 2022
- [c34]Wlodzimierz Bielecki, Marek Palkowski, Maciej Poliwoda:
Automatic code optimization for computing the McCaskill partition functions. FedCSIS 2022: 475-478 - [c33]Marek Palkowski, Wlodzimierz Bielecki:
NPDP Benchmark Suite for Loop Tiling Effectiveness Evaluation. PPAM (2) 2022: 51-62 - 2021
- [c32]Mateusz Gruzewski, Marek Palkowski:
Implementation of Nussinov's RNA Folding Using the Kokkos Library. CORES/IP&C/ACS 2021: 310-317 - [c31]Mateusz Gruzewski, Marek Palkowski:
RNA Folding Codes Optimization Using the Intel SDK for OpenCL. ICAISC (2) 2021: 473-482 - 2020
- [c30]Marek Palkowski, Wlodzimierz Bielecki, Mateusz Gruzewski:
Automatic Generation of Parallel Cache-Efficient Code Implementing Zuker's RNA Folding. ICAISC (1) 2020: 646-654 - 2019
- [c29]Marek Palkowski, Wlodzimierz Bielecki:
Parallel cache-efficient code for computing the McCaskill partition functions. FedCSIS 2019: 207-210 - [c28]Marek Palkowski:
Energy Consumption Analysis of the Nussinov RNA Folding Implementations. ICAISC (2) 2019: 240-249 - [c27]Marek Palkowski, Wlodzimierz Bielecki:
Parallel Tiled Cache and Energy Efficient Code for Zuker's RNA Folding. PPAM (2) 2019: 25-34 - 2018
- [c26]Wlodzimierz Bielecki, Marek Palkowski:
Transitive Closure Based Schedule of Loop Nest Statement Instances. ACS 2018: 122-131 - [c25]Marek Palkowski, Wlodzimierz Bielecki:
Accelerating Minimum Cost Polygon Triangulation Code with the TRACO Compiler. FedCSIS (Communication Papers) 2018: 111-114 - [c24]Marek Palkowski, Krzysztof Siedlecki, Wlodzimierz Bielecki:
Parallel Cache Efficient Algorithm and Implementation of Needleman-Wunsch Global Sequence Alignment. ICAISC (2) 2018: 207-216 - 2017
- [c23]Marek Palkowski, Wlodzimierz Bielecki:
Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs. FedCSIS 2017: 523-526 - [c22]Marek Palkowski, Wlodzimierz Bielecki, Piotr Skotnicki:
Improving Data Locality of RNA Secondary Structure Prediction Code. ICAISC (1) 2017: 690-699 - [c21]Marek Palkowski, Wlodzimierz Bielecki:
A Practical Approach to Tiling Zuker's RNA Folding Using the Transitive Closure of Loop Dependence Graphs. ISAT (2) 2017: 200-209 - 2016
- [c20]Wlodzimierz Bielecki, Marek Palkowski:
Loop Nest Tiling for Image Processing and Communication Applications. ACS 2016: 305-314 - [c19]Marek Palkowski, Wlodzimierz Bielecki:
An Iteration Space Visualizer for Polyhedral Loop Transformations in Numerical Programming. FedCSIS 2016: 705-708 - [c18]Marek Palkowski:
Finding Free Schedules for RNA Secondary Structure Prediction. ICAISC (2) 2016: 179-188 - [c17]Tomasz Klimek, Marek Palkowski, Wlodzimierz Bielecki:
Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops. SBAC-PAD (Workshops) 2016: 43-48 - 2015
- [c16]Marek Palkowski, Tomasz Klimek, Wlodzimierz Bielecki:
TRACO: An automatic loop nest parallelizer for numerical applications. FedCSIS 2015: 681-686 - [c15]Marek Palkowski, Wlodzimierz Bielecki:
Using an Artificial Neural Network to Predict Loop Transformation Time. ICAISC (1) 2015: 102-111 - [c14]Wlodzimierz Bielecki, Marek Palkowski, Tomasz Klimek:
Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs. PPAM (2) 2015: 133-142 - 2014
- [c13]Wlodzimierz Bielecki, Marek Palkowski:
Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph. ACS 2014: 309-320 - [c12]Marek Palkowski, Wlodzimierz Bielecki:
TRACO Parallelizing Compiler. ACS 2014: 409-421 - [c11]Marek Palkowski, Wlodzimierz Bielecki:
Usage of the TRACO Compiler for Neural Network Parallelization. ICAISC (1) 2014: 121-130 - 2012
- [c10]Marek Palkowski:
Impact of Variable Privatization on Extracting Synchronization-Free Slices for Multi-core Computers. Facing the Multicore-Challenge 2012: 72-83 - [c9]Marek Palkowski:
Automatic Privatization for Parallel Execution of Loops. ICAISC (2) 2012: 395-403 - 2011
- [c8]Wlodzimierz Bielecki, Marek Palkowski:
Using Free Scheduling for Programming Graphic Cards. Facing the Multicore-Challenge 2011: 72-83 - 2010
- [c7]Wlodzimierz Bielecki, Tomasz Klimek, Marek Palkowski, Anna Beletska:
An Iterative Algorithm of Computing the Transitive Closure of a Union of Parameterized Affine Integer Tuple Relations. COCOA (1) 2010: 104-113 - [c6]Wlodzimierz Bielecki, Marek Palkowski:
Coarse-Grained Loop Parallelization for Image Processing and Communication Applications. IP&C 2010: 307-314 - 2009
- [c5]Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski, Krzysztof Siedlecki:
Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations. ISPDC 2009: 73-80 - [c4]Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski:
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing. LCPC 2009: 233-246 - [c3]Wlodzimierz Bielecki, Marek Palkowski:
Extracting Both Affine and Non-linear Synchronization-Free Slices in Program Loops. PPAM (1) 2009: 196-205 - 2008
- [c2]Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski, Pierluigi San Pietro:
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. ICA3PP 2008: 185-195 - [c1]Wlodzimierz Bielecki, Marek Palkowski:
Using Message Passing for Developing Coarse-Grained Applications in OpenMP. ICSOFT (PL/DPS/KE) 2008: 145-152
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-05-08 21:04 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:
