Amanote Research

Amanote Research

    RegisterSign In

Lower Bounds for Row Minima Searching

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-61440-0_150
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 1996

Authors
Phillip G. BradfordKnut Reinert
Publisher

Springer Berlin Heidelberg


Related search

A Spectral Approach to Lower Bounds With Applications to Geometric Searching

SIAM Journal on Computing
MathematicsComputer Science
1998English

Upper Bounds for the Euclidean Minima of Abelian Fields

Journal de Theorie des Nombres de Bordeaux
Number TheoryAlgebra
2015English

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 Measurable Chromatic Numbers

Geometric and Functional Analysis
GeometryAnalysisTopology
2009English

Calculating Lower Bounds for Caching Problems

Computing (Vienna/New York)
Numerical AnalysisComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2007English

Improved Lower Bounds for Multicovering Codes

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy