Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Compact labeling scheme for ancestor queriesABITEBOUL, Serge ; ALSTRUP, Stephen ; KAPLAN, Haim ; MILO, Tova ; RAUHE, TheisSIAM Journal on Computing, 2006, Vol.35 (6), p.1295-1309 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Terminal coalgebras and free iterative theoriesAdámek, Jiřı´ ; Milius, StefanInformation and computation, 2006-07, Vol.204 (7), p.1139-1172 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Faster parameterized algorithms for minor containmentAdler, Isolde ; Dorn, Frederic ; Fomin, Fedor V. ; Sau, Ignasi ; Thilikos, Dimitrios M.Theoretical computer science, 2011-11, Vol.412 (50), p.7018-7028 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
Tight bounds for the performance of Longest In System on DAGsAdler, Micah ; Rosén, AdiJournal of algorithms, 2005-05, Vol.55 (2), p.101-112 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
Node-disjoint paths on the mesh and a new trade-off in VLSI layoutAGGARWAL, A ; KLEINBERG, J ; WILLIAMSON, D. PSIAM journal on computing, 2000, Vol.29 (4), p.1321-1333 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
The plurality problem with three colors and moreAigner, Martin ; De Marco, Gianluca ; Montangero, ManuelaTheoretical computer science, 2005-06, Vol.337 (1), p.319-330 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
FITTING TREE METRICS: HIERARCHICAL CLUSTERING AND PHYLOGENYAILON, Nir ; CHARIKAR, MosesSIAM journal on computing, 2011-01, Vol.40 (5), p.1275-1291 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
Fast estimation of diameter and shortest paths (without matrix multiplication)AINGWORTH, D ; CHEKURI, C ; INDYK, P ; MOTWANI, RSIAM journal on computing, 1999, Vol.28 (4), p.1167-1181 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Set systems: Order types, continuous nondeterministic deformations, and quasi-ordersAkama, YohjiTheoretical computer science, 2011-10, Vol.412 (45), p.6235-6251 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Exact algorithms for computing the tree edit distance between unordered treesAkutsu, Tatsuya ; Fukagawa, Daiji ; Takasu, Atsuhiro ; Tamura, TakeyukiTheoretical computer science, 2011-02, Vol.412 (4), p.352-364 [Periódico revisado por pares]Oxford: Elsevier B.VTexto completo disponível |