2436 search results - page 90 / 488 » Comonadic Notions of Computation |
125
click to vote
CONCUR
1998
Springer
15 years 8 months ago
1998
Springer
The classical theory of deterministic automata is presented in terms of the notions of homomorphism and bisimulation, which are the cornerstones of the theory of universal coalgebr...
130
click to vote
LATIN
2000
Springer
15 years 7 months ago
2000
Springer
We present a very simple algorithm for the Least Common Ancestor problem. We thus dispel the frequently held notion that an optimal LCA computation is unwieldy and unimplementable...
104
Voted
CIE
2008
Springer
15 years 5 months ago
2008
Springer
We revisit Girard's reducibility candidates by proposing a general of the notion of neutral terms. They are the terms which do not interact with some contexts called eliminati...
114
Voted
CIE
2008
Springer
15 years 5 months ago
2008
Springer
We study the shrinking and separation properties (two notions well-known in descriptive set theory) for NP and coNP and show that under reasonable complexity-theoretic assumptions...
111
click to vote
DCC
1998
IEEE
15 years 3 months ago
1998
IEEE
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...