MACH: Fast Randomized Tensor Decompositions

MADMX: A Novel Strategy for Maximal Dense Motif Extraction

Maintaining Arrays of Contiguous Objects

Maintaining Information in Fully-Dynamic Trees with Top Trees

Mantaining Dynamic Matrices for Fully Dynamic Transitive Closure

Many Sparse Cuts via Higher Eigenvalues

Mapping Semantic Networks to Undirected Networks

Matching Pursuits with Random Sequential Subdictionaries

Matching Subsequences in Trees

Matroid Prophet Inequalities

Matroid Secretary Problem in the Random Assignment Model

Matroidal Degree-Bounded Minimum Spanning Trees

Max Cut and the Smallest Eigenvalue

Max Edge Coloring of Trees

Max-Cut and Max-Bisection are NP-hard on unit disk graphs

Max-stable sketches: estimation of Lp-norms, dominance norms and point queries for non-negative signals

Max-Sum Diversification, Monotone Submodular Functions and Dynamic Updates

Max-Throughput for (Conservative) k-of-n Testing

Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems

Maximizing Non-monotone Submodular Set Functions Subject to Different Constraints: Combined Algorithms