Tight Upper and Lower Bounds on the Path Length of Binary Trees

SIAM Journal on Computing - United States
doi 10.1137/s0097539791197323
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Tight Upper Bounds for the Expected Loss of Lexicographic Heuristics in Binary Multiattribute Choice

SSRN Electronic Journal
2006English

Lower Bounds on the Length of Monotone Paths in Arrangements

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1991English

Robust Randomness Amplifiers: Upper and Lower Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

New Upper and Lower Bounds Line of Sight Path Loss Models for Mobile Propagation in Buildings

ASEAN Journal on Science and Technology for Development
2017English

The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1989English

Average Path Length of Binary Decision Diagrams

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2005English

Upper and Lower Bounds on the Capacity of Wireless Optical Intensity Channels

2007English

Tight RMR Lower Bounds for Mutual Exclusion and Other Problems

2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy