COMPUTING ON A FREE TREE VIA COMPLEXITY-PRESERVING MAPPINGS.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Using a centroid theorem for divide-and-conquer purposes, the author considers a number of data structuring techniques for linear lists, and generalizes them (i. e. , maps them) into techniques for free trees. Attention is restricted to mappings that preserve the complexity of the algorithms or at least keep the algorithms within the same complexity class.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages358-368
Number of pages11
ISBN (Print)081860591X, 9780818605918
DOIs
StatePublished - 1984

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this