@inproceedings{10.1145/3373718.3394739,
    Address = {New York, NY, USA},
    Author = {Grohe, Martin},
    BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
    File = {Counting Bounded Tree Depth Homomorphisms - 2003.08164 - a - r.pdf},
    ISBN = {9781450371049},
    Keywords = {tree depth, first order logic, homomorphism indistinguishability, counting homomorphisms},
    Location = {Saarbr\"{u}cken, Germany},
    Pages = {507--520},
    Publisher = {Association for Computing Machinery},
    Series = {LICS '20},
    Title = {Counting Bounded Tree Depth Homomorphisms},
    URL = {https://doi.org/10.1145/3373718.3394739},
    Year = {2020},
    bdsk-url-1 = {https://doi.org/10.1145/3373718.3394739},
    date-added = {2020-07-04 09:55:36 +0200},
    date-modified = {2020-07-04 09:55:36 +0200},
    numpages = {14},
    doi = {10.1145/3373718.3394739}
}

@inproceedings{10.1145/3373718.3394739, Address = {New York, NY, USA}, Author = {Grohe, Martin}, BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science}, File = {Counting Bounded Tree Depth Homomorphisms - 2003.08164 - a - r.pdf}, ISBN = {9781450371049}, Keywords = {tree depth, first order logic, homomorphism indistinguishability, counting homomorphisms}, Location = {Saarbr\"{u}cken, Germany}, Pages = {507--520}, Publisher = {Association for Computing Machinery}, Series = {LICS '20}, Title = {Counting Bounded Tree Depth Homomorphisms}, URL = {https://doi.org/10.1145/3373718.3394739}, Year = {2020}, bdsk-url-1 = {https://doi.org/10.1145/3373718.3394739}, date-added = {2020-07-04 09:55:36 +0200}, date-modified = {2020-07-04 09:55:36 +0200}, numpages = {14}, doi = {10.1145/3373718.3394739} }