loading...
Encoding a Binary Search Tree in Constant Time on BSR
Dalian, China December 05-December 08
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.133Sixth International Conference on Par ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Limin Xiang, Kai Cheng, Kazuo Ushijiam, "Encoding a Binary Search Tree in Constant Time on BSR," Parallel and Distributed Computing Applications and Technologies, International Conference on, pp. 740-744, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/PDCAT.2005.133,
author = {Limin Xiang and Kai Cheng and Kazuo Ushijiam},
title = {Encoding a Binary Search Tree in Constant Time on BSR},
journal ={Parallel and Distributed Computing Applications and Technologies, International Conference on},
volume = {0},
year = {2005},
isbn = {0-7695-2405-2},
pages = {740-744},
doi = {http://doi.ieeecomputersociety.org/10.1109/PDCAT.2005.133},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel and Distributed Computing Applications and Technologies, International Conference on
TI - Encoding a Binary Search Tree in Constant Time on BSR
SN - 0-7695-2405-2
SP740
EP744
A1 - Limin Xiang,
A1 - Kai Cheng,
A1 - Kazuo Ushijiam,
PY - 2005
KW - null
VL - 0
JA - Parallel and Distributed Computing Applications and Technologies, International Conference on
ER -
 
Limin Xiang, Kyushu Sangyo University, Japan
Kai Cheng, Kyushu Sangyo University, Japan
Kazuo Ushijiam, Kyushu Sangyo University, Japan
Constant time solutions on BSR can be found in the literature to many applications, such as parenthesis matching, tree decoding, tree reconstruction, and etc. However, the problem of encoding a tree in constant time on BSR is still open. In this paper, some properties will be discussed on binary search trees and the i-p sequence, and based on the properties, a constant time algorithm on BSR is proposed for encoding a binary search tree into its i-p sequence, which is the first constant time solution to the problem on any model of computation.
Citation:
Limin Xiang, Kai Cheng, Kazuo Ushijiam, "Encoding a Binary Search Tree in Constant Time on BSR," pdcat, pp.740-744, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.