Search results for "B-trees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
30	Jie Wu 0001, Eduardo B. Fernández, Yingquiu Luo	Embedding of binomial trees in hypercubes with link faults.	ICPP	1997	DBLP DOI BibTeX RDF	binomial trees embedding, variable roots, faulty links, n-level binomial tree, spanning binomial trees, fault tolerance property, reduction operations, binomial tree structure, performance, broadcasting, hypercubes, hypercube networks, n-cubes, link faults
30	Fengrong Ren, Hiroshi Tanaka, Noria Fukuda, Takashi Gojobori	Molecular evolutionary phylogenetic trees based on minimum description length principle.	HICSS (5)	1995	DBLP DOI BibTeX RDF	molecular evolutionary phylogenetic trees, minimum complexity phylogenetic tree, branch lengths, logarithmic likelihood, mitochondrial DNA sequences, complexity, trees (mathematics), inference mechanisms, DNA, genetics, biology computing, inductive inference, minimum description length principle, tree topology
30	Bruce A. Draper, Carla E. Brodley, Paul E. Utgoff	Goal-Directed Classification Using Linear Machine Decision Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	goal-directed classification, linear machine decision trees, feature-based classification, nonparametric classification, linear machine decision tree, multivariate decision tree induction, misclassification cost functions, image understanding systems, pattern recognition, computer vision, trees (mathematics), inference mechanisms, decision theory, learning systems, pixel classification, inference algorithms
29	Albrecht Zimmermann	Ensemble-Trees: Leveraging Ensemble Power Inside Decision Trees.	Discovery Science	2008	DBLP DOI BibTeX RDF
29	Yun Chi, Yirong Yang, Richard R. Muntz	HybridTreeMiner: An Efficient Algorithm for Mining Frequent Rooted Trees and Free Trees Using Canonical Form.	SSDBM	2004	DBLP DOI BibTeX RDF	tree iso-morphism, enumeration tree, rooted unordered tree, free tree, canonical form, frequent subtree
29	Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort	Box-Trees and R-Trees with Near-Optimal Query Time.	Discret. Comput. Geom.	2002	DBLP DOI BibTeX RDF
29	Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort	Box-trees and R-trees with near-optimal query time.	SCG	2001	DBLP DOI BibTeX RDF
29	Walter Cunto, Vicente Yriarte	GKD-Trees: Binary Trees that Combine Multi-dimensional Data Handling, Node Size and Fringe Reorganization.	SWAT	1992	DBLP DOI BibTeX RDF
29	Yangjun Chen	On the Signature Trees and Balanced Signature Trees.	ICDE	2005	DBLP DOI BibTeX RDF	Bit-slice files, S-trees, Signature trees, Information retrieval, Signature files
29	Rolf Klein, Derick Wood	On the Maximum Path Length of AVL Trees.	CAAP	1988	DBLP DOI BibTeX RDF	brother trees, comparison cost, node visit cost, AVL trees, path length
28	Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz	Resource Allocation in Bounded Degree Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF	Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation
28	Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhisa Ueda, Minoru Kanehisa, Hiroshi Mamitsuka	A new efficient probabilistic model for mining labeled ordered trees applied to glycobiology.	ACM Trans. Knowl. Discov. Data	2008	DBLP DOI BibTeX RDF	labeled ordered trees, probabilistic models, maximum likelihood, Expectation-maximization
28	Luc Maranget	Compiling pattern matching to good decision trees.	ML	2008	DBLP DOI BibTeX RDF	match compilers, heuristics, decision trees
28	Raphaël Kummer, Peter G. Kropf, Pascal Felber	Building multicast trees in ad-hoc networks.	Autonomics	2008	DBLP DOI BibTeX RDF	mobile ad-hoc computing, wireless networks protocol, MANETs, mobile networking, ad-hoc wireless networks, multicast trees
28	Sagi Snir, Satish Rao	Using Max Cut to Enhance Rooted Trees Consistency.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	rooted triplets, semidefinite programming, Phylogenetic trees, supertrees
28	Thomas C. Schmidt, Matthias Wählisch	Morphing distribution trees - On the evolution of multicast states under mobility and an adaptive routing scheme for mobile SSM sources.	Telecommun. Syst.	2006	DBLP DOI BibTeX RDF	Mobile source specific m ulticast, IPv6 mobility management, Internet measurement, Shortest path trees, Multicast routing protocols
28	Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan 0001	Automatic linear orders and trees.	ACM Trans. Comput. Log.	2005	DBLP DOI BibTeX RDF	Automatic structures, trees, linear orders
28	Denis Bertrand, Olivier Gascuel	Topological Rearrangements and Local Search Method for Tandem Duplication Trees.	IEEE ACM Trans. Comput. Biol. Bioinform.	2005	DBLP DOI BibTeX RDF	Tandem duplication trees, topological rearrangements, minimum evolution, Zinc finger genes, local search, phylogeny, parsimony
28	Gad M. Landau, Laxmi Parida, Oren Weimann	Using PQ Trees for Comparative Genomics.	CPM	2005	DBLP DOI BibTeX RDF	permutation patterns, PQ trees, whole genome analysis, evolutionary analysis, data mining, clusters, patterns, Pattern discovery, comparative genomics, motifs
28	Lars Grunske, Peter A. Lindsay, Nisansala Yatapanage, Kirsten Winter	An Automated Failure Mode and Effect Analysis Based on High-Level Design Specification with Behavior Trees.	IFM	2005	DBLP DOI BibTeX RDF	Automated Hazard Analysis, High-Level Design Specification, Model Checking, FMEA, SAL, Behavior Trees
28	Sjouke Mauw, Martijn Oostdijk	Foundations of Attack Trees.	ICISC	2005	DBLP DOI BibTeX RDF	semantics, attack trees, threat analysis
28	João Gama 0001	Functional Trees.	Mach. Learn.	2004	DBLP DOI BibTeX RDF	multivariate decision trees, supervised learning, multiple models
28	Jean G. Vaucher	Building Optimal Binary Search Trees from Sorted Values in O(N) Time.	Essays in Memory of Ole-Johan Dahl	2004	DBLP DOI BibTeX RDF	data structures, binary search tree, balanced trees
28	Basilis Boutsinas, Ioannis X. Tsekouronas	Splitting Data in Decision Trees Using the New False-Positives Criterion.	SETN	2004	DBLP DOI BibTeX RDF	data mining, machine learning, decision trees
28	Avrim Blum, Shuchi Chawla 0001, Adam Kalai	Static Optimality and Dynamic Search-Optimality in Lists and Trees.	Algorithmica	2003	DBLP DOI BibTeX RDF	Adaptive data structures, Experts Analysis, Competitive Analysis, Binary search trees
28	Sandro Morasca	A proposal for using continuous attributes in classification trees.	SEKE	2002	DBLP DOI BibTeX RDF	decision trees, C4.5, ID3, continuous attributes
28	Marina Guetova, Steffen Hölldobler, Hans-Peter Störr	Incremental Fuzzy Decision Trees.	KI	2002	DBLP DOI BibTeX RDF	classification, fuzzy logic, decision trees, incremental learning
28	João Gama 0001	Functional Trees.	Discovery Science	2001	DBLP DOI BibTeX RDF	Decision Trees, Multiple Models, Supervised Machine Learning
28	Bhaskar DasGupta, Xin He, Tao Jiang 0001, Ming Li 0001, John Tromp	On the Linear-Cost Subtree-Transfer Distance between Phylogenetic Trees.	Algorithmica	1999	DBLP DOI BibTeX RDF	Approximation algorithms, Lower bounds, Evolutionary trees
28	Christian Icking, Rolf Klein, Thomas Ottmann	Priority Search Trees in Secondary Memory (Extended Abstract).	WG	1987	DBLP DOI BibTeX RDF	priority search tree, B-tree, search trees, red-black tree, secondary memory
27	Kemal Efe, Antonio Fernández 0001	Mesh-Connected Trees: A Bridge Between Grids and Meshes of Trees.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	parallel algorithms, grids, interconnection networks, Parallel architectures, hypercubes, binary tree, graph embedding, product networks, mesh of trees
27	Sreenivas Gollapudi, Rina Panigrahy	The power of two min-hashes for similarity search among hierarchical data objects.	PODS	2008	DBLP DOI BibTeX RDF	earth movers distance, similarity, locality sensitive hashing
27	Christian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Andreas Hofmeier, Marco Matzeder, Thomas Unfried	Tree Drawings on the Hexagonal Grid.	GD	2008	DBLP DOI BibTeX RDF
27	Satoshi Morinaga, Hiroki Arimura, Takahiro Ikeda, Yosuke Sakao, Susumu Akamine	Key semantics extraction by dependency tree mining.	KDD	2005	DBLP DOI BibTeX RDF	phrase/sentence reconstruction, redundancy reduction, syntactic dependency, tree enumeration, text mining
27	Yasser El-Sonbaty, Amgad Neematallah	Multiway Decision Tree Induction Using Projection and Merging (MPEG).	ICTAI	2005	DBLP DOI BibTeX RDF
27	Martha J. Kosa, Mark A. Boshart	Treemap visualizations for CS2.	ITiCSE	2004	DBLP DOI BibTeX RDF
27	Paolo Ferragina, Roberto Grossi	The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.	J. ACM	1999	DBLP DOI BibTeX RDF	Patricia trie, prefix and range search, string searching and sorting, text index, suffix tree, B-tree, suffix array, external-memory data structure
27	Jia-Wei Hong, Kurt Mehlhorn, Arnold L. Rosenberg	Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version).	ICALP	1981	DBLP DOI BibTeX RDF
27	Qiangfu Zhao	Learning with Data Streams - An NNTree Based Approach.	EUC Workshops	2005	DBLP DOI BibTeX RDF	neural network trees, plasticity-stability dilemma, neural networks, Machine learning, decision trees, on-line learning
27	Robert J. Carragher, Masahiro Fujita, Chung-Kuan Cheng	Simple tree-construction heuristics for the fanout problem .	ICCD	1995	DBLP DOI BibTeX RDF	tree-construction heuristics, fanout problem, fanout delay, buffer fanout trees, technology mapped network, gate-transformation, LT-tree construction technique, delays, combinational circuits, trees (mathematics), critical paths, logical functions
27	Hermann Kaindl, Reza Shams, Helmut Horacek	Minimax Search Algorithms With and Without Aspiration Windows.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	minimax search algorithms, aspiration windows, exact minimax values, backward pruning, linear space complexity, alpha-beta search, computational complexity, game theory, trees (mathematics), search problems, uniform distribution, minimax techniques, game trees
27	Xiao-Jia M. Zhou, Tharam S. Dillon	A Statistical-Heuristic Feature Selection Criterion for Decision Tree Induction.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	statistical-heuristic feature selection criterion, multibranching decision trees, built-in statistical test, proportional-reduction-in-error, cost-of-complexity heuristic, middle-cut preference, tau criterion, prepruning, dynamic error estimation, pattern recognition, pattern recognition, robustness, statistics, trees (mathematics), decision theory, Bayes methods, Bayesian classifier, decision tree induction
27	Saul B. Gelfand, C. S. Ravishankar, Edward J. Delp	An Iterative Growing and Pruning Algorithm for Classification Tree Design.	IEEE Trans. Pattern Anal. Mach. Intell.	1991	DBLP DOI BibTeX RDF	pruning algorithm, classification tree design, right-sized trees, terminal nodes, waveform recognition problem, pattern recognition, pattern recognition, iterative method, iterative methods, trees (mathematics), Bayes methods, Bayes methods, estimation theory, estimation theory, stopping rules
27	Ashkan Aazami, Joseph Cheriyan, Krishnam Raju Jampani	Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
27	Raimar Falke, Pierre Frenzel, Rainer Koschke	Empirical evaluation of clone detection using syntax suffix trees.	Empir. Softw. Eng.	2008	DBLP DOI BibTeX RDF	Software clone detection, Software maintenance, Program analysis, Redundancy, Software evolution, Duplication
27	Tingting Zhou, Keith C. C. Chan, Zhenghua Wang	TopEVM: Using Co-occurrence and Topology Patterns of Enzymes in Metabolic Networks to Construct Phylogenetic Trees.	PRIB	2008	DBLP DOI BibTeX RDF	TopEVM, co-occurrence pattern, topology pattern, degree centrality, evolutionary distance, document clustering, metabolic network, phylogenetic analysis
27	Pierre Fraigniaud, Andrzej Pelc	Deterministic Rendezvous in Trees with Little Memory.	DISC	2008	DBLP DOI BibTeX RDF
27	Kayhan Erciyes, Deniz Ozsoyeller, Orhan Dagdeviren	Distributed Algorithms to Form Cluster Based Spanning Trees in Wireless Sensor Networks.	ICCS (1)	2008	DBLP DOI BibTeX RDF	clustering, wireless sensor networks, synchronizers, spanning tree
27	Angelo Montanari, Gabriele Puppis	A Contraction Method to Decide MSO Theories of Deterministic Trees.	LICS	2007	DBLP DOI BibTeX RDF
27	José L. Balcázar, Albert Bifet, Antoni Lozano	Mining Frequent Closed Unordered Trees Through Natural Representations.	ICCS	2007	DBLP DOI BibTeX RDF
27	Fabrizio Frati	Straight-Line Orthogonal Drawings of Binary and Ternary Trees.	GD	2007	DBLP DOI BibTeX RDF
27	Zohar Manna, Henny B. Sipma, Ting Zhang 0001	Verifying Balanced Trees.	LFCS	2007	DBLP DOI BibTeX RDF
27	Jan Struyf, Saso Dzeroski	Clustering Trees with Instance Level Constraints.	ECML	2007	DBLP DOI BibTeX RDF
27	Daria Sorokina, Rich Caruana, Mirek Riedewald	Additive Groves of Regression Trees.	ECML	2007	DBLP DOI BibTeX RDF
27	Neil Ghani, Alexander Kurz 0001	Higher Dimensional Trees, Algebraically.	CALCO	2007	DBLP DOI BibTeX RDF
27	Bernhard Pfahringer, Geoffrey Holmes 0001, Richard Kirkby	New Options for Hoeffding Trees.	Australian Conference on Artificial Intelligence	2007	DBLP DOI BibTeX RDF
27	Nicolas Broutin, Luc Devroye	Large Deviations for the Weighted Height of an Extended Class of Trees.	Algorithmica	2006	DBLP DOI BibTeX RDF
27	Jesús M. Pérez, Javier Muguerza, Olatz Arbelaitz, Ibai Gurrutxaga, José Ignacio Martín	Consolidated Trees: An Analysis of Structural Convergence.	Selected Papers from AusDM	2006	DBLP DOI BibTeX RDF
27	Shunsuke Inenaga, Masayuki Takeda	On-Line Linear-Time Construction of Word Suffix Trees.	CPM	2006	DBLP DOI BibTeX RDF
27	Witold Pedrycz, Zenon A. Sosnowski	C-fuzzy decision trees.	IEEE Trans. Syst. Man Cybern. Part C	2005	DBLP DOI BibTeX RDF
27	Tran Khanh Dang	Privacy-Preserving Basic Operations on Outsourced Search Trees.	ICDE Workshops	2005	DBLP DOI BibTeX RDF
27	Amitabh Chaudhary, Michael T. Goodrich	Balanced Aspect Ratio Trees Revisited.	WADS	2005	DBLP DOI BibTeX RDF
27	Marcus A. C. Farias, Carlos Eduardo Scheidegger, João Luiz Dihl Comba, Luiz Velho 0001	Boolean Operations on Surfel-Bounded Objects Using Constrained BSP-Trees.	SIBGRAPI	2005	DBLP DOI BibTeX RDF
27	Pedro Javier García, José Flich, José Duato, Ian Johnson, Francisco J. Quiles 0001, Finbar Naven	Dynamic Evolution of Congestion Trees: Analysis and Impact on Switch Architecture.	HiPEAC	2005	DBLP DOI BibTeX RDF
27	Tanya Y. Berger-Wolf	Online Consensus and Agreement of Phylogenetic Trees.	WABI	2004	DBLP DOI BibTeX RDF
27	Yun Chi, Yirong Yang, Richard R. Muntz	Indexing and Mining Free Trees.	ICDM	2003	DBLP DOI BibTeX RDF
27	Myungsun Park, Sukho Lee	Optimizing Both Cache and Disk Performance of R-Trees.	DEXA	2003	DBLP DOI BibTeX RDF
27	Michelangelo Ceci, Annalisa Appice, Donato Malerba	Simplification Methods for Model Trees with Regression and Splitting Nodes.	MLDM	2003	DBLP DOI BibTeX RDF
27	Jayme Luiz Szwarcfiter	Optimal Binary Search Trees with Costs Depending on the Access Paths.	CIAC	2003	DBLP DOI BibTeX RDF
27	Barbara R. Holland, Vincent Moulton	Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees.	WABI	2003	DBLP DOI BibTeX RDF
27	Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N. S. Pedersen, S. Srinivasa Rao 0001	Computing Refined Buneman Trees in Cubic Time.	WABI	2003	DBLP DOI BibTeX RDF
27	Dennis E. Shasha, Jason Tsong-Li Wang, Huiyuan Shan, Kaizhong Zhang	ATreeGrep: Approximate Searching in Unordered Trees.	SSDBM	2002	DBLP DOI BibTeX RDF
27	Hirendu Vaishnav, Massoud Pedram	Alphabetic trees-theory and applications in layout-driven logicsynthesis.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2001	DBLP DOI BibTeX RDF
27	B. John Oommen, R. K. S. Loke	On the Pattern Recognition of Noisy Subsequence Trees.	IEEE Trans. Pattern Anal. Mach. Intell.	2001	DBLP DOI BibTeX RDF
27	Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela	Context Trees.	IJCAR	2001	DBLP DOI BibTeX RDF
27	Daniel Zappala, Aaron Fabbri	An Evaluation of Shared Multicast Trees with Multiple Active Cores.	ICN (1)	2001	DBLP DOI BibTeX RDF
27	Donato Malerba, Annalisa Appice, Antonia Bellino, Michelangelo Ceci, Domenico Pallotta	Stepwise Induction of Model Trees.	AI*IA	2001	DBLP DOI BibTeX RDF
27	Chin Lung Lu, Zheng-Yao Su, Chuan Yi Tang	A New Measure of Edit Distance between Labeled Trees.	COCOON	2001	DBLP DOI BibTeX RDF
27	Johannes Gehrke	Data Mining with Decision Trees.	ICDE	2000	DBLP DOI BibTeX RDF
27	Inga Sitzmann, Peter J. Stuckey	O-Trees: A Constraint-Based Index Structure.	Australasian Database Conference	2000	DBLP DOI BibTeX RDF
27	Richard M. Karp, Yanjun Zhang	On Parallel Evaluation of Game Trees.	J. ACM	1998	DBLP DOI BibTeX RDF	?-? pruning, AND/OR tree, parallel speedup
27	Xiao Zhou 0001, Takao Nishizeki	The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees.	ISAAC	1998	DBLP DOI BibTeX RDF
27	Michael Schmitt 0001	On the Sample Complexity for Neural Trees.	ALT	1998	DBLP DOI BibTeX RDF
27	Nir Shavit, Asaph Zemach	Diffracting Trees.	ACM Trans. Comput. Syst.	1996	DBLP DOI BibTeX RDF	index distribution, contention, wait free, lock free, counting networks
27	Damon Kaller	Definability Equals Recognizability of Partial 3-Trees.	WG	1996	DBLP DOI BibTeX RDF
27	Alf-Christian Achilles	Optimal Emulation of Meshes on Meshes of Trees.	Euro-Par	1995	DBLP DOI BibTeX RDF
27	Nir Shavit, Asaph Zemach	Diffracting Trees (Preliminary Version).	SPAA	1994	DBLP DOI BibTeX RDF
27	Anatoly P. Pinchuk, Konstantin V. Shvachko	Maintaining Dictionaries: Space-Saving Modifications of B-Trees.	ICDT	1992	DBLP DOI BibTeX RDF
27	Helen Cameron, Derick Wood	How Costly Can Red-Black Trees Be?	ICCI	1991	DBLP DOI BibTeX RDF
27	Renzo Sprugnoli, Elena Barcucci, Alessandra Chiuderi, Renzo Pinzani	On Some Properties of (a, b)-Trees.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF
27	Christos Levcopoulos, Andrzej Lingas, Jörg-Rüdiger Sack	Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract).	ICALP	1987	DBLP DOI BibTeX RDF
27	Hanan Samet, Markku Tamminen	Bintrees, CSG trees, and time.	SIGGRAPH	1985	DBLP DOI BibTeX RDF	bintrees, image processing, time, motion, conversion, solid modeling, quadtrees, octrees, constructive solid geometry (CSG), hierarchical data structures, interference detection
27	Arnold L. Rosenberg, Lawrence Snyder	Time- and Space-Optimality in B-Trees.	ACM Trans. Database Syst.	1981	DBLP DOI BibTeX RDF	2, 3-tree, bushy B-tree, compact B-tree, node-visit cost, B-tree, space utilization
27	Arnold L. Rosenberg, Lawrence Snyder	Compact B-Trees.	SIGMOD Conference	1979	DBLP DOI BibTeX RDF
26	Rajen B. Bhatt, M. Gopal	FRCT: fuzzy-rough classification trees.	Pattern Anal. Appl.	2008	DBLP DOI BibTeX RDF	Fuzzy-rough classification trees, Classification, Rough sets, Decision trees, Fuzzy sets, Fuzzy-rough sets
26	Christophe Marsala, Marcin Detyniecki	High scale video mining with forests of fuzzy decision trees.	CSTST	2008	DBLP DOI BibTeX RDF	forest of fuzzy decision trees, TRECVid, fuzzy decision trees, video mining
26	Stavroula Siachalou, Leonidas Georgiadis	Algorithms for precomputing constrained widest paths and multicast trees.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	bottleneck paths, widest paths, widest trees, graph theory, QoS routing, multicast trees, precomputation
26	Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, Sanjay Ranka	Parallel Construction of Multidimensional Binary Search Trees.	IEEE Trans. Parallel Distributed Syst.	2000	DBLP DOI BibTeX RDF	multidimensional binary search trees, parallel algorithms, parallel computers, hypercubes, meshes, k-d trees
26	Athanassios Papagelis, Dimitrios Kalles	GA Tree: genetically evolved decision trees.	ICTAI	2000	DBLP DOI BibTeX RDF	GA Tree, genetically evolved decision trees, classification decision tree evolution, standard discretized concept learning problems, C4 5, OneR, genetic algorithms, genetic algorithms, learning (artificial intelligence), decision trees, search problems, system performance
26	Conrado Martínez, Salvador Roura	Randomized Binary Search Trees.	J. ACM	1998	DBLP DOI BibTeX RDF	probabilistic algebraic specification, randomized data structures, self-organizing data structures, search trees, balanced trees