Publisher
Springer International Publishing
Reference26 articles.
1. Åstrand, M., Polishchuk, V., Rybicki, J., Suomela, J., Uitto, J.: Local algorithms in (weakly) coloured graphs. CoRR abs/1002.0125 (2010)
2. Lecture Notes in Computer Science;K Censor-Hillel,2017
3. Csóka, E., Gerencsér, B., Harangi, V., Virág, B.: Invariant gaussian processes and independent sets on regular graphs of large girth. Random Struct. Algorithms 47, 284–303 (2015)
4. Chang, Y.-J., Kopelowitz, T., Pettie, S.: An exponential separation between randomized and deterministic complexity in the LOCAL model. In: IEEE 57th Annual Symposium on Foundations of Computer Science (2016)
5. Lecture Notes in Computer Science;A Czygrinow,2008