Backlog Decomposition is a method in software engineering that systematically breaks down high-level backlog items into smaller, manageable, and implementable subtasks while preserving their traceability and alignment with overarching project requirements.
2
Publications
42
Citations
10
Authors
8
Institutions
Publications per year
2017–2026
1
Parents
Publications
2
Backlog-adaptive compression: Age of information
Jing Zhong, Roy D. Yates, Emina Soljanin · 2017 · 26 citations
Michael A. Bender, Sándor P. Fekete, Alexander Kröller et al. · Theoretical Computer Science · 2015 · 16 citations · Full text
1–2 of 2
Authors
10
- VL
1
h-index
- JZ
1
h-index
- RD
1
h-index
- ES
1
h-index
- AK
1
h-index
1–5 of 10
Institutions
8
Rutgers Sexual and Reproductive Health and Rights
Utrecht, Netherlands
1 h-index
3 publications
78 citations
Case Western Reserve University
Cleveland, United States
1 h-index
1 publications
16 citations
Technische Universität Braunschweig
Braunschweig, Germany
1 h-index
2 publications
32 citations
Aalto University
Espoo, Finland
1 h-index
1 publications
16 citations
Stony Brook University
Stony Brook, United States
1 h-index
2 publications
32 citations
University of Helsinki
Helsinki, Finland
1 h-index
1 publications
16 citations
Linköping University
Linköping, Sweden
1 h-index
1 publications
16 citations
Helsinki Institute for Information Technology
Espoo, Finland
1 h-index
1 publications
16 citations
1–8 of 8
Venues
- Theoretical Computer Science
1 publications · 16 citations
1
h-index
1–1