Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/101520
dc.contributor | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
---|---|
dc.contributor | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
dc.contributor.author | Duch Brown, Amalia |
dc.contributor.author | Lau Laynes-Lozada, Gustavo Salvador |
dc.date | 2017 |
dc.identifier.citation | Duch, A., Lau, G. Partial match queries in relaxed K-dt trees. A: Workshop on Analytic Algorithmics and Combinatorics. "Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017". Barcelona: Society for Industrial and Applied Mathematics (SIAM), 2017, p. 131-138. |
dc.identifier.citation | 978-1-61197-477-5 |
dc.identifier.citation | 10.1137/1.9781611974775.13 |
dc.identifier.uri | http://hdl.handle.net/2117/101520 |
dc.language.iso | eng |
dc.publisher | Society for Industrial and Applied Mathematics (SIAM) |
dc.relation | http://dx.doi.org/10.1137/1.9781611974775.13 |
dc.relation | info:eu-repo/grantAgreement/ES/1PE/TIN2013-46181-C2-1-R |
dc.relation | info:eu-repo/grantAgreement/AGAUR/2014SGR1034 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject | Data structures (Computer science) |
dc.subject | Trees (Graph theory) |
dc.subject | Estructures de dades (Informàtica) |
dc.subject | Arbres (Teoria de grafs) |
dc.title | Partial match queries in relaxed K-dt trees |
dc.type | info:eu-repo/semantics/submittedVersion |
dc.type | info:eu-repo/semantics/conferenceObject |
dc.description.abstract | |
dc.description.abstract |