EDBT 2026 Demo / reviewers in the wild / expert
Tae Woo Kim
dblp:188/9656
· DBLP profile ↗
5ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
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
1 paper |
Operating systems · 50% Concurrent programming · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Operating systems › resource management › memory management
address space management |
0.9 | 1 | 2025 | Scalable Address Spaces using Concurrent Interval Skiplist · SOSP 2025 |
Concurrent programming › synchronization
lock contention |
0.9 | 1 | 2025 | Scalable Address Spaces using Concurrent Interval Skiplist · SOSP 2025 |
Operating systems › resource management
memory management |
0.9 | 1 | 2025 | Scalable Address Spaces using Concurrent Interval Skiplist · SOSP 2025 |
Concurrent programming
synchronization |
0.9 | 1 | 2025 | Scalable Address Spaces using Concurrent Interval Skiplist · SOSP 2025 |
Methods — techniques the papers use, named apart from their topics
fine-grained locking · 0.9concurrent interval skiplist · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Scalable Address Spaces using Concurrent Interval SkiplistabstractA kernel's address space design can significantly bottleneck multi-threaded applications, as address space operations such as mmap() and munmap() are serialized by coarsegrained locks like Linux's mmap_lock. Such locks have long been known as one of the most intractable contention points in memory management. While prior works have attempted to address this issue, they either fail to sufficiently parallelize operations or are impractical for real-world kernels. Tae Woo Kim, Youngjin Kwon, Jeehoon Kang |
SOSP | 1 |
| 2022 | SecureIIoT Environment: Federated Learning Empowered Approach for Securing IIoT From Data BreachabstractThe growing congruence of gadgets today resulted in a numerous type of cyber attacks. A similar trend occurs with the industrial Internet of Things (IIoT), wherein increasing data created by connected equipment offers up new opportunities for enhancing service quality for new applications. But, security has become a major design priority for smart devices since the introduction of the IIoT. However, data providers have significant challenges in exchanging their data between different cyber physical systems due to privacy and security concerns (e.g., data imbalance and leakage). In this article, we developed a safe data sharing architecture for various IIoT devices using federated learning (FL). The proposed architecture incorporates FL into the edge computing consensus process, allowing the consensus computing activity to be used for federated training as well. The proposed framework achieves high efficiency, and better security, according to numerical findings generated by experimenting deep learning models. More precisely, the proposed framework named as SecureIIoT, is able to achieve 99.79% accuracy by detecting attacks as a binary classification problem. Aaisha Makkar, Tae Woo Kim, Ashutosh Kumar Singh 0001, Jungho Kang, Jong Hyuk Park 0001 |
IEEE Trans. Ind. Informatics | 2 |
| 2021 | Blockchain-empowered cloud architecture based on secret sharing for smart city
Jeonghun Cha, Sushil Kumar Singh 0001, Tae Woo Kim, Jong Hyuk Park 0001 |
J. Inf. Secur. Appl. | 3 |
| 2017 | Low complexity user pairing algorithm for in-band full-duplex networks with power controlabstractFull Duplex(FD) network is considered as efficient scheme which could service both downlink(DL) and uplink(UL) users by same resource while HD can serve only DL or UL user for each resource. By optimized user scheduling with power control, optimal spectral efficiency could be achieved but optimization problem is non-linear and complex thus it is hard to implement. Low complexity relaxed optimization problem is proposed to solve resource allocation to minimize the transmission completion time in FD network. By adopting proposed scheme, suboptimal solution can be found in linear problem with significantly lower complexity. Sanghwa Lee, Minho Yang, Tae Woo Kim, Dong Ku Kim |
APCC | 3 |
| 2016 | Pragmatic Quality Assessment for Automatically Extracted Data
Scott N. Woodfield, Deryle W. Lonsdale, Stephen W. Liddle, Tae Woo Kim, David W. Embley, Christopher Almquist |
ER | 4 |