Search the dblp DataBase
G. E. Farr :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
G. E. Farr , Chris S. Wallace The Complexity of Strict Minimum Message Length Inference. [Citation Graph (0, 0)][DBLP ] Comput. J., 2002, v:45, n:3, pp:285-292 [Journal ] G. E. Farr A Correlation Inequality Involving Stable Set and Chromatic Polynomials. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1993, v:58, n:1, pp:14-21 [Journal ] G. E. Farr The Go polynomials of a graph. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:306, n:1-3, pp:1-18 [Journal ] The Complexity of Counting Colourings of Subgraphs of the Grid. [Citation Graph (, )][DBLP ] On the Ashkin-Teller Model and Tutte-Whitney Functions. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.002secs