An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
Cross-linguistic phoneme correspondences, or metaphonemes1 , can be defined across languages which are relatively closely related in exactly the same way as correspondences can be...
We introduce the Conditional Mean Value Analysis (CMVA) algorithm, an exact solution method for product-form load-dependent closed queueing networks that provides a numerically st...