828 search results - page 141 / 166 » Bounded Hairpin Completion |
APPROX
2006
Springer
14 years 1 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...
DNA
2006
Springer
14 years 1 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
FM
2008
Springer
13 years 11 months ago
2008
Springer
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
DBSEC
2010
13 years 11 months ago
2010
Private retrieval of public data is useful when a client wants to query a public data service without revealing the specific query data to the server. Computational Private Informa...
DAGSTUHL
2006
13 years 11 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...