Trees and linked lists with variable ordering relations (RTR structures)

ISSN： 0361-7688

Source： Programming and Computer Software, Vol.32, Iss.6, 2006-12, pp. : 324-337

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The Formal Design Model of Doubly-Linked-Circular Lists (DLC-Lists)

International Journal of Software Science and Computational Intelligence (IJSSCI), Vol. 3, Iss. 2, 2011-04 ,pp. : 83-102

IGI Global_journal

Access to resources Recommend Favorite

Constraint propagation for ordering, abstraction, and aggregation relations

By Pape Claude Le

Journal of Experimental & Theoretical Artificial Intelligence, Vol. 10, Iss. 1, 1998-01 ,pp. : 63-76

Taylor & Francis Ltd

Access to resources Recommend Favorite

Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees

By Bertossi A.A. Pinotti C.M.

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 8, 2002-08 ,pp. : 1314-1333

Academic Press

Access to resources Recommend Favorite

Runtime reconfigurable interfaces: the RTR-IFB approach

By Ihmor Stefan Hardt Wolfram

International Journal of Embedded Systems, Vol. 2, Iss. 1-2, 2006-07 ,pp. : 4-15

Inderscience Publishers

Access to resources Recommend Favorite

Succinct and I/O Efficient Data Structures for Traversal in Trees

By Dillabaugh Craig He Meng Maheshwari Anil

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 201-223

Springer Publishing Company

Access to resources Recommend Favorite