Bader, David A., 1969-
Bader, David A.
![Sudoc [ABES], France](/viaf/images/flags/SUDOC.png "Sudoc [ABES], France")
David A. Bader American computer scientist
VIAF ID: 70042885 (Personal)
Permalink: http://viaf.org/viaf/70042885
Preferred Forms
-
100 1 _ ‡a Bader, David A
-
100 1 _ ‡a Bader, David A.
-
100 1 _
‡a
Bader, David A.
-
100 1 _ ‡a Bader, David A. (sparse)
-
100 1 _ ‡a Bader, David A.
-
100 1 _ ‡a Bader, David A.
-
100 1 _ ‡a Bader, David A. ‡d (1969- )
-
100 1 _ ‡a Bader, David A. ‡d (1969- ).
-
100 1 _
‡a
Bader, David A.
‡d
1969-
-
100 1 _
‡a
Bader, David A.
‡d
1969-
-
100 1 _
‡a
Bader, David A.,
‡d
1969-
-
100 1 _ ‡a Bader, David A., ‡d 1969-
-
100 0 _
‡a
David A. Bader
‡c
American computer scientist
4xx's: Alternate Name Forms (8)
5xx's: Related Names (7)
- 551 _ _
‡a
Bethlehem, Pa.
‡4
ortg
‡4
https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _
‡a
Center for Discrete Mathematics and Theoretical Computer Science
- 510 2 _
‡a
College of Computing
- 510 2 _
‡a
College of Computing
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
- 510 2 _
‡a
HiPC 12, 2005
- 510 2 _
‡a
New Jersey Institute of Technology
‡4
affi
‡4
https://d-nb.info/standards/elementset/gnd#affiliation
‡e
Affiliation
- 510 2 _
‡a
University of Maryland at College Park
Works
| Title | Sources |
|---|---|
| Detecting insider threats in a real corporate database of computer usage activity |
|
| Editor's Note |
|
| A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs) |
|
| Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs |
|
| Graph partitioning and graph clustering : 10th DIMACS Implementation Challenge Workshop, February 13-14, 2012, Georgia Institute of Technology, Atlanta, GA |
|
| Guest Editors' Introduction, Special Issue on High-Performance Computational Biology |
|
| High performance computing--HiPC 2005 : 12th international conference, Goa, India, December 18-21, 2005 : proceedings |
|
| A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. |
|
| Massive graph analytics |
|
| Modeling the Power Variability of Core Speed Scaling on Homogeneous Multicore Systems |
|
| A New Parallel Method for Binary Black Hole Simulations |
|
| Petascale computing : algorithms and applications |
|
| Practical parallel algorithms for personalized communication and integer sorting, 1995: |
|
| Rec-DCM-Eigen: reconstructing a less parsimonious but more accurate tree in shorter time. |
|
| Scalable data parallel algorithms for texture synthesis using Gibbs random fields. |
|
| Scientific computing with multicore and accelerators |
|
| SEECN: SIMULATING COMPLEX SYSTEMS USING DYNAMIC COMPLEX NETWORKS |
|
| Simulating Individual-Based Models of Epidemics in Hierarchical Networks |
|
| Standards for graph algorithm primitives |
|
