Páll Melsted

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2012
j5		Alan M. Frieze, Páll Melsted: Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables. Random Struct. Algorithms 41(3): 334-364 (2012)
	2011
j4		Páll Melsted, Jonathan K. Pritchard: Efficient counting of k-mers in DNA sequences using a Bloom Filter. BMC Bioinformatics 12: 333 (2011)
j3		Alan M. Frieze, Páll Melsted: Randomly coloring simple hypergraphs. Inf. Process. Lett. 111(17): 848-853 (2011)
j2		Alan M. Frieze, Páll Melsted, Michael Mitzenmacher: An Analysis of Random-Walk Cuckoo Hashing. SIAM J. Comput. 40(2): 291-308 (2011)
	2010
j1		Prasad Chebolu, Alan M. Frieze, Páll Melsted: Finding a maximum matching in a sparse random graph in O(n) expected time. J. ACM 57(4) (2010)
	2009
c4		Prasad Chebolu, Alan M. Frieze, Páll Melsted, Gregory B. Sorkin: Average-Case Analyses of Vickrey Costs. APPROX-RANDOM 2009: 434-447
c3		Alan M. Frieze, Páll Melsted, Michael Mitzenmacher: An Analysis of Random-Walk Cuckoo Hashing. APPROX-RANDOM 2009: 490-503
i2		Alan M. Frieze, Páll Melsted: Randomly colouring simple hypergraphs. CoRR abs/0901.3699 (2009)
i1		Alan M. Frieze, Páll Melsted: Maximum Matchings in Random Bipartite Graphs and the Space Utilization of Cuckoo Hashtables. CoRR abs/0910.5535 (2009)
	2008
c2		Prasad Chebolu, Alan M. Frieze, Páll Melsted: Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time. ICALP (1) 2008: 161-172
c1		Prasad Chebolu, Páll Melsted: PageRank and the random surfer model. SODA 2008: 1010-1018

Coauthor Index

Last update Mon May 20 00:45:38 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page