( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication.

, , , , , и . SC, стр. 24:1-24:22. ACM, (2019)

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.

Klaus Kwasniewski

Stefan Kwasniewski

Grzegorz Podrygajlo

Differentiation of human teratocarcinoma cell line into motor neurons: investigation of cellular phenotype in vitro and in transplantation studies. TierH Hannover, (2009)

Grzegorz Jaśkiewicz

Grzegorz Popiolek

 

Другие публикации лиц с тем же именем

ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations., , , , , , , , , и 4 other автор(ы). SC, стр. 43:1-43:17. IEEE, (2022)Topologies of Reasoning: Demystifying Chains, Trees, and Graphs of Thoughts., , , , , , , , , и 4 other автор(ы). CoRR, (2024)SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems., , , , , , , , , и 9 other автор(ы). MICRO, стр. 282-297. ACM, (2021)SeBS: a serverless benchmark suite for function-as-a-service computing., , , , и . Middleware, стр. 64-78. ACM, (2021)Using Compiler Techniques to Improve Automatic Performance Modeling., , и . PACT, стр. 468-479. IEEE Computer Society, (2015)SeBS: A Serverless Benchmark Suite for Function-as-a-Service Computing., , , , и . CoRR, (2020)Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs., , , , , , , и . SPAA, стр. 328-339. ACM, (2021)Automatic complexity analysis of explicitly parallel programs., и . SPAA, стр. 226-235. ACM, (2014)Lifting C semantics for dataflow optimization., , , , , , и . ICS, стр. 17:1-17:13. ACM, (2022)Deinsum: Practically I/O Optimal Multi-Linear Algebra., , , , и . SC, стр. 25:1-25:15. IEEE, (2022)