default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAydin Buluç
Person information
- affiliation: Lawrence Berkeley National Laboratory, USA
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j21]Steven A. Hofmeyr
, Aydin Buluç, Robert Riley, Rob Egan, Oguz Selvitopi, Leonid Oliker, Katherine A. Yelick, Migun Shakya, Brett Youtsey, Ariful Azad:
Exabiome: Advancing Microbial Science through Exascale Computing. Comput. Sci. Eng. 26(2): 8-15 (2024)- [c94]Ujjaini Mukhopadhyay, Alok Tripathy, Oguz Selvitopi, Katherine A. Yelick, Aydin Buluç:
Sparsity-Aware Communication for Distributed Graph Neural Network Training. ICPP 2024: 117-126 - [c93]Benjamin Brock, Aydin Buluç, Katherine A. Yelick:
RDMA-Based Algorithms for Sparse Matrix Multiplication on GPUs. ICS 2024: 225-235 - [c92]Tianyu Liang, Riley Murray, Aydin Buluç, James Demmel:
Fast multiplication of random dense matrices with sparse matrices. IPDPS 2024: 52-62 - [c91]Alok Tripathy, Katherine A. Yelick, Aydin Buluç:
Distributed Matrix-Based Sampling for Graph Neural Network Training. MLSys 2024 - [c90]Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu:
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers. PPoPP 2024: 348-363 - [c89]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Aydin Buluç, James Demmel:
Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition. SPAA 2024: 155-168 - [i57]Yuxi Hong, Aydin Buluç:
A sparsity-aware distributed-memory algorithm for sparse-sparse matrix multiplication. CoRR abs/2408.14558 (2024) - [i56]Jeremy Kepner, Hayden Jananthan, Michael Jones, William Arcand, David Bestor, William Bergeron, Daniel Burrill, Aydin Buluç, Chansup Byun, Timothy Davis, Vijay Gadepally, Daniel Grant, Michael Houle, Matthew Hubbell, Piotr Luszczek, Lauren Milechin, Chasen Milner, Guillermo Morales, Andrew Morris, Julie Mullen, Ritesh Patel, Alex Pentland, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Gabriel Wachman, Charles Yee, Peter Michaleas:
What is Normal? A Big Data Observational Science Model of Anonymized Internet Traffic. CoRR abs/2409.03111 (2024) - [i55]Hayden Jananthan, Michael Jones, William Arcand, David Bestor, William Bergeron, Daniel Burrill, Aydin Buluç, Chansup Byun, Timothy Davis, Vijay Gadepally, Daniel Grant, Michael Houle, Matthew Hubbell, Piotr Luszczek, Peter Michaleas, Lauren Milechin, Chasen Milner, Guillermo Morales, Andrew Morris, Julie Mullen, Ritesh Patel, Alex Pentland, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Gabriel Wachman, Charles Yee, Jeremy Kepner:
Anonymized Network Sensing Graph Challenge. CoRR abs/2409.08115 (2024) - 2023
- [j20]Naw Safrin Sattar, Aydin Buluç, Khaled Z. Ibrahim, Shaikh Arifuzzaman:
Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection. Appl. Netw. Sci. 8(1): 64 (2023) - [c88]Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu:
Optimizing Search Layouts in Packed Memory Arrays. ALENEX 2023: 148-161 - [c87]Benjamin Brock, Scott McMillan, Aydin Buluç, Timothy G. Mattson, José E. Moreira:
C++ and Interoperability Between Libraries: The GraphBLAS C++ Specification. IPDPS Workshops 2023: 207-215 - [c86]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori, Aydin Buluç, James Demmel:
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition. NeurIPS 2023 - [c85]Luk Burchard, Max Xiaohang Zhao, Johannes Langguth, Aydin Buluç, Giulia Guidi:
Space Efficient Sequence Alignment for SRAM-Based Computing: X-Drop on the Graphcore IPU. SC 2023: 33:1-33:16 - [i54]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Laura Grigori, Aydin Buluç, James Demmel:
Fast Exact Leverage Score Sampling from Khatri-Rao Products with Applications to Tensor Decomposition. CoRR abs/2301.12584 (2023) - [i53]Oguz Selvitopi, Saliya Ekanayake, Giulia Guidi, Muaaz G. Awan, Georgios A. Pavlopoulos, Ariful Azad, Nikos Kyrpides, Leonid Oliker, Katherine A. Yelick, Aydin Buluç:
Extreme-scale many-against-many protein similarity search. CoRR abs/2303.01845 (2023) - [i52]Luk Burchard, Max Xiaohang Zhao, Johannes Langguth, Aydin Buluç, Giulia Guidi:
Space Efficient Sequence Alignment for SRAM-Based Computing: X-Drop on the Graphcore IPU. CoRR abs/2304.08662 (2023) - [i51]Brian Wheatman, Randal C. Burns, Aydin Buluç, Helen Xu:
CPMA: An Efficient Batch-Parallel Compressed Set Without Pointers. CoRR abs/2305.05055 (2023) - [i50]Tianyu Liang, Riley Murray, Aydin Buluç, James Demmel:
Fast multiplication of random dense matrices with fixed sparse matrices. CoRR abs/2310.15419 (2023) - [i49]Alok Tripathy, Katherine A. Yelick, Aydin Buluç:
Distributed Matrix-Based Sampling for Graph Neural Network Training. CoRR abs/2311.02909 (2023) - [i48]Benjamin Brock, Aydin Buluç, Katherine A. Yelick:
RDMA-Based Algorithms for Sparse Matrix Multiplication on GPUs. CoRR abs/2311.18141 (2023) - 2022
- [j19]Can Kizilkale, Farid Rashidi Mehrabadi, Erfan Sadeqi Azer, Eva Pérez-Guijarro, Kerrie Marie, Maxwell P. Lee, Chi-Ping Day, Glenn Merlino, Funda Ergün, Aydin Buluç, Süleyman Cenk Sahinalp, Salem Malikic:
Fast intratumor heterogeneity inference from single-cell sequencing data. Nat. Comput. Sci. 2(9): 577-583 (2022) - [j18]Carl Yang, Aydin Buluç, John D. Owens:
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU. ACM Trans. Math. Softw. 48(1): 1:1-1:51 (2022) - [j17]Ariful Azad, Oguz Selvitopi, Md Taufique Hussain, John R. Gilbert, Aydin Buluç:
Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems. IEEE Trans. Parallel Distributed Syst. 33(4): 989-1001 (2022) - [c84]Michael Jones, Jeremy Kepner, Daniel Andersen, Aydin Buluç, Chansup Byun, kc claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Micheal Houle, Matthew Hubbell, Hayden Jananthan, Anna Klein, Chad R. Meiners, Lauren Milechin, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Jon Sreekanth, Doug Stetson, Charles Yee, Peter Michaleas:
GraphBLAS on the Edge: Anonymized High Performance Streaming of Network Traffic. HPEC 2022: 1-8 - [c83]Ivan Kawaminami, Arminda Estrada, Youssef Elsakkary, Hayden Jananthan, Aydin Buluç, Tim Davis, Daniel Grant, Michael Jones, Chad R. Meiners, Andrew Morris, Sandeep Pisharody, Jeremy Kepner:
Large Scale Enrichment and Statistical Cyber Characterization of Network Traffic. HPEC 2022: 1-7 - [c82]Srdan Milakovic, Oguz Selvitopi, Israt Nisa, Zoran Budimlic, Aydin Buluç:
Parallel Algorithms for Masked Sparse Matrix-Matrix Products. ICPP 2022: 10:1-10:11 - [c81]Yuxin Chen, Benjamin Brock, Serban D. Porumbescu, Aydin Buluç, Katherine A. Yelick, John D. Owens:
Atos: A Task-Parallel GPU Scheduler for Graph Analytics. ICPP 2022: 50:1-50:11 - [c80]Giulia Guidi, Gabriel Raulet, Daniel Rokhsar, Leonid Oliker, Katherine A. Yelick, Aydin Buluç:
Distributed-Memory Parallel Contig Generation for De Novo Long-Read Genome Assembly. ICPP 2022: 82:1-82:11 - [c79]Vivek Bharadwaj, Aydin Buluç, James Demmel:
Distributed-Memory Sparse Kernels for Machine Learning. IPDPS 2022: 47-58 - [c78]Benjamin Brock, Scott McMillan, Aydin Buluç, Timothy G. Mattson, José E. Moreira:
GraphBLAS: C++ Iterators for Sparse Matrices. IPDPS Workshops 2022: 238-246 - [c77]Jeremy Kepner, Michael Jones, Daniel Andersen, Aydin Buluç, Chansup Byun, kc claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Daniel Grant, Micheal Houle, Matthew Hubbell, Hayden Jananthan, Anna Klein, Chad R. Meiners, Lauren Milechin, Andrew Morris, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Doug Stetson, Charles Yee, Peter Michaleas:
Temporal Correlation of Internet Observatories and Outposts. IPDPS Workshops 2022: 247-254 - [c76]Md Taufique Hussain, Guttu Sai Abhishek, Aydin Buluç, Ariful Azad:
Parallel Algorithms for Adding a Collection of Sparse Matrices. IPDPS Workshops 2022: 285-294 - [c75]Aydin Buluç:
Sparse Matrices Powering Three Pillars of Science: Simulation, Data, and Learning. ISSAC 2022: 31 - [c74]Srdan Milakovic, Oguz Selvitopi, Israt Nisa, Zoran Budimlic, Aydin Buluç:
Parallel algorithms for masked sparse matrix-matrix products. PPoPP 2022: 453-454 - [c73]Oguz Selvitopi, Saliya Ekanayake, Giulia Guidi, Muaaz G. Awan, Georgios A. Pavlopoulos, Ariful Azad, Nikos Kyrpides, Leonid Oliker, Katherine A. Yelick, Aydin Buluç:
Extreme-Scale Many-against-Many Protein Similarity Search. SC 2022: 1:1-1:12 - [c72]Yuxin Chen, Benjamin Brock, Serban D. Porumbescu, Aydin Buluç, Katherine A. Yelick, John D. Owens:
Scalable Irregular Parallelism with GPUs: Getting CPUs Out of the Way. SC 2022: 50:1-50:16 - [p4]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 - [i47]Vivek Bharadwaj, Aydin Buluç, James Demmel:
Distributed-Memory Sparse Kernels for Machine Learning. CoRR abs/2203.07673 (2022) - [i46]Jeremy Kepner, Michael Jones, Daniel Andersen, Aydin Buluç, Chansup Byun, Kimberly C. Claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Daniel Grant, Micheal Houle, Matthew Hubbell, Hayden Jananthan, Anna Klein, Chad R. Meiners, Lauren Milechin, Andrew Morris, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Doug Stetson, Charles Yee, Peter Michaleas:
Temporal Correlation of Internet Observatories and Outposts. CoRR abs/2203.10230 (2022) - [i45]Michael Jones, Jeremy Kepner, Daniel Andersen, Aydin Buluç, Chansup Byun, Kimberly C. Claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Micheal Houle, Matthew Hubbell, Hayden Jananthan, Anna Klein, Chad R. Meiners, Lauren Milechin, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Jon Sreekanth, Doug Stetson, Charles Yee, Peter Michaleas:
GraphBLAS on the Edge: High Performance Streaming of Network Traffic. CoRR abs/2203.13934 (2022) - [i44]Giulia Guidi, Gabriel Raulet, Daniel Rokhsar, Leonid Oliker, Katherine A. Yelick, Aydin Buluç:
Distributed-Memory Parallel Contig Generation for De Novo Long-Read Genome Assembly. CoRR abs/2207.04350 (2022) - [i43]Ivan Kawaminami, Arminda Estrada, Youssef Elsakkary, Hayden Jananthan, Aydin Buluç, Tim Davis, Daniel Grant, Michael Jones, Chad R. Meiners, Andrew Morris, Sandeep Pisharody, Jeremy Kepner:
Large Scale Enrichment and Statistical Cyber Characterization of Network Traffic. CoRR abs/2209.03341 (2022) - [i42]Vivek Bharadwaj, Osman Asif Malik, Riley Murray, Aydin Buluç, James Demmel:
Distributed-Memory Randomized Algorithms for Sparse Tensor CP Decomposition. CoRR abs/2210.05105 (2022) - 2021
- [j16]Seher Acer, Ariful Azad, Erik G. Boman, Aydin Buluç, Karen D. Devine, S. M. Ferdous, Nitin Gawande, Sayan Ghosh, Mahantesh Halappanavar, Ananth Kalyanaraman, Arif Khan, Marco Minutoli, Alex Pothen, Sivasankaran Rajamanickam, Oguz Selvitopi, Nathan R. Tallent, Antonino Tumeo:
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications. Int. J. High Perform. Comput. Appl. 35(6): 553-571 (2021) - [j15]Jeremy T. Fineman, Aydin Buluç, Seth Gilbert:
Introduction to the Special Issue for SPAA 2018: Part 1. ACM Trans. Parallel Comput. 8(1): 3e:1 (2021) - [j14]Jeremy T. Fineman, Aydin Buluç, Seth Gilbert:
Introduction to the Special Issue for SPAA 2018 - Part 2. ACM Trans. Parallel Comput. 8(2): 6:1 (2021) - [c71]Giulia Guidi, Marquita Ellis, Daniel Rokhsar, Katherine A. Yelick, Aydin Buluç:
BELLA: Berkeley Efficient Long-Read to Long-Read Aligner and Overlapper. ACDA 2021: 123-134 - [c70]Jeremy Kepner, Michael Jones, Daniel Andersen, Aydin Buluç, Chansup Byun, Kimberly C. Claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Micheal Houle, Matthew Hubbell, Anna Klein, Chad R. Meiners, Lauren Milechin, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Doug Stetson, Adam Tse, Charles Yee, Peter Michaleas:
Spatial Temporal Analysis of 40, 000, 000, 000, 000 Internet Darkspace Packets. HPEC 2021: 1-8 - [c69]Marquita Ellis, Aydin Buluç, Katherine A. Yelick:
Scaling Generalized N-Body Problems, A Case Study from Genomics. ICPP 2021: 64:1-64:9 - [c68]Oguz Selvitopi, Benjamin Brock, Israt Nisa, Alok Tripathy, Katherine A. Yelick, Aydin Buluç:
Distributed-memory parallel algorithms for sparse times tall-skinny-dense matrix multiplication. ICS 2021: 431-442 - [c67]Md Taufique Hussain, Oguz Selvitopi, Aydin Buluç, Ariful Azad:
Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale. IPDPS 2021: 90-100 - [c66]Benjamin Brock, Aydin Buluç, Timothy G. Mattson, Scott McMillan, José E. Moreira:
Introduction to GraphBLAS 2.0. IPDPS Workshops 2021: 253-262 - [c65]Giulia Guidi, Oguz Selvitopi, Marquita Ellis, Leonid Oliker, Katherine A. Yelick, Aydin Buluç:
Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly. IPDPS 2021: 517-526 - [c64]Israt Nisa, Prashant Pandey, Marquita Ellis, Leonid Oliker, Aydin Buluç, Katherine A. Yelick:
Distributed-Memory k-mer Counting on GPUs. IPDPS 2021: 527-536 - [c63]Marquita Ellis, Aydin Buluç, Katherine A. Yelick:
Asynchrony versus bulk-synchrony for a generalized N-body problem from genomics. PPoPP 2021: 465-466 - [c62]Muaaz Gul Awan, Steven A. Hofmeyr, Rob Egan, Nan Ding, Aydin Buluç, Jack Deslippe, Leonid Oliker, Katherine A. Yelick:
Accelerating large scale de novo metagenome assembly using GPUs. SC 2021: 7 - [c61]Prashant Pandey, Brian Wheatman, Helen Xu, Aydin Buluç:
Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs. SIGMOD Conference 2021: 1372-1385 - [c60]Giulia Guidi, Marquita Ellis, Aydin Buluç, Katherine A. Yelick, David E. Culler:
10 Years Later: Cloud Computing is Closing the Performance Gap. ICPE (Companion) 2021: 41-48 - [i41]Aydin Buluç, Tamara G. Kolda, Stefan M. Wild, Mihai Anitescu, Anthony M. DeGennaro, John Jakeman, Chandrika Kamath, Ramakrishnan Kannan, Miles E. Lopes, Per-Gunnar Martinsson, Kary L. Myers, Jelani Nelson, Juan M. Restrepo, C. Seshadhri, Draguna L. Vrabie, Brendt Wohlberg, Stephen J. Wright, Chao Yang, Peter Zwart:
Randomized Algorithms for Scientific Computing (RASC). CoRR abs/2104.11079 (2021) - [i40]Ariful Azad, Oguz Selvitopi, Md Taufique Hussain, John R. Gilbert, Aydin Buluç:
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems. CoRR abs/2106.14402 (2021) - [i39]Jeremy Kepner, Michael Jones, Daniel Andersen, Aydin Buluç, Chansup Byun, Kimberly C. Claffy, Timothy Davis, William Arcand, Jonathan Bernays, David Bestor, William Bergeron, Vijay Gadepally, Micheal Houle, Matthew Hubbell, Anna Klein, Chad R. Meiners, Lauren Milechin, Julie Mullen, Sandeep Pisharody, Andrew Prout, Albert Reuther, Antonio Rosa, Siddharth Samsi, Doug Stetson, Adam Tse, Charles Yee, Peter Michaleas:
Spatial Temporal Analysis of 40, 000, 000, 000, 000 Internet Darkspace Packets. CoRR abs/2108.06653 (2021) - [i38]Srdan Milakovic, Oguz Selvitopi, Israt Nisa, Zoran Budimlic, Aydin Buluç:
Parallel Algorithms for Masked Sparse Matrix-Matrix Products. CoRR abs/2111.09947 (2021) - [i37]Yuxin Chen, Benjamin Brock, Serban D. Porumbescu, Aydin Buluç, Katherine A. Yelick, John D. Owens:
Atos: A Task-Parallel GPU Dynamic Scheduling Framework for Dynamic Irregular Computations. CoRR abs/2112.00132 (2021) - [i36]Md Taufique Hussain, Guttu Sai Abhishek, Aydin Buluç, Ariful Azad:
Parallel Algorithms for Adding a Collection of Sparse Matrices. CoRR abs/2112.10223 (2021) - 2020
- [j13]Muaaz G. Awan, Jack Deslippe, Aydin Buluç, Oguz Selvitopi, Steven A. Hofmeyr, Leonid Oliker, Katherine A. Yelick:
ADEPT: a domain independent sequence alignment strategy for gpu architectures. BMC Bioinform. 21(1): 406 (2020) - [j12]Yongzhe Zhang, Ariful Azad, Aydin Buluç:
Parallel algorithms for finding connected components using linear algebra. J. Parallel Distributed Comput. 144: 14-27 (2020) - [j11]Ariful Azad, Aydin Buluç, Xiaoye S. Li, Xinliang Wang, Johannes Langguth:
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs. SIAM J. Sci. Comput. 42(4): C143-C168 (2020) - [c59]Oguz Selvitopi, Md Taufique Hussain, Ariful Azad, Aydin Buluç:
Optimizing High Performance Markov Clustering for Pre-Exascale Architectures. IPDPS 2020: 116-126 - [c58]Francesco Peverelli, Lorenzo Di Tucci, Marco D. Santambrogio, Nan Ding, Steven A. Hofmeyr, Aydin Buluç, Leonid Oliker, Katherine A. Yelick:
GPU accelerated partial order multiple sequence alignment for long reads self-correction. IPDPS Workshops 2020: 174-182 - [c57]Benjamin Brock, Aydin Buluç, Timothy G. Mattson, Scott McMillan, José E. Moreira, Roger Pearce, Oguz Selvitopi, Trevor Steil:
Considerations for a Distributed GraphBLAS API. IPDPS Workshops 2020: 215-218 - [c56]Benjamin Brock, Aydin Buluç, Timothy G. Mattson, Scott McMillan, José E. Moreira:
A Roadmap for the GraphBLAS C++ API. IPDPS Workshops 2020: 219-222 - [c55]Alberto Zeni, Giulia Guidi, Marquita Ellis, Nan Ding, Marco D. Santambrogio, Steven A. Hofmeyr, Aydin Buluç, Leonid Oliker, Katherine A. Yelick:
LOGAN: High-Performance GPU-Based X-Drop Long-Read Alignment. IPDPS 2020: 462-471 - [c54]Yu-Hang Tang, Oguz Selvitopi, Doru-Thom Popovici, Aydin Buluç:
A High-Throughput Solver for Marginalized Graph Kernels on GPU. IPDPS 2020: 728-738 - [c53]Alok Tripathy, Katherine A. Yelick, Aydin Buluç:
Reducing communication in graph neural network training. SC 2020: 70 - [c52]Oguz Selvitopi, Saliya Ekanayake, Giulia Guidi, Georgios A. Pavlopoulos, Ariful Azad, Aydin Buluç:
Distributed many-to-many protein sequence alignment using sparse matrices. SC 2020: 75 - [i35]Katherine A. Yelick, Aydin Buluç, Muaaz G. Awan, Ariful Azad, Benjamin Brock, Rob Egan, Saliya Ekanayake, Marquita Ellis, Evangelos Georganas, Giulia Guidi, Steven A. Hofmeyr, Oguz Selvitopi, Cristina Teodoropol, Leonid Oliker:
The Parallelism Motifs of Genomic Data Analysis. CoRR abs/2001.06989 (2020) - [i34]Marquita Ellis, Giulia Guidi, Aydin Buluç, Leonid Oliker, Katherine A. Yelick:
diBELLA: Distributed Long Read to Long Read Alignment. CoRR abs/2001.10049 (2020) - [i33]Alberto Zeni, Giulia Guidi, Marquita Ellis, Nan Ding, Marco D. Santambrogio, Steven A. Hofmeyr, Aydin Buluç, Leonid Oliker, Katherine A. Yelick:
LOGAN: High-Performance GPU-Based X-Drop Long-Read Alignment. CoRR abs/2002.05200 (2020) - [i32]Oguz Selvitopi, Md Taufique Hussain, Ariful Azad, Aydin Buluç:
Optimizing High Performance Markov Clustering for Pre-Exascale Architectures. CoRR abs/2002.10083 (2020) - [i31]Alok Tripathy, Katherine A. Yelick, Aydin Buluç:
Reducing Communication in Graph Neural Network Training. CoRR abs/2005.03300 (2020) - [i30]Oguz Selvitopi, Saliya Ekanayake, Giulia Guidi, Georgios A. Pavlopoulos, Ariful Azad, Aydin Buluç:
Distributed Many-to-Many Protein Sequence Alignment using Sparse Matrices. CoRR abs/2009.14467 (2020) - [i29]Md Taufique Hussain, Oguz Selvitopi, Aydin Buluç, Ariful Azad:
Communication-Avoiding and Memory-Constrained Sparse Matrix-Matrix Multiplication at Extreme Scale. CoRR abs/2010.08526 (2020) - [i28]Giulia Guidi, Oguz Selvitopi, Marquita Ellis, Leonid Oliker, Katherine A. Yelick, Aydin Buluç:
Parallel String Graph Construction and Transitive Reduction for De Novo Genome Assembly. CoRR abs/2010.10055 (2020) - [i27]Nicolas Swenson, Aditi S. Krishnapriyan, Aydin Buluç, Dmitriy Morozov, Katherine A. Yelick:
PersGNN: Applying Topological Data Analysis and Geometric Deep Learning to Structure-Based Protein Function Prediction. CoRR abs/2010.16027 (2020) - [i26]Giulia Guidi, Marquita Ellis, Aydin Buluç, Katherine A. Yelick, David E. Culler:
10 Years Later: Cloud Computing is Closing the Performance Gap. CoRR abs/2011.00656 (2020)
2010 – 2019
- 2019
- [j10]Yusuke Nagasaka, Satoshi Matsuoka, Ariful Azad, Aydin Buluç:
Performance optimization, modeling and analysis of sparse matrix-matrix products on multi-core and many-core processors. Parallel Comput. 90 (2019) - [c51]Santosh Pandey, Xiaoye Sherry Li, Aydin Buluç, Jiejun Xu, Hang Liu:
H-INDEX: Hash-Indexing for Parallel Triangle Counting on GPUs. HPEC 2019: 1-7 - [c50]Marquita Ellis, Giulia Guidi, Aydin Buluç, Leonid Oliker, Katherine A. Yelick:
diBELLA: Distributed Long Read to Long Read Alignment. ICPP 2019: 70:1-70:11 - [c49]Benjamin Brock, Aydin Buluç, Katherine A. Yelick:
BCL: A Cross-Platform Distributed Data Structures Library. ICPP 2019: 102:1-102:10 - [c48]Ariful Azad, Aydin Buluç:
LACC: A Linear-Algebraic Algorithm for Finding Connected Components in Distributed Memory. IPDPS 2019: 2-12 - [c47]Muhammad Osama, Minh Truong, Carl Yang, Aydin Buluç, John D. Owens:
Graph Coloring on the GPU. IPDPS Workshops 2019: 231-240 - [c46]Tim Mattson, Timothy A. Davis, Manoj Kumar, Aydin Buluç, Scott McMillan, José E. Moreira, Carl Yang:
LAGraph: A Community Effort to Collect Graph Algorithms Built on Top of the GraphBLAS. IPDPS Workshops 2019: 276-284 - [c45]Benjamin A. Brock, Yuxin Chen, Jiakun Yan, John D. Owens, Aydin Buluç, Katherine A. Yelick:
RDMA vs. RPC for Implementing Distributed Data Structures. IA3@SC 2019: 17-22 - [i25]Carl Yang, Aydin Buluç, John D. Owens:
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU. CoRR abs/1908.01407 (2019) - [i24]Benjamin Brock, Yuxin Chen, Jiakun Yan, John D. Owens, Aydin Buluç, Katherine A. Yelick:
RDMA vs. RPC for Implementing Distributed Data Structures. CoRR abs/1910.02158 (2019) - [i23]Yu-Hang Tang, Oguz Selvitopi, Doru Popovici, Aydin Buluç:
A High-Throughput Solver for Marginalized Graph Kernels on GPU. CoRR abs/1910.06310 (2019) - 2018
- [c44]Penporn Koanantakool, Alnur Ali, Ariful Azad, Aydin Buluç, Dmitriy Morozov, Leonid Oliker, Katherine A. Yelick, Sang-Yun Oh:
Communication-Avoiding Optimization Methods for Distributed Massive-Scale Sparse Inverse Covariance Estimation. AISTATS 2018: 1376-1386 - [c43]Carl Yang, Aydin Buluç, John D. Owens:
Design Principles for Sparse Matrix Multiplication on the GPU. Euro-Par 2018: 672-687 - [c42]Carl Yang, Aydin Buluç, John D. Owens:
Implementing Push-Pull Efficiently in GraphBLAS. ICPP 2018: 89:1-89:11 - [c41]Yusuke Nagasaka, Satoshi Matsuoka, Ariful Azad, Aydin Buluç:
High-Performance Sparse Matrix-Matrix Products on Intel KNL and Multicore Architectures. ICPP Workshops 2018: 34:1-34:10 - [c40]Evangelos Georganas, Rob Egan, Steven A. Hofmeyr, Eugene Goltsman, Bill Arndt, Andrew Tritt, Aydin Buluç, Leonid Oliker, Katherine A. Yelick:
Extreme scale de novo metagenome assembly. SC 2018: 10:1-10:13 - [c39]Amir Gholami, Ariful Azad, Peter H. Jin, Kurt Keutzer, Aydin Buluç:
Integrated Model, Batch, and Domain Parallelism in Training Neural Networks. SPAA 2018: 77-86 - [i22]Ariful Azad, Aydin Buluç, Xiaoye S. Li, Xinliang Wang, Johannes Langguth:
A distributed-memory approximation algorithm for maximum weight perfect bipartite matching. CoRR abs/1801.09809 (2018) - [i21]Carl Yang, Aydin Buluç, John D. Owens:
Design Principles for Sparse Matrix Multiplication on the GPU. CoRR abs/1803.08601 (2018) - [i20]Yusuke Nagasaka, Satoshi Matsuoka, Ariful Azad, Aydin Buluç:
High-performance sparse matrix-matrix products on Intel KNL and multicore architectures. CoRR abs/1804.01698 (2018) - [i19]Carl Yang, Aydin Buluç, John D. Owens:
Implementing Push-Pull Efficiently in GraphBLAS. CoRR abs/1804.03327 (2018) - [i18]Evangelos Georganas, Rob Egan, Steven A. Hofmeyr, Eugene Goltsman, Bill Arndt, Andrew Tritt, Aydin Buluç, Leonid Oliker, Katherine A. Yelick:
Extreme Scale De Novo Metagenome Assembly. CoRR abs/1809.07014 (2018) - [i17]Benjamin Brock, Aydin Buluç, Katherine A. Yelick:
BCL: A Cross-Platform Distributed Container Library. CoRR abs/1810.13029 (2018) - 2017
- [j9]Ariful Azad, Aydin Buluç, Alex Pothen:
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting. IEEE Trans. Parallel Distributed Syst. 28(1): 44-59 (2017) - [j8]Hasan Metin Aktulga, Md. Afibuzzaman, Samuel Williams, Aydin Buluç, Meiyue Shao, Chao Yang, Esmond G. Ng, Pieter Maris, James P. Vary:
A High Performance Block Eigensolver for Nuclear Configuration Interaction Calculations. IEEE Trans. Parallel Distributed Syst. 28(6): 1550-1563 (2017) - [c38]Marquita Ellis, Evangelos Georganas, Rob Egan, Steven A. Hofmeyr, Aydin Buluç, Brandon Cook, Leonid Oliker, Katherine A. Yelick:
Performance Characterization of De Novo Genome Assembly on Leading Parallel Systems. Euro-Par 2017: 79-91 - [c37]Timothy G. Mattson, Carl Yang, Scott McMillan, Aydin Buluç, José E. Moreira:
GraphBLAS C API: Ideas for future versions of the specification. HPEC 2017: 1-6 - [c36]Ariful Azad, Mathias Jacquelin, Aydin Buluç, Esmond G. Ng:
The Reverse Cuthill-McKee Algorithm in Distributed-Memory. IPDPS 2017: 22-31 - [c35]Aydin Buluç, Tim Mattson:
Introduction to GABB Workshop. IPDPS Workshops 2017: 577 - [c34]Aydin Buluç, Tim Mattson, Scott McMillan, José E. Moreira, Carl Yang:
Design of the GraphBLAS API for C. IPDPS Workshops 2017: 643-652 - [c33]Ariful Azad, Aydin Buluç:
A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm. IPDPS 2017: 688-697 - [c32]Ariful Azad, Aydin Buluç:
Towards a GraphBLAS Library in Chapel. IPDPS Workshops 2017: 1095-1104 - [c31]Evangelos Georganas, Marquita Ellis, Rob Egan, Steven A. Hofmeyr, Aydin Buluç, Brandon Cook, Leonid Oliker, Katherine A. Yelick:
MerBench: PGAS Benchmarks for High Performance Genome Assembly. PAW@SC 2017: 5:1-5:4 - [c30]Yang You, Aydin Buluç, James Demmel:
Scaling deep learning on GPU and knights landing clusters. SC 2017: 9 - [i16]Aydin Buluç, Scott Beamer, Kamesh Madduri, Krste Asanovic, David A. Patterson:
Distributed-Memory Breadth-First Search on Massive Graphs. CoRR abs/1705.04590 (2017) - [i15]Evangelos Georganas, Steven A. Hofmeyr, Rob Egan, Aydin Buluç, Leonid Oliker, Daniel Rokhsar, Katherine A. Yelick:
Extreme-Scale De Novo Genome Assembly. CoRR abs/1705.11147 (2017) - [i14]Yang You, Aydin Buluç, James Demmel:
Scaling Deep Learning on GPU and Knights Landing clusters. CoRR abs/1708.02983 (2017) - [i13]Penporn Koanantakool, Alnur Ali, Ariful Azad, Aydin Buluç, Dmitriy Morozov, Sang-Yun Oh, Leonid Oliker, Katherine A. Yelick:
Communication-Avoiding Optimization Methods for Massive-Scale Graphical Model Structure Learning. CoRR abs/1710.10769 (2017) - [i12]Amir Gholami, Ariful Azad, Kurt Keutzer, Aydin Buluç:
Integrated Model and Data Parallelism in Training Neural Networks. CoRR abs/1712.04432 (2017) - 2016
- [j7]Ariful Azad, Aydin Buluç:
A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs. Parallel Comput. 58: 117-130 (2016) - [j6]Ariful Azad, Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, Samuel Williams:
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication. SIAM J. Sci. Comput. 38(6) (2016) - [c29]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 - [c28]Ariful Azad, Aydin Buluç:
Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs. IPDPS 2016: 32-42 - [c27]Penporn Koanantakool, Ariful Azad, Aydin Buluç, Dmitriy Morozov, Sang-Yun Oh, Leonid Oliker, Katherine A. Yelick:
Communication-Avoiding Parallel Sparse-Dense Matrix-Matrix Multiplication. IPDPS 2016: 842-853 - [p3]Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Graph Partitioning. Algorithm Engineering 2016: 117-158 - [i11]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) - [i10]Veronika Strnadová-Neeley, Aydin Buluç, John R. Gilbert, Leonid Oliker, Weimin Ouyang:
LiRa: A New Likelihood-Based Similarity Score for Collaborative Filtering. CoRR abs/1608.08646 (2016) - [i9]Ariful Azad, Aydin Buluç:
A work-efficient parallel sparse matrix-sparse vector multiplication algorithm. CoRR abs/1610.07902 (2016) - [i8]Ariful Azad, Mathias Jacquelin, Aydin Buluç, Esmond G. Ng:
The Reverse Cuthill-McKee Algorithm in Distributed-Memory. CoRR abs/1610.08128 (2016) - 2015
- [j5]Adam Lugowski, Shoaib Kamil, Aydin Buluç, Samuel Williams, Erika Duriakova, Leonid Oliker, Armando Fox, John R. Gilbert:
Parallel processing of filtered queries in attributed semantic graphs. J. Parallel Distributed Comput. 79-80: 115-131 (2015) - [j4]Aydin Buluç, Leonid Oliker, John R. Gilbert:
Special issue "Graph analysis for scientific discovery". Parallel Comput. 47: 1-2 (2015) - [c26]Veronika Strnadová-Neeley, Aydin Buluç, Jarrod Chapman, John R. Gilbert, Joseph Gonzalez, Leonid Oliker:
Efficient data reduction for large-scale genetic mapping. BCB 2015: 126-135 - [c25]Ariful Azad, Aydin Buluç:
Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra. CLUSTER 2015: 398-407 - [c24]Jeremy Kepner, David A. Bader, Aydin Buluç, John R. Gilbert, Timothy G. Mattson, Henning Meyerhenke:
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons. ICCS 2015: 2453-2462 - [c23]Evangelos Georganas, Aydin Buluç, Jarrod Chapman, Leonid Oliker, Daniel Rokhsar, Katherine A. Yelick:
merAligner: A Fully Parallel Sequence Aligner. IPDPS 2015: 561-570 - [c22]Ariful Azad, Aydin Buluç, John R. Gilbert:
Parallel Triangle Counting and Enumeration Using Matrix Algebra. IPDPS Workshops 2015: 804-811 - [c21]Ariful Azad, Aydin Buluç, Alex Pothen:
A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs. IPDPS 2015: 1075-1084 - [c20]Evangelos Georganas, Aydin Buluç, Jarrod Chapman, Steven A. Hofmeyr, Chaitanya Aluru, Rob Egan, Leonid Oliker, Daniel Rokhsar, Katherine A. Yelick:
HipMer: an extreme-scale de novo genome assembler. SC 2015: 14:1-14:11 - [i7]Jeremy Kepner, David A. Bader, Aydin Buluç, John R. Gilbert, Timothy G. Mattson, Henning Meyerhenke:
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons. CoRR abs/1504.01039 (2015) - [i6]Ariful Azad, Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Oded Schwartz, Sivan Toledo, Samuel Williams:
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication. CoRR abs/1510.00844 (2015) - 2014
- [c19]Veronika Strnadova, Aydin Buluç, Jarrod Chapman, John R. Gilbert, Joseph Gonzalez, Stefanie Jegelka, Daniel Rokhsar, Leonid Oliker:
Efficient and accurate clustering for large-scale genetic mapping. BIBM 2014: 3-10 - [c18]Tim Mattson, David A. Bader, Aydin Buluç, John R. Gilbert, Joseph Gonzalez, Jeremy Kepner:
GABB Introduction. IPDPS Workshops 2014: 1135-1137 - [c17]Hasan Metin Aktulga, Aydin Buluç, Samuel Williams, Chao Yang:
Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations. IPDPS 2014: 1213-1222 - [c16]Evangelos Georganas, Aydin Buluç, Jarrod Chapman, Leonid Oliker, Daniel Rokhsar, Katherine A. Yelick:
Parallel De Bruijn Graph Construction and Traversal for De Novo Genome Assembly. SC 2014: 437-448 - [i5]Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen W. Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for Graph Algorithm Primitives. CoRR abs/1408.0393 (2014) - 2013
- [c15]Tim Mattson, David A. Bader, Jonathan W. Berry, Aydin Buluç, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo:
Standards for graph algorithm primitives. HPEC 2013: 1-2 - [c14]Aydin Buluç, Erika Duriakova, Armando Fox, John R. Gilbert, Shoaib Kamil, Adam Lugowski, Leonid Oliker, Samuel Williams:
High-Productivity and High-Performance Analysis of Filtered Semantic Graphs. IPDPS 2013: 237-248 - [c13]Edgar Solomonik, Aydin Buluç, James Demmel:
Minimizing Communication in All-Pairs Shortest Paths. IPDPS 2013: 548-559 - [c12]Scott Beamer, Aydin Buluç, Krste Asanovic, David A. Patterson:
Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search. IPDPS Workshops 2013: 1618-1627 - [c11]Grey Ballard, Aydin Buluç, James Demmel, Laura Grigori, Benjamin Lipshitz, Oded Schwartz, Sivan Toledo:
Communication optimal parallel multiplication of sparse random matrices. SPAA 2013: 222-231 - [i4]Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Graph Partitioning. CoRR abs/1311.3144 (2013) - 2012
- [j3]Aydin Buluç, John R. Gilbert:
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments. SIAM J. Sci. Comput. 34(4) (2012) - [c10]Aydin Buluç, Armando Fox, John R. Gilbert, Shoaib Kamil, Adam Lugowski, Leonid Oliker, Samuel Williams:
High-performance analysis of filtered semantic graphs. PACT 2012: 463-464 - [c9]Krishna Chaitanya Kandalla, Aydin Buluç, Hari Subramoni, Karen Tomko, Jérôme Vienne, Leonid Oliker, Dhabaleswar K. Panda:
Can Network-Offload Based Non-blocking Neighborhood MPI Collectives Improve Communication Overheads of Irregular Graph Algorithms? CLUSTER Workshops 2012: 222-230 - [c8]Aydin Buluç, Kamesh Madduri:
Graph partitioning for scalable distributed graph computations. Graph Partitioning and Graph Clustering 2012: 83-102 - [c7]Adam Lugowski, Aydin Buluç, John R. Gilbert, Steven P. Reinhardt:
Scalable complex graph analysis with the knowledge discovery toolbox. ICASSP 2012: 5345-5348 - [c6]Adam Lugowski, David M. Alber, Aydin Buluç, John R. Gilbert, Steven P. Reinhardt, Yun Teng, Andrew Waranis:
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis. SDM 2012: 930-941 - 2011
- [j2]Aydin Buluç, John R. Gilbert:
The Combinatorial BLAS: design, implementation, and applications. Int. J. High Perform. Comput. Appl. 25(4): 496-509 (2011) - [c5]Aydin Buluç, Samuel Williams, Leonid Oliker, James Demmel:
Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication. IPDPS 2011: 721-733 - [c4]Aydin Buluç, Kamesh Madduri:
Parallel breadth-first search on distributed memory systems. SC 2011: 65:1-65:12 - [p2]Aydin Buluç, John R. Gilbert, Viral B. Shah:
Implementing Sparse Matrices for Graph Algorithms. Graph Algorithms in the Language of Linear Algebra 2011: 287-313 - [p1]Aydin Buluç, John R. Gilbert:
New Ideas in Sparse Matrix Matrix Multiplication. Graph Algorithms in the Language of Linear Algebra 2011: 315-337 - [i3]Aydin Buluç, Kamesh Madduri:
Parallel Breadth-First Search on Distributed Memory Systems. CoRR abs/1104.4518 (2011) - [i2]Aydin Buluç, John R. Gilbert:
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments. CoRR abs/1109.3739 (2011) - 2010
- [j1]Aydin Buluç, John R. Gilbert, Ceren Budak:
Solving path problems on the GPU. Parallel Comput. 36(5-6): 241-253 (2010) - [i1]Aydin Buluç, John R. Gilbert:
Highly Parallel Sparse Matrix-Matrix Multiplication. CoRR abs/1006.2183 (2010)
2000 – 2009
- 2009
- [c3]Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, Charles E. Leiserson:
Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. SPAA 2009: 233-244 - 2008
- [c2]Aydin Buluç, John R. Gilbert:
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication. ICPP 2008: 503-510 - [c1]Aydin Buluç, John R. Gilbert:
On the representation and multiplication of hypersparse matrices. IPDPS 2008: 1-11
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-23 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:
