( en | de | ru )

 

Disambiguation of "Hallett, Michael T."

Author of the publication

copydeleteadd this publication to your clipboard
Dependable Computing in Virtual Laboratories.

, , , , and . ICDE, page 235-242. IEEE Computer Society, (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mark Hallett

William Hallett

Michael R T Macnair

T Peters

T Attin

 

Other publications of authors with the same name

Ancestral Maximum Likelihood of Evolutionary Trees Is Hard., , , , , and . J. Bioinform. Comput. Biol., 2 (2): 257-272 (2004)Refining Protein Subcellular Localization., , , and . PLoS Comput. Biol., (2005)Hunting for Functionally Analogous Genes., and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 465-476. Springer, (2000)On the Parameterized Complexity of Layered Graph Drawing., , , , , , , , , and 2 other author(s). ESA, volume 2161 of Lecture Notes in Computer Science, page 488-499. Springer, (2001)Reproducible Data Analysis Pipelines for Precision Medicine., , , and . PDP, page 299-306. IEEE, (2019)A compendium of parameterized complexity results., and . SIGACT News, 25 (3): 122-123 (1994)Darwin v. 2.0: an interpreted computer language for the biosciences., , , and . Bioinform., 16 (2): 101-103 (2000)A Trade-Off between Sample Complexity and Computational Complexity in Learning Boolean Networks from Time-Series Data., and . IEEE ACM Trans. Comput. Biol. Bioinform., 7 (1): 118-125 (2010)The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs., , , , and . Theor. Comput. Sci., 244 (1-2): 167-188 (2000)Analogs and Duals of the MAST Problem for Sequences and Trees., , , and . ESA, volume 1461 of Lecture Notes in Computer Science, page 103-114. Springer, (1998)