Variable Reordering of Parity-OBDDs Harald Sack. Yovisto Academic Video Search. OBDD swap nodes variable Optimization sym position Operation Excursion trees Symbolic size Simulation simulated sifting University of Trier, Germany overview obdd obdd manipulation optimization conclusion basics definition properti algorithm variation problem variabl reordering experimental result excursion decomposition boolean function obdd functional davio shannon kebschul schubert rosenstiel harald sack universitat jena institut informat obdd alternativ decomposition chang decomposition inclusion function harald sack universitat jena institut informat sifting experimental result obdd memory optimized obdd sip harald sack universitat jena institut informat schaltkreis siz nod obdd symbolic simulation obdd ite pde nde obdd optimization mod-sifting creat list simulated siz variabl position each repeat mov through level with sym-swap comput reduction variabl accessed let wher perform possibl return chang new harald sack universitat jena institut informat obdd cofactor creation obdd obdd symbolic simulation ite synthesis algorithm chang obdd-it alternativ function decomposition circuit description harald sack universitat jena institut informat cio input output nam obdd definition abc obdd canonical probabilistic equivalencet with boolean signatur gergov meinel harald sack universitat jena institut informat obdd ordered binary decision diagram abc formula valu boolean function read-onc reduced compact efficient manipulation obdd swap operation optimization basic sym-swap critical symmetry consequenc sifting minimier basic operation swap variabl hav swapped around nod swap-in-plac obdd new probl operation not symmetric obdd optimization solution exchang merg simulat apply only any always join nod excursion implementational detail win effect nod reduction simpl algorithm local swap-operation most only one variabl how stor nod what about betwe regular excursion implementational detail critical obdd swap obdd optimization basic operation obdd probl locality dependent implementation operation harald sack universitat jena institut informat obdd optimization adapting variabl ord possibl ord probl evaluation only construction heuristics sifting swap-operation must symmetric rudell basic operation effect local