8699 search results - page 264 / 1740 » Elements of the Theory of Computation |
166
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...
160
click to vote
ECSCW
2003
15 years 8 months ago
2003
The constructs of "common ground" and "grounding" are frequently invoked in the CSCW literature as a mechanism by which participants engaged in joint activity c...
155
Voted
CIE
2005
Springer
16 years 6 days ago
2005
Springer
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
193
click to vote
MFCS
2004
Springer
16 years 22 hour ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
154
click to vote
SIP
2001
15 years 8 months ago
2001
The paper presents basic concepts of the discrete system theory from the viewpoint of Banach algebras and shows that some Banach algebras of sequences are not only suitable mathem...