Search results for "kd-trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
82	Karel Culík II, Thomas Ottmann, Derick Wood	Dense Multiway Trees.	ACM Trans. Database Syst.	1981	DBLP DOI BibTeX RDF	dense trees, multiway trees, storage utilization, B-trees, search trees, balanced trees
73	William E. Wright	Dynamic Binary Search Trees.	ACM Annual Conference (1)	1978	DBLP DOI BibTeX RDF	BB trees, Dynamic trees, Optimal trees, Weighted path length, Weighted trees, Binary search trees, AVL trees
71	Jun Rao, Kenneth A. Ross	Making B+-Trees Cache Conscious in Main Memory.	SIGMOD Conference	2000	DBLP DOI BibTeX RDF
57	Zhiheng Huang, Masoud Nikravesh, Ben Azvine, Tamás D. Gedeon	Weighted Pattern Trees: A Case Study with Customer Satisfaction Dataset.	IFSA (1)	2007	DBLP DOI BibTeX RDF
55	David Benoit, Erik D. Demaine, J. Ian Munro, Rajeev Raman, Venkatesh Raman 0001, S. Srinivasa Rao 0001	Representing Trees of Higher Degree.	Algorithmica	2005	DBLP DOI BibTeX RDF	Cardinal trees, Ordinal trees, Digital search trees, Data structures, Data compression, Information theory, Hashing, Analysis of algorithms, Dictionary, Tries, Succinct data structures
55	Joaquim Gabarró, Xavier Messeguer, Daniel Riu	Concurrent Rebalancing on HyperRed-Black Trees.	SCCC	1997	DBLP DOI BibTeX RDF	concurrent rebalancing, HyperRed-Black trees, consecutive red nodes, Chromatic trees, red nodes, concurrent deletions algorithm, concurrent insertions, direct updating, red cluster, trees (mathematics), deletions
51	Sangyong Hwang, Keunjoo Kwon, Sang Kyun Cha, Byung Suk Lee 0001	Performance Evaluation of Main-Memory R-tree Variants.	SSTD	2003	DBLP DOI BibTeX RDF
51	Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas	10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees.	Advances and Applications of Automata on Words and Trees	2010	DBLP BibTeX RDF
51	Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas	10501 Executive Summary - Advances and Applications of Automata on Words and Trees.	Advances and Applications of Automata on Words and Trees	2010	DBLP BibTeX RDF
50	Michael Benedikt, Leonid Libkin, Frank Neven	Logical definability and query languages over ranked and unranked trees.	ACM Trans. Comput. Log.	2007	DBLP DOI BibTeX RDF	Ranked trees, unranked trees, query languages, tree automata, model theory
50	Trong Dung Nguyen, Tu Bao Ho, Hiroshi Shimodaira	A visualization tool for interactive learning of large decision trees.	ICTAI	2000	DBLP DOI BibTeX RDF	large decision tree visualization, moderately sized datasets, decision tree induction programs, very large trees, T2 5D, data mining, data mining, decision trees, interactive systems, data visualisation, very large databases, learning process, visualization tool, interactive learning, large datasets, learning by example, visualization technique, decision tree induction, tree visualizers, learning techniques
50	Zicheng Guo, Rami G. Melhem	Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	binaryX-trees, spanning buses, 2-D arrayarchitectures, routing step, parallel architectures, multiprocessor interconnection networks, embedding, network routing, binary trees, processor arrays, pyramids, network embeddings
50	Richard W. Selby, Adam A. Porter	Learning from Examples: Generation and Evaluation of Decision Trees for Software Resource Analysis.	IEEE Trans. Software Eng.	1988	DBLP DOI BibTeX RDF	software resource analysis, production environment, machine learning, software engineering, software engineering, artificial intelligence, artificial intelligence, metrics, decision trees, trees (mathematics), decision theory, NASA, software modules
50	Rudolf Bayer, Karl Unterauer	Prefix B-Trees.	ACM Trans. Database Syst.	1977	DBLP DOI BibTeX RDF	multiway search trees, B-trees, key compression
45	Daw-Jong Shyu, Biing-Feng Wang, Chuan Yi Tang	The emulation problem on trees.	IPPS	1995	DBLP DOI BibTeX RDF	emulation problem, optimal emulation, X-trees, m-ary trees, parallel algorithms, parallel algorithms, interconnection networks, multiprocessor interconnection networks, trees, pyramids
45	Christian Glaßer, Jean-Eric Pin, Nicole Schweikardt, Victor L. Selivanov, Wolfgang Thomas (eds.)	Advances and Applications of Automata on Words and Trees, 12.12. - 17.12.2010	Advances and Applications of Automata on Words and Trees	2010	DBLP BibTeX RDF
45	Alexander Okhotin, Christian Reitwießner	Parsing Unary Boolean Grammars Using Online Convolution.	Advances and Applications of Automata on Words and Trees	2010	DBLP BibTeX RDF
44	Shimin Chen, Phillip B. Gibbons, Todd C. Mowry, Gary Valentin	Fractal prefetching B±Trees: optimizing both cache and disk performance.	SIGMOD Conference	2002	DBLP DOI BibTeX RDF
44	Vance E. Waddle	Production Trees: A Compact Representation of Parsed Programs.	ACM Trans. Program. Lang. Syst.	1990	DBLP DOI BibTeX RDF
44	Jason Cong, Cheng-Kok Koh	Interconnect layout optimization under higher-order RLC model.	ICCAD	1997	DBLP DOI BibTeX RDF	RATS trees, Steiner routings, bounded-radius Steiner trees, higher-order RLC model, incremental moment computation algorithm, interconnect layout optimization, nonmonotone signal response, required-arrival-time Steiner trees, resistance-inductance-capacitance circuits, routing area, routing cost, routing topologies, shortest-path Steiner trees, signal delay, signal settling time, voltage overshoot, waveform optimization, waveform quality evaluation, wire-sizing optimization, circuit optimisation, topology optimization, delay optimization
43	Jakub Koperwas, Krzysztof Walczak 0002	Frequent Subsplit Representation of Leaf-Labelled Trees.	EvoBIO	2008	DBLP DOI BibTeX RDF	Leaf-labelled trees, frequent subsplits, phylogenetic trees
43	Manuel Gómez-Olmedo, Andrés Cano	Applying Numerical Trees to Evaluate Asymmetric Decision Problems.	ECSQARU	2003	DBLP DOI BibTeX RDF	asymmetric decision problems, numerical trees, probability trees, Influence diagrams
43	Bryant A. Julstrom, Günther R. Raidl	Initialization is robust in evolutionary algorithms that encode spanning trees as sets of edges.	SAC	2002	DBLP DOI BibTeX RDF	random spanning trees, sets of edges, spanning trees, initialization
43	Sabine R. Öhring, Maximilian Ibel, Sajal K. Das 0001, Mohan Kumar	On generalized fat trees.	IPPS	1995	DBLP DOI BibTeX RDF	generalized fat trees, multiprocesser interconnection networks, connection machine architecture, pruned butterflies, fat tree based architecture, inner nodes, leaf processors, recursive scalability, maximal fault-tolerance, logarithmic diameter bisection scalability, fault tolerant self-routing, reliability, parallel architectures, fault tolerant computing, broadcasting, hypercubes, multiprocessor interconnection networks, trees, meshes, communication complexity, symmetry, routers, network routing, switches, rings, pyramids, tori, CM-5
42	Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky	A new perspective on implementation by voting trees.	EC	2009	DBLP DOI BibTeX RDF	copeland rule, voting trees, approximation, computational social choice
41	YunMei Dong	Linear algorithm for lexicographic enumeration of CFG parse trees.	Sci. China Ser. F Inf. Sci.	2009	DBLP DOI BibTeX RDF	hierarchical construction of set of parse trees, lexicographic enumeration of parse trees, counting of parse trees
41	Eiichi Tanaka	A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	unrooted trees, unordered trees, bottom-up computing method, strongly structure-preserving mapping, vertex correspondences, similar substructures, similar structure search, pattern recognition, computational complexity, dynamic programming, dynamic programming, pattern matching, pattern matching, similarity, time complexity, trees (mathematics), space complexity, distance metric, maximum degrees
41	Sheela Ramanna, Rajen Bhatt, Piotr Biernot	Software Defect Classification: A Comparative Study with Rough Hybrid Approaches.	RSEISP	2007	DBLP DOI BibTeX RDF	rough-fuzzy classification trees, neuro-fuzzy decision trees, Classification, rough sets, software defects
40	Saverio Caminiti, Emanuele G. Fusco, Rossella Petreschi	A Bijective Code for k -Trees with Linear Time Encoding and Decoding.	ESCAPE	2007	DBLP DOI BibTeX RDF
40	Robert Endre Tarjan	Results and Problems on Self-adjusting Search Trees and Related Data Structures.	SWAT	2006	DBLP DOI BibTeX RDF
40	Leonid Libkin, Frank Neven	Logical Definability and Query Languages over Unranked Trees.	LICS	2003	DBLP DOI BibTeX RDF
40	David Benoit, Erik D. Demaine, J. Ian Munro, Venkatesh Raman 0001	Representing Trees of Higer Degree.	WADS	1999	DBLP DOI BibTeX RDF
40	Shou-Hsuan Stephen Huang	Height-Balanced Trees of Order (beta,gamma,delta).	ACM Trans. Database Syst.	1985	DBLP DOI BibTeX RDF
40	Hillol Kargupta, Byung-Hoon Park, Haimonti Dutta	Orthogonal Decision Trees.	IEEE Trans. Knowl. Data Eng.	2006	DBLP DOI BibTeX RDF	Orthogonal decision trees, redundancy free trees, Fourier transform, principle component analysis
40	Nicholas Georgiou	Embeddings and Other Mappings of Rooted Trees Into Complete Trees.	Order	2005	DBLP DOI BibTeX RDF
39	Chin-Wen Ho, Sun-Yuan Hsieh, Gen-Huey Chen	An Efficient Parallel Strategy for Computing K-terminal Reliability and Finding Most Vital Edge in 2-trees and Partial 2-trees.	IPPS	1997	DBLP DOI BibTeX RDF	efficient parallel strategy, K-terminal reliability computation, most vital edge finding, 2-trees, partial 2-trees, connected graph components, logarithmic time, reliability, processors, edges, computation time, vertices, CRCW PRAM
39	Alexandros Kalousis, Melanie Hilario	Model selection via meta-learning: a comparative study.	ICTAI	2000	DBLP DOI BibTeX RDF	NOEMON, dataset characteristics, base-level inducers, instance based learners, boosted decision trees, learning (artificial intelligence), decision trees, decision trees, meta-models, model selection, meta-learning, instance based learning
38	Andrés Cano, Manuel Gómez-Olmedo, Serafín Moral	Binary Probability Trees for Bayesian Networks Inference.	ECSQARU	2009	DBLP DOI BibTeX RDF	Bayesian networks inference, variable elimination algorithm, probability trees, deterministic algorithms, approximate computation
38	Dong Kyue Kim, Minhwan Kim, Heejin Park	Linearized Suffix Tree: an Efficient Index Data Structure with the Capabilities of Suffix Trees and Suffix Arrays.	Algorithmica	2008	DBLP DOI BibTeX RDF	Index data structures, Suffix trees, Suffix arrays, String algorithms
38	Amalia Duch	Randomized Insertion and Deletion in Point Quad Trees.	ISAAC	2004	DBLP DOI BibTeX RDF	Randomized Algorithms, Quad trees
38	Evgeny Dantsin, Andrei Voronkov	Expressive Power and Data Complexity of Query Languages for Trees and Lists.	PODS	2000	DBLP DOI BibTeX RDF	trees, expressive power, lists, data complexity, term algebras
38	Jason Tsong-Li Wang, Bruce A. Shapiro, Dennis E. Shasha, Kaizhong Zhang, Kathleen M. Currey	An Algorithm for Finding the Largest Approximately Common Substructures of Two Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	1998	DBLP DOI BibTeX RDF	pattern recognition, dynamic programming, pattern matching, trees, Computational biology
38	Marc Mosko, J. J. Garcia-Luna-Aceves	An Analysis of Packet Loss Correlation in FEC-Enhanced Multicast Trees.	ICNP	2000	DBLP DOI BibTeX RDF	packet loss correlation, FEC-enhanced multicast trees, group loss probabilities, forward error correction codes, state equations, recursive formulae, FEC group, shared loss tree, leaf nodes, transmission group, missing packets, nonuniform link loss, nonFEC trees, Internet, probability, error correction codes, packet switching, decoding, decoding, trees (mathematics), forward error correction, multicast communication, erasure codes, correlation methods, probability mass function, cumulative distribution function
38	Floriana Esposito, Donato Malerba, Giovanni Semeraro	A Comparative Analysis of Methods for Pruning Decision Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	1997	DBLP DOI BibTeX RDF	top-down induction of decision trees, simplification of decision trees, pruning and grafting operators, optimal pruning, Decision trees, comparative studies
37	Milena Mihail, Christos Kaklamanis, Satish Rao	Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings.	FOCS	1995	DBLP DOI BibTeX RDF	efficient access, optical bandwidth wavelength routing, directed fiber trees, directed graph models, trees of rings, fiber links, physical directedness, optical amplifiers, polynomial time routing algorithm, optical wavelengths, fixed W wavelength technology, optical routing requirements, coloring paradigms, multicolored alternating cycles, averaging analysis, directed graphs, trees (mathematics), wavelength division multiplexing, wavelength division multiplexing, graph colouring, optical communication, approximation factor, WDM optical networks, ring topologies, tree topologies
37	Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan	Nearly Tight Bounds on the Learnability of Evolution.	FOCS	1997	DBLP DOI BibTeX RDF	nearly tight bounds, evolution learnability, Cavender-Farris trees, edge weighted trees, Phylogeny Construction Problem, CF tree, computationally expensive, genetic algorithms, maximum likelihood estimator, stochastic process, DNA, convergence rate, random variable
37	Mukul S. Bansal, Jianrong Dong, David Fernández-Baca	Comparing and Aggregating Partially Resolved Trees.	LATIN	2008	DBLP DOI BibTeX RDF
37	Robert Endre Tarjan, Renato Fonseca F. Werneck	Self-adjusting top trees.	SODA	2005	DBLP BibTeX RDF
36	Jakub Koperwas, Krzysztof Walczak 0002	Phylogenetic Trees Dissimilarity Measure Based on Strict Frequent Splits Set and Its Application for Clustering.	RSKT	2008	DBLP DOI BibTeX RDF	Leaf-labelled trees, Frequent subsplits, Clustering, Phylogenetic trees
36	Ander Murua	The Hopf Algebra of Rooted Trees, Free Lie Algebras, and Lie Series.	Found. Comput. Math.	2006	DBLP DOI BibTeX RDF	Free Lie algebra, Continous BCH function, Hopf algbra of rooted trees, Hall rooted trees, Lie series, Dual PBW basis, Rewritting algorithm, Logarithm of Chenn-Fliess series, Series of vector fields, Rooted tree
36	Stavros D. Nikolopoulos, Charis Papadopoulos	The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Complement spanning-tree matrix theorem, Quasi-threshold graphs, Networks, Trees, Spanning trees, Combinatorial problems
36	Isamu Shioya, Takao Miura	Knowledge pruning in decision trees.	ICTAI	2000	DBLP DOI BibTeX RDF	knowledge pruning, pruning method, semantic hierarchies, hierarchy levels, UCI Machine Learning Repository On Car Evaluation and Nursery, data mining, learning (artificial intelligence), decision trees, decision trees, domain knowledge
36	Vijay S. Iyengar	HOT: Heuristics for Oblique Trees.	ICTAI	1999	DBLP DOI BibTeX RDF	oblique trees, data mining, machine learning, classification, decision trees
36	Rudolf Bayer, J. K. Metzger	On the Encipherment of Search Trees and Random Access Files.	ACM Trans. Database Syst.	1976	DBLP DOI BibTeX RDF	encipherment, indexed sequential files, privacy transformation, random access files, security, privacy, cryptography, indexes, paging, protection, B-trees, search trees
36	Céline Scornavacca, Vincent Berry, Vincent Ranwez	From Gene Trees to Species Trees through a Supertree Approach.	LATA	2009	DBLP DOI BibTeX RDF
35	Antonio Corral, Manuel Torres 0001, Michael Vassilakopoulos, Yannis Manolopoulos	Predictive Join Processing between Regions and Moving Objects.	ADBIS	2008	DBLP DOI BibTeX RDF	TPR-trees, linear quad-trees, query processing, Moving objects, R-trees, joins
35	Atsuhiro Takasu, Shin'ichi Satoh 0001, Eishi Katsura	A rule learning method for academic document image processing.	ICDAR	1995	DBLP DOI BibTeX RDF	educational administrative data processing, syntactic rule learning method, academic document image processing, CyberMagazine, database tuples, block segmentation, rough classification, two dimensional plane, ordinal context free grammar, symbol concatenation, non terminal symbols, decomposed trees, learning (artificial intelligence), image segmentation, image classification, trees (mathematics), document image processing, computational linguistics, visual databases, visual database, context-free grammars, syntactic analysis, parse trees, digital library system
35	Jonathan Schaeffer	The History Heuristic and Alpha-Beta Search Enhancements in Practice.	IEEE Trans. Pattern Anal. Mach. Intell.	1989	DBLP DOI BibTeX RDF	history heuristic, alpha-beta search enhancements, minimax trees, interior nodes, transposition tables, trees (mathematics), search problems, minimax techniques, game trees
35	Giridhar Jayavelu, Srinivasan Ramasubramanian, Ossama Younis	Maintaining colored trees for disjoint multipath routing under node failures.	IEEE/ACM Trans. Netw.	2009	DBLP DOI BibTeX RDF	IP fast rerouting, colored trees, multipath routing
35	Martin Graham 0001, Jessie B. Kennedy	Exploring Multiple Trees through DAG Representations.	IEEE Trans. Vis. Comput. Graph.	2007	DBLP DOI BibTeX RDF	Multiple trees, Directed Acyclic Graph
35	Siegfried Nijssen, Élisa Fromont	Mining optimal decision trees from itemset lattices.	KDD	2007	DBLP DOI BibTeX RDF	decision trees, frequent itemsets, constraint-based mining, formal concepts
35	Renato Fernandes Hentschke, Jaganathan Narasimham, Marcelo O. Johann, Ricardo Augusto da Luz Reis	Maze routing steiner trees with effective critical sink optimization.	ISPD	2007	DBLP DOI BibTeX RDF	timing driven synthesis, Steiner trees, maze routing
35	Wan Nazmee Wan Zainon, Paul R. Calder	Visualising phylogenetic trees.	AUIC	2006	DBLP BibTeX RDF	interactive visualisation, bioinformatics, phylogenetic trees
35	Gerth Stølting Brodal, Rolf Fagerberg, Christian N. S. Pedersen	Computing the Quartet Distance between Evolutionary Trees in Time O(n log n).	Algorithmica	2004	DBLP DOI BibTeX RDF	Quartet distance, Distance measures, Evolutionary trees, Hierarchical decompositions
35	Donato Malerba, Floriana Esposito, Michelangelo Ceci, Annalisa Appice	Top-Down Induction of Model Trees with Regression and Splitting Nodes.	IEEE Trans. Pattern Anal. Mach. Intell.	2004	DBLP DOI BibTeX RDF	global and local effects, regression and splitting nodes, SMOTI, linear regression, Inductive learning, model trees
35	Alexandre Riazanov, Andrei Voronkov	Partially Adaptive Code Trees.	JELIA	2000	DBLP DOI BibTeX RDF	term indexing, code trees, matching, automated theorem proving, subsumption
35	Alois Panholzer, Helmut Prodinger	Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration.	Algorithmica	1998	DBLP DOI BibTeX RDF	Priority trees, Height of nodes, Generating functions, Path length
34	Beomseok Nam, Alan Sussman	A Comparative Study of Spatial Indexing Techniques for Multidimensional Scientific Datasets.	SSDBM	2004	DBLP DOI BibTeX RDF
34	Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter	A Framework for Index Bulk Loading and Dynamization.	ICALP	2001	DBLP DOI BibTeX RDF
34	Milan Zorman, Vili Podgorelec, Peter Kokol, Margaret G. E. Peterson, Joseph M. Lane	Decision Tree's Induction Strategies Evaluated on a Hard Real World Problem.	CBMS	2000	DBLP DOI BibTeX RDF	evolutionary decision trees, orthopaedic fracture data, decision trees, hybrid methods
33	Yuval Emek	k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees.	ESA	2009	DBLP DOI BibTeX RDF
33	Hosam M. Mahmoud	The size of random bucket trees via urn models.	Acta Informatica	2002	DBLP DOI BibTeX RDF
33	Neal Glew	A Theory of Second-Order Trees.	ESOP	2002	DBLP DOI BibTeX RDF
33	Conrado Martinez, Alois Panholzer, Helmut Prodinger	Partial Match Queries in Relaxed Multidimensional Search Trees.	Algorithmica	2001	DBLP DOI BibTeX RDF
33	Ming-Yang Kao, Tak Wah Lam, Wing-Kin Sung, Hing-Fung Ting	A Faster and Unifying Algorithm for Comparing Trees.	CPM	2000	DBLP DOI BibTeX RDF
33	Daniel Dominic Sleator, Robert Endre Tarjan	Self-Adjusting Binary Search Trees	J. ACM	1985	DBLP DOI BibTeX RDF
33	Vijay K. Vaishnavi	Computing Point Enclosures.	IEEE Trans. Computers	1982	DBLP DOI BibTeX RDF	VLSI artwork analysis, Augmented segment trees, dual range queries, inverse range queries, multilayered segment trees, point enclosure queries, S-trees, databases, segment trees
33	Paolo Penna, Carmine Ventre	Energy-efficient broadcasting in ad-hoc networks: combining MSTs with shortest-path trees.	PE-WASUN	2004	DBLP DOI BibTeX RDF	light approximate shortest-path trees, wireless ad hoc networks, energy consumption, multicast trees
33	Kazuhiko Kato	Persistently Cached B-Trees.	IEEE Trans. Knowl. Data Eng.	2003	DBLP DOI BibTeX RDF	B^+-trees, secondary storage management, persistent caching, replication, database management system, B-trees, complex objects, indexing structure
33	Hussein A. Abbass, Michael Towsey, Gerard D. Finn	C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees.	Knowl. Inf. Syst.	2001	DBLP DOI BibTeX RDF	C5, Multivariate decision trees, Univariate decision trees, Neural networks
33	Yuan Gao, Ye Ge, Jennifer C. Hou	RMCM: Reliable Multicasts for Core-based Multicast Trees.	ICNP	2000	DBLP DOI BibTeX RDF	core-based multicast trees, RMCM, multicast applications, on-tree router, core-based tree, retransmission request, optimal recovery, turning point approach, IP options, group membership changes, repliers, delayed ACK approach, repair-based reliable multicast, NAK implosion control, recovery latency, recovery isolation, FreeBSD 2.2.8, Internet, Internet, transport protocols, packet switching, network topology, digital simulation, trees (mathematics), telecommunication network routing, multicast communication, reliable multicasts, event-driven simulation, topology changes, local recovery, data packets, hosts
33	Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel	Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract).	Euro-Par	1997	DBLP DOI BibTeX RDF	Concurrent insertions and deletions, Concurrent generalized rotations, Safety and liveness proofs, Search trees, AVL trees, Concurrent algorithms
33	Fabrizio Petrini, Marco Vanneschi	k -ary n -trees: High Performance Networks for Massively Parallel Architectures.	IPPS	1997	DBLP DOI BibTeX RDF	k-ary n-trees, flowcontrol, congestion-free patterns, routing, Interconnection networks, virtual channels, fat-trees
33	Renzo Sprugnoli	The Generation of Binary Trees as a Numerical Problem.	J. ACM	1992	DBLP DOI BibTeX RDF	generation of binary trees, binary trees
33	Ig-hoon Lee, Junho Shim, Sang-goo Lee, Jonghoon Chun	CST-Trees: Cache Sensitive T-Trees.	DASFAA	2007	DBLP DOI BibTeX RDF
33	Alicja Wieczorkowska, Zbigniew W. Ras, Li-Shiang Tsay	Representing Audio Data by FS-Trees and Adaptable TV-Trees.	ISMIS	2003	DBLP DOI BibTeX RDF
32	Vincent Berry, François Nicolas	Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics
32	Michael Fuchs 0001, Hsien-Kuei Hwang, Ralph Neininger	Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees.	Algorithmica	2006	DBLP DOI BibTeX RDF
32	David M. Arnow, Aaron M. Tenenbaum	An Empirical Comparison of B-Trees, Compact B-Trees and Multiway Trees.	SIGMOD Conference	1984	DBLP DOI BibTeX RDF
32	Andreas Brandstädt, Van Bang Le, R. Sritharan	Structure and linear-time recognition of 4-leaf powers.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	squares of trees, trees, phylogenetic trees, leaf powers, Graph powers
32	Hanan Samet	Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing.	ACM Trans. Database Syst.	2004	DBLP DOI BibTeX RDF	BV-trees, PK-trees, space decomposition, R-trees, decoupling, Spatial indexing, object hierarchies
32	Tao Yang 0009, Apostolos Gerasoulis	DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors.	IEEE Trans. Parallel Distributed Syst.	1994	DBLP DOI BibTeX RDF	trees(mathematics), DSC, low-complexityheuristic, dominant sequence clustering algorithm, completely connected processor, unbounded number, nonzero communication overhead, arbitrary directedacyclic task graphs, special classes, coarse-grain trees, fine-grain trees, general scheduling algorithms, ETF, scheduling, performance, parallel algorithms, computational complexity, parallel programming, NP-complete, directed graphs, DAGs, join, optimal schedules, MD, fork, parallel task scheduling
32	Celine Vens, Jan Struyf, Leander Schietgat, Saso Dzeroski, Hendrik Blockeel	Decision trees for hierarchical multi-label classification.	Mach. Learn.	2008	DBLP DOI BibTeX RDF	Precision-recall analysis, Decision trees, Hierarchical classification, Multi-label classification, Functional genomics
32	Anna Kasprzik	A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness.	ICGI	2008	DBLP DOI BibTeX RDF	MAT learning, multi-dimensional trees, finite-state
32	Albert Bifet, Ricard Gavaldà	Mining adaptively frequent closed unlabeled rooted trees in data streams.	KDD	2008	DBLP DOI BibTeX RDF	closed mining, data streams, patterns, trees, concept drift
32	Joseph Cheriyan, Mohammad R. Salavatipour	Hardness and Approximation Results for Packing Steiner Trees.	Algorithmica	2006	DBLP DOI BibTeX RDF	Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems
32	Adrian Rusu, Radu Jianu, Confesor Santiago, Christopher Clement	An experimental study on algorithms for drawing binary trees.	APVIS	2006	DBLP DOI BibTeX RDF	drawing algorithm, binary trees, experimental study, planar, straight-line
32	Kirsten Winter	Formalising Behaviour Trees with CSP.	IFM	2004	DBLP DOI BibTeX RDF	Behaviour Trees, model checking, Requirements engineering, CSP
32	Wim Pijls, Arie de Bruin	Game Tree Algorithms and Solution Trees.	Computers and Games	1998	DBLP DOI BibTeX RDF	Game tree search, Minimax search, Solution trees, Alpha-beta, SSS*, MTD
32	Kim S. Larsen, Rolf Fagerberg	B-trees with relaxed balance.	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