Randomised algorithms

Randomised Algorithms and Constraint Logic

We propose a declarative-based implementation of randomised algorithms, which exploits the Constraint Logic Programming (CLP) paradigm. For the high-level formalisation of probabilistic programs expressing such algorithms we actually refer to a generalisation of CLP, namely the Probabilistic Concurrent Constraint Programming (PCCP) language, previously introduced in DW97]. This language provide...

Randomised Algorithms and Probabilisti Constraint Programming

Implementing Randomised Algorithms in Constraint Logic Programming

Synopsis Algorithms where the ow of information is determined by an element of random choice (a \coin ipping" device), aka randomised algorithms, have known in the last decade a tremendous growth of interest, especially in the eld of complexity theory. Up to now such algorithms have been implemented mostly by means of probabilistic programs written in imperative languages. These programs have b...

Randomised algorithms for isomorphisms of simple types

We give the first linear time (yet randomized) algorithm for the first order isomorphism problem, i.e., the isomorphism of non-recursive types involving productand functiontype constructors, under the axioms of commutativity and associativity of products, currying and distributivity of functions over products. This problem can also be thought of as the problem of formal equality-testing of mult...

Searching for Pareto-optimal Randomised Algorithms

Randomised algorithms traditionally make stochastic decisions based on the result of sampling from a uniform probability distribution, such as the toss of a fair coin. In this paper, we relax this constraint, and investigate the potential benefits of allowing randomised algorithms to use non-uniform probability distributions. We show that the choice of probability distribution influences the no...