nonrecursive,space-timecomplexity 1.IntrOductiOn Thechoiceandcomparisonofrecursiveversus nonrecursivealgorithmsisaknownsubjectfromthe algorithm—studyincomputerscience.Itisfoundinthe majortextbooks,itisinvestigatedbyscientists,and discussedbyprofessionals.Inthispaperwepresentthe designandcomplexityanalysisofafewtestingand...
P. Bose and P. Morin, An improved algorithm for subdivision traversal without extra storage, in: Proceedings of the 11th International Sym- posium on Algorithms and Computation (ISAAC'2000) (2000) (to ap- pear).P. Bose and P. Morin. An improved algorithm for subdivision traversal without ...
computer science.Quite general structural and algorithmic problems were addressed during the developmentoftheDSAmodelingtool,whichare interestingfortheirdes ign an alys is and efi c ienc y t est ing .F ro m qu ite a fe w o f th em,here w e concentrate ...