Items where authors include "Fichtenberger, H."

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., Gao, M. and Peng, P. (2020) Sampling arbitrary subgraphs exactly uniformly in sublinear time. In: Czumaj, A., Dawar, A. and Merelli, E., (eds.) The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020). The 47th International Colloquium on Automata, Languages and Programming (ICALP 2020), 08-11 Jul 2020, Saarbrücken, Germany. Schloss Dagstuhl--Leibniz-Zentrum für Informatik , 45:1-45:13. ISBN 9783959771382

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