Showing 1–20 of 25 results
/ Date/ Name
Apr 16, 2020Fully Dynamic s-t Edge Connectivity in Subpolynomial TimeDec 31, 2020Minor Sparsifiers and the Distributed Laplacian ParadigmMar 27, 2023Faster Isomorphism for $p$-Groups of Class 2 and Exponent $p$Aug 6, 2019Parallel Batch-Dynamic Graphs: Algorithms and Lower BoundsJan 18, 2024Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial TimeSep 19, 2024Canonical forms for matrix tuples in polynomial timeAug 14, 2020On the Hardness of Massively Parallel ComputationNov 20, 2021Approximation Algorithms for LCS and LIS with Truly Improved Running TimesApr 26, 2017Local discontinuous Galerkin methods for the time tempered fractional diffusion equationApr 27, 2011Information Dissemination via Random Walks in d-Dimensional SpaceMar 5, 2020Fast Noise Removal for $k$-Means ClusteringOct 29, 2021Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious RoutingMay 14, 2013Efficient Density Estimation via Piecewise Polynomial ApproximationJul 9, 2010Optimal Pricing in Social Networks with Incomplete InformationOct 2, 2012Learning mixtures of structured distributions over discrete domainsMay 19, 2017Linear regression without correspondenceOct 25, 2019String Matching with Wildcards in the Massively Parallel Computation ModelNov 9, 2013The Complexity of Optimal Multidimensional PricingNov 1, 2014Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width HistogramsOct 8, 2015Structure and automorphisms of primitive coherent configurations