| BICO: BIRCH Meets Coresets for k-Means Clustering H Fichtenberger, M Gillé, M Schmidt, C Schwiegelshohn, C Sohler Algorithms–ESA 2013: 21st Annual European Symposium, Sophia Antipolis …, 2013 | 98 | 2013 |
| Differentially private algorithms for graphs under continual observation H Fichtenberger, M Henzinger, L Ost arXiv preprint arXiv:2106.14756, 2021 | 41 | 2021 |
| Consistent k-clustering for general metrics H Fichtenberger, S Lattanzi, A Norouzi-Fard, O Svensson Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 24 | 2021 |
| Constant matters: Fine-grained error bound on differentially private continual observation H Fichtenberger, M Henzinger, J Upadhyay International Conference on Machine Learning, 10072-10092, 2023 | 23 | 2023 |
| Constant matters: Fine-grained Complexity of Differentially Private Continual Observation H Fichtenberger, M Henzinger, J Upadhyay arXiv preprint arXiv:2202.11205, 2022 | 22 | 2022 |
| Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries MH Bateni, H Esfandiari, H Fichtenberger, M Henzinger, R Jayaram, ... Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 21 | 2023 |
| Sampling arbitrary subgraphs exactly uniformly in sublinear time H Fichtenberger, M Gao, P Peng arXiv preprint arXiv:2005.01861, 2020 | 20 | 2020 |
| Every testable (infinite) property of bounded-degree graphs contains an infinite hyperfinite subproperty H Fichtenberger, P Peng, C Sohler Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 20 | 2019 |
| Testable properties in general graphs and random order streaming A Czumaj, H Fichtenberger, P Peng, C Sohler arXiv preprint arXiv:1905.01644, 2019 | 15 | 2019 |
| On testing minor-freeness in bounded degree graphs with one-sided error H Fichtenberger, R Levi, Y Vasudev, M Wötzel CoRR abs/1707.06126, 2017 | 12 | 2017 |
| A two-sided error distributed property tester for conductance H Fichtenberger, Y Vasudev 43rd International Symposium on Mathematical Foundations of Computer Science …, 2018 | 10 | 2018 |
| On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs H Fichtenberger, P Peng, C Sohler RANDOM / APPROX 2015 40, 2015 | 9 | 2015 |
| A Sublinear Tester for Outerplanarity (and Other Forbidden Minors) With One-Sided Error H Fichtenberger, R Levi, Y Vasudev, M Wötzel 45th International Colloquium on Automata, Languages, and Programming (ICALP …, 2018 | 7 | 2018 |
| Signal/background classification of time series for biological virus detection D Siedhoff, H Fichtenberger, P Libuschewski, F Weichert, C Sohler, ... German Conference on Pattern Recognition, 388-398, 2014 | 4 | 2014 |
| On fully dynamic constant-factor approximation algorithms for clustering problems H Fichtenberger, M Henzinger, A Wiese arXiv preprint arXiv:2112.07217, 2021 | 3 | 2021 |
| Testing individual-based stability properties in graphical hedonic games H Fichtenberger, A Krivošija, A Rey Proceedings of the 18th international conference on autonomous agents and …, 2019 | 3 | 2019 |
| Distributed testing of conductance H Fichtenberger, Y Vasudev arXiv preprint arXiv:1705.08174, 2017 | 3 | 2017 |
| Approximately Counting Subgraphs in Data Streams H Fichtenberger, P Peng Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2022 | 2 | 2022 |
| Testing stability prop erties in graphical hedonic games H Fichtenberger, A Rey Autonomous Agents and Multi-Agent Systems 35 (2), 26, 2021 | 2 | 2021 |
| A theory-based evaluation of nearest neighbor models put into practice H Fichtenberger, D Rohde Advances in Neural Information Processing Systems 31, 2018 | 2 | 2018 |
Christian SohlerProfessor for Algorithmic Data Analysis, University of CologneEmail được xác minh tại uni-koeln.de
