Splay tree

Results: 83



#Item
1Algorithms 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

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-08 10:53:22
2Advances in Applied Mathematics–430 www.elsevier.com/locate/yaama Counting consistent phylogenetic trees is #P-complete Magnus Bordewich a,∗ , Charles Semple b , John Talbot c

Advances in Applied Mathematics–430 www.elsevier.com/locate/yaama Counting consistent phylogenetic trees is #P-complete Magnus Bordewich a,∗ , Charles Semple b , John Talbot c

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2006-01-18 08:31:22
3Randomized Splay Trees: Theoretical and Experimental Results Susanne Albers∗ Marek Karpinski†

Randomized Splay Trees: Theoretical and Experimental Results Susanne Albers∗ Marek Karpinski†

Add to Reading List

Source URL: www14.in.tum.de

Language: English - Date: 2013-11-25 11:04:32
4

PDF Document

Add to Reading List

Source URL: www.hieratic.eu

Language: English
5Cryptanalysis of splay tree based encryption Jean-Philippe Aumasson Nagravision SA, Switzerland Abstract. We present a chosen-plaintext attack on KIST, a recently proposed encryption scheme based on splay trees. Our atta

Cryptanalysis of splay tree based encryption Jean-Philippe Aumasson Nagravision SA, Switzerland Abstract. We present a chosen-plaintext attack on KIST, a recently proposed encryption scheme based on splay trees. Our atta

Add to Reading List

Source URL: 131002.net

Language: English - Date: 2012-08-14 06:46:48
    6An Incremental Editor for Dynamic Hierarchical Drawing of Trees D. Workman, M. Bernard  S. Pothoven

    An Incremental Editor for Dynamic Hierarchical Drawing of Trees D. Workman, M. Bernard S. Pothoven

    Add to Reading List

    Source URL: pothoven.net

    Language: English - Date: 2014-01-03 11:10:35
    7

    PDF Document

    Add to Reading List

    Source URL: www.akira.ruc.dk

    Language: English - Date: 2004-04-01 07:04:40
    8Dynamic Task Allocation in Asynchronous Shared Memory Dan Alistarh∗ James Aspnes†  MIT

    Dynamic Task Allocation in Asynchronous Shared Memory Dan Alistarh∗ James Aspnes† MIT

    Add to Reading List

    Source URL: cs-www.cs.yale.edu

    Language: English - Date: 2015-04-30 10:34:00
    9CS 373: Combinatorial Algorithms, Spring 2001 Homework 2 (due Thu. Feb. 15, 2001 at 11:59 PM) Name: Net ID:

    CS 373: Combinatorial Algorithms, Spring 2001 Homework 2 (due Thu. Feb. 15, 2001 at 11:59 PM) Name: Net ID:

    Add to Reading List

    Source URL: web.engr.illinois.edu

    Language: English - Date: 2014-12-28 08:52:33
    10CS 373: Combinatorial Algorithms, Spring 1999 Midterm 1 (February 23, 1999) Name: Net ID:

    CS 373: Combinatorial Algorithms, Spring 1999 Midterm 1 (February 23, 1999) Name: Net ID:

    Add to Reading List

    Source URL: web.engr.illinois.edu

    Language: English - Date: 2014-12-28 08:54:11