ScholarLens Back to search
1992•Journal of Parallel and Distributed ComputingOpen access

Efficient algorithms for dilated mappings of binary trees

Mohammad Iqbal

Open full text 1 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Random binary tree, Self-balancing binary search tree, Binary tree, Interval tree, K-ary tree, Optimal binary search tree, Computer science, Binary number

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Efficient algorithms for dilated mappings of binary trees — Research Paper | ScholarLens