CORR
2010
Springer
13 years 4 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
: - In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider onli...
APAL
2007
13 years 4 months ago
2007
Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data structures. Catego...
ALGORITHMICA
2010
13 years 4 months ago
2010
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
FOCS
2008
IEEE
13 years 4 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...
SOFTVIS
2010
ACM
13 years 4 months ago
2010
ACM
Understanding the data structures in a program is crucial to understanding how the program works, or why it doesn't work. Inspecting the code that implements the data structu...
SIGCOMM
2010
ACM
13 years 4 months ago
2010
ACM
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
APLAS
2010
ACM
13 years 4 months ago
2010
ACM
Abstract. We propose a new method to verify that a higher-order, treeprocessing functional program conforms to an input/output specification. Our method reduces the verification pr...
HPCC
2010
Springer
13 years 5 months ago
2010
Springer
This paper presents an algorithm and a data structure for scalable dynamic synchronization in fine-grained parallelism. The algorithm supports the full generality of phasers with d...