Finding a path in a network based on multiple constraints (the MCP problem) is often
considered an integral part of quality of service (QoS) routing. QoS routing with constraints …

Computer science and physics have been closely linked since the birth of modern
computing. In recent years, an interdisciplinary area has blossomed at the junction of these …

Finding a path in a network based on multiple constraints (the MCP problem) is often
referred to as QoS routing. QoS routing with constraints on multiple additive metrics has …

Towards Geometry-Preserving Reductions Between Constraint Satisfaction Problems (and other
problems in NP) Page 1 M. Marin, L. Leustean (Eds.): 8th Symposium on Working Formal …

We study threshold properties of random constraint satisfaction problems under a
probabilistic model due to Molloy [Models for random constraint satisfaction problems, in …

We introduce a prime number generator in the form of a stochastic algorithm. The character
of this algorithm gives rise to a continuous phase transition which distinguishes a phase …

A brief description of a software tool developed to analyze transmission lines with arbitrary
losses is presented in this paper. This tool summarizes a complete methodology for the …

We study threshold properties of random constraint satisfaction problems under a
probabilistic model due to Molloy. We give a sufficient condition for the existence of a sharp …

Much ink has dried in the historical discussion of what is mathematics? Does it follows the
scientific method? Is it just a collection of recipes, formulas and algorithms? Is it a science or …

In this work we explore the ability of the Google search engine to find results for random N-
letter strings. These random strings, dense over the set of possible N-letter words, address …