Tango tree

Results: 85



#Item
1I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-eff

I/O-efficient Point Location using Persistent B-Trees Lars Arge, Andrew Danner, and Sha-Mayn Teh Department of Computer Science, Duke University We present an external planar point location data structure that is I/O-eff

Add to Reading List

Source URL: www.cs.swarthmore.edu

Language: English - Date: 2004-01-23 10:39:23
2Indexing Structures for ash based Solid State Drives SeungBum Jo1,3 , Vineet Pandey2,3 , and S. Srinivasa Rao1 1 School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea sb

Indexing Structures for ash based Solid State Drives SeungBum Jo1,3 , Vineet Pandey2,3 , and S. Srinivasa Rao1 1 School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea sb

Add to Reading List

Source URL: www.hipc.org

Language: English - Date: 2011-11-11 12:59:22
3An 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
4An Optimal Ancestry Scheme and Small Universal Posets  ∗ Pierre Fraigniaud

An Optimal Ancestry Scheme and Small Universal Posets ∗ Pierre Fraigniaud

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-04-12 08:36:10
5Delays Induce an Exponential Memory Gap for Rendezvous in Trees ∗ Pierre Fraigniaud

Delays Induce an Exponential Memory Gap for Rendezvous in Trees ∗ Pierre Fraigniaud

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-04-12 08:39:01
6An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email:

An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email:

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2013-02-11 10:36:14
7Compact Ancestry Labeling Schemes for XML Trees∗ Pierre Fraigniaud† Abstract An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by

Compact Ancestry Labeling Schemes for XML Trees∗ Pierre Fraigniaud† Abstract An ancestry labeling scheme labels the nodes of any tree in such a way that ancestry queries between any two nodes can be answered just by

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-02-08 08:23:33
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
9Distributed Computing with Advice: Information Sensitivity of Graph Coloring Pierre Fraigniaud1 , Cyril Gavoille2 , David Ilcinkas3⋆ , and Andrzej Pelc3⋆⋆ 1  CNRS and University Paris 7

Distributed Computing with Advice: Information Sensitivity of Graph Coloring Pierre Fraigniaud1 , Cyril Gavoille2 , David Ilcinkas3⋆ , and Andrzej Pelc3⋆⋆ 1 CNRS and University Paris 7

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2007-04-28 05:56:24
10Atomic snapshots in O(log3 n) steps using randomized helping James Aspnes∗ Keren Censor-Hillel†

Atomic snapshots in O(log3 n) steps using randomized helping James Aspnes∗ Keren Censor-Hillel†

Add to Reading List

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

Language: English - Date: 2015-04-30 10:33:59