| 2009 |
|---|
| 81 | EE | Seunghwa Kang,
David A. Bader:
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs.
PPOPP 2009: 15-24 |
| 80 | EE | Amrita Mathuriya,
David A. Bader,
Christine E. Heitsch,
Stephen C. Harvey:
GTfold: a scalable multicore code for RNA secondary structure prediction.
SAC 2009: 981-988 |
| 79 | EE | David A. Bader,
Virat Agarwal,
Seunghwa Kang:
Computing discrete transforms on the Cell Broadband Engine.
Parallel Computing 35(3): 119-137 (2009) |
| 2008 |
|---|
| 78 | EE | David A. Bader:
Petascale Computing for Large-Scale Graph Problems.
CISIS 2008: 779 |
| 77 | EE | David A. Bader,
Aparna Chandramowlishwaran,
Virat Agarwal:
On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis.
ICPP 2008: 520-527 |
| 76 | EE | Seunghwa Kang,
David A. Bader:
Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine.
ICPP 2008: 83-90 |
| 75 | EE | David A. Bader,
Sulabh Patel:
High performance MPEG-2 software decoder on the cell broadband engine.
IPDPS 2008: 1-10 |
| 74 | EE | Virat Agarwal,
Lurng-Kuo Liu,
David A. Bader:
Financial modeling on the cell broadband engine.
IPDPS 2008: 1-12 |
| 73 | EE | David A. Bader,
Kamesh Madduri:
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks.
IPDPS 2008: 1-12 |
| 72 | EE | David A. Bader,
Viktor K. Prasanna:
DOSA: design optimizer for scientific applications.
IPDPS 2008: 1-5 |
| 71 | EE | David A. Bader:
Engineering Algorithms for Computational Biology.
Encyclopedia of Algorithms 2008 |
| 70 | EE | David A. Bader:
High Performance Algorithm Engineering for Large-scale Problems.
Encyclopedia of Algorithms 2008 |
| 69 | EE | David A. Bader:
Sorting Signed Permutations by Reversal (Reversal Distance).
Encyclopedia of Algorithms 2008 |
| 68 | EE | David A. Bader,
Srinivas Aluru:
High-performance computational biology.
Parallel Computing 34(11): 613-615 (2008) |
| 67 | EE | David A. Bader,
Kamesh Madduri:
A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms.
Parallel Computing 34(11): 627-639 (2008) |
| 2007 |
|---|
| 66 | EE | Kamesh Madduri,
David A. Bader,
Jonathan W. Berry,
Joseph R. Crobak:
An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances.
ALENEX 2007 |
| 65 | EE | David A. Bader,
Virat Agarwal:
FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine.
HiPC 2007: 172-184 |
| 64 | EE | David A. Bader:
Petascale Computing for Large-Scale Graph Problems.
IPDPS 2007: 1 |
| 63 | EE | David A. Bader,
Virat Agarwal,
Kamesh Madduri:
On the Design and Analysis of Irregular Algorithms on the Cell Processor: A Case Study of List Ranking.
IPDPS 2007: 1-10 |
| 62 | EE | David A. Bader,
Viktor K. Prasanna:
DOSA: Design Optimizer for Scientific Applications.
IPDPS 2007: 1-6 |
| 61 | EE | David A. Bader,
Kamesh Madduri:
A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms.
IPDPS 2007: 1-8 |
| 60 | EE | Joseph R. Crobak,
Jonathan W. Berry,
Kamesh Madduri,
David A. Bader:
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture.
IPDPS 2007: 1-8 |
| 59 | EE | David A. Bader,
Varun Kanade,
Kamesh Madduri:
SWARM: A Parallel Programming Framework for Multicore Processors.
IPDPS 2007: 1-8 |
| 58 | EE | Srinivas Aluru,
David A. Bader,
Anantharaman Kalyanaraman:
Symposium Evening Tutorial: High-performance Computing Methods for Computational Genomics.
IPDPS 2007: 13 |
| 57 | EE | Guojing Cong,
David A. Bader:
Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors.
ISPA 2007: 137-147 |
| 56 | EE | David A. Bader:
Petascale Computing for Large-Scale Graph Problems.
PPAM 2007: 166-169 |
| 55 | EE | David A. Bader,
Shiva Kintali,
Kamesh Madduri,
Milena Mihail:
Approximating Betweenness Centrality.
WAW 2007: 124-137 |
| 54 | EE | Sagar Dhakal,
Majeed M. Hayat,
Jorge E. Pezoa,
Cundong Yang,
David A. Bader:
Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach.
IEEE Trans. Parallel Distrib. Syst. 18(4): 485-497 (2007) |
| 53 | EE | Diana H. P. Low,
Bharadwaj Veeravalli,
David A. Bader:
On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures.
J. Parallel Distrib. Comput. 67(9): 1007-1017 (2007) |
| 52 | EE | David A. Bader,
Virat Agarwal,
Kamesh Madduri,
Seunghwa Kang:
High performance combinatorial algorithm design on the Cell Broadband Engine processor.
Parallel Computing 33(10-11): 720-740 (2007) |
| 2006 |
|---|
| 51 | EE | David A. Bader,
Kamesh Madduri:
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2.
ICPP 2006: 523-530 |
| 50 | EE | David A. Bader,
Kamesh Madduri:
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks.
ICPP 2006: 539-550 |
| 49 | EE | David A. Bader,
Vaddadi P. Chandu,
Mi Yan:
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony.
ICPP 2006: 65-73 |
| 48 | EE | Matthew J. Sottile,
Vaddadi P. Chandu,
David A. Bader:
Performance analysis of parallel programs via message-passing graph traversal.
IPDPS 2006 |
| 47 | EE | Srinivas Aluru,
David A. Bader,
Anantharaman Kalyanaraman:
M11 - High-performance computing methods for computational genomics.
SC 2006: 225 |
| 46 | | David A. Bader,
Usman Roshan,
Alexandros Stamatakis:
Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions.
Advances in Computers 68: 128-179 (2006) |
| 45 | EE | Srinivas Aluru,
Nancy M. Amato,
David A. Bader:
Editorial: Special Section on High-Performance Computational Biology.
IEEE Trans. Parallel Distrib. Syst. 17(8): 737-739 (2006) |
| 44 | EE | David A. Bader,
Guojing Cong:
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs.
J. Parallel Distrib. Comput. 66(11): 1366-1378 (2006) |
| 43 | EE | Guojing Cong,
David A. Bader:
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols.
J. Parallel Distrib. Comput. 66(6): 854-866 (2006) |
| 2005 |
|---|
| 42 | | David A. Bader,
Manish Parashar,
Sridhar Varadarajan,
Viktor K. Prasanna:
High Performance Computing - HiPC 2005, 12th International Conference, Goa, India, December 18-21, 2005, Proceedings
Springer 2005 |
| 41 | EE | David A. Bader,
Vipin Sachdeva:
Incorporating life sciences applications in the architectural optimizations of next-generation petaflop-system.
CSB Workshops 2005: 83-84 |
| 40 | EE | David A. Bader,
Kamesh Madduri:
Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors.
HiPC 2005: 465-476 |
| 39 | EE | David A. Bader,
Guojing Cong,
John Feo:
On the Architectural Requirements for Efficient Execution of Graph Algorithms.
ICPP 2005: 547-556 |
| 38 | EE | Guojing Cong,
David A. Bader:
An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs).
IPDPS 2005 |
| 37 | | Guojing Cong,
David A. Bader:
An Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs.
ISCA PDCS 2005: 27-34 |
| 36 | | David A. Bader,
Vipin Sachdeva:
A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic.
ISCA PDCS 2005: 41-48 |
| 35 | EE | David A. Bader:
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology.
WEA 2005: 16-21 |
| 34 | EE | David A. Bader,
Guojing Cong:
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs).
J. Parallel Distrib. Comput. 65(9): 994-1006 (2005) |
| 2004 |
|---|
| 33 | | David A. Bader,
Ashfaq A. Khokhar:
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, September 15-17, 2004, The Canterbury Hotel, San Francisco, California, USA
ISCA 2004 |
| 32 | EE | Mohammed Javeed Zaki,
David A. Bader,
Johan Montagnat,
Concettina Guerra:
Topic 17: High Performance Bioinformatics.
Euro-Par 2004: 988 |
| 31 | EE | David A. Bader,
Kamesh Madduri:
A Parallel State Assignment Algorithm for Finite State Machines.
HiPC 2004: 297-308 |
| 30 | EE | Guojing Cong,
David A. Bader:
Lock-Free Parallel Algorithms: An Experimental Study.
HiPC 2004: 516-528 |
| 29 | EE | Mehmet F. Su,
Ihab El-Kady,
David A. Bader,
Shawn-Yu Lin:
A Novel FDTD Application Featuring OpenMP-MPI Hybrid Parallelization.
ICPP 2004: 373-379 |
| 28 | EE | Guojing Cong,
David A. Bader:
The Euler Tour Technique and Parallel Rooted Spanning Tree.
ICPP 2004: 448-457 |
| 27 | EE | David A. Bader,
Guojing Cong:
A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors.
IPDPS 2004 |
| 26 | EE | David A. Bader,
Guojing Cong:
Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs.
IPDPS 2004 |
| 25 | EE | David A. Bader:
Computational biology and high-performance computing.
Commun. ACM 47(11): 34-41 (2004) |
| 24 | EE | David A. Bader,
Srinivas Aluru:
Special Issue: High Performance Computational Biology.
Concurrency - Practice and Experience 16(9): 817-821 (2004) |
| 23 | EE | David A. Bader:
An improved, randomized algorithm for parallel selection with an experimental study.
J. Parallel Distrib. Comput. 64(9): 1051-1059 (2004) |
| 2003 |
|---|
| 22 | EE | Srinivas Aluru,
David A. Bader:
Guest Editor's Introduction: Special issue on high-performance computational biology.
J. Parallel Distrib. Comput. 63(7-8): 671-673 (2003) |
| 2002 |
|---|
| 21 | EE | David A. Bader,
Sukanya Sreshta,
Nina R. Weisse-Bernstein:
Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs) (Extended Abstract).
HiPC 2002: 63-78 |
| 20 | EE | David A. Bader,
Srinivas Aluru:
Workshop Introduction.
IPDPS 2002 |
| 19 | | Bernard M. E. Moret,
David A. Bader,
Tandy Warnow:
High-Performance Algorithm Engineering for Computational Phylogenetics.
The Journal of Supercomputing 22(1): 99-111 (2002) |
| 2001 |
|---|
| 18 | EE | David A. Bader,
Ajith K. Illendula,
Bernard M. E. Moret,
Nina R. Weisse-Bernstein:
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture.
Algorithm Engineering 2001: 129-144 |
| 17 | EE | Bernard M. E. Moret,
David A. Bader,
Tandy Warnow:
High-Performance Algorithm Engineering for Computational Phylogenetics.
International Conference on Computational Science (2) 2001: 1012-1021 |
| 16 | EE | Bernard M. E. Moret,
Stacia K. Wyman,
David A. Bader,
Tandy Warnow,
Mi Yan:
A New Implmentation and Detailed Study of Breakpoint Analysis.
Pacific Symposium on Biocomputing 2001: 583-594 |
| 15 | EE | David A. Bader,
Bernard M. E. Moret,
Mi Yan:
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.
WADS 2001: 365-376 |
| 14 | | David A. Bader,
Bernard M. E. Moret,
Mi Yan:
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.
Journal of Computational Biology 8(5): 483-491 (2001) |
| 2000 |
|---|
| 13 | EE | Rob Pennington,
David A. Bader,
Barney Maccabe,
Patricia A. Kovatch,
Stephen L. Scott:
Tutorial A: Design and Analysis of High Performance Clusters.
CLUSTER 2000: 1-2 |
| 12 | EE | David A. Bader,
Bernard M. E. Moret,
Peter Sanders:
Algorithm Engineering for Parallel Computation.
Experimental Algorithmics 2000: 1-23 |
| 1999 |
|---|
| 11 | EE | David A. Bader,
Arthur B. Maccabe,
Jason R. Mastaler,
John K. McIver III,
Patricia A. Kovatch:
Design and Analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster.
IWCC 1999: 9-18 |
| 10 | | David A. Bader,
Joseph JáJá:
SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs).
J. Parallel Distrib. Comput. 58(1): 92-108 (1999) |
| 1998 |
|---|
| 9 | EE | David R. Helman,
Joseph JáJá,
David A. Bader:
A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation.
ACM Journal of Experimental Algorithmics 3: 4 (1998) |
| 8 | | David R. Helman,
David A. Bader,
Joseph JáJá:
A Randomized Parallel Sorting Algorithm with an Experimental Study.
J. Parallel Distrib. Comput. 52(1): 1-23 (1998) |
| 1996 |
|---|
| 7 | EE | David A. Bader,
Joseph JáJá:
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection.
IPPS 1996: 292-301 |
| 6 | EE | David A. Bader,
Joseph JáJá,
David Harwood,
Larry S. Davis:
Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study.
IPPS 1996: 414-423 |
| 5 | | David R. Helman,
David A. Bader,
Joseph JáJá:
Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract).
SPAA 1996: 211-222 |
| 4 | EE | David A. Bader,
David R. Helman,
Joseph JáJá:
Practical Parallel Algorithms for Personalized Communication and Integer Sorting.
ACM Journal of Experimental Algorithmics 1: 3 (1996) |
| 3 | | David A. Bader,
Joseph JáJá:
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study.
J. Parallel Distrib. Comput. 35(2): 173-190 (1996) |
| 1995 |
|---|
| 2 | | David A. Bader,
Joseph JáJá:
Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract).
PPOPP 1995: 123-133 |
| 1 | EE | David A. Bader,
Joseph JáJá,
Rama Chellappa:
Scalable data parallel algorithms for texture synthesis using Gibbs random fields.
IEEE Transactions on Image Processing 4(10): 1456-1460 (1995) |
