![Lowest common ancestor / Theoretical computer science / Tree traversal / Rope / Eval / Graph theory / Computing / Binary trees Lowest common ancestor / Theoretical computer science / Tree traversal / Rope / Eval / Graph theory / Computing / Binary trees](https://www.pdfsearch.io/img/73b9d015f64a425635cd6c765b9935ea.jpg)
| Document Date: 2010-06-08 09:56:29 Open Document File Size: 196,24 KBShare Result on Facebook
City Tokyo / / Company Chiyoda / / Country Japan / / / Event Delayed Filing / Reorganization / / Facility Japan University of Tokyo / / IndustryTerm basic bottom-up algorithm / finite applications / na¨ıve algorithm / ∗-product / inefficient algorithm / / Organization University of Tokyo / National Institute of Informatics / / Person Kazuhiro Inaba / / Position rt / / ProgrammingLanguage XPath / XML / Datalog / / Technology main algorithm / N-ary Query Algorithm / XML / QUERY-RUNA algorithm / basic bottom-up algorithm / same algorithm / na¨ıve algorithm / FFG algorithm / previous na¨ıve algorithm / /
SocialTag |