default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorge M. Slota
Person information
- affiliation: Rensselaer Polytechnic Institute, Troy, NY, USA
- affiliation: Sandia National Labs, Albuquerque, NM, USA
- affiliation (PhD 2016): Pennsylvania State University, University Park, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c25]Yuxuan Zhu
, Michael Mandulak, Kerui Wu, George M. Slota, Yuseok Jeon, Ka-Ho Chow, Lei Yu:
On the Robustness of Graph Reduction Against GNN Backdoor. AISec@CCS 2024: 65-76- [i6]Yuxuan Zhu, Michael Mandulak, Kerui Wu, George M. Slota, Yuseok Jeon, Ka-Ho Chow, Lei Yu:
On the Robustness of Graph Reduction Against GNN Backdoor. CoRR abs/2407.02431 (2024) - 2023
- [j5]Christopher Brissette, Andy Huang, George M. Slota:
Spectrum Consistent Coarsening Approximates Edge Weights. SIAM J. Matrix Anal. Appl. 44(3): 1032-1046 (2023) - [c24]Christopher Brissette, Ujwal Pandey, George M. Slota:
Effects of Null Model Choice on Modularity Maximization. COMPLEX NETWORKS (2) 2023: 261-272 - 2022
- [j4]Ian Bogle, George M. Slota, Erik G. Boman, Karen D. Devine, Sivasankaran Rajamanickam:
Parallel graph coloring algorithms for distributed GPU environments. Parallel Comput. 110: 102896 (2022) - [c23]Christopher Brissette, David Liu, George M. Slota:
Correcting Output Degree Sequences in Chung-Lu Random Graph Generation. COMPLEX NETWORKS (2) 2022: 69-80 - [c22]Ian Bogle, George M. Slota:
Achieving Speedups for Distributed Graph Biconnectivity. HPEC 2022: 1-7 - [c21]Michael Mandulak, Ruochen Hu, George M. Slota:
Explicit Ordering Refinement for Accelerating Irregular Graph Analysis. HPEC 2022: 1-8 - [c20]Ian Bogle, George M. Slota:
Distributed Algorithms for the Graph Biconnectivity and Least Common Ancestor Problems. IPDPS Workshops 2022: 1139-1142 - [p2]George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri:
Multicore Algorithms for Graph Connectivity Problems. Massive Graph Analytics 2022: 63-84 - [p1]George M. Slota, Karen D. Devine, Kamesh Madduri, Sivasankaran Rajamanickam:
Partitioning Trillion-Edge Graphs. Massive Graph Analytics 2022: 223-240 - [i5]Christopher Brissette, Andy Huang, George M. Slota:
Parallel coarsening of graph data with spectral guarantees. CoRR abs/2204.11757 (2022) - 2021
- [c19]Christopher Brissette, George M. Slota:
Limitations of Chung Lu Random Graph Generation. COMPLEX NETWORKS 2021: 451-462 - [i4]Christopher Brissette, George M. Slota:
A simple method for improving the accuracy of Chung-Lu random graph generation. CoRR abs/2103.00662 (2021) - [i3]Ian Bogle, Erik G. Boman, Karen D. Devine, Sivasankaran Rajamanickam, George M. Slota:
Parallel Graph Coloring Algorithms for Distributed GPU Environments. CoRR abs/2107.00075 (2021) - 2020
- [j3]George M. Slota, Cameron Root, Karen D. Devine, Kamesh Madduri, Sivasankaran Rajamanickam:
Scalable, Multi-Constraint, Complex-Objective Graph Partitioning. IEEE Trans. Parallel Distributed Syst. 31(12): 2789-2801 (2020) - [c18]Morgan Lee, George M. Slota:
Fast and High Quality Graph Alignment via Treelets. IPDPS Workshops 2020: 170-173 - [c17]Jack Garbus, Christopher Brissette, George M. Slota:
Parallel Generation of Simple Null Graph Models. IPDPS Workshops 2020: 1091-1100 - [c16]George M. Slota, Jack Garbus:
A Parallel LFR-like Benchmark for Evaluating Community Detection Algorithms. IPDPS Workshops 2020: 1112-1115 - [c15]Ian Bogle, Erik G. Boman, Karen D. Devine, Sivasankaran Rajamanickam, George M. Slota:
Distributed Memory Graph Coloring Algorithms for Multiple GPUs. IA3@SC 2020: 54-62
2010 – 2019
- 2019
- [c14]Ian Bogle, Karen D. Devine, Mauro Perego, Sivasankaran Rajamanickam, George M. Slota:
A Parallel Graph Algorithm for Detecting Mesh Singularities in Distributed Memory Ice Sheet Simulations. ICPP 2019: 1:1-1:10 - [c13]George M. Slota, Jonathan W. Berry, Simon D. Hammond, Stephen L. Olivier, Cynthia A. Phillips, Sivasankaran Rajamanickam:
Scalable generation of graphs for benchmarking HPC community-detection algorithms. SC 2019: 73:1-73:14 - 2018
- [c12]George M. Slota, Sivasankaran Rajamanickam:
Experimental Design of Work Chunking for Graph Algorithms on High Bandwidth Memory Architectures. IPDPS 2018: 875-884 - 2017
- [c11]George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri:
Order or Shuffle: Empirically Evaluating Vertex Order Impact on Parallel Graph Computations. IPDPS Workshops 2017: 588-597 - [c10]George M. Slota, Sivasankaran Rajamanickam, Karen D. Devine, Kamesh Madduri:
Partitioning Trillion-Edge Graphs in Minutes. IPDPS 2017: 646-655 - [c9]Sindhuja Parimalarangan, George M. Slota, Kamesh Madduri:
Fast Parallel Graph Triad Census and Triangle Counting on Shared-Memory Platforms. IPDPS Workshops 2017: 1500-1509 - [i2]George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri:
Distributed Graph Layout for Scalable Small-world Network Analysis. CoRR abs/1701.00503 (2017) - 2016
- [j2]George M. Slota, Kamesh Madduri, Sivasankaran Rajamanickam:
Complex Network Partitioning Using Label Propagation. SIAM J. Sci. Comput. 38(5) (2016) - [c8]George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri:
A Case Study of Complex Graph Analysis in Distributed Memory: Implementation and Optimization. IPDPS 2016: 293-302 - [i1]George M. Slota, Sivasankaran Rajamanickam, Karen D. Devine, Kamesh Madduri:
Partitioning Trillion-edge Graphs in Minutes. CoRR abs/1610.07220 (2016) - 2015
- [j1]George M. Slota, Kamesh Madduri:
Parallel color-coding. Parallel Comput. 47: 51-69 (2015) - [c7]George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri:
High-Performance Graph Analytics on Manycore Processors. IPDPS 2015: 17-27 - 2014
- [c6]George M. Slota, Kamesh Madduri, Sivasankaran Rajamanickam:
PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks. IEEE BigData 2014: 481-490 - [c5]George M. Slota, Kamesh Madduri:
Simple parallel biconnectivity algorithms for multicore platforms. HiPC 2014: 1-10 - [c4]George M. Slota, Kamesh Madduri:
Complex Network Analysis Using Parallel Approximate Motif Counting. IPDPS 2014: 405-414 - [c3]George M. Slota, Sivasankaran Rajamanickam, Kamesh Madduri:
BFS and Coloring-Based Parallel Algorithms for Strongly Connected Components and Related Problems. IPDPS 2014: 550-559 - 2013
- [c2]Jingchen Liu, George M. Slota, Gang Zheng, Zhaohui Wu, Minwoo Park, Seungkyu Lee, Ingmar Rauschert, Yanxi Liu:
Symmetry Detection from RealWorld Images Competition 2013: Summary and Results. CVPR Workshops 2013: 200-205 - [c1]George M. Slota, Kamesh Madduri:
Fast Approximate Subgraph Counting and Enumeration. ICPP 2013: 210-219
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-12-04 21:11 CET 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:
