18 search results - page 3 / 4 » Formal Theories for Logspace Counting |
138
click to vote
STOC
1993
ACM
15 years 2 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
DEXAW
2000
IEEE
15 years 2 months ago
2000
IEEE
Given their simple nature, the success of keyword based retrieval systems is astonishing. Although these methods seemingly only process words (and their word counts), they rely on...
CLEIEJ
2002
14 years 10 months ago
2002
Function Point Analysis (FPA) is among the most commonly used techniques to estimate the size of software system projects or software systems. During the point counting process th...
171
click to vote
POPL
2005
ACM
15 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...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
In this paper we propose a new voting protocol with desirable security properties. The voting stage of the protocol can be performed by humans without computers; it provides every...