Establishes Ω(n/ε²) query lower bounds for approximating correlation clustering cost and partitions under memory constraints in adjacency-matrix and general graph models.
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , pages =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
representative citing papers
Explosive synchronization arises in networks of Type-I neurons with electrical coupling on scale-free topologies when heterogeneity is weak and degree-frequency correlation is present.
No single MLOps tool covers the full lifecycle, so practitioners combine tools for orchestration, data versioning, experiment tracking, and cloud platforms.
citing papers explorer
-
Query Lower Bounds for Correlation Clustering under Memory Constraints
Establishes Ω(n/ε²) query lower bounds for approximating correlation clustering cost and partitions under memory constraints in adjacency-matrix and general graph models.
-
Explosive synchronization in networks of Type-I neurons with electrical synapses
Explosive synchronization arises in networks of Type-I neurons with electrical coupling on scale-free topologies when heterogeneity is weak and degree-frequency correlation is present.
-
A Systematic Review of MLOps Tools: Tool Adoption, Lifecycle Coverage, and Critical Insights
No single MLOps tool covers the full lifecycle, so practitioners combine tools for orchestration, data versioning, experiment tracking, and cloud platforms.