1![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 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](https://www.pdfsearch.io/img/de2bef77b4476c8d453b9b840f2bc184.jpg) | Add to Reading ListSource URL: www.cs.swarthmore.eduLanguage: English - Date: 2004-01-23 10:39:23
|
---|
2![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 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](https://www.pdfsearch.io/img/6f16fff8d16a3efe041ad80f7aa58cb7.jpg) | Add to Reading ListSource URL: www.hipc.orgLanguage: English - Date: 2011-11-11 12:59:22
|
---|
3![An 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](https://www.pdfsearch.io/img/4723f4c8514a8ce408d6d4c8f513ed7c.jpg) | Add to Reading ListSource URL: pothoven.netLanguage: English - Date: 2014-01-03 11:10:35
|
---|
4![An Optimal Ancestry Scheme and Small Universal Posets ∗ Pierre Fraigniaud An Optimal Ancestry Scheme and Small Universal Posets ∗ Pierre Fraigniaud](https://www.pdfsearch.io/img/99a6579eb4c7f1ec73645de2dd0dda85.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2010-04-12 08:36:10
|
---|
5![Delays Induce an Exponential Memory Gap for Rendezvous in Trees ∗ Pierre Fraigniaud Delays Induce an Exponential Memory Gap for Rendezvous in Trees ∗ Pierre Fraigniaud](https://www.pdfsearch.io/img/f1b0f688982a6e00485be3e9b88d96fb.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2010-04-12 08:39:01
|
---|
6![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: 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:](https://www.pdfsearch.io/img/8e46e13714bec46c33ab9f754f4a9103.jpg) | Add to Reading ListSource URL: www.mpi-sws.orgLanguage: English - Date: 2013-02-11 10:36:14
|
---|
7![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 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](https://www.pdfsearch.io/img/abc8935abcc4d2fb7a5586f6ca66f562.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2010-02-08 08:23:33
|
---|
8![Dynamic Task Allocation in Asynchronous Shared Memory Dan Alistarh∗ James Aspnes† MIT Dynamic Task Allocation in Asynchronous Shared Memory Dan Alistarh∗ James Aspnes† MIT](https://www.pdfsearch.io/img/53bf0d4f59ec81bdd214d06245092a60.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2015-04-30 10:34:00
|
---|
9![Distributed 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](https://www.pdfsearch.io/img/7046ec47db73723594d827fe9154878d.jpg) | Add to Reading ListSource URL: www.liafa.jussieu.frLanguage: English - Date: 2007-04-28 05:56:24
|
---|
10![Atomic 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†](https://www.pdfsearch.io/img/dbb7cde90732021266008acf0fa535ef.jpg) | Add to Reading ListSource URL: cs-www.cs.yale.eduLanguage: English - Date: 2015-04-30 10:33:59
|
---|