Dynamic Reachability
Dynamic Reachability is a computational framework in dynamic data structures that enables the maintenance and querying of reachability information in a directed graph undergoing incremental updates such as edge insertions or deletions.
89
Publications
4.3K
Citations
231
Authors
124
Institutions
Publications per year
2017–2026
31
Parents
89
Program analysis via graph reachability
Thomas Reps · Information and Software Technology · 1998 · 330 citations
1–5 of 89
231
4
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 231
124
University of California, Berkeley
Berkeley, United States
6 h-index
7 publications
177 citations
ETH Zurich
Zurich, Switzerland
4 h-index
11 publications
263 citations
Technical University of Munich
Munich, Germany
3 h-index
7 publications
115 citations
University of Oxford
Oxford, United Kingdom
3 h-index
6 publications
120 citations
Institute of Science and Technology Austria
Klosterneuburg, Austria
3 h-index
4 publications
186 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
282 citations

University of Edinburgh
Edinburgh, United Kingdom
2 h-index
9 publications
281 citations
University of Vienna
Vienna, Austria
2 h-index
2 publications
126 citations
1–8 of 124
7 publications · 656 citations
7
h-index
4 publications · 284 citations
4
h-index
2 publications · 150 citations
3
h-index
2 publications · 190 citations
2
h-index
2 publications · 482 citations
2
h-index
1–5