Cell Probe Lower Bounds and Approximations for Range Mode

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-14165-2_51
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Bit-Probe Lower Bounds for Succinct Data Structures

SIAM Journal on Computing
MathematicsComputer Science
2012English

Bounds for Nearly Best Approximations

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1975English

Upper and Lower Bounds of Eigenvalues: Mode-Clamping Theorems

Quarterly of Applied Mathematics
Applied Mathematics
1970English

Bounds and Approximations for Multistage Stochastic Programs

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2016English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Lower Bounds for Swapping Arthur and Merlin

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy