Q4993299
type: Item
instance of: scholarly article
zbMATH Open document ID: 1462.68079
author: Erik D. Demaine
author: Andrea Lincoln
author: Quanquan C. Liu
author: Jayson Lynch
author: Williams Virginia Vassilevska
publication date: 2021-06-15T00:00:00Z
full work available at URL: https://arxiv.org/abs/1711.07960
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7359371
zbMATH Keywords: IO model
zbMATH Keywords: fine-grained complexity
zbMATH Keywords: algorithms
MaRDI profile type: MaRDI publication profile
arXiv ID: 1711.07960
cites work: Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
cites work: The buffer tree: A technique for designing batched external data structures
cites work: An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
cites work: Automata, Languages and Programming
cites work: Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
cites work: Q4440438
cites work: Algorithms and Data Structures
cites work: Organization and maintenance of large ordered indexes
cites work: Q4411355
cites work: Algorithm Theory - SWAT 2004
cites work: Q4886043
cites work: Cache-oblivious dynamic programming
cites work: External-memory exact and approximate all-pairs shortest-paths in undirected graphs
cites work: Q4133134
cites work: Matrix multiplication via arithmetic progressions
cites work: Q3651735
cites work: Cache-Oblivious Algorithms
cites work: Powers of tensors and fast matrix multiplication
cites work: Q4411404
cites work: Algorithms - ESA 2003
cites work: The Input/Output Complexity of Sparse Matrix Multiplication
cites work: Towards polynomial lower bounds for dynamic problems
cites work: Fast approximation algorithms for the diameter and radius of sparse graphs
cites work: Q3392275
cites work: Q3819052
cites work: Systems of Logic Based on Ordinals†
cites work: Multiplying matrices faster than coppersmith-winograd
DOI: 10.4230/LIPICS.ITCS.2018.34
description: scientific article; zbMATH DE number 7359371