A Formalization of the Knuth–Bendix(–Huet) Critical Pair Theorem

By Galdino André   Ayala-Rincón Mauricio  

Journal of Automated Reasoning, Vol. 45, Iss. 3, 2010-10 ,pp. : 301-325

Springer Publishing Company

Access to resources Recommend Favorite

Symbolic derivation of Runge-Kutta order conditions

By Famelis I.T.   Papakostas S.N.   Tsitouras C.  

Journal of Symbolic Computation, Vol. 37, Iss. 3, 2004-03 ,pp. : 311-327

Elsevier

Access to resources Recommend Favorite

Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths

By Weiermann A.  

Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. : 355-362

Elsevier

Access to resources Recommend Favorite

Innovative order types as success factors in stock exchange competition

By Kunzelmann Matthias   Mäkiö Juho  

Information Systems and e-Business Management, Vol. 5, Iss. 2, 2007-03 ,pp. : 167-184

Springer Publishing Company

Access to resources Recommend Favorite

Euclidean Upgrading from Segment Lengths

By Ronda José   Valdés Antonio  

International Journal of Computer Vision, Vol. 90, Iss. 3, 2010-12 ,pp. : 350-368

Springer Publishing Company

Access to resources Recommend Favorite