Items where authors include "Sohler, C."

Proceedings Paper

Czumaj, A., Fichtenberger, H., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2020) Testable properties in general graphs and random order streaming. In: Byrka, J. and Meka, R., (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). 24th International Conference on Randomization and Computation (RANDOM 2020), 17-19 Aug 2020, Online conference. Leibniz International Proceedings in Informatics (LIPIcs) (176). Schloss Dagstuhl--Leibniz-Zentrum fur Informatik , 16:1-16:20. ISBN 9783959771641

Fichtenberger, H., Peng, P. orcid.org/0000-0003-2700-5699 and Sohler, C. (2019) Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty. In: Chan, T., (ed.) Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA19). 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA19), 06-09 Jan 2019, San Diego, California. SIAM . ISBN 978-1-61197-548-2

Monemizadeh, M., Muthukrishnan, S., Peng, P. orcid.org/0000-0003-2700-5699 et al. (1 more author) (2017) Testable bounded degree graph properties are random order streamable. In: Chatzigiannakis, I., Indyk, P., Kuhn, F. and Muscholl, A., (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. ICALP 2017, 10-14 Jul 2017, Warsaw, Poland. LIPIcs, 80 . Dagstuhl Publishing , Dagstuhl, Germany , 131:1-131:14. ISBN 9783959770415

Czumaj, A., Peng, P. orcid.org/0000-0003-2700-5699 and Sohler, C. (2015) Testing cluster structure of graphs. In: STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing. STOC '15: Symposium on Theory of Computing, 14-17 Jun 2015, Portland, Oregon, USA. Association for Computing Machinery (ACM) , pp. 723-732. ISBN 9781450335362