1396 search results - page 38 / 280 » Succinct Dynamic Data Structures |
186
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....
139
Voted
LICS
1997
IEEE
15 years 8 months ago
1997
IEEE
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
166
click to vote
APWEB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract With the growing importance of XML in data exchange, much research tends to provide a compact labeling scheme and a flexible query facility to extract data from dynamic XM...
157
click to vote
KBSE
2009
IEEE
15 years 11 months ago
2009
IEEE
—Automated debugging is becoming increasingly important as the size and complexity of software increases. This paper makes a case for using constraint-based data structure repair...
130
Voted
SODA
2004
ACM
15 years 6 months ago
2004
ACM
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...