Marina Knittel

Orcid: 0009-0008-1498-7519

According to our database1, Marina Knittel authored at least 15 papers between 2019 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Massively Parallel Tree Embeddings for High Dimensional Spaces.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

Fair, Polylog-Approximate Low-Cost Hierarchical Clustering.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost.
Proceedings of the International Conference on Machine Learning, 2023

2022
Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost.
CoRR, 2022

Adaptive Massively Parallel Algorithms for Cut Problems.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

Adaptive Massively Parallel Constant-Round Tree Contraction.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

The Dichotomous Affiliate Stable Matching Problem: Approval-Based Matching with Applicant-Employer Relations.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

2021
Multiple Optimal Reconciliations Under the Duplication-Loss-Coalescence Model.
IEEE ACM Trans. Comput. Biol. Bioinform., 2021

Improved Hierarchical Clustering on Massive Datasets with Broad Guarantees.
CoRR, 2021

Scalable Equilibrium Computation in Multi-agent Influence Games on Networks.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Fair Hierarchical Clustering.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Matching Affinity Clustering: Improved Hierarchical Clustering at Scale with Guarantees.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring.
Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Streaming and Massively Parallel Algorithms for Edge Coloring.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

DREAM: An Algorithm for Mitigating the Overhead of Robust Rescheduling.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019


  Loading...