Остановите войну!
for scientists:
default search action
David A. Bader
- > Home > Persons > David A. Bader
Publications
- 2011
- [r9]David A. Bader, Guojing Cong:
Graph Algorithms. Encyclopedia of Parallel Computing 2011: 796-805 - [r8]Guojing Cong, David A. Bader:
Hybrid Programming With SIMPLE. Encyclopedia of Parallel Computing 2011: 851-860 - [r7]David A. Bader, Guojing Cong:
Spanning Tree, Minimum Weight. Encyclopedia of Parallel Computing 2011: 1870-1877 - [r6]David A. Bader, Guojing Cong:
SWARM: A Parallel Programming Framework for Multicore Processors. Encyclopedia of Parallel Computing 2011: 1966-1971 - 2007
- [c36]Guojing Cong, David A. Bader:
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors. ISPA 2007: 137-147 - [r2]Guojing Cong, David A. Bader:
Efficient Parallel Graph Algorithms for Multicore and Multiprocessors. Handbook of Parallel Computing 2007 - [r1]Kamesh Madduri, John Feo, Guojing Cong, David A. Bader:
Design of Multithreaded Algorithms for Combinatorial Problems. Handbook of Parallel Computing 2007 - 2006
- [j20]Guojing Cong, David A. Bader:
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols. J. Parallel Distributed Comput. 66(6): 854-866 (2006) - [j19]David A. Bader, Guojing Cong:
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. J. Parallel Distributed Comput. 66(11): 1366-1378 (2006) - 2005
- [j17]David A. Bader, Guojing Cong:
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). J. Parallel Distributed Comput. 65(9): 994-1006 (2005) - [c27]Guojing Cong, David A. Bader:
An Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs. PDCS 2005: 27-34 - [c23]David A. Bader, Guojing Cong, John Feo:
On the Architectural Requirements for Efficient Execution of Graph Algorithms. ICPP 2005: 547-556 - [c22]Guojing Cong, David A. Bader:
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs). IPDPS 2005 - 2004
- [c18]Guojing Cong, David A. Bader:
Lock-Free Parallel Algorithms: An Experimental Study. HiPC 2004: 516-528 - [c16]Guojing Cong, David A. Bader:
The Euler Tour Technique and Parallel Rooted Spanning Tree. ICPP 2004: 448-457 - [c15]David A. Bader, Guojing Cong:
A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors. IPDPS 2004 - [c14]David A. Bader, Guojing Cong:
Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs. IPDPS 2004
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-04-21 18:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint