Demo Data from EDBT 2026 / reviewers in the wild / expert
Taejoo Chang
dblp:73/4200
· DBLP profile ↗
5ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorSystems, architecture and hardware · 1 · 1 since 2021Theory of computation · 1 · 1 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.
| Theoretical computer science
1 paper |
Coding theory · 100% | |
| Network and information security
1 paper |
Cryptographic primitives and cryptanalysis · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
stream cipher |
0.0 | 1 | 1999 | An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences · IEEE Trans. Inf. Theory 1999 |
Coding theory › sequences
de bruijn sequences |
0.0 | 1 | 1999 | An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences · IEEE Trans. Inf. Theory 1999 |
Coding theory › sequences
sequence generation |
0.0 | 1 | 1999 | An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn Sequences · IEEE Trans. Inf. Theory 1999 |
Methods — techniques the papers use, named apart from their topics
d-homomorphism · 0.0exclusive-or operations · 0.0Exclusive-OR operation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Hybrid emulation for bypassing anti-reversing techniques and analyzing malware
Seokwoo Choi, Taejoo Chang, Sung-Woo Yoon, Yongsu Park |
J. Supercomput. | 2 |
| 1999 | An Efficient Implementation of the D-Homomorphism for Generation of de Bruijn SequencesabstractAn efficient implementation of the D-homomorphism for generating de Bruijn (1946) sequences is presented. The number of exclusive-or operations required to generate the next bit for de Bruijn sequences of order n from a de Bruijn function of order k is shown to be approximately k(2/sup W(n-k)/-1), where W(r) is the number of one's in the binary representation of r: therefore, the number of required operations can be reduced to k if the de Bruijn function is selected appropriately. As an application, the stream cipher is indicated. Taejoo Chang, Bongjoo Park, Yun Hee Kim, Iickho Song |
IEEE Trans. Inf. Theory | 1 |
| 1997 | Maximum length cellular automaton sequences and its application
Taejoo Chang, Iickho Song, Jinsoo Bae, Kwang Soon Kim |
Signal Process. | 1 |
| 1996 | Nonparametric detection of known and random signals based on zero-crossings
Jinsoo Bae, Youngkwon Ryu, Taejoo Chang, Iickho Song, Hyung-Myung Kim |
Signal Process. | 3 |
| 1996 | Adaptive code rate change for maximum throughput in DS-SSMA communication systems
Youngkwon Ryu, Iickho Song, Taejoo Chang, Kwang Soon Kim |
Signal Process. | 3 |