19 search results - page 2 / 4 » stacs 1999 |
STACS
1999
Springer
13 years 9 months ago
1999
Springer
We present an optimal strategy for searching for a goal in a street which achieves the competitive factor of √ 2, thus matching the best lower bound known before. This finally ...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
We show that the marked version of the Post Correspondence Problem, where the words on a list are required to di er in the rst letter, is decidable. On the other hand, PCP remains ...
SSDBM
1999
IEEE
13 years 9 months ago
1999
IEEE
In many scientific domains, experimental devices or simulation programs generate large volumes of data. The volumes of data may reach hundreds of terabytes and therefore it is imp...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
This paper presents a completeness result for a first-order interval temporal logic, called Neighbourhood Logic (NL) which has two neighbourhood modalities. NL can support the spe...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...