9626 search results - page 1814 / 1926 » Invariant Based Programming |
139
click to vote
ICALP
2009
Springer
16 years 2 months 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...
107
click to vote
ICALP
2009
Springer
16 years 2 months 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...
103
click to vote
ICALP
2009
Springer
16 years 2 months 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...
131
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
218
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...