Demo Data from SIGIR 2026 / reviewers in the wild / expert
Justin Kim
dblp:215/9009
· DBLP profile ↗
4ranked-venue papers
2as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
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.
| Theoretical computer science
1 paper |
Mathematical optimization · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Distributed systems · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Mathematical optimization › numerical computation
floating-point arithmetic |
0.9 | 1 | 2025 | Correctly Rounded Math Libraries without Worrying about the Application's Rounding Mode · Proc. ACM Program. Lang. 2025 |
Mathematical optimization
numerical computation |
0.9 | 1 | 2025 | Correctly Rounded Math Libraries without Worrying about the Application's Rounding Mode · Proc. ACM Program. Lang. 2025 |
Distributed systems › fault tolerance
byzantine fault tolerance |
0.5 | 1 | 2021 | Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults · PODC 2021 |
Distributed systems
consensus |
0.5 | 1 | 2021 | Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults · PODC 2021 |
Distributed systems
fault tolerance |
0.1 | 1 | 2021 | Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish Faults · PODC 2021 |
Methods — techniques the papers use, named apart from their topics
polynomial approximation · 1.7interval arithmetic · 1.7error-free transformation · 0.9error free transformations · 0.9protocol compilation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Correctly Rounded Math Libraries without Worrying about the Application's Rounding ModeabstractOur RLibm project has recently proposed methods to generate a single implementation for an elementary function that produces correctly rounded results for multiple rounding modes and representations with up to 32-bits. They are appealing for developing fast reference libraries without double rounding issues. The key insight is to build polynomial approximations that produce the correctly rounded result for a representation with two additional bits when compared to the largest target representation and with the “non-standard” round-to-odd rounding mode, which makes double rounding the RLibm math library result to any smaller target representation innocuous. The resulting approximations generated by the RLibm approach are implemented with machine supported foating-point operations with the round-to-nearest rounding mode. When an application uses a rounding mode other than the round-to-nearest mode, the RLibm math library saves the application’s rounding mode, changes the system’s rounding mode to round-to-nearest, computes the correctly rounded result, and restores the application’s rounding mode. This frequent change of rounding modes has a performance cost. This paper proposes two new methods, which we call rounding-invariant outputs and rounding-invariant input bounds, to avoid the frequent changes to the rounding mode and the dependence on the round-to-nearest mode. First, our new rounding-invariant outputs method proposes using the round-to-zero rounding mode to implement RLibm ’s polynomial approximations. We propose fast, error-free transformations to emulate a round-to-zero result from any standard rounding mode without changing the rounding mode. Second, our rounding-invariant input bounds method factors any rounding error due to different rounding modes using interval bounds in the RLibm pipeline. Both methods make a different set of trade-offs and improve the performance of resulting libraries by more than 2×. Sehyeok Park, Justin Kim, Santosh Nagarakatte |
Proc. ACM Program. Lang. | 2 |
| 2024 | Re²Pair: Increasing the Scalability of RePair by Decreasing Memory Usage
Justin Kim, Rahul Varki, Marco Oliva, Christina Boucher 0001 |
ESA | 1 |
| 2021 | Brief Announcement: Making Synchronous BFT Protocols Secure in the Presence of Mobile Sluggish FaultsabstractBFT protocols in the synchronous setting rely on a strong assumption: every message sent by a party will arrive at its destination within a known bounded time. To allow some degree of asynchrony while still tolerating a minority corruption, recently, in Crypto'19, a weaker synchrony assumption called mobile sluggish faults was introduced. In this work, we investigate the support for mobile sluggish faults in existing synchronous protocols such as Dfinity, Streamlet, Sync HotStuff, OptSync and the optimal latency BFT protocol. We identify key principles that can be used to "compile'' these synchronous protocols to tolerate mobile sluggish faults. Justin Kim, Vandan Mehta, Kartik Nayak, Nibesh Shrestha |
PODC | 1 |
| 2017 | Growth of bacteria in 3-d coloniesabstractThe dynamics of growth of bacterial populations has been extensively studied for planktonic cells in well-agitated liquid culture, in which all cells have equal access to nutrients. In the real world, bacteria are more likely to live in physically structured habitats as colonies, within which individual cells vary in their access to nutrients. The dynamics of bacterial growth in such conditions is poorly understood, and, unlike that for liquid culture, there is not a standard broadly used mathematical model for bacterial populations growing in colonies in three dimensions (3-d). By extending the classic Monod model of resource-limited population growth to allow for spatial heterogeneity in the bacterial access to nutrients, we develop a 3-d model of colonies, in which bacteria consume diffusing nutrients in their vicinity. By following the changes in density of E. coli in liquid and embedded in glucose-limited soft agar, we evaluate the fit of this model to experimental data. The model accounts for the experimentally observed presence of a sub-exponential, diffusion-limited growth regime in colonies, which is absent in liquid cultures. The model predicts and our experiments confirm that, as a consequence of inter-colony competition for the diffusing nutrients and of cell death, there is a non-monotonic relationship between total number of colonies within the habitat and the total number of individual cells in all of these colonies. This combined theoretical-experimental study reveals that, within 3-d colonies, E. coli cells are loosely packed, and colonies produce about 2.5 times as many cells as the liquid culture from the same amount of nutrients. We verify that this is because cells in liquid culture are larger than in colonies. Our model provides a baseline description of bacterial growth in 3-d, deviations from which can be used to identify phenotypic heterogeneities and inter-cellular interactions that further contribute to the structure of bacterial communities. Xinxian Shao, Andrew Mugler, Justin Kim, Ha Jun Jeong, Bruce R. Levin, Ilya Nemenman |
PLoS Comput. Biol. | 3 |