Search results for "tree data structures"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Alban Gabillon, Manuel Munier, Jean-Jacques Bascou, Laurent Gallon, Emmanuel Bruno	An Access Control Model for Tree Data Structures.	ISC	2002	DBLP DOI BibTeX RDF	Access Control, Security Policy, Tree Data Structures, Permission, Authorization Rule
3	Richard J. Anderson	Tree Data Structures for N-Body Simulation.	FOCS	1996	DBLP DOI BibTeX RDF	spatial decomposition tree, particle-cluster force evaluation algorithms, Barnes-Hut algorithm, spatially balanced tree, force evaluation, tree data structures, tree data structures, k-d tree, worst case complexity, N-body simulation
2	Emad Mabrouk, Abdel-Rahman Hedar, Masao Fukushima	Memetic programming with adaptive local search using tree data structures.	CSTST	2008	DBLP DOI BibTeX RDF	genetic programming, evolutionary computing, meta-heuristics, iterated local search
2	Michael A. Bender, Erik D. Demaine, Martin Farach-Colton	Cache-Oblivious B-Trees.	FOCS	2000	DBLP DOI BibTeX RDF	cache-oblivious B-trees, dynamic search-tree data structures, optimal search bound, amortized memory transfers, computational complexity, memory hierarchy, cache storage, tree data structures, insertions, deletions, tree searching, hierarchical memory, worst-case bounds
2	Guoliang Xue	A Cost Optimal Parallel Algorithm for Computing Force Field in N-Body Simulations.	COCOON	1998	DBLP DOI BibTeX RDF	Paralle algorithms, spatial tree data structures, force field evaluation, cost optimal algorithms, PRAM, N-body simulations
1	Parikshit Ram, Alexander G. Gray	Maximum Inner-Product Search using Tree Data-structures	CoRR	2012	DBLP BibTeX RDF
1	Parthasarathy Madhusudan, Xiaokang Qiu, Andrei Stefanescu	Recursive proofs for inductive tree data-structures.	POPL	2012	DBLP DOI BibTeX RDF
1	Abdel-Rahman Hedar, Emad Mabrouk, Masao Fukushima	Tabu Programming: a New Problem Solver through Adaptive Memory Programming over Tree Data Structures.	International Journal of Information Technology and Decision Making	2011	DBLP DOI BibTeX RDF
1	Anton Bardera, Imma Boada, Miquel Feixas, Jaume Rigau, Mateu Sbert	Multiresolution image registration based on tree data structures.	Graphical Models	2011	DBLP DOI BibTeX RDF
1	Thomas Wies, Marco Muñiz, Viktor Kuncak	An Efficient Decision Procedure for Imperative Tree Data Structures.	CADE	2011	DBLP DOI BibTeX RDF
1	Angelo Ciaramella, Witold Pedrycz, Alfredo Petrosino	Uninorm Based Fuzzy Network for Tree Data Structures.	WILF	2009	DBLP DOI BibTeX RDF	Fuzzy Logic Connectives, t-norms (t-conorms), Trees, Graphical Models, Structured Data, Uninorms
1	Heder S. Bernardino, Helio J. C. Barbosa	Grammar-Based Immune Programming for Symbolic Regression.	ICARIS	2009	DBLP DOI BibTeX RDF	immune programming, Artificial immune system, symbolic regression, grammatical evolution
1	Ashish Kundu, Elisa Bertino	Structural signatures for tree data structures.	PVLDB	2008	DBLP BibTeX RDF
1	D. Brian Larkins, James Dinan, Sriram Krishnamoorthy, Srinivasan Parthasarathy, Atanas Rountev, P. Sadayappan	Global trees: a framework for linked data structures on distributed memory parallel systems.	SC	2008	DBLP DOI BibTeX RDF
1	Alex X. Liu, Fei Chen, JeeHyun Hwang, Tao Xie	Xengine: a fast and scalable XACML policy evaluation engine.	SIGMETRICS	2008	DBLP DOI BibTeX RDF	policy decision point (PDP), policy enforcement point (PEP), access control, web server, XACML, policy evaluation
1	Brent Bryan, Frederick Eberhardt, Christos Faloutsos	Compact Similarity Joins.	ICDE	2008	DBLP DOI BibTeX RDF
1	Paolo Valente	Exact GPS simulation and optimal fair scheduling with logarithmic complexity.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	scheduling, complexity theory, tree data structures
1	Soo Kyoung Kim, Heggere S. Ranganath	Solving discontinuity and distortion problems in boundary based image segmentation and representation.	ACM Southeast Regional Conference	2007	DBLP DOI BibTeX RDF	image segmentation, image representation, distortion, discontinuity
1	James Aspnes, Gauri Shah	Skip graphs.	ACM Transactions on Algorithms	2007	DBLP DOI BibTeX RDF	Peer-to-peer, overlay networks, skip lists
1	Robert Endre Tarjan, Renato Fonseca F. Werneck	Dynamic Trees in Practice.	WEA	2007	DBLP DOI BibTeX RDF
1	Ulrich Lauther	Multipole-Based Force Approximation Revisited - A Simple but Fast Implementation Using a Dynamized Enclosing-Circle-Enhanced k-d-Tree.	Graph Drawing	2006	DBLP DOI BibTeX RDF
1	Jussi Kujala, Tapio Elomaa	Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance.	ISAAC	2006	DBLP DOI BibTeX RDF
1	Kevin Andrusky, Stephen Curial, José Nelson Amaral	Tree-Traversal Orientation Analysis.	LCPC	2006	DBLP DOI BibTeX RDF
1	Gerhard W. Zumbusch	Data Dependence Analysis for the Parallelization of Numerical Tree Codes.	PARA	2006	DBLP DOI BibTeX RDF
1	Xuehong Sun, Yiqiang Q. Zhao	An On-Chip IP Address Lookup Algorithm.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	Algorithms, hardware, tree data structures, range search, on-chip memory, IP address lookup
1	Haibin Lu, Sartaj Sahni	A B-Tree Dynamic Router-Table Design.	IEEE Trans. Computers	2005	DBLP DOI BibTeX RDF	dynamic router-tables, highest-priority-range matching, nonintersecting ranges, B-trees, Packet routing, longest-prefix matching
1	Keshri Verma, Om Prakash Vyas, Ranjana Vyas	Temporal Approach to Association Rule Mining Using T-Tree and P-Tree.	MLDM	2005	DBLP DOI BibTeX RDF
1	Vijay Arya, Thierry Turletti, Shivkumar Kalyanaraman	Encodings of Multicast Trees.	NETWORKING	2005	DBLP DOI BibTeX RDF
1	Alban Gabillon	An authorization model for XML databases.	SWS	2004	DBLP DOI BibTeX RDF	Xupdate, privilege, security, XML, access controls, XPath, permission
1	Haibin Lu, Sartaj K. Sahni	A B-tree dynamic router-table design.	ISCC	2004	DBLP DOI BibTeX RDF
1	Pedro C. Diniz, Joonseok Park	Using FPGAs for data and reorganization engines: preliminary results for spatial pointer-based data structures.	FPGA	2003	DBLP DOI BibTeX RDF
1	James Aspnes, Gauri Shah	Skip graphs.	SODA	2003	DBLP DOI BibTeX RDF
1	James D. Fix	The set-associative cache performance of search trees.	SODA	2003	DBLP DOI BibTeX RDF
1	M. Bernard, S. Mohammed	Labeled Radial Drawing of Data Structures.	IV	2003	DBLP DOI BibTeX RDF
1	Salvador Roura	Digital Access to Comparison-Based Tree Data Structures and Algorithms.	J. Algorithms	2001	DBLP DOI BibTeX RDF
1	Frans Coenen, Graham Goulbourne, Paul H. Leng	Computing Association Rules Using Partial Totals.	PKDD	2001	DBLP DOI BibTeX RDF	Data Structures, Association Rules, Set Enumeration Tree
1	Carsten Kleiner, Udo W. Lipeck	Efficient Index Structures for Spatio-Temporal Objects. (PDF / PS)	DEXA Workshops	2000	DBLP DOI BibTeX RDF	spatio-temporal objects, tree-based access structures, spatio-temporal queries, generalized search trees, SS-tree, size-based penalty metrics, distance-based penalty metrics, tree data structures, index structures, spatial queries, temporal queries, R*-tree, database indexing
1	Paolo Ferragina, Giovanni Manzini	Opportunistic Data Structures with Applications.	FOCS	2000	DBLP DOI BibTeX RDF	opportunistic data structures, data indexing, succinct suffix array, suffix tree data structures, suffix array data structures, Glimpse tool, sublinear query time complexity, sublinear space complexity, computational complexity, data structures, search, data compression, data compression, entropy, database theory, data set, database indexing, query performance
1	Trent Hill, James Noble, John Potter	Scalable Visualisations with Ownership Trees.	TOOLS	2000	DBLP DOI BibTeX RDF	program visualisation, scalable visualisations, ownership trees, top-level components, implicit aggregation structure, scale-independent topology, low-level data structure, software visualisation tool, learning, object-oriented programming, object-oriented programs, software maintenance, debugging, computer science education, teaching, program debugging, tree data structures, abstraction levels, object graph, program maintenance
1	James Cheney	Statistical Models for Term Compression.	Data Compression Conference	2000	DBLP DOI BibTeX RDF	term syntax tree compression statistical model
1	Richard J. Anderson	Tree Data Structures for N-Body Simulation.	SIAM J. Comput.	1999	DBLP DOI BibTeX RDF
1	Scott P. Oswald, Kannan Ramchandran, Thomas S. Huang	Efficient Terrain Data Representation for 3D Rendering Using the Generalized BFOS Algorithm. (PDF / PS)	ICIP	1997	DBLP DOI BibTeX RDF	efficient terrain data representation, 3D rendering, generalized BFOS algorithm, flight simulator video games, regular triangular grid, tree-pruning method, quantization trees, geographic information systems, GIS, computer graphics, regression, displays, binary tree, tree data structures, tessellation, military, multiple resolutions
1	Vincenzo Auletta, Amelia De Vivo, Vittorio Scarano	Multiple Templates Access of Trees in Parallel Memory Systems. (PDF / PS)	IPPS	1997	DBLP DOI BibTeX RDF	multiple template access, node mapping algorithms, subtree templates, root-to-leaf path templates, preprocessing phase, data structure, time complexity, tree data structures, load, complete binary trees, conflict-free access, parallel access, memory modules, parallel memory systems
1	Yonatan Aumann, Michael A. Bender	Fault Tolerant Data Structures.	FOCS	1996	DBLP DOI BibTeX RDF	fault tolerant data structures, memory faults, pointer-based data structures, dictionary tree, trees, stack, tree data structures, linked list
1	Chiun-Chieh Hsu	All-fault-tolerant embedding of a complete binary tree in a group of Cayley graphs. (PDF / PS)	ICPADS	1996	DBLP DOI BibTeX RDF	all-fault-tolerant embedding, n-dimensional complete transposition graph, bubblesort graph, fault-tolerant scheme, fault tolerant computing, multiprocessor interconnection networks, Cayley graphs, tree data structures, star graph, complete binary tree
1	Maria Cristina Pinotti, Vincenzo A. Crupi, Sajal K. Das	A Parallel Solution to the Extended Set Union Problem with Unlimited Backtracking. (PDF / PS)	IPPS	1996	DBLP DOI BibTeX RDF	parallel solution, extended set union problem, unlimited backtracking, Find, SetUnion, MultiUnion, k-Parallel Union Find trees, constant parallel time, optimal work, constant-time performance, parallel algorithms, computational complexity, data structure, parallel machines, Restore, backtracking, Backtrack, tree data structures, tree searching, random-access storage, dynamic partition, Union, EREW-PRAM model
1	Sajal K. Das, Falguni Sarkar	A hypercube algorithm for GVT computation and its application in optimistic parallel simulation.	Annual Simulation Symposium	1995	DBLP DOI BibTeX RDF	GVT computation, optimistic parallel simulation, global virtual time, distributed memory hypercube architecture, 3N messages, logical processors, simulation system, spanning binomial tree, GVT manager, physical processor, hierarchical load balancing, transient messages, parallel algorithms, computational complexity, discrete event simulation, discrete event simulation, memory management, hypercube networks, distributed memory systems, tree data structures, hypercube algorithm
1	Arne Andersson	Sublogarithmic Searching without Multiplications.	FOCS	1995	DBLP DOI BibTeX RDF	sublogarithmic searching, unit-cost RAM, computational complexity, data structure, search, search problems, tree data structures, insert, delete, nearest neighbour, worst-case time
1	Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts	Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version).	FOCS	1995	DBLP DOI BibTeX RDF	competitive access time, dynamic storage rearrangement, industrial stacker crane warehouse, automatic robot run warehouse, disk track optimization, two dimensional memory management, bubble memory, doubly linked list management, computational complexity, database, graph theory, lower bounds, optimisation, database management systems, upper bounds, server, storage allocation, probability distribution, tree structure, tree data structures, operations research, undirected graph, process migration, competitive algorithms, competitive algorithms, warehouse, disk storage, mass storage systems
1	Richard M. Karp, Orli Waarts, Geoffrey Zweig	The Bit Vector Intersection Problem (Preliminary Version).	FOCS	1995	DBLP DOI BibTeX RDF	bit vector intersection, sparse bit vectors, dictionary matches, high probability, recursive tree-searching, randomized algorithms, hashing, tree data structures, randomised algorithms, algorithm theory
1	Hajime Kitakami, Tadasu Shin-I, Kazuho Ikeo, Yoshihiro Ugawa, Naruya Saitou, Takashi Gojobori, Yoshio Tateno	YAMATO and ASUKA: DNA database management system.	HICSS	1995	DBLP DOI BibTeX RDF	DNA database management system, YAMATO, ASUKA, DDBJ, window interfaces, DDBJ-schema, single entry, Human Genome Project, flat file format, restructuring tool, tree search tool, taxonomy database, structured SQL-programming method, control flow language, SQL expression, SYBASE, DNA Data Bank of Japan, user interfaces, searching, query processing, relational databases, SQL, DNA, tree data structures, genetics, biology computing, relational database management system, relational schema
1	Shin-Ywan Wang, Toshiaki Yagasaki	Block selection: a method for segmenting a page image of various editing styles. (PDF / PS)	ICDAR	1995	DBLP DOI BibTeX RDF	block selection, page image segmentation, editing styles, categorized blocks, page blocks, document processing applications, page arrangement, image segmentation, optical character recognition, OCR, text classification, image classification, image representation, document image processing, tree structure, tree data structures, English, text editing, skew correction, Kanji, hierarchical tree
1	S. Jeromy Carrière, Rick Kazman	Research report: Interacting with huge hierarchies: beyond cone trees.	INFOVIS	1995	DBLP DOI BibTeX RDF	huge information hierarchy visualisation, huge information hierarchy interaction, huge hierarchies, tool efficacy, fsviz, graphical techniques, usage-based filtering, animated zooming, hand-coupled rotation, fish-eye zooming, distant node coalescence, cone tree visualization systems, node layout algorithm, interaction techniques, texturing, computer animation, data visualisation, empirical evaluation, dynamic queries, tree data structures, colour, depth cueing, user control, visual clutter, cone trees
1	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work
1	Kim S. Larsen, Rolf Fagerberg	B-trees with relaxed balance. (PDF / PS)	IPPS	1995	DBLP DOI BibTeX RDF	relaxed balance, shared-memory asynchronous parallel architectures, rebalancing, extensive locking, maximal size, parallel architectures, B-trees, tree data structures, subtree
1	Massimo Ancona, M. De Benedetto	A parallel algorithm for "document segmentation".	PDP	1995	DBLP DOI BibTeX RDF	data parallel approach, divide and conquer implementation, xy-tree, xy-trees, PVM3 system, parallel algorithms, parallel algorithm, image segmentation, document image processing, tree data structures, document segmentation, divide and conquer methods
1	Paolo Cremonesi, Domenico G. Sorrenti	A control architecture for managing instructions among partitions of a data parallel structure.	PDP	1995	DBLP DOI BibTeX RDF	instruction management, data parallel structure, image feature handling, distributed-memory MIMD parallel machine, MANAGER processes, WORKER processes, parallel image processing algorithm, distributed memory MIMD parallel machine, parallel algorithms, parallel programming, edge detection, edge detection, parallel machines, tree structure, tree data structures, control architecture, control strategies, parallel data structure
1	Antonio Polo Márquez, Manuel Barrena García, J. Hernandez, Juan Miguel Martínez, Pedro de Miguel, Manuel M. Nieto Rodríguez	Multi-dimensional partitioning for massively parallel database machines.	PDP	1995	DBLP DOI BibTeX RDF	multidimensional partitioning, massively parallel database machines, processing tools, parallel relational database, m-Q-tree indexes, multiattribute index structure, scalability, query processing, relational databases, distributed databases, requirements, parallel machines, high performance, software performance evaluation, access method, tree data structures, database machines, complex queries, data declustering
1	Dietrich Fahrenholtz, Volker Haarslev	Visualization of Strand(tm) Processes. (PDF / PS)	VL	1995	DBLP DOI BibTeX RDF	large call tree circular shaped layout, Strand programs, Strand process visualisation, parallel Strand programs, Polaranimation tool, debugging facilities, parallel programming, parallel programs, software tools, visual programming, visual languages, software performance evaluation, data visualisation, program debugging, tree data structures, performance tuning, visualization tool, polar coordinates
1	Xinxin Liu, David Walker	Confluence of Processes and Systems of Objects.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Karsten Weihe	Maximum (s, t)-Flows in Planar Networks in O(\|V\| log \|V\|) Time	FOCS	1994	DBLP DOI BibTeX RDF	planar networks, maximum (s,t)-flows, directed graphs, planar graph, tree data structures, maximum flow
1	Jianqing Liu, Yee-Hong Yang	Multiresolution Color Image Segmentation.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	multiresolution color image segmentation, relaxation process, quadtree structure, noise resistant, global clustering information, synthesized images, evaluation criterion, image segmentation, simulated annealing, simulated annealing, Markov random fields, Markov processes, merging, tree data structures, real images, splitting, dissimilarity measures, scale space filter, maximum a posteriori estimate
1	Akhil Kumar	G-Tree: A New Data Structure for Organizing Multidimensional Data.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	G-tree, multidimensional data organisation, grid tree, ordering property, multidimensional space, partition numbers, dynamic data spaces, nonuniform data distributions, deletion operations, BD tree, zkdb tree, KDB tree, simulated bucket utilization rates, data structure, trees (mathematics), range queries, B-trees, tree data structures, data handling
1	Gabriel Matsliach, Oded Shmueli	A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	large index maintenance, multiprocessor multidisk environments, secondary memory indices, dedicated secondary memory, local broadcast network, straightforward method, index record partitioning, local B/sup tree, totally distributed B/sup tree method, combined distribution method, tightly coupled environments, redundant array of inexpensive disks, distributed indices, simulation, performance evaluation, performance, data structures, indexing, distributed databases, shared memory, multiprocessing systems, database systems, distributed file systems, RAID, tree data structures, declustering, magnetic disc storage, approximate analysis
1	Alain Billionnet	Allocating Tree Structured Programs in a Distributed System with Uniform Communication Costs.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	tree structured programs, optimization, distributed system, computational complexity, complexity, parallel programming, resource allocation, distributed processing, computer network, task allocation, communication costs, tree data structures, communication graph
1	Joydeep Ghosh, Sajal K. Das, Ajita John	Concurrent Processing of Linearly Ordered Data Structures on Hypercube Multicomputers.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	concurrentprocessing, linearly ordered data structures, concurrentmanipulation, augmented binomial search tree, pruned binomial tree, arbitrary processor node, consecutive nodes, nonoverlappingprocessor lists, intermediate-levelimage processing algorithms, dictionary operations, low-level image processingalgorithms, Gray code embedding, distributed memorymulticomputers, parallel algorithms, parallel programming, broadcast, hypercube networks, trees (mathematics), distributed memory systems, search problems, merge, tree data structures, search trees, k-ary n-cubes, concurrent data structure, hypercube multicomputers, local information, fanout, hypercube systems
1	Jean-Michel Hélary, Achour Mostéfaoui, Michel Raynal	A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms.	IEEE Trans. Parallel Distrib. Syst.	1994	DBLP DOI BibTeX RDF	token-based distributed mutualexclusion algorithms, tree-based distributed mutual exclusion algorithms, permission-based mutual exclusion algorithms, rooted tree structure, informationstructure, topology requirements, distributed algorithms, distributed algorithms, topology, tree data structures, generic algorithm
1	Robert P. Cheetham, B. John Oommen, David T. H. Ng	Adaptive Structuring of Binary Search Trees Using Conditional Rotations.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	conditional rotations, restructuring heuristic, integer memory locations, weighted path length, simulation, tree data structures, binary search trees, adaptive structuring
1	Kikuo Fujimura, Pankaj Jalote	On Robustness of B-Trees.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	index corruption, pointer corruption, structural error, data structure, robustness, correctability, B-trees, tree data structures, semantic information
1	Özden Gür-Ali, William A. Wallace	Induction of Rules Subject to a Quality Constraint: Probabilistic Inductive Learning.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	quality constraint, probabilistic inductive learning, organizational databases, tree induction algorithms, total branching, subset elimination, maximum misclassification levels, minimum reliability levels, automated decision processes, claims process, compensation board, learning (artificial intelligence), decision support system, decision support systems, knowledge acquisition, deductive databases, rule induction, tree data structures, uncertainty handling, rule generation, statistical quality control, decision processes
1	Yasuaki Nakamura, Shigeru Abe, Yutaka Ohsawa, Masao Sakauchi	A Balanced Hierarchical Data Structure for Multidimensional Data with Highly Efficient Dynamic Characteristics.	IEEE Trans. Knowl. Data Eng.	1993	DBLP DOI BibTeX RDF	balanced hierarchical data structure, highly efficient dynamic characteristics, multidimensional tree, worst-case storage utilization, dynamic characteristics, simulation, B-tree, tree data structures, insertion, deletion, multidimensional data, spatial searching, retrieval performance
1	Toshihide Ibaraki, Tiko Kameda	A Theory of Coteries: Mutual Exclusion in Distributed Systems.	IEEE Trans. Parallel Distrib. Syst.	1993	DBLP DOI BibTeX RDF	Boolean variable, Booleanfunction, self-dual functions, three-majority function, binary decomposition, classical Ashenhurst decomposition, distributed systems, distributed processing, Boolean functions, mutual exclusion, compactness, Boolean algebra, binary tree, quorums, tree data structures, coteries
1	Ing-Ray Chen, Sayed Atef Banawan	Modeling and Analysis of Concurrent Maintenance Policies for Data Structures Using Pointers.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	concurrent maintenance policies, state reduction method, two-dimensional Markov model, one-dimensional Markov model, concurrent data structure maintenance policies, service time per operation, priority allocation functions, binary tree data structure, 1D Markov model, 2D Markov model, performance evaluation, performance analysis, data structures, software maintenance, Markov processes, tree data structures, pointers, closed form expression
1	Josephine Micallef, Gail E. Kaiser	Support Algorithms for Incremental Attribute Evaluation of Asynchronous Subtree Replacements.	IEEE Trans. Software Eng.	1993	DBLP DOI BibTeX RDF	incremental attribute evaluation, multiple asynchronous subtree replacements, arbitrary noncircular attribute grammars, multiple independent editing cursors, disjoint regions, derivation tree, computational complexity, complexity, trees (mathematics), attribute grammars, tree data structures, text editing, open problems
1	David Steinbrook, Eugene E. McDonnell	From Trees into Boxes.	APL	1993	DBLP DOI BibTeX RDF	APL, J
1	Michael S. Warren, John K. Salmon	Astrophysical N-body Simulations Using Hierarchical Tree Data Structures.	SC	1992	DBLP BibTeX RDF
1	Nirdosh Bhatnagar	Back of the Envelope Performance Analysis of a Two Level Hierarchy of Memory in Presence of Tree Data Structures.	Int. CMG Conference	1989	DBLP BibTeX RDF
1	Anucha Pitaksanonkul, Suchai Thanawastien, Chidchanok Lursinsap	Comparisons of quad trees and 4-D trees: new results [VLSI layout].	IEEE Trans. on CAD of Integrated Circuits and Systems	1989	DBLP DOI BibTeX RDF
1	Derick Wood	Extremal Cost Tree Data Structures.	SWAT	1988	DBLP DOI BibTeX RDF
1	G. Scott Owen	Teaching of tree data structures using microcomputer graphics.	SIGCSE	1986	DBLP DOI BibTeX RDF
1	Claude Puech, Hossein Yahia	Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing.	Symposium on Computational Geometry	1985	DBLP DOI BibTeX RDF
1	C. E. Veni Madhavan	Secondary Attribute Retrieval Using Tree Data Structures.	Theor. Comput. Sci.	1984	DBLP DOI BibTeX RDF