<--- Back to Details
First PageDocument Content
Combinatorics / Enumerative combinatorics / Self-balancing binary search tree / Binary search tree / Tree / B-tree / Catalan number / The Art of Computer Programming / Random permutation statistics / Binary trees / Mathematics / Computing
Date: 2005-04-08 09:13:55
Combinatorics
Enumerative combinatorics
Self-balancing binary search tree
Binary search tree
Tree
B-tree
Catalan number
The Art of Computer Programming
Random permutation statistics
Binary trees
Mathematics
Computing

THE SCIENTIFIC WORKS OF RAINER KEMP (1949–2004) PHILIPPE FLAJOLET, MARKUS NEBEL, AND HELMUT PRODINGER‡ Abstract. This short note presents a summary of the scientific contributions of Rainer Kemp (1949–2004) in the

Add to Reading List

Source URL: algo.inria.fr

Download Document from Source Website

File Size: 224,36 KB

Share Document on Facebook

Similar Documents

Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

Depth of a Random Binary Search Tree with Concurrent Insertions James Aspnes1 and Eric Ruppert2 Yale University, USA York University, Canada

DocID: 1uCBo - View Document

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

DocID: 1qXBI - View Document

Algorithms and Data Structures (WS15/16) Exercises for Units 14 and 15 Problem 1 Try to get some feel for the behavior of the splay tree data structure. Draw a binary search tree with 5-10 nodes, and work out a few splay

Algorithms and Data Structures (WS15/16) Exercises for Units 14 and 15 Problem 1 Try to get some feel for the behavior of the splay tree data structure. Draw a binary search tree with 5-10 nodes, and work out a few splay

DocID: 1qNaY - View Document

Historical index structure for reducing insertion and search cost in LBS

Historical index structure for reducing insertion and search cost in LBS

DocID: 1qEgC - View Document

Fast Concurrent AVL Trees Erik Henriksson December 16th, 2013 Fast Concurrent AVL Trees

Fast Concurrent AVL Trees Erik Henriksson December 16th, 2013 Fast Concurrent AVL Trees

DocID: 1qsSy - View Document