A Decidable Logic for Tree Data-Structures with Measurements

Lecture Notes in Computer Science - Verification, Model Checking, and Abstract Interpretation ◽

10.1007/978-3-030-11245-5_15 ◽

2019 ◽

pp. 318-341 ◽

Cited By ~ 1

Author(s):

Xiaokang Qiu ◽

Yanjun Wang

Keyword(s):

Data Structures ◽

Tree Data

Download Full-text

Recursive proofs for inductive tree data-structures

ACM SIGPLAN Notices ◽

10.1145/2103621.2103673 ◽

2012 ◽

Vol 47 (1) ◽

pp. 123-136 ◽

Cited By ~ 7

Author(s):

Parthasarathy Madhusudan ◽

Xiaokang Qiu ◽

Andrei Stefanescu

Keyword(s):

Data Structures ◽

Tree Data

Download Full-text

Extremal cost tree data structures

SWAT 88 - Lecture Notes in Computer Science ◽

10.1007/3-540-19487-8_6 ◽

1988 ◽

pp. 51-63

Author(s):

Derick Wood

Keyword(s):

Data Structures ◽

Tree Data

Download Full-text

Multiresolution image registration based on tree data structures

Graphical Models ◽

10.1016/j.gmod.2011.01.001 ◽

2011 ◽

Vol 73 (4) ◽

pp. 111-126 ◽

Cited By ~ 1

Author(s):

Anton Bardera ◽

Imma Boada ◽

Miquel Feixas ◽

Jaume Rigau ◽

Mateu Sbert

Keyword(s):

Image Registration ◽

Data Structures ◽

Tree Data ◽

Multiresolution Image

Download Full-text

Teaching of tree data structures using microcomputer graphics

ACM SIGCSE Bulletin ◽

10.1145/953055.5634 ◽

1986 ◽

Vol 18 (1) ◽

pp. 67-72 ◽

Cited By ~ 2

Author(s):

G. Scott Owen

Keyword(s):

Data Structures ◽

Tree Data

Download Full-text

Secondary attribute retrieval using tree data structures

Theoretical Computer Science ◽

10.1016/0304-3975(84)90106-3 ◽

1984 ◽

Vol 33 (1) ◽

pp. 107-116 ◽

Cited By ~ 3

Author(s):

C.E. Veni Madhavan

Keyword(s):

Data Structures ◽

Tree Data

Download Full-text

MERGEABLE DOUBLE-ENDED PRIORITY QUEUES

International Journal of Foundations of Computer Science ◽

10.1142/s0129054199000022 ◽

1999 ◽

Vol 10 (01) ◽

pp. 1-17 ◽

Cited By ~ 6

Author(s):

SEONGHUN CHO ◽

SARTAJ SAHNI

Keyword(s):

Data Structure ◽

Data Structures ◽

Priority Queue ◽

Priority Queues ◽

Experimental Results ◽

Tree Data ◽

Tree Data Structure

We show that the leftist tree data structure may be adapted to obtain data structures that permit the double-ended priority queue operations Insert, DeleteMin, DeleteMax, and Merge to be done in O( log n) time where n is the size of the resulting queue. The operations FindMin and FindMax can be done in O(1) time. Experimental results are also presented.

Download Full-text

On Structural Signatures for Tree Data Structures

Applied Cryptography and Network Security - Lecture Notes in Computer Science ◽

10.1007/978-3-642-31284-7_11 ◽

2012 ◽

pp. 171-187 ◽

Cited By ~ 12

Author(s):

Kai Samelin ◽

Henrich C. Pöhls ◽

Arne Bilzhause ◽

Joachim Posegga ◽

Hermann de Meer

Keyword(s):

Data Structures ◽

Tree Data

Download Full-text

On the Study of Automatic NC-Code Programming Based on DXF Files

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.48-49.767 ◽

2011 ◽

Vol 48-49 ◽

pp. 767-772 ◽

Cited By ~ 1

Author(s):

Rui Hang Shi ◽

Lei Luo ◽

Zhen Qiang Yao

Keyword(s):

Data Structure ◽

Data Structures ◽

Object Oriented ◽

Programming System ◽

Automatic Programming ◽

Technological Parameters ◽

Nc Code ◽

Processing Information ◽

Tree Data ◽

Tree Data Structure

In this paper, a method of automatic NC code programming is studied. The data structure used to store graph information is the base of automatic programming system. By utilizing the object-oriented tree data structure proposed in the paper, the disadvantages of the method caused by using simple data structures can be overcome. In processing information, the judgment of topological relationship between two outlines is very important. The Loop Extremum Method is easy, convenient and with no limitations. The system adds plenty of technological parameters, provides multiple machining patterns. In the end, an example is given to test and verify the system`s functions.

Download Full-text