2492 search results - page 59 / 499 » On the General Signature Trees |
SIGCSE
2005
ACM
14 years 1 months ago
2005
ACM
Red-black trees and leftist heaps are classic data structures that are commonly taught in Data Structures (CS2) and/or Algorithms (CS7) courses. This paper describes alternatives ...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
ISSTA
2009
ACM
14 years 2 months ago
2009
ACM
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
MLQ
2008
13 years 7 months ago
2008
We work out the details of a schema for a mixed support forcing iteration, which generalizes the Mitchell model [7] with no Aronszajn trees on 2. The main purpose of this paper is ...
WG
2005
Springer
14 years 1 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...