default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Zalewski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c37]Andrew Lumsdaine
, Luke D'Alessandro, Kevin Deweese, Jesun Firoz, Tony Liu, Scott McMillan, John Phillip Ratzloff, Marcin Zalewski:
NWGraph: A Library of Generic Graph Algorithms and Data Structures in C++20. ECOOP 2022: 31:1-31:28- [p1]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John Gilbert, Shana Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, José E. Moreira, John D. Owens, Carl Yang, Marcin Zalewski, Timothy G. Mattson:
Introduction to GraphBLAS. Massive Graph Analytics 2022: 507-524 - 2021
- [j3]Michael Bauer, Wonchan Lee, Manolis Papadakis, Marcin Zalewski, Michael Garland, Konrad Hinsen, Anshu Dubey:
Supercomputing in Python With Legate. Comput. Sci. Eng. 23(4): 73-79 (2021) - 2020
- [c36]Cliff A. Joslyn, Sinan Aksoy, Dustin Arendt, Jesun Firoz, Louis Jenkins, Brenda Praggastis, Emilie Purvine, Marcin Zalewski:
Hypergraph Analytics of Domain Name System Relationships. WAW 2020: 1-15
2010 – 2019
- 2019
- [c35]Jesun Sahariar Firoz, Marcin Zalewski, Andrew Lumsdaine:
A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs. PACT 2019: 421-432 - [c34]Vito Giovanni Castellana, Maurizio Drocco, John Feo, Jesun Sahariar Firoz, Thejaka Amila Kanewala, Andrew Lumsdaine, Joseph B. Manzano, Andres Marquez, Marco Minutoli, Joshua Suetterlein, Antonino Tumeo, Marcin Zalewski:
A Parallel Graph Environment for Real-World Data Analytics Workflows. DATE 2019: 1313-1318 - [c33]Xu Liu, Jesun Sahariar Firoz, Marcin Zalewski, Mahantesh Halappanavar, Kevin J. Barker, Andrew Lumsdaine, Assefaw H. Gebremedhin:
Distributed Direction-Optimizing Label Propagation for Community Detection. HPEC 2019: 1-6 - [c32]Louis Jenkins, Jesun Sahariar Firoz, Marcin Zalewski, Cliff A. Joslyn, Mark Raugas:
Graph Algorithms in PGAS: Chapel and UPC++. HPEC 2019: 1-6 - 2018
- [c31]Jesun Sahariar Firoz, Marcin Zalewski, Thejaka Amila Kanewala, Andrew Lumsdaine:
Synchronization-Avoiding Graph Algorithms. HiPC 2018: 52-61 - [c30]Jesun Sahariar Firoz, Marcin Zalewski, Joshua Suetterlein, Andrew Lumsdaine:
Adaptive Runtime Features for Distributed Graph Algorithms. HiPC 2018: 82-91 - [c29]Louis Jenkins, Tanveer Hossain Bhuiyan, Sarah Harun, Christopher Lightsey, David Mentgen, Sinan G. Aksoy, Timothy Stavcnger, Marcin Zalewski, Hugh R. Medal, Cliff A. Joslyn:
Chapel HyperGraph Library (CHGL). HPEC 2018: 1-6 - [c28]Jesse Chamberlin, Marcin Zalewski, Scott McMillan, Andrew Lumsdaine:
PyGB: GraphBLAS DSL in Python with Dynamic Compilation Into Efficient C++. IPDPS Workshops 2018: 310-319 - [c27]Jesun Sahariar Firoz, Marcin Zalewski, Andrew Lumsdaine, Martina Barnas:
Runtime Scheduling Policies for Distributed Graph Algorithms. IPDPS 2018: 640-649 - [c26]Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine:
Distributed, Shared-Memory Parallel Triangle Counting. PASC 2018: 5:1-5:12 - [c25]Jesun Sahariar Firoz, Marcin Zalewski, Andrew Lumsdaine:
A scalable distance-1 vertex coloring algorithm for power-law graphs. PPoPP 2018: 391-392 - [c24]Louis Jenkins, Marcin Zalewski, Michael Ferguson:
Chapel Aggregation Library (CAL). PAW-ATM@SC 2018: 34-43 - 2017
- [c23]Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine:
Families of Graph Algorithms: SSSP Case Study. Euro-Par 2017: 428-441 - [c22]Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine:
Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering. HiPC 2017: 52-61 - [c21]Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine:
Distributed-memory fast maximal independent set. HPEC 2017: 1-7 - [c20]Jesun Sahariar Firoz, Thejaka Amila Kanewala, Marcin Zalewski, Martina Barnas, Andrew Lumsdaine:
POSTER: Distributed Control: The Benefits of Eliminating Global Synchronization via Effective Scheduling. PPoPP 2017: 441-442 - [i4]Thejaka Amila Kanewala, Marcin Zalewski, Martina Barnas, Andrew Lumsdaine:
Families of Distributed Memory Parallel Graph Algorithms from Self-Stabilizing Kernels-An SSSP Case Study. CoRR abs/1706.05760 (2017) - 2016
- [c19]Jesun Sahariar Firoz, Marcin Zalewski, Martina Barnas, Andrew Lumsdaine:
Improving Performance of Distributed Graph Traversals via Application-Aware Plug-In Work Scheduler. Euro-Par Workshops 2016: 545-556 - [c18]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, Carl Yang, John D. Owens, Marcin Zalewski, Timothy G. Mattson, José E. Moreira:
Mathematical foundations of the GraphBLAS. HPEC 2016: 1-9 - [c17]Peter Zhang, Marcin Zalewski, Andrew Lumsdaine, Samantha Misurda, Scott McMillan:
GBTL-CUDA: Graph Algorithms and Primitives for GPUs. IPDPS Workshops 2016: 912-920 - [c16]Jesun Sahariar Firoz, Thejaka Amila Kanewala, Marcin Zalewski, Martina Barnas, Andrew Lumsdaine:
Context Matters: Distributed Graph Algorithms and Runtime Systems: A Case Study of Distributed Graph Traversals. PASC 2016: 12 - [c15]Jesun Sahariar Firoz, Martina Barnas, Marcin Zalewski, Andrew Lumsdaine:
The Value of Variance. ICPE 2016: 287-295 - [i3]Thejaka Amila Kanewala, Marcin Zalewski, Andrew Lumsdaine:
Abstract Graph Machine. CoRR abs/1604.04772 (2016) - [i2]Jeremy Kepner, Peter Aaltonen, David A. Bader, Aydin Buluç, Franz Franchetti, John R. Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, José E. Moreira, John D. Owens, Carl Yang, Marcin Zalewski, Timothy G. Mattson:
Mathematical Foundations of the GraphBLAS. CoRR abs/1606.05790 (2016) - 2015
- [c14]Jesun Sahariar Firoz, Thejaka Amila Kanewala, Marcin Zalewski, Martina Barnas, Andrew Lumsdaine:
Importance of Runtime Considerations in Performance Engineering of Large-Scale Distributed Graph Algorithms. Euro-Par Workshops 2015: 553-564 - [c13]Jesun Sahariar Firoz, Martina Barnas, Marcin Zalewski, Andrew Lumsdaine:
Comparison of Single Source Shortest Path Algorithms on Two Recent Asynchronous Many-task Runtime Systems. ICPADS 2015: 674-681 - [c12]Marcin Zalewski, Nicholas Gerard Edmonds, Andrew Lumsdaine:
Declarative Patterns for Imperative Distributed Graph Algorithms. IPDPS Workshops 2015: 796-803 - [c11]Peter Zhang, Eric Holk, John Matty, Samantha Misurda, Marcin Zalewski, Jonathan Chu, Scott McMillan, Andrew Lumsdaine:
Dynamic parallelism for simple and efficient GPU graph algorithms. IA3@SC 2015: 11:1-11:4 - [i1]Jesun Sahariar Firoz, Thejaka Amila Kanewala, Marcin Zalewski, Martina Barnas, Andrew Lumsdaine:
The Anatomy of Large-Scale Distributed Graph Algorithms. CoRR abs/1507.06702 (2015) - 2014
- [c10]Larisse Voufo, Marcin Zalewski, Andrew Lumsdaine:
Scoping rules on a platter: a framework for understanding and specifying name binding. WGP@ICFP 2014: 59-70 - [c9]Marcin Zalewski, Thejaka Amila Kanewala, Jesun Sahariar Firoz, Andrew Lumsdaine:
Distributed control: priority scheduling for single source shortest paths without synchronization. IA3@SC 2014: 17-24 - 2012
- [c8]Andrew Sutton, Marcin Zalewski:
Testing C++ generic libraries. ICSM 2012: 36-45 - 2011
- [c7]Larisse Voufo, Marcin Zalewski, Andrew Lumsdaine:
ConceptClang: an implementation of C++ concepts in Clang. WGP@ICFP 2011: 71-82 - 2010
- [j2]Jean-Philippe Bernardy, Patrik Jansson, Marcin Zalewski, Sibylle Schupp:
Generic programming with C++ concepts and Haskell type classes - a comparison. J. Funct. Program. 20(3-4): 271-302 (2010) - [e1]Bruno C. d. S. Oliveira, Marcin Zalewski:
Proceedings of the ACM SIGPLAN Workshop on Generic Programming, WGP 2010, Baltimore, MD, USA, September 27-29, 2010. ACM 2010, ISBN 978-1-4503-0251-7 [contents]
2000 – 2009
- 2009
- [j1]Marcin Zalewski, Sibylle Schupp:
A Semantic Definition of Separate Type Checking in C++ with Concepts. J. Object Technol. 8(5): 105-132 (2009) - [c6]Daniel Lincke, Patrik Jansson, Marcin Zalewski, Cezar Ionescu:
Generic Libraries in C++ with Concepts from High-Level Domain Descriptions in Haskell. DSL 2009: 236-261 - 2008
- [b1]Marcin Zalewski:
Generic Programming with Concepts. Chalmers University of Technology, Gothenburg, Sweden, 2008 - [c5]Jean-Philippe Bernardy, Patrik Jansson, Marcin Zalewski, Sibylle Schupp, Andreas P. Priesnitz:
A comparison of c++ concepts and haskell type classes. ICFP-WGP 2008: 37-48 - 2006
- [c4]Gustav Munkby, Andreas P. Priesnitz, Sibylle Schupp, Marcin Zalewski:
Scrap++: scrap your boilerplate in C++. ICFP-WGP 2006: 66-75 - [c3]Marcin Zalewski, Sibylle Schupp:
Change Impact Analysis for Generic Libraries. ICSM 2006: 35-44 - 2004
- [c2]Sibylle Schupp, Marcin Zalewski, Kyle Ross:
Rapid performance prediction for library components. WOSP 2004: 69-73 - 2003
- [c1]Marcin Zalewski, Sibylle Schupp:
A Polymorphic Radix- n Framework for Fast Fourier Transforms. Ershov Memorial Conference 2003: 30-37
Coauthor Index
aka: Jesun Firoz
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:25 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:
