dblp.uni-trier.dewww.uni-trier.de

Mark Marron

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
9EEMark Marron, Manuel V. Hermenegildo, Deepak Kapur, Darko Stefanovic: Efficient Context-Sensitive Shape Analysis with Graph Based Heap Models. CC 2008: 245-259
8EEMark Marron, Darko Stefanovic, Deepak Kapur, Manuel V. Hermenegildo: Identification of Heap-Carried Data Dependence Via Explicit Store Heap Models. LCPC 2008: 94-108
7EEMark Marron, Mario Méndez-Lojo, Manuel V. Hermenegildo, Darko Stefanovic, Deepak Kapur: Sharing analysis of arrays, collections, and recursive structures. PASTE 2008: 43-49
6EEKrister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret: Approximating the true evolutionary distance between two genomes. ACM Journal of Experimental Algorithmics 12: (2008)
2007
5EEMark Marron, Darko Stefanovic, Manuel V. Hermenegildo, Deepak Kapur: Heap analysis in the presence of collection libraries. PASTE 2007: 31-36
2006
4EEMark Marron, Deepak Kapur, Darko Stefanovic, Manuel V. Hermenegildo: A Static Heap Analysis for Shape and Connectivity: Unified Memory Analysis: The Base Framework. LCPC 2006: 345-363
2005
3EEKrister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret: Approximating the True Evolutionary Distance between Two Genomes. ALENEX/ANALCO 2005: 121-129
2004
2EEMark Marron, Krister M. Swenson, Bernard M. E. Moret: Genomic Distances under Deletions and Insertions. Theor. Comput. Sci. 325(3): 347-360 (2004)
2003
1EEMark Marron, Krister M. Swenson, Bernard M. E. Moret: Genomic Distances under Deletions and Insertions. COCOON 2003: 537-547

Coauthor Index

1Joel V. Earnest-DeYoung [3] [6]
2Manuel V. Hermenegildo [4] [5] [7] [8] [9]
3Deepak Kapur [4] [5] [7] [8] [9]
4Mario Méndez-Lojo [7]
5Bernard M. E. Moret [1] [2] [3] [6]
6Darko Stefanovic [4] [5] [7] [8] [9]
7Krister M. Swenson [1] [2] [3] [6]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)