Coresets and Their Applications to Design Sublinear Algorithms
Explore coresets and their role in designing efficient sublinear algorithms, enhancing computational performance for large-scale data analysis and machine learning tasks.
Parameterized Inapproximability of the Minimum Distance Problem over All Fields
Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.
ReLU Hull Approximation - Fast and Precise Convex Hull Over-Approximation for Neural Network Verification
Explore a fast, precise approach to over-approximating ReLU function convex hulls in neural network verification, improving efficiency and precision for large-scale networks.
Sublinear Time Algorithms for Max-Cut Approximation on Expander Graphs
Explore random walks on graphs to achieve better-than-1/2 approximation for max-cut on expanding and clusterable graphs, using sublinear time algorithms.
Sublinear-Time Algorithms in Learning
Explore cutting-edge sublinear algorithms for efficient machine learning, focusing on extroverted approaches and their applications in large-scale data analysis.
O(log s)-Approximate Nearest Neighbor Search for Earth Mover's Distance
Explore advancements in nearest neighbor search for Earth Mover's Distance, improving approximation to Õ(log s) with sublinear query time using data-dependent LSH functions and tree embedding techniques.
Massively Parallel Algorithms for High-Dimensional Euclidean Minimum Spanning Tree
Efficient distributed algorithms for clustering high-dimensional data using Euclidean Minimum Spanning Tree, achieving constant factor approximation in O~(loglogn) rounds of MPC model.
Applications of Sub-linear Algorithms in Other Fields
Explore how sub-linear algorithms impact diverse fields, enhancing efficiency and scalability in data analysis and problem-solving across disciplines.
Inapproximability of Clustering in Lp Metrics
Explores computational complexity of clustering in Lp metrics, discussing approximation algorithms, hardness of approximation, and key concepts like Johnson Coverage Hypothesis.
Towards Better Approximation of Graph Crossing Number
Explores advanced techniques for approximating graph crossing numbers, focusing on new frameworks and theorems for both general and bounded-degree graphs.
Optimal Streaming Approximations for All Boolean Max 2-CSPs and Max k-SAT
Explore streaming approximations for Boolean Max 2-CSPs and Max k-SAT, covering algorithms, lower bounds, and communication complexity in constraint satisfaction problems.
On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
Explore efficient graph traversal techniques using light spanners and low-treewidth embeddings, with applications to minor-free graphs and approximation algorithms.
Stochastic Weighted Matching - 1-Epsilon Approximation
Explore stochastic weighted matching algorithms, including Monte Carlo analysis, vertex-independent matching, and greedy approaches for efficient approximation solutions.
A Parameterized Approximation Scheme for Min k-Cut
Explore a parameterized approximation scheme for the Min k-Cut problem, covering algorithms, research directions, and proof ingredients like tree decomposition and polynomial time analysis.
Cut-Equivalent Trees are Optimal for Min-Cut Queries
Explore cut-equivalent trees and their optimality for min-cut queries, covering algorithms, data structures, and approximation techniques in graph theory.
Sublinear Algorithms and Complexity Theory Vignettes
Explore key concepts and applications of sublinear algorithms through practical vignettes, focusing on efficient computational methods and algorithmic complexity.
Improved Approximations for Extremal Eigenvalues of Sparse Hamiltonians
Discover advanced approximation techniques for eigenvalues in sparse Hamiltonians, exploring new methods for quantum systems with q-local terms and improved mathematical approaches for k-sparse configurations.
A Better Approximation for Interleaved Dyck Reachability
Explore a novel approach to interleaved Dyck reachability, offering improved precision for context- and field-sensitive static analyses through refined CFLs and on-demand application.
Local Algorithms: Principles and Applications
Explore insights from Tal Herman's presentation at the Workshop on Local Algorithms, delving into cutting-edge research in computer science and mathematics.
How Efficiently Can We Solve Unique Games? - Lecture
Explore the computational complexity of Unique Games and their efficient solutions in this insightful talk by Yotam Dikstein.
Almost-Optimal Sublinear Additive Spanners in Graph Theory
Explore sublinear additive spanners in graph theory, focusing on optimal stretch functions and size bounds for undirected unweighted graphs. Learn about recent advancements and their implications.