Páll Melsted

From MaRDI portal
(Redirected from Páll Melsted)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Algorithm 1005: Fortran subroutines for reverse mode algorithmic differentiation of BLAS matrix operations
ACM Transactions on Mathematical Software
2020-11-10Paper
Randomly coloring simple hypergraphs
Information Processing Letters
2013-04-04Paper
Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
Random Structures & Algorithms
2012-10-31Paper
An analysis of random-walk cuckoo hashing
SIAM Journal on Computing
2011-07-29Paper
scientific article; zbMATH DE number 5764831 (Why is no real title available?)2010-08-06Paper
Finding a maximum matching in a sparse random graph in <i>O</i> ( <i>n</i> ) expected time
Journal of the ACM
2010-07-14Paper
Average-Case Analyses of Vickrey Costs
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2009-10-28Paper
An Analysis of Random-Walk Cuckoo Hashing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2009-10-28Paper
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
Automata, Languages and Programming
2008-08-28Paper


Research outcomes over time


This page was built for person: Páll Melsted