On the Analysis of Tree-Matching Algorithms


0 INTRODUCTION : This paper deals wi th the average case performance analysis of tree-m~tc~Lng algorithms. The trees we consider here are planar label led trees as occurs in programming experience under the form of syntax t rees, expression trees or tree-representat ion of structured objects (records). More spec i f i ca l l y , we are interested in methods… (More)
DOI: 10.1007/3-540-10003-2_72


  • Presentations referencing similar topics