default search action
Wlodzimierz Bielecki
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j19]Marek Palkowski
, Wlodzimierz Bielecki:
NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers. Parallel Comput. 116: 103016 (2023) - [c39]Wlodzimierz Bielecki, Marek Palkowski
Polyhedral Tiling Strategies for the Zuker Algorithm Optimization. FedCSIS (Communication Papers) 2023: 37-41 - 2022
- [c38]Wlodzimierz Bielecki, Marek Palkowski
Automatic code optimization for computing the McCaskill partition functions. FedCSIS 2022: 475-478 - [c37]Marek Palkowski
NPDP Benchmark Suite for Loop Tiling Effectiveness Evaluation. PPAM (2) 2022: 51-62 - 2021
- [j18]Wlodzimierz Bielecki
3D parallel tiled code implementing a modified Knuth's optimal binary search tree algorithm. J. Comput. Sci. 48: 101246 (2021) - [c36]Wlodzimierz Bielecki, Maciej Poliwoda:
Automatic Parallel Tiled Code Generation Based on Dependence Approximation. PaCT 2021: 260-275 - 2020
- [j17]Marek Palkowski
Parallel tiled cache and energy efficient codes for O(n4) RNA folding algorithms. J. Parallel Distributed Comput. 137: 252-258 (2020) - [c35]Marek Palkowski
Automatic Generation of Parallel Cache-Efficient Code Implementing Zuker's RNA Folding. ICAISC (1) 2020: 646-654
2010 – 2019
- 2019
- [j16]Marek Palkowski
Tiling Nussinov's RNA folding loop nest with a space-time approach. BMC Bioinform. 20(1): 208:1-208:11 (2019) - [j15]Wlodzimierz Bielecki
Insight into tiles generated by means of a correction technique. J. Supercomput. 75(5): 2665-2690 (2019) - [c34]Marek Palkowski
Parallel cache-efficient code for computing the McCaskill partition functions. FedCSIS 2019: 207-210 - [c33]Marek Palkowski, Wlodzimierz Bielecki:
Parallel Tiled Cache and Energy Efficient Code for Zuker's RNA Folding. PPAM (2) 2019: 25-34 - 2018
- [j14]Marek Palkowski
Tuning iteration space slicing based tiled multi-core code implementing Nussinov's RNA folding. BMC Bioinform. 19(1): 12:1-12:12 (2018) - [j13]Wlodzimierz Bielecki
Generation of parallel synchronization-free tiled code. Computing 100(3): 277-302 (2018) - [j12]Marek Palkowski
Parallel Tiled Codes Implementing the Smith-Waterman Alignment Algorithm for Two and Three Sequences. J. Comput. Biol. 25(10): 1106-1119 (2018) - [c32]Wlodzimierz Bielecki
Transitive Closure Based Schedule of Loop Nest Statement Instances. ACS 2018: 122-131 - [c31]Marek Palkowski
Accelerating Minimum Cost Polygon Triangulation Code with the TRACO Compiler. FedCSIS (Communication Papers) 2018: 111-114 - [c30]Marek Palkowski
Parallel Cache Efficient Algorithm and Implementation of Needleman-Wunsch Global Sequence Alignment. ICAISC (2) 2018: 207-216 - 2017
- [j11]Wlodzimierz Bielecki
Dynamic Tile Free Scheduling for Code with Acyclic Inter-Tile Dependence Graphs. Comput. Sci. 18(2): 195- (2017) - [j10]Marek Palkowski
Parallel tiled Nussinov RNA folding loop nest generated using both dependence graph transitive closure and loop skewing. BMC Bioinform. 18(1): 290 (2017) - [j9]Marek Palkowski
Parallel Tiled Code Generation with Loop Permutation within Tiles. Comput. Informatics 36(6): 1261-1282 (2017) - [c29]Marek Palkowski
Optimizing Numerical Code by means of the Transitive Closure of Dependence Graphs. FedCSIS 2017: 523-526 - [c28]Marek Palkowski
Improving Data Locality of RNA Secondary Structure Prediction Code. ICAISC (1) 2017: 690-699 - [c27]Marek Palkowski
A Practical Approach to Tiling Zuker's RNA Folding Using the Transitive Closure of Loop Dependence Graphs. ISAT (2) 2017: 200-209 - 2016
- [j8]Agnieszka Kaminska, Wlodzimierz Bielecki:
Statistical models to accelerate software development by means of iterative compilation. Comput. Sci. 17(3): 407- (2016) - [j7]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) - [j6]Marek Palkowski, Wlodzimierz Bielecki:
TRACO: Source-to-Source Parallelizing Compiler. Comput. Informatics 35(6): 1277-1306 (2016) - [c26]Wlodzimierz Bielecki
Loop Nest Tiling for Image Processing and Communication Applications. ACS 2016: 305-314 - [c25]Wlodzimierz Bielecki
Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph. ACS 2016: 315-327 - [c24]Marek Palkowski, Wlodzimierz Bielecki:
An Iteration Space Visualizer for Polyhedral Loop Transformations in Numerical Programming. FedCSIS 2016: 705-708 - [c23]Tomasz Klimek, Marek Palkowski
Synchronization-Free Automatic Parallelization for Arbitrarily Nested Affine Loops. SBAC-PAD (Workshops) 2016: 43-48 - 2015
- [j5]Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek:
Using basis dependence distance vectors in the modified Floyd-Warshall algorithm. J. Comb. Optim. 30(2): 253-275 (2015) - [c22]Marek Palkowski
TRACO: An automatic loop nest parallelizer for numerical applications. FedCSIS 2015: 681-686 - [c21]Marek Palkowski
Using an Artificial Neural Network to Predict Loop Transformation Time. ICAISC (1) 2015: 102-111 - [c20]Wlodzimierz Bielecki, Marek Palkowski
Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs. PPAM (2) 2015: 133-142 - 2014
- [c19]Wlodzimierz Bielecki, Marek Palkowski
Perfectly Nested Loop Tiling Transformations Based on the Transitive Closure of the Program Dependence Graph. ACS 2014: 309-320 - [c18]Marek Palkowski
TRACO Parallelizing Compiler. ACS 2014: 409-421 - [c17]Marek Palkowski
Usage of the TRACO Compiler for Neural Network Parallelization. ICAISC (1) 2014: 121-130 - 2013
- [c16]Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek:
Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm. COCOA 2013: 129-140 - [c15]Wlodzimierz Bielecki, Krzysztof Kraska, Tomasz Klimek:
Transitive Closure of a Union of Dependence Relations for Parameterized Perfectly-Nested Loops. PaCT 2013: 37-50 - 2012
- [j4]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) - [j3]Wlodzimierz Bielecki, Marek Palkowski
Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Comput. 38(9): 518-532 (2012) - 2011
- [j2]Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski
Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformations. Parallel Comput. 37(8): 479-497 (2011) - [c14]Wlodzimierz Bielecki, Marek Palkowski:
Using Free Scheduling for Programming Graphic Cards. Facing the Multicore-Challenge 2011: 72-83 - [c13]Wlodzimierz Bielecki, Krzysztof Kraska:
Extracting Coarse-Grained Parallelism for Affine Perfectly Nested Quasi-uniform Loops. PPAM (1) 2011: 307-316 - 2010
- [c12]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 - [c11]Wlodzimierz Bielecki, Marek Palkowski
Coarse-Grained Loop Parallelization for Image Processing and Communication Applications. IP&C 2010: 307-314
2000 – 2009
- 2009
- [j1]Wlodzimierz Bielecki, Tomasz Klimek, Konrad Trifunovic:
Calculating Exact Transitive Closure for a Normalized Affine Integer Tuple Relation. Electron. Notes Discret. Math. 33: 7-14 (2009) - [c10]Anna Beletska, Denis Barthou
Computing the Transitive Closure of a Union of Affine Integer Tuple Relations. COCOA 2009: 98-109 - [c9]Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski
Coarse-Grained Loop Parallelization: Iteration Space Slicing vs Affine Transformations. ISPDC 2009: 73-80 - [c8]Anna Beletska, Wlodzimierz Bielecki, Albert Cohen, Marek Palkowski
Synchronization-Free Automatic Parallelization: Beyond Affine Iteration-Space Slicing. LCPC 2009: 233-246 - [c7]Wlodzimierz Bielecki, Marek Palkowski
Extracting Both Affine and Non-linear Synchronization-Free Slices in Program Loops. PPAM (1) 2009: 196-205 - 2008
- [c6]Wlodzimierz Bielecki, Anna Beletska, Marek Palkowski
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations. ICA3PP 2008: 185-195 - [c5]Anna Beletska, Wlodzimierz Bielecki, Krzysztof Siedlecki, Pierluigi San Pietro
Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops. ICCSA (2) 2008: 871-886 - [c4]Wlodzimierz Bielecki, Marek Palkowski:
Using Message Passing for Developing Coarse-Grained Applications in OpenMP. ICSOFT (PL/DPS/KE) 2008: 145-152 - 2007
- [c3]Anna Beletska, Wlodzimierz Bielecki, Pierluigi San Pietro
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. ISPDC 2007: 203-210 - [p3]Wlodzimierz Bielecki, Dariusz Burak:
Parallelization Method of Encryption Algorithms. Advances in Information Processing and Protection 2007: 191-204 - [p2]Wlodzimierz Bielecki, Maciej Poliwoda:
Hyperplane Method Implementation for Loops Parallelization in the .NET Environment. Advances in Information Processing and Protection 2007: 431-445 - 2006
- [c2]Piotr Dziurzanski, Wlodzimierz Bielecki, Konrad Trifunovic, M. Kleszczonek:
A System for Transforming an ANSI C Code with OpenMP Directives into a SystemC Description. DDECS 2006: 153-154 - [p1]Wlodzimierz Bielecki, Dariusz Burak:
Parallelization of Standard Modes of Operation for Symmetric Key Block Ciphers. Biometrics, Computer Security Systems and Artificial Intelligence Applications 2006: 101-110 - 2004
- [c1]Wlodzimierz Bielecki, Rafal Kocisz:
A Modified Vertex Method for Parallelization of Arbitrary Nested Loops. PARELEC 2004: 91-96
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-10-07 21:17 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: