115 search results - page 6 / 23 » The Complexity of List Ranking of Trees |
NAR
2007
14 years 9 months ago
2007
g:Profiler (http://biit.cs.ut.ee/gprofiler/) is a public web server for characterising and manipulating gene lists resulting from mining high-throughput genomic data. g:Profiler h...
NAACL
2010
14 years 8 months ago
2010
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
112
click to vote
PODC
2010
ACM
15 years 1 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
IJFCS
2007
14 years 10 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
178
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...