We generalize the classical knapsack and subset sum problems to arbitrary groups and study the computational complexity of these new problems. We show that these problems, as well as the boundedâ€¦ (More)

The classic knapsack and related problems have natural generalizations to arbitrary (non-commutative) groups, collectively called knapsacktype problems in groups. We study the effect of free andâ€¦ (More)

Market risk analysis is a computationally intensive problem which requires powerful computing resources. To enable consistent comparisons of vendors' technologies in this area the Securitiesâ€¦ (More)

Rise of hundreds cores technologies bring again to the first plan the problem of interprocess synchronization in database engines. Spinlocks are widely used in contemporary DBMS to synchronizeâ€¦ (More)

In the past 20 years, computerization has driven explosive growth in the volume of financial markets and in the variety of traded financial instruments. Increasingly sophisticated mathematical andâ€¦ (More)

For finitely generated nilpotent groups, we employ Malâ€™cev coordinates to solve several classical algorithmic problems efficiently. Computation of normal forms, the membership problem, the conjugacyâ€¦ (More)

Market risk management is a critical, resourceintensive task for financial trading firms. The industry relies heavily on innovation in technical infrastructure to increase the quality and quantity ofâ€¦ (More)

Visual working memory is characterised by a limited storage capacity. Given this storage limitation, selection of behaviourally relevant objects based on locations, features or object category, isâ€¦ (More)