Projects per year
Fingerprint
Dive into the research topics where Christian Konrad is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Projects
- 3 Finished
-
An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation
Konrad, C. & Naidu, K. K., 2024, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. Woodruff, D. P. (ed.). Society for Industrial and Applied Mathematics, p. 2881-2899 19 p. (Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms (SODA)).Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)
3 Citations (Scopus) -
O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set
Assadi, S., Konrad, C., Naidu, K. K. & Sundaresan, J., 10 Jun 2024, STOC 2024: Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O'Donnell, R. (eds.). ACM SIGGRAPH, p. 847-858 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)
Open Access -
Improved Weighted Matching in the Sliding Window Model
Alexandru, C.-M., Dvorák, P., Konrad, C. & Naidu, K. K., 3 Mar 2023, STACS 2023: 40th International Symposium on Theoretical Aspects of Computer Science, STACS 2023. Berenbrink, P., Bouyer, P., Dawar, A. & Kante, M. M. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vol. 254. p. 6:1-6:21 6. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 254).Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)
Open Access3 Citations (Scopus)