1322 search results - page 3 / 265 » Parameterized counting problems |
WDAS
1998
14 years 10 months ago
1998
In the counting problem, asynchronous concurrent processes repeatedly assign themselves successive values, such as integers or locations in memory. Counting networks are a class o...
87
Voted
SODA
2010
ACM
15 years 6 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Research on parameterized algorithmics for NP-hard problems has steadily grown over the last years. We survey and discuss how parameterized complexity analysis naturally develops i...
DAC
1999
ACM
15 years 1 months ago
1999
ACM
This paper presents a new algorithm for exact estimation of the minimum memory size required by programs dealing with array computations. Memory size is an important factor a ecti...
DM
2000
14 years 9 months ago
2000
This paper discusses investigations of sequences of natural numbers which count the orbits of an in nite permutation group on n-sets or n-tuples. It surveys known results on the g...