Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ulf Adams

dblp:220/9134 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 86% Programming languages and type systems · 14%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
floating-point conversion
0.722019
Ryū revisited: printf floating point conversion · Proc. ACM Program. Lang. 2019
Ryū: fast float-to-string conversion · PLDI 2018
Coding theory › finite fields › finite field arithmetic
basis conversion
0.412019
Ryū revisited: printf floating point conversion · Proc. ACM Program. Lang. 2019
Programming languages and type systems
language design
0.112019
Ryū revisited: printf floating point conversion · Proc. ACM Program. Lang. 2019

Methods — techniques the papers use, named apart from their topics

shortest decimal representation · 0.8ryu algorithm · 0.8fixed-size integer arithmetic · 0.3
YearPublicationVenuePosition
2019 Ryū revisited: printf floating point conversion
abstract
Ryū Printf is a new algorithm to convert floating-point numbers to decimal strings according to the printf %f, %e, and %g formats: %f generates ‘full’ output (integer part of the input, dot, configurable number of digits), %e generates scientific output (one leading digit, dot, configurable number of digits, exponent), and %g generates the shorter of the two. Ryū Printf is based on the Ryū algorithm, which converts binary floating-point numbers to the shortest equivalent decimal floating-point representation. We provide quantitative evidence that Ryū Printf is between 3.8 and 55 times faster than existing printf implementations. Furthermore, we show that both Ryū and Ryū Printf generalize to arbitrary number bases. This finding implies the existence of a fast algorithm to convert from base-10 to base-2, as long as the maximum precision of the input is known a priori.
Ulf Adams
Proc. ACM Program. Lang.1
2018 Ryū: fast float-to-string conversion
abstract
We present Ryū, a new routine to convert binary floating point numbers to their decimal representations using only fixed-size integer operations, and prove its correctness. Ryū is simpler and approximately three times faster than the previously fastest implementation.
Ulf Adams
PLDI1