2713 search results - page 138 / 543 » Parameterized Tree Systems |
149
Voted
AMAST
2008
Springer
15 years 5 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
123
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
143
click to vote
OSDI
2008
ACM
16 years 3 months ago
2008
ACM
The console logs generated by an application contain messages that the application developers believed would be useful in debugging or monitoring the application. Despite the ubiq...
134
Voted
PODC
1990
ACM
15 years 7 months ago
1990
ACM
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
124
Voted
HASKELL
2009
ACM
15 years 10 months ago
2009
ACM
Data-type generic programming can be used to traverse and manipulate specific parts of large heterogeneously-typed tree structures, without the need for tedious boilerplate. Gene...