Communication Lower Bounds and Optimal Algorithms for Programs That Reference Arrays - Part 1

doi 10.21236/ada584726
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

Lower Bounds for Monotone Span Programs

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
1996English

Superpolynomial Lower Bounds for Monotone Span Programs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1999English

Efficient Algorithms and Lower Bounds for Robust Linear Regression

2019English

Hexagonal Grid Drawings: Algorithms and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

2020English

Lower Bounds and Parallel Algorithms for Planar Orthogonal Grid Drawings

English

Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation

2019English

Optimal Lower Bounds for Quantum Automata and Random Access Codes

English

Primary-Backup Protocols: Lower Bounds and Optimal Implementations

Dependable Computing and Fault-Tolerant Systems
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy