Recent publication of Hironaka seems to provoke extended discussions, like Atiyah's proof of almost complex structure of $S^6$ earlier... Unlike Atiyah's paper, Hironaka's paper does not have a historical overview that provides a vague image for non-expert to the field. [Kollar] has such a comment:
...This duality also makes it difficult to write a reasonable historical presentation and to correctly appreciate the contributions of various researchers. Each step ahead can be viewed as small or large, depending on whether we focus on the change in the ideas or on their effect. In some sense, all the results of the past forty years have their seeds in [Hir64].
[Hauser] is a relatively readable review on this problem to me. My interest is basically on (possible) constructive side of [Hironaka] since singularity algorithms are known to connect with coding algorithms via Grobner bases. But given the status and attention given to this paper and I'm not an expert in AG, I want to ask
Can anyone comment on whether Hironaka's technique LLUED and its globalized version GLUED (like he said in the end of [Hironaka]) also improves design of resolution algorithms?
"Our methodology of using leverage-up exponent-down (LUED) seems to be more significant than just proving the resolution of singularities..."[Hironaka]
Will such a technique be extended beyond the scope of algebraic geometry (to, say, algebraic topology/coding theory/projective geometry)?
[Kollar] Kollár, János. "Resolution of Singularities--Seattle Lecture." arXiv preprint math/0508332 (2005).
[Hironaka] Resolution of Singularties in Positive Characteristics: A proof of resolution of singularities in characteristic $p>0$ and all dimensions.
[Hauser]Hauser, Herwig. "On the problem of resolution of singularities in positive characteristic (Or: A proof we are still waiting for)." Bulletin of the American Mathematical Society 47.1 (2010): 1-30. http://homepage.univie.ac.at/herwig.hauser/Publications/Problem_PosChar.pdf
please see recent updates in comments