Last update: Sat Oct 14 02:35:45 MDT 2017
@Article{Martel:1994:CCW, author = "C. Martel and R. Subramonian", title = "On the Complexity of Certified Write-All Algorithms", journal = j-J-ALG, volume = "16", number = "3", pages = "361--387", month = may, year = "1994", CODEN = "JOALDV", DOI = "https://doi.org/10.1006/jagm.1994.1017", ISSN = "0196-6774 (print), 1090-2678 (electronic)", ISSN-L = "0196-6774", bibdate = "Tue Dec 11 09:15:42 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/jalg.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0196677484710170", acknowledgement = ack-nhfb, fjournal = "Journal of Algorithms", journal-URL = "http://www.sciencedirect.com/science/journal/01966774", }