Networks Cannot Compute Their Diameter in Sublinear Time

doi 10.1137/1.9781611973099.91
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Sublinear Time Algorithms

English

Private Database Search With Sublinear Query Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Approximating the Minimum Spanning Tree Weight in Sublinear Time

SIAM Journal on Computing
MathematicsComputer Science
2005English

Near-Optimal Sublinear Time Algorithms for Ulam Distance

2010English

Sublinear Time, Measurement-Optimal, Sparse Recovery for All

2012English

Dynamical Systems That Compute Time-Optimal Switchings

IFAC Proceedings Volumes
2001English

Sublinear-Time Parallel Algorithms for Matching and Related Problems

1988English

Compressed Dynamic Tries With Applications to LZ-Compression in Sublinear Time and Space

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

NOS: A Software Suite to Compute Node Overlap and Segregation (??) in Ecological Networks

Ecography
EvolutionEcologySystematicsBehavior
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy