Iterative Backtracking
Iterative Backtracking is an algorithmic paradigm that systematically explores potential solutions in a state space using an explicit stack to simulate backtracking without recursion, distinguishing it from recursive backtracking by employing iteration and stack manipulation to manage the search and recovery of partial configurations.
26
Publications
2.5K
Citations
58
Authors
41
Institutions
Publications per year
2017–2026
7
Parents
26
Inductive invariant generation via abductive inference
Thomas Dillig, Boyang Li, Ken McMillan · 2013 · 143 citations
Beam-stack search: integrating backtracking with beam search
Rong Zhou, Eric A. Hansen · 2005 · 126 citations
1–5 of 26
58
Japan Advanced Institute of Science and Technology, Japan
2 publications · 164 citations
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 58
41

University of Alberta
Edmonton, Canada
2 h-index
3 publications
331 citations
Williams (United States)
Tulsa, United States
2 h-index
2 publications
186 citations
William & Mary
Williamsburg, United States
2 h-index
2 publications
186 citations
University College London
London, United Kingdom
2 h-index
2 publications
186 citations
Microsoft (United States)
Redmond, United States
2 h-index
2 publications
186 citations
Tokyo Institute of Technology
Tokyo, Japan
2 h-index
6 publications
492 citations
Sandia National Laboratories
Albuquerque, United States
1 h-index
1 publications
43 citations
East China University of Science and Technology
Shanghai, China
1 h-index
2 publications
166 citations
1–8 of 41
2 publications · 257 citations
2
h-index
1 publications · 30 citations
1
h-index
1 publications · 88 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 43 citations
1
h-index
1–5