1![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 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](https://www.pdfsearch.io/img/863bc2b672484dbe79bea603ea2f9450.jpg) | Add to Reading ListSource URL: www.helsinki.fiLanguage: English - Date: 2013-12-04 06:40:48
|
---|
2![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 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](https://www.pdfsearch.io/img/c7b5cc5d72de2da6fccdef1b432d26f0.jpg) | Add to Reading ListSource URL: transact2017.cse.lehigh.edu- Date: 2017-02-05 14:51:38
|
---|
3![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 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](https://www.pdfsearch.io/img/cdc833ab33546c71c7e94b1ee5a03c41.jpg) | Add to Reading ListSource URL: transact2017.cse.lehigh.edu- Date: 2017-02-10 05:00:51
|
---|
4![S AARLAND U NIVERSITY Binary Search Trees, Rectangles and Patterns László KOZMA S AARLAND U NIVERSITY Binary Search Trees, Rectangles and Patterns László KOZMA](https://www.pdfsearch.io/img/c7ea9f6a55ca440ffd4912044ce3fa79.jpg) | Add to Reading ListSource URL: scidok.sulb.uni-saarland.de- Date: 2016-09-26 05:30:37
|
---|
5![Programming Techniques S.L. Graham, R.L. Rivest Editors Programming Techniques S.L. Graham, R.L. Rivest Editors](https://www.pdfsearch.io/img/b1911c2ce3bd0abbd506f7d4b7712ba6.jpg) | Add to Reading ListSource URL: bioinfo.ict.ac.cnLanguage: English - Date: 2014-11-28 11:05:21
|
---|
6![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 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](https://www.pdfsearch.io/img/3acfb2843a48cf8323a7ea3aba3e7d1f.jpg) | Add to Reading ListSource URL: resources.mpi-inf.mpg.deLanguage: English - Date: 2015-01-06 07:25:52
|
---|
7![´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1 ´ Scalable Task Pools with CAFE: Adjustable Fairness and Contention Dmitry Basin1 , Rui Fan2 , Idit Keidar1 , Ofer Kiselov1 , and Dmitri Perelman1? 1](https://www.pdfsearch.io/img/e24def9dc2b0dcb3540b7e2453d9a74f.jpg) | Add to Reading ListSource URL: webee.technion.ac.ilLanguage: English - Date: 2011-07-22 05:28:44
|
---|
8![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 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](https://www.pdfsearch.io/img/1c1f5604a665426768596f2049071b5c.jpg) | Add to Reading ListSource URL: www.cs.rice.eduLanguage: English - Date: 2001-06-26 00:43:24
|
---|
9![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](https://www.pdfsearch.io/img/8bd9a8adaf9d260bb751e4be44fe516e.jpg) | Add to Reading ListSource URL: bioinfo.ict.ac.cnLanguage: English - Date: 2014-11-28 11:05:21
|
---|
10![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 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](https://www.pdfsearch.io/img/4dc55b59fc2fcfc3e65ad715b8d5b43b.jpg) | Add to Reading ListSource URL: pbil.univ-lyon1.frLanguage: English - Date: 2008-10-22 02:35:19
|
---|