A Lower Bound for the Complexity of the Union-Split-Find Problem

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-18088-5_41
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Time Complexity Lower Bound for Adaptive Mutual Exclusion

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2011English

A Geometrical Formulation of the Μ-Lower Bound Problem

IET Control Theory and Applications
ControlSystems EngineeringHuman-Computer InteractionOptimizationElectronic EngineeringComputer Science ApplicationsElectrical
2009English

Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

2012English

Fiscal Policy in a Currency Union at the Zero Lower Bound

Journal of Money, Credit and Banking
AccountingEconomicsEconometricsFinance
2019English

Folding Minimal Sequences: The Lower Bound for Sequence Complexity of Globular Proteins

FEBS Letters
GeneticsCell BiologyMolecular BiologyBiochemistryStructural BiologyBiophysics
1999English

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

The Stage Shop Scheduling Problem: Lower Bound and Metaheuristic

Scientia Iranica
2018English

An Effective Lower Bound for Group Complexity of Finite Semigroups and Automata

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
2012English

A Lower Bound for the Rank of $J_0(q)$

Acta Arithmetica
Number TheoryAlgebra
2000English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy