( en | de | ru )

 

Disambiguation of "Melsted, Páll"

Author of the publication

copydeleteadd this publication to your clipboard
An Analysis of Random-Walk Cuckoo Hashing.

, , and . SIAM J. Comput., 40 (2): 291-308 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Páll Eggerz

Jóhann Páll Árnason

Aniko Pàll

Toby Melsted

Susanne Pall Tolna

 

Other publications of authors with the same name

Efficient counting of k-mers in DNA sequences using a Bloom Filter., and . BMC Bioinform., (2011)An Analysis of Random-Walk Cuckoo Hashing., , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 490-503. Springer, (2009)Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables., and . Random Struct. Algorithms, 41 (3): 334-364 (2012)Finding a maximum matching in a sparse random graph in O(n) expected time., , and . J. ACM, 57 (4): 24:1-24:27 (2010)Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables, and . CoRR, (2009)An Analysis of Random-Walk Cuckoo Hashing., , and . SIAM J. Comput., 40 (2): 291-308 (2011)Pseudoalignment for metagenomic read assignment., , , , and . Bioinform., 33 (14): 2082-2088 (2017)Average-Case Analyses of Vickrey Costs., , , and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 434-447. Springer, (2009)Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time., , and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 161-172. Springer, (2008)PageRank and the random surfer model, and . Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, page 1010--1018. Society for Industrial and Applied Mathematics, (2008)