TY - GEN
T1 - COMPUTING ON A FREE TREE VIA COMPLEXITY-PRESERVING MAPPINGS.
AU - Chazelle, Bernard
PY - 1984
Y1 - 1984
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0021567757&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0021567757&partnerID=8YFLogxK
U2 - 10.1109/sfcs.1984.715936
DO - 10.1109/sfcs.1984.715936
M3 - Conference contribution
AN - SCOPUS:0021567757
SN - 081860591X
SN - 9780818605918
T3 - Annual Symposium on Foundations of Computer Science (Proceedings)
SP - 358
EP - 368
BT - Annual Symposium on Foundations of Computer Science (Proceedings)
PB - IEEE
ER -