Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Patricio V. Poblete"'
Autor:
Alfredo Viola, Patricio V. Poblete
Publikováno v:
Combinatorics, Probability and Computing. 28:600-617
Thirty years ago, the Robin Hood collision resolution strategy was introduced for open addressing hash tables, and a recurrence equation was found for the distribution of its search cost. Although this recurrence could not be solved analytically, it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d45b35ef4a3aacf051fa2d4b865b89f0
https://doi.org/10.1017/s0963548318000408
https://doi.org/10.1017/s0963548318000408
Publikováno v:
Revista Chilena de Derecho y Tecnología. 5
Este articulo proporciona una explicacion detallada sobre el procedimiento de arbitraje en linea para la resolucion de disputas de nombres de dominio punto cl. Asimismo, describe los antecedentes y las etapas hacia el desarrollo e implementacion del
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd94a994e5fbc6f2828dc18aeb5b4e00
https://doi.org/10.5354/0719-2584.2016.44090
https://doi.org/10.5354/0719-2584.2016.44090
Publikováno v:
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
Artículos CONICYT
CONICYT Chile
instacron:CONICYT
The Quickheap (QH) is a recent data structure for implementing priority queues which has proved to be simple and efficient in practice. It has also been shown to offer logarithmic expected amortized complexity for all of its operations. Yet, this com
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::961249bc54c360b143899df9fb87283a
https://doi.org/10.1142/s0129054111008507
https://doi.org/10.1142/s0129054111008507
Publikováno v:
Theoretical Computer Science. 352(1-3):136-158
To any sequence of real numbers 〈an〉 n ≥ 0, we can associate another sequence 〈âs〉s ≥ 0 which Knuth calls its binomial transform. This transform is defined through the rule âs = Bsan=Σn(-1)n(s n) an.We study the properties of this tran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9b68a6a801dc82323aacb5dea284a41
Autor:
Alfredo Viola, Patricio V. Poblete
Publikováno v:
Electronic Notes in Discrete Mathematics. 7:146-149
Abstract Deletions in open addressing hash tables are often handled by marking the cells as “deleted” instead of “empty”, because otherwise the search algorithm might fail to find some of the keys. The space used by deleted cells may be reuse
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6506300abe1de570ca0581467e2c601
https://doi.org/10.1016/s1571-0653(04)00246-x
https://doi.org/10.1016/s1571-0653(04)00246-x
Autor:
Patricio V. Poblete
Publikováno v:
Algorithmica. 29:227-237
Given a setS ofN distinct elements in random order and a pivotx ∈S, we study the problem of simultaneously finding the left and the right neighbors ofx, i.e.,L=max{u|u x}.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::74c0e065cb2014bc89990366ffb62539
https://doi.org/10.1007/bf02679620
https://doi.org/10.1007/bf02679620
Publikováno v:
Random Structures & Algorithms. 10:221-255
We present an analysis of the effect of the last-come-first-served heuristic on a linear probing hash table. We study the behavior of successful searches, assuming searches for all elements of the table are equally likely. It is known that the Robin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba44d9adddb2a66fb6576114a67c9e0f
https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<221::aid-rsa12>3.0.co
https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<221::aid-rsa12>3.0.co
Publikováno v:
Algorithmica. 22:490-515
This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models are considered, that of full tables and that of sparse tables with a fixed filling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ca469af5057ac51e307440bf0c3f782
https://doi.org/10.1007/pl00009236
https://doi.org/10.1007/pl00009236
Publikováno v:
SIAM Journal on Computing. 24:266-278
This paper addresses the fundamental problem of permuting the elements of an array of $n$ elements according to some given permutation. Our goal is to perform the permutation quickly using only a polylogarithmic number of bits of extra storage. The m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f9c4605f069fec0e32301d60d5a88db6
https://doi.org/10.1137/s0097539792238649
https://doi.org/10.1137/s0097539792238649
Publikováno v:
International Journal of Foundations of Computer Science. :1-10
We present a fourth-order fringe analysis for the expected behavior of 2–3 trees, which includes 97% of the elements in the tree. It is accomplished by exploiting the structure of the transition matrix. Our results improve a number of bounds, in pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::693ec817a26efb8dc8fddaaac0cfc0e3
https://doi.org/10.1142/s0129054195000020
https://doi.org/10.1142/s0129054195000020