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
[1]
Hilfe
Suche: Author="Harris, David"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast sequential importance sampling to estimate the graph reliability polynomial
David G. Harris
,
Francis Sullivan
,
Isabel Beichl
Algorithmica
68
(4), 2014, pp. 916-939
Efficient computation of balanced structures
David G. Harris
,
Ehab Morsy
,
Gopal Pandurangan
,
Peter Robinson
,
Aravind Srinivasan
Lecture Notes in Computer Science
7966
, 2013, pp. 581-593
Constraint satisfaction, packet routing, and the Lovász local lemma
David G. Harris
,
Aravind Srinivasan
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 685-694
The reliable router: A reliable and high-performance communication substrate for parallel computers
William J. Dally
,
Larry R. Dennison
,
David Harris
,
Kinhong Kan
,
Thucydides Xanthopoulus
Lecture Notes in Computer Science
853
, 1994, pp. 241-255