The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
David A. Bader: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:41-48 [Conf]
  2. Guojing Cong, David A. Bader
    An Empirical Analysis of Parallel Random Permutation Algorithms ON SMPs. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:27-34 [Conf]
  3. David A. Bader, Vipin Sachdeva
    Incorporating life sciences applications in the architectural optimizations of next-generation petaflop-system. [Citation Graph (0, 0)][DBLP]
    CSB Workshops, 2005, pp:83-84 [Conf]
  4. David A. Bader, Bernard M. E. Moret, Peter Sanders
    Algorithm Engineering for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:1-23 [Conf]
  5. Mohammed Javeed Zaki, David A. Bader, Johan Montagnat, Concettina Guerra
    Topic 17: High Performance Bioinformatics. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 2004, pp:988- [Conf]
  6. Guojing Cong, David A. Bader
    Lock-Free Parallel Algorithms: An Experimental Study. [Citation Graph (0, 0)][DBLP]
    HiPC, 2004, pp:516-528 [Conf]
  7. David A. Bader, Kamesh Madduri
    A Parallel State Assignment Algorithm for Finite State Machines. [Citation Graph (0, 0)][DBLP]
    HiPC, 2004, pp:297-308 [Conf]
  8. 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). [Citation Graph (0, 0)][DBLP]
    HiPC, 2002, pp:63-78 [Conf]
  9. David A. Bader, Kamesh Madduri
    Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    HiPC, 2005, pp:465-476 [Conf]
  10. Bernard M. E. Moret, David A. Bader, Tandy Warnow
    High-Performance Algorithm Engineering for Computational Phylogenetics. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2001, pp:1012-1021 [Conf]
  11. David A. Bader, Guojing Cong, John Feo
    On the Architectural Requirements for Efficient Execution of Graph Algorithms. [Citation Graph (0, 0)][DBLP]
    ICPP, 2005, pp:547-556 [Conf]
  12. David A. Bader, Vaddadi P. Chandu, Mi Yan
    ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony. [Citation Graph (0, 0)][DBLP]
    ICPP, 2006, pp:65-73 [Conf]
  13. David A. Bader, Kamesh Madduri
    Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2. [Citation Graph (0, 0)][DBLP]
    ICPP, 2006, pp:523-530 [Conf]
  14. David A. Bader, Kamesh Madduri
    Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 2006, pp:539-550 [Conf]
  15. Guojing Cong, David A. Bader
    The Euler Tour Technique and Parallel Rooted Spanning Tree. [Citation Graph (0, 0)][DBLP]
    ICPP, 2004, pp:448-457 [Conf]
  16. Mehmet F. Su, Ihab El-Kady, David A. Bader, Shawn-Yu Lin
    A Novel FDTD Application Featuring OpenMP-MPI Hybrid Parallelization. [Citation Graph (0, 0)][DBLP]
    ICPP, 2004, pp:373-379 [Conf]
  17. David A. Bader, Srinivas Aluru
    Workshop Introduction. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2002, pp:- [Conf]
  18. David A. Bader, Guojing Cong
    A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  19. David A. Bader, Guojing Cong
    Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  20. David A. Bader, Joseph JáJá
    Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:292-301 [Conf]
  21. 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. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:414-423 [Conf]
  22. Guojing Cong, David A. Bader
    An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs). [Citation Graph (0, 0)][DBLP]
    IPDPS, 2005, pp:- [Conf]
  23. Matthew J. Sottile, Vaddadi P. Chandu, David A. Bader
    Performance analysis of parallel programs via message-passing graph traversal. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    IWCC, 1999, pp:9-18 [Conf]
  25. David A. Bader, Joseph JáJá
    Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PPOPP, 1995, pp:123-133 [Conf]
  26. Bernard M. E. Moret, Stacia K. Wyman, David A. Bader, Tandy Warnow, Mi Yan
    A New Implmentation and Detailed Study of Breakpoint Analysis. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2001, pp:583-594 [Conf]
  27. Srinivas Aluru, David A. Bader, Anantharaman Kalyanaraman
    M11 - High-performance computing methods for computational genomics. [Citation Graph (0, 0)][DBLP]
    SC, 2006, pp:225- [Conf]
  28. David R. Helman, David A. Bader, Joseph JáJá
    Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:211-222 [Conf]
  29. David A. Bader, Bernard M. E. Moret, Mi Yan
    A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:365-376 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:129-144 [Conf]
  31. David A. Bader
    High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:16-21 [Conf]
  32. David A. Bader, Usman Roshan, Alexandros Stamatakis
    Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 2006, v:68, n:, pp:128-179 [Journal]
  33. David A. Bader
    Computational biology and high-performance computing. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2004, v:47, n:11, pp:34-41 [Journal]
  34. David A. Bader, Srinivas Aluru
    Special Issue: High Performance Computational Biology. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 2004, v:16, n:9, pp:817-821 [Journal]
  35. David A. Bader, Bernard M. E. Moret, Mi Yan
    A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2001, v:8, n:5, pp:483-491 [Journal]
  36. David A. Bader, David R. Helman, Joseph JáJá
    Practical Parallel Algorithms for Personalized Communication and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1996, v:1, n:, pp:3- [Journal]
  37. David R. Helman, Joseph JáJá, David A. Bader
    A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:4- [Journal]
  38. David A. Bader
    An improved, randomized algorithm for parallel selection with an experimental study. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:9, pp:1051-1059 [Journal]
  39. David A. Bader, Guojing Cong
    A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2005, v:65, n:9, pp:994-1006 [Journal]
  40. David A. Bader, Joseph JáJá
    Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:35, n:2, pp:173-190 [Journal]
  41. David A. Bader, Joseph JáJá
    SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs). [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:58, n:1, pp:92-108 [Journal]
  42. Srinivas Aluru, David A. Bader
    Guest Editor's Introduction: Special issue on high-performance computational biology. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:7-8, pp:671-673 [Journal]
  43. David R. Helman, David A. Bader, Joseph JáJá
    A Randomized Parallel Sorting Algorithm with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:52, n:1, pp:1-23 [Journal]
  44. David A. Bader, Guojing Cong
    Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:11, pp:1366-1378 [Journal]
  45. Guojing Cong, David A. Bader
    Designing irregular parallel algorithms with mutual exclusion and lock-free protocols. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2006, v:66, n:6, pp:854-866 [Journal]
  46. David A. Bader, Joseph JáJá, Rama Chellappa
    Scalable data parallel algorithms for texture synthesis using Gibbs random fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 1995, v:4, n:10, pp:1456-1460 [Journal]
  47. Bernard M. E. Moret, David A. Bader, Tandy Warnow
    High-Performance Algorithm Engineering for Computational Phylogenetics. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2002, v:22, n:1, pp:99-111 [Journal]
  48. Srinivas Aluru, Nancy M. Amato, David A. Bader
    Editorial: Special Section on High-Performance Computational Biology. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2006, v:17, n:8, pp:737-739 [Journal]
  49. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2007, v:18, n:4, pp:485-497 [Journal]
  50. 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. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  51. David A. Bader, Kamesh Madduri
    A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-8 [Conf]
  52. David A. Bader, Varun Kanade, Kamesh Madduri
    SWARM: A Parallel Programming Framework for Multicore Processors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-8 [Conf]
  53. Srinivas Aluru, David A. Bader, Anantharaman Kalyanaraman
    Symposium Evening Tutorial: High-performance Computing Methods for Computational Genomics. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:13- [Conf]
  54. 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. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-10 [Conf]
  55. Joseph R. Crobak, Jonathan W. Berry, Kamesh Madduri, David A. Bader
    Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-8 [Conf]
  56. David A. Bader
    Petascale Computing for Large-Scale Graph Problems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1- [Conf]
  57. David A. Bader, Viktor K. Prasanna
    DOSA: Design Optimizer for Scientific Applications. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2007, pp:1-6 [Conf]
  58. Guojing Cong, David A. Bader
    Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors. [Citation Graph (0, 0)][DBLP]
    ISPA, 2007, pp:137-147 [Conf]
  59. David A. Bader, Shiva Kintali, Kamesh Madduri, Milena Mihail
    Approximating Betweenness Centrality. [Citation Graph (0, 0)][DBLP]
    WAW, 2007, pp:124-137 [Conf]
  60. 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. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:9, pp:1007-1017 [Journal]

  61. Tutorial A: Design and Analysis of High Performance Clusters. [Citation Graph (, )][DBLP]


  62. FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine. [Citation Graph (, )][DBLP]


  63. Simulating Individual-Based Models of Epidemics in Hierarchical Networks. [Citation Graph (, )][DBLP]


  64. On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis. [Citation Graph (, )][DBLP]


  65. Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine. [Citation Graph (, )][DBLP]


  66. Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation. [Citation Graph (, )][DBLP]


  67. High performance MPEG-2 software decoder on the cell broadband engine. [Citation Graph (, )][DBLP]


  68. DOSA: design optimizer for scientific applications. [Citation Graph (, )][DBLP]


  69. Financial modeling on the cell broadband engine. [Citation Graph (, )][DBLP]


  70. SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks. [Citation Graph (, )][DBLP]


  71. A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets. [Citation Graph (, )][DBLP]


  72. Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis. [Citation Graph (, )][DBLP]


  73. Understanding the design trade-offs among current multicore systems for numerical computations. [Citation Graph (, )][DBLP]


  74. Petascale Computing for Large-Scale Graph Problems. [Citation Graph (, )][DBLP]


  75. An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs. [Citation Graph (, )][DBLP]


  76. GTfold: a scalable multicore code for RNA secondary structure prediction. [Citation Graph (, )][DBLP]


  77. Petascale Computing for Large-Scale Graph Problems. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.457secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002