scientific article; zbMATH DE number 7359371
From MaRDI portal
Publication:4993299
DOI10.4230/LIPIcs.ITCS.2018.34zbMath1462.68079arXiv1711.07960MaRDI QIDQ4993299
Williams Virginia Vassilevska, Erik D. Demaine, Jayson Lynch, Andrea Lincoln, Quanquan C. Liu
Publication date: 15 June 2021
Full work available at URL: https://arxiv.org/abs/1711.07960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
Scheduling lower bounds via AND subset sum ⋮ The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance ⋮ Fine-Grained Complexity Theory (Tutorial)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- The buffer tree: A technique for designing batched external data structures
- Organization and maintenance of large ordered indexes
- Towards polynomial lower bounds for dynamic problems
- The Input/Output Complexity of Sparse Matrix Multiplication
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (unless SETH is false)
- Cache-Oblivious Algorithms
- Powers of tensors and fast matrix multiplication
- Cache-oblivious dynamic programming
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Algorithm Theory - SWAT 2004
- Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter
- Algorithms and Data Structures
- Multiplying matrices faster than coppersmith-winograd
- An Optimal Cache‐Oblivious Priority Queue and Its Application to Graph Algorithms
- Automata, Languages and Programming
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Systems of Logic Based on Ordinals†
- Algorithms - ESA 2003
This page was built for publication:
