ICALP
2009
Springer
15 years 4 days ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
Abstract. In experimental psychology, the method of paired comparisons was proposed as a means for ranking preferences amongst n elements of a human subject. The method requires pe...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
We study the cover time of multiple random walks. Given a graph G of n vertices, assume that k independent random walks start from the same vertex. The parameter of interest is the...
ICALP
2009
Springer
15 years 4 days ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...