Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bader, David A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A Lin-Kernighan heuristic for the DCJ median problem of genomes with unequal contents
Zhaoming Yin
,
Jijun Tang
,
Stephen W. Schaeffer
,
David A. Bader
Lecture Notes in Computer Science
8591
, 2014, pp. 227-238
Computing discrete transforms on the Cell Broadband Engine
David A. Bader
,
Virat Agarwal
,
Seunghwa Kang
Parallel Computing
35
(3), 2009, pp. 119-137
A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms
David A. Bader
,
Kamesh Madduri
Parallel Computing
34
(11), 2008, pp. 627-639
High performance combinatorial algorithm design on the Cell Broadband Engine processor
David A. Bader
,
Virat Agarwal
,
Kamesh Madduri
,
Seunghwa Kang
Parallel Computing
33
(10-11), 2007, pp. 720-740
On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures
Diana H.P. Low
,
Bharadwaj Veeravalli
,
David A. Bader
Journal Parallel Distributed Computing
67
(9), 2007, pp. 1007-1017
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
David A. Bader
,
Guojing Cong
Journal Parallel Distributed Computing
66
(11), 2006, pp. 1366-1378
Designing irregular parallel algorithms with mutual exclusion and lock-free protocols
Guojing Cong
,
David A. Bader
Journal Parallel Distributed Computing
66
(6), 2006, pp. 854-866
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
David A. Bader
,
Guojing Cong
Journal Parallel Distributed Computing
65
(9), 2005, pp. 994-1006
An improved, randomized algorithm for parallel selection with an experimental study
David A. Bader
Journal Parallel Distributed Computing
64
(9), 2004, pp. 1051-1059
Using PRAM algorithms on a uniform-memory-access shared-memory architecture
David A. Bader
,
Ajith K. Illendula
,
Bernard M.E. Moret
,
Nina R. Weisse-Bernstein
Lecture Notes in Computer Science
2141
, 2001, pp. 129-144
A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
David A. Bader
,
Bernard M.E. Moret
,
Mi Yan
Lecture Notes in Computer Science
2125
, 2001, pp. 365-376
Simple: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs)
David A. Bader
,
Joseph Jájá
Journal Parallel Distributed Computing
58
(1), 1999, pp. 92-108
A randomized parallel sorting algorithm with an experimental study
David R. Helman
,
David A. Bader
,
Joseph Jájá
Journal Parallel Distributed Computing
52
(1), 1998, pp. 1-23
Parallel algorithms for image histogramming and connected components with an experimental study
David A. Bader
,
Joseph Jájá
Journal Parallel Distributed Computing
35
(2), 1996, pp. 173-190
Parallel algorithms for personalized communication and sorting with an experimental study
David R. Helman
,
David A. Bader
,
Joseph Jájá
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'96 (Padua, Italy, June 24-26, 1996)
, 1996, pp. 211-222