VLDB 2026 Research / reviewers in the wild / expert
Susan Janiszewski
dblp:38/2101
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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 |
Coding theory · 100% |
Topics — the 1 heaviest of 1, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › sequences › sequence design
conflict-avoiding codes |
0.1 | 1 | 2007 | On Conflict-Avoiding Codes of Length n=4m for Three Active Users · IEEE Trans. Inf. Theory 2007 |
Methods — techniques the papers use, named apart from their topics
combinatorial bounds · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | On Conflict-Avoiding Codes of Length n=4m for Three Active UsersabstractNew improved upper and lower bounds on the maximum size of a symmetric or arbitrary conflict-avoiding code of length n = 4 m for three active users are proved. Furthermore, direct constructions for optimal conflict-avoiding codes of length n = 4 m and m equiv 2 (mod 4) for three active users are provided. Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Y. Teymorian, Vladimir D. Tonchev |
IEEE Trans. Inf. Theory | 3 |