Skew heap - PDFSEARCH.IO - Document Search Engine

Skew heap
Results: 15

#	Item
1	Tight Bounds for Clock Synchronization [Extended Abstract] ∗ Christoph Lenzen Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:15:58 Electrical engineering Synchronization Clock signal Clock skew Computing Computer programming Clock synchronization Heap Flow network Distributed computing
2	Tight Bounds for Clock Synchronization [Extended Abstract] ∗ Christoph Lenzen Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:32 Electrical engineering Synchronization Clock signal Clock skew Computing Computer programming Clock synchronization Heap Flow network Distributed computing
3	Reconstructing Reticulate Evolution in Species – Theory and Practice Luay Nakhleh Tandy Warnow Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2004-07-27 17:52:12 Knowledge representation Binary trees Phylogenetic network Phylogenetics Tree Schedule Reticulation Bridge Skew heap Link/cut tree
4	JOURNAL OF COMPUTATIONAL BIOLOGY Volume 12, Number 6, 2005 © Mary Ann Liebert, Inc. Pp. 796–811 Reconstructing Reticulate Evolution in Species— Add to Reading List Source URL: www.cs.rice.edu Language: English - Date: 2008-02-12 09:02:55 Phylogenetic network Phylogenetics Reticulation Tree Schedule Reticulate evolution Skew heap
5	Functional Data Structures for Typed Racket Hari Prashanth K R Sam Tobin-Hochstadt Northeastern University Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2012-08-10 19:22:47 Software engineering Computer programming Pairing heap Double-ended queue Binomial heap Skew binomial heap Queue D-ary heap Heap Abstract data types Computing Priority queues
6	Automatic Fine-Grain Locking using Shape Properties Guy Golan-Gueta Nathan Bronson Alex Aiken Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-08-21 21:41:00 Data Computing Binary trees Databases Schedule Lock Linearizability Serializability Skew heap Transaction processing Data management Concurrency control
7	Functional Data Structures for Typed Racket Hari Prashanth K R Sam Tobin-Hochstadt Northeastern University Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2015-03-24 18:44:54 Software engineering Computer programming Pairing heap Double-ended queue Binomial heap Skew binomial heap Queue D-ary heap Heap Abstract data types Computing Priority queues
8	Chapter 5 Comparing trees This chapter describes the tree comparison measures available in COMPONENT, and the various ways you can compare trees using the program. Among the possible uses of tree comparison measures are: Add to Reading List Source URL: taxonomy.zoology.gla.ac.uk Language: English - Date: 2007-07-24 12:38:38 Tree rearrangement Unrooted binary tree Binary tree Tree R-tree B-tree Phylogenetic tree T-carrier Skew heap Graph theory Phylogenetics Data management
9	slide 1 gaius Binary trees a binary tree is a finite set of nodes which is either empty or consists of Add to Reading List Source URL: floppsie.comp.glam.ac.uk Language: English - Date: 2015-02-04 11:33:46 Computing B-tree Tree T-tree Binary search tree Skew heap Binary trees Graph theory Data management
10	Information Processing Letters ELSEVIER Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2004-06-23 16:50:39 Concurrency control Sorting algorithms Binary trees D-ary heap Priority queue B-tree Heap Lock Skew heap Graph theory Data management Computing