173 search results - page 20 / 35 » Asymptotic classes of finite structures |
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
ICMAS
2000
13 years 8 months ago
2000
In this paper we focus on the problem of how infinite belief hierarchies can be represented and reasoned with in a computationally tractable way. When modeling nested beliefs one ...
DM
2010
13 years 7 months ago
2010
In this paper, we first prove some general results on the number of fixed points of collineations of finite partial geometries, and on the number of absolute points of dualities o...
SIGMETRICS
2002
ACM
13 years 7 months ago
2002
ACM
We introduce a new methodology for the exact analysis of M/G/1-type Markov processes. The methodology uses basic, well-known results for Markov chains by exploiting the structure ...
IFL
1997
Springer
13 years 11 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...