1322 search results - page 137 / 265 » Parameterized counting problems |
POPL
2005
ACM
14 years 10 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
SPAA
2009
ACM
14 years 7 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
CODES
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper provides an overview of the Blue Matter application development effort within the Blue Gene project that supports our scientific simulation efforts in the areas of pro...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
SPIRE
2010
Springer
13 years 8 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...