default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPáll Melsted
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Pétur Helgi Einarsson
, Páll Melsted:
BUSZ: compressed BUS files. Bioinform. 39(5) (2023)- 2020
- [j13]Kristjan Jonasson, Sven Sigurdsson, Hordur Freyr Yngvason, Petur Orri Ragnarsson, Páll Melsted:
Algorithm 1005: Fortran Subroutines for Reverse Mode Algorithmic Differentiation of BLAS Matrix Operations. ACM Trans. Math. Softw. 46(1): 9:1-9:20 (2020)
2010 – 2019
- 2019
- [j12]Páll Melsted, Vasilis Ntranos, Lior Pachter:
The barcode, UMI, set format and BUStools. Bioinform. 35(21): 4472-4473 (2019) - 2017
- [j11]Lorian Schaeffer, Harold Pimentel, Nicolas Bray, Páll Melsted, Lior Pachter:
Pseudoalignment for metagenomic read assignment. Bioinform. 33(14): 2082-2088 (2017) - 2016
- [j10]Arna Óskarsdóttir, Gísli Másson, Páll Melsted:
BamHash: a checksum program for verifying the integrity of sequence data. Bioinform. 32(1): 140-141 (2016) - [j9]Birte Kehr, Páll Melsted, Bjarni V. Halldórsson:
PopIns: population-scale detection of novel sequence insertions. Bioinform. 32(7): 961-967 (2016) - [j8]Birte Kehr, Páll Melsted:
chopBAI: BAM index reduction solves I/O bottlenecks in the joint analysis of large sequencing cohorts. Bioinform. 32(14): 2202-2204 (2016) - [j7]Harold Pimentel, Pascal Sturmfels, Nicolas Bray, Páll Melsted, Lior Pachter:
The Lair: a resource for exploratory analysis of published RNA-Seq data. BMC Bioinform. 17: 490:1-490:6 (2016) - 2015
- [i3]Nicolas Bray, Harold Pimentel, Páll Melsted, Lior Pachter:
Near-optimal RNA-Seq quantification. CoRR abs/1505.02710 (2015) - 2014
- [j6]Páll Melsted, Bjarni V. Halldórsson:
KmerStream: streaming algorithms for k-mer abundance estimation. Bioinform. 30(24): 3541-3547 (2014) - 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 Bioinform. 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): 24:1-24:27 (2010)
2000 – 2009
- 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-29 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
