( en | de | ru )

 

Disambiguation of "Bielecki, Wlodzimierz"

Author of the publication

copydeleteadd this publication to your clipboard
Finding Synchronization-Free Parallelism Represented with Trees of Dependent Operations.

, , , and . ICA3PP, volume 5022 of Lecture Notes in Computer Science, page 185-195. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Wlodzimierz Bielecki

Wlodzimierz Sawluk

Emil Bielecki

Jürgen Bielecki

Christiane Bielecki

 

Other publications of authors with the same name

Parallelization Method of Encryption Algorithms., and . Advances in Information Processing and Protection, Springer, (2007)Using Free Scheduling for Programming Graphic Cards., and . Facing the Multicore-Challenge, volume 7174 of Lecture Notes in Computer Science, page 72-83. Springer, (2011)Finding Synchronization-Free Slices of Operations in Arbitrarily Nested Loops., , , and . ICCSA (2), volume 5073 of Lecture Notes in Computer Science, page 871-886. Springer, (2008)Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph., and . ACS, volume 534 of Advances in Intelligent Systems and Computing, page 315-327. (2016)Automatic code optimization for computing the McCaskill partition functions., , and . FedCSIS, volume 30 of Annals of Computer Science and Information Systems, page 475-478. (2022)TRACO: An automatic loop nest parallelizer for numerical applications., , and . FedCSIS, volume 5 of Annals of Computer Science and Information Systems, page 681-686. IEEE, (2015)Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs., , and . PPAM (2), volume 9574 of Lecture Notes in Computer Science, page 133-142. Springer, (2015)Using Basis Dependence Distance Vectors to Calculate the Transitive Closure of Dependence Relations by Means of the Floyd-Warshall Algorithm., , and . COCOA, volume 8287 of Lecture Notes in Computer Science, page 129-140. Springer, (2013)Free scheduling for statement instances of parameterized arbitrarily nested affine loops., , and . Parallel Comput., 38 (9): 518-532 (2012)Transitive Closure Based Schedule of Loop Nest Statement Instances., and . ACS, volume 889 of Advances in Intelligent Systems and Computing, page 122-131. Springer, (2018)