Property Testing for Graphs
Explore advanced techniques in property testing for graphs, focusing on sublinear algorithms and their applications in large-scale network analysis.
Forbidding Induced Subgraphs - Structure and Algorithms
Explore graph theory with Maria Chudnovsky, focusing on forbidden induced subgraphs and their impact on graph structure and algorithmic applications.
Expanders in Higher Dimensions: From Local to Global Properties and Applications
Explore high-dimensional expanders, their local-to-global properties, and applications in coding theory, networking, and computational complexity.
Designing and Exploiting Fast Algorithms for Polynomial Matrices - Lecture 2
Explorez les algorithmes rapides pour les matrices polynomiales et leurs applications dans cette conférence approfondie sur l'algèbre informatique.
Recent Advances in Dynamic Graph Algorithms
Explore recent advancements in dynamic graph algorithms, focusing on efficient data structures and techniques for handling evolving network structures.
Expanders and Property Testing
Explore expanders and property testing in graph theory, focusing on their applications and connections to theoretical computer science.
Sparsifying Set Systems for Coverage Problems
Explore recent advancements in sparsifying set systems for coverage problems, focusing on sublinear graph simplification techniques.
Approximating Maximum Matching Requires Almost Quadratic Time
Explore algorithms for estimating maximum matching size, focusing on recent advancements and lower bounds. Gain insights into subquadratic time complexity and its limitations in graph theory.
On (1 + ε)-Approximate (Vertex) Cut Sparsifiers
Explore advanced graph compression techniques for planar and quasi-bipartite graphs, focusing on high-quality cut sparsifiers and their size bounds. Analyze contraction-based approaches and their limitations.
Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
Explore advanced algorithms for dynamic maximum matching using Ordered Ruzsa-Szemeredi Graphs, improving update time to n^{o(1)} * ORS(n) and reducing the problem to a combinatorial bound.
Planar Partition Oracles for Bounded Degree Graphs in Polynomial Time
Explore planar graph partition oracles for bounded degree graphs, focusing on hyperfinite decompositions and their applications in sublinear algorithms and property testing.
Conditional Sampling for Distribution Testing
Explore conditional sampling techniques for distribution testing, focusing on efficient algorithms and their applications in statistical analysis.
Toward Optimal Semi-streaming Algorithm for (1+ε)-Approximate Maximum Matching
Explore a deterministic algorithm for (1+ε)-approximate maximum matching, improving pass-complexity and advancing solutions in various computational models.
Low Degree Testing over the Reals
Explore low degree testing over real numbers, focusing on theoretical concepts and applications in local algorithms.
Subgraph Counting and Seed Counting in Graph Theory
Explore sublinear subgraph counting and sampling techniques, focusing on the advantages of counting seeds in graph analysis.
Maximal Matching in Bounded-deletion Streams
Explore maximal matching in bounded-deletion graph streams, analyzing space complexity as a function of deletion parameter K. Gain insights into algorithmic techniques and lower bound results.
Graphs with Large Edge Weights for Shortest Path Structure - Sublinear Graph Simplification
Explore the relationship between graph shortest paths and edge weight ratios, examining reweighting techniques to preserve path structures.
The Mysterious Kronecker Coefficients in Algebraic Combinatorics
Explore the enigmatic Kronecker coefficients, their significance in algebraic combinatorics, and recent developments in positivity, asymptotics, and computational complexity.
Polynomial-Time Power-Sum Decomposition of Polynomials - Efficient Algorithms and Applications
Explore efficient algorithms for power-sum decomposition of polynomials, improving on prior work for tensor decomposition and Gaussian mixture identifiability. Gain insights into numerical linear algebra and noise-resilient techniques.
Around the Alexandrov-Fenchel Inequality - Convex Geometry and Its Applications
Explore the history and recent progress in convex geometry, focusing on Minkowski's theory and its connections to various mathematical disciplines.
Hypertrees in Combinatorics and Graph Theory
Explore hypertrees with Professor Nati Linial, delving into combinatorics, algorithms, and their applications in computer science and mathematics.