Busque entre los 168325 recursos disponibles en el repositorio
Mostrar el registro sencillo del ítem
dc.date.accessioned | 2012-11-20T13:03:43Z | |
dc.date.available | 2012-11-20T13:03:43Z | |
dc.date.issued | 2006-08 | |
dc.identifier.uri | http://sedici.unlp.edu.ar/handle/10915/24379 | |
dc.description.abstract | In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be shared by several words. We also show that two variants (generalizations) of the problem can be solved optimally in Θ (lgN) time under the comparison based model of computation. | en |
dc.language | en | es |
dc.subject | random access machine (RAM) | en |
dc.subject | Modeling | es |
dc.subject | Bounded-action devices (e.g., Turing machines, random access machines) | es |
dc.title | An O(1) solution to the prefix sum problem on a specialized memory architecture | es |
dc.type | Objeto de conferencia | es |
sedici.identifier.isbn | 0-387-34633-3 | es |
sedici.creator.person | Brodnik, Andrej | es |
sedici.creator.person | Karlsson, Johan | es |
sedici.creator.person | Munro, J. Ian | es |
sedici.creator.person | Nilsson, Andreas | es |
sedici.description.note | 4th IFIP International Conference on Theoretical Computer Science | es |
sedici.subject.materias | Ciencias Informáticas | es |
sedici.description.fulltext | true | es |
mods.originInfo.place | Red de Universidades con Carreras en Informática (RedUNCI) | es |
sedici.subtype | Objeto de conferencia | es |
sedici.rights.license | Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) | |
sedici.rights.uri | http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ | |
sedici.date.exposure | 2006-08 | |
sedici.relation.event | 19 th IFIP World Computer Congress - WCC 2006 | es |
sedici.description.peerReview | peer-review | es |