Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Litovsky:1998:CGG,
author = "I. Litovsky and Y. Metivier and E. Sopena",
title = "Checking global graph properties by means of local
computations: the majority problem",
journal = j-THEOR-COMP-SCI,
volume = "194",
number = "1--2",
pages = "245--246",
day = "10",
month = mar,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Wed May 27 07:21:35 MDT 1998",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210L (Formal
languages and computational linguistics); C4240P
(Parallel programming and algorithm theory)",
conflocation = "Pisa, Italy; 28 Aug.-1 Sept. 1995",
conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA '95) (papers in summary form
only received)",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "distributed algorithms; distributed computation;
distributed systems; global graph properties; graph
recognizers; graph relabelling; graph theory; local
computations; majority problem; rewriting systems",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}