Appendix: Indexing the binary voting trees under amendment agendas 29th November 2013 This is an appendix to Lehtinen (forthcoming): “Strategic voting and the degree of path-dependence”, Group Decision and Negotiatio

Source URL: www.helsinki.fi

Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees Dimitrios Siakavaras, Konstantinos Nikas, Georgios Goumas and Nectarios Koziris National Technical University of Athens School of Electrica

Source URL: transact2017.cse.lehigh.edu

Combining HTM and RCU to Implement Highly Efficient Balanced Binary Search Trees Dimitrios Siakavaras, Konstantinos Nikas, Georgios Goumas and Nectarios Koziris National Technical University of Athens (NTUA) School of El

Source URL: transact2017.cse.lehigh.edu

S AARLAND U NIVERSITY Binary Search Trees, Rectangles and Patterns László KOZMA

Source URL: scidok.sulb.uni-saarland.de

Programming Techniques S.L. Graham, R.L. Rivest Editors

Source URL: bioinfo.ict.ac.cn

• Abstract data types
• Mathematics
• Software engineering
• Computer programming
• Analysis of algorithms
• Asymptotic analysis
• Binary trees
• Binomial heap
• Priority queue
• Minimum spanning tree
• Big O notation
• Heap

Exercise 10: Exercising in style Task 1: Very exclusive! a) Give a solution to mutual exclusion using a fetch-and-add register. b) Give a solution to mutual exclusion using a compare-and-swap register. c) Give a solution

Source URL: resources.mpi-inf.mpg.de

• Edsger W. Dijkstra
• Concurrency control
• Mutual exclusion
• Binary trees

´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1

Source URL: webee.technion.ac.il

• Graph theory
• Binary trees
• Computer programming
• Software engineering
• Tree traversal
• Linked list
• B-tree
• T-tree
• Trie
• Tree
• Redblack tree

Design and Scalability of NLS, a Scalable Naming and Location Service Y. Charlie Hu, Daniel A. Rodney and Peter Druschel Computer Science Department Rice University Houston, TX 77005 , , d

Source URL: www.cs.rice.edu

• Computing
• Computer programming
• Graph theory
• Domain name system
• B-tree
• Internet Standards
• Internet protocols
• Binary trees
• Node
• Name server
• Tree
• Lowest common ancestor

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

Source URL: bioinfo.ict.ac.cn

• Mathematics
• Geometry
• Computer science
• Search algorithms
• Discrete geometry
• Computational geometry
• Mathematical optimization
• Closest pair of points problem
• Nearest neighbor search
• Nearest neighbor graph
• K-nearest neighbors algorithm
• Euclidean minimum spanning tree

Novel tree edit operations for RNA secondary structure comparison Julien Allali1 and Marie-France Sagot2 1 Institut Gaspard-Monge, Universit´e de Marne-la-Vall´ee, Cit´e Descartes, Champs-sur-Marne, 77454

Source URL: pbil.univ-lyon1.fr

• Graph theory
• Binary trees
• Biology
• Computing
• Knowledge representation
• Tree
• T-tree
• B-tree
• Dynamic programming
• RNA
• Tree alignment
• Redblack tree