TCS
2010
12 years 11 months ago
2010
TCS
2010
12 years 11 months ago
2010
Markovian process algebras, such as PEPA and stochastic -calculus, bring a powerful compositional approach to the performance modelling of complex systems. However, the models gen...
TCS
2010
12 years 11 months ago
2010
The main idea for interpreting concurrent processes as labelled precubical sets is that a given set of n actions running concurrently must be assembled to a labelled ncube, in exac...
TCS
2010
12 years 11 months ago
2010
TCS
2010
12 years 11 months ago
2010
This paper presents an exact correspondence in typing and dynamics between polarised linear logic and a typed -calculus based on IO-typing. The respective incremental constraints,...
TCS
2010
12 years 11 months ago
2010
We describe a solution to the SAT problem via non-confluent P systems with active membranes, without using membrane division rules. Furthermore, we provide an algorithm for simula...
TCS
2010
12 years 11 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
TCS
2010
12 years 11 months ago
2010
Constructions of cryptographic primitives based on general assumptions (e.g., one-way functions) tend to be less efficient than constructions based on specific (e.g., number-theor...
TCS
2010
12 years 11 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...
TCS
2010
12 years 11 months ago
2010
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...