]> mj.ucw.cz Git - saga.git/history - opt.tex
Continuing with the intro to dynamic algorithms.
[saga.git] / opt.tex
2008-04-08 Martin MaresMore on the Ackermann's function and its inverses.
2008-04-07 Martin MaresCall subgraphs clusters.
2008-04-07 Martin MaresCorrection to OPT.
2008-04-06 Martin MaresCorrections to robust contractions.
2008-04-06 Martin MaresUse larger parens.
2008-04-06 Martin MaresTopological graph computations.
2008-04-05 Martin Mares\paran redefined.
2008-04-05 Martin MaresFixed lots of typos.
2008-04-05 Martin MaresFix references.
2008-04-05 Martin MaresRemarks on Pettie.
2008-04-05 Martin MaresThe optimal algorithm.
2008-04-03 Martin MaresMore on optimal decision trees.
2008-04-03 Martin MaresConstruction of optimal trees.
2008-04-02 Martin MaresDecision trees started.
2008-04-02 Martin MaresVaria.
2008-04-02 Martin MaresPartitioning done.
2008-04-02 Martin MaresMore robust contractions.
2008-04-01 Martin MaresRobust contraction lemma.
2008-04-01 Martin MaresStarted with robust contractions.
2008-03-29 Martin MaresSH: Optimality.
2008-03-29 Martin MaresSH: Yardsticks.
2008-03-29 Martin MaresSoft heaps: fixes.
2008-03-29 Martin MaresSoft heaps: Example.
2008-03-27 Martin MaresAnalysis of soft heaps finished.
2008-03-27 Martin MaresMore soft heaps. More.
2008-03-27 Martin MaresSoft heaps: time complexity.
2008-03-26 Martin MaresAccuracy finished.
2008-03-26 Martin MaresEven more soft heaps.
2008-03-26 Martin MaresMore soft heap bits.
2008-03-26 Martin MaresMore soft heaps.
2008-03-26 Martin MaresTwo pictures of soft heaps.
2008-03-24 Martin MaresApproaching Optimality. Very slowly.