A class of prolog programs with non-linear outputs inferable from positive dataKRISHNA RAO, M. R. K.Lecture notes in computer science. 2005, pp 312-326, issn 0302-9743, isbn 3-540-29242-X, 1Vol, 15 p.Conference Paper

Rebuilding a tree from its traversals: A case study of program inversionMU, Shin-Cheng; BIRD, Richard.Lecture notes in computer science. 2003, pp 265-282, issn 0302-9743, isbn 3-540-20536-5, 18 p.Conference Paper

Constructing a binary tree efficiently from its traversalsMÄKINEN, E.International journal of computer mathematics. 2000, Vol 75, Num 2, pp 143-147, issn 0020-7160Article

An Efficient Multiplication Algorithm for Thin Matrices and for Matrices with Similar Rows and ColumnsARSLAN, Abdullah N; CHIDRI, Arvind.Scientific computing. International conferenceWorldComp'2010. 2010, pp 147-152, isbn 1-60132-137-6, 6 p.Conference Paper

On a logical approach to estimating computational complexity of potentially intractable problemsSZAŁAS, Andrzej.Lecture notes in computer science. 2003, pp 423-431, issn 0302-9743, isbn 3-540-40543-7, 9 p.Conference Paper

Mixed Search Number and Linear-Width of Interval and Split GraphsFOMIN, Fedor V; HEGGERNES, Pinar; MIHAI, Rodica et al.Networks (New York, NY). 2010, Vol 56, Num 3, pp 207-214, issn 0028-3045, 8 p.Article

Optimal trade-off for Merkle tree traversalBERMAN, Piotr; KARPINSKI, Marek; NEKRICH, Yakov et al.Theoretical computer science. 2007, Vol 372, Num 1, pp 26-36, issn 0304-3975, 11 p.Article

Tree traversal and word orderKURAL, Murat.Linguistic inquiry. 2005, Vol 36, Num 3, pp 367-387, issn 0024-3892, 21 p.Article

Enhancing Locality for Recursive Traversals of Recursive StructuresJO, Youngjoon; KULKARNI, Milind.ACM SIGPLAN notices. 2011, Vol 46, Num 10, pp 463-482, issn 1523-2867, 20 p.Conference Paper

Efficient Mining of Large Maximal Bicliques from 3D Symmetric Adjacency MatrixSELVAN, S; NATARAJ, R. V.IEEE transactions on knowledge and data engineering. 2010, Vol 22, Num 12, pp 1797-1802, issn 1041-4347, 6 p.Article

Learnability of simply-moded logic programs from entailmentKRISHNA RAO, M. R. K.Lecture notes in computer science. 2004, pp 128-141, issn 0302-9743, isbn 3-540-24087-X, 14 p.Conference Paper

Characterizing SME migration towards advanced manufacturing technologiesTHOMAS, A. J; BARTON, R. A.Proceedings of the Institution of Mechanical Engineers. Part B. Journal of engineering manufacture. 2012, Vol 226, Num 4, pp 745-756, issn 0954-4054, 12 p.Article

A Fast Algorithm for Adaptive Prefix CodingKARPINSKI, Marek; NEKRICH, Yakov.Algorithmica. 2009, Vol 55, Num 1, pp 29-41, issn 0178-4617, 13 p.Article

QT-CBP : A new RFID tag anti-collision algorithm using collision bit positioningLEE, Hyunji; KIM, Jongdeok.Lecture notes in computer science. 2006, pp 591-600, issn 0302-9743, isbn 3-540-36850-7, 1Vol, 10 p.Conference Paper

Constraint-Aware Approach to Web Service CompositionPENGWEI WANG; ZHIJUN DING; CHANGJUN JIANG et al.IEEE transactions on systems, man, and cybernetics. Systems (Print). 2014, Vol 44, Num 6, pp 770-784, issn 2168-2216, 15 p.Article

Texture synthesis using label assignment over a graph : GRAPHICS INTERFACECARON, Jack; MOULD, David.Computers & graphics. 2014, Vol 39, pp 24-36, issn 0097-8493, 13 p.Article

Automated verification of the deutsch-schorr-waite tree-traversal algorithmLOGINOV, Alexey; REPS, Thomas; SAGIV, Mooly et al.Lecture notes in computer science. 2006, pp 261-279, issn 0302-9743, isbn 3-540-37756-5, 1Vol, 19 p.Conference Paper

Parallel algorithms for separable permutationsYUGANDHAR, V; SAXENA, Sanjeev.Discrete applied mathematics. 2005, Vol 146, Num 3, pp 343-364, issn 0166-218X, 22 p.Article

Efficient spatial clustering algorithm using binary treeALI, Mohsin; XUE LI; ZHAO YANG DONG et al.Lecture notes in computer science. 2005, pp 294-301, issn 0302-9743, isbn 3-540-26972-X, 8 p.Conference Paper

Visitor combination and traversal controlVISSER, Joost.Report - Software engineering. 2001, Num 9, pp 1-22, issn 1386-369XArticle

Object-oriented tree traversal with JJForesterKUIPERS, Tobias; VISSER, Joost.Report - Software engineering. 2000, Num 41, pp 1-18, issn 1386-369XArticle

DFSP: a Depth-First SPelling algorithm for sequential pattern mining of biological sequencesLIAO, Vance Chiang-Chi; CHEN, Ming-Syan.Knowledge and information systems (Print). 2014, Vol 38, Num 3, pp 623-639, issn 0219-1377, 17 p.Article

Stack-Based Parallel Recursion on Graphics ProcessorsKE YANG; BINGSHENG HE; QIONG LUO et al.ACM SIGPLAN notices. 2009, Vol 44, Num 4, pp 299-300, issn 1523-2867, 2 p.Conference Paper

Stack-Based Parallel Recursion on Graphics ProcessorsKE YANG; BINGSHENG HE; QIONG LUO et al.ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming. 2009, pp 299-300, isbn 978-1-60558-397-6, 1Vol, 2 p.Conference Paper

A data structure for improved GP analysis via efficient computation and visualisation of population measuresEKART, Aniko; GUSTAFSON, Steven.Lecture notes in computer science. 2004, pp 35-46, issn 0302-9743, isbn 3-540-21346-5, 12 p.Conference Paper