139 search results - page 16 / 28 » Internode: Internal Node Logic Computational Model |
CC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
CSL
1992
Springer
13 years 12 months ago
1992
Springer
We develop the rst steps of a theory of concurrency within the framework of evolving algebras of Gurevich, with the aim of investigating its suitability for the role of a general f...
CGF
2004
13 years 7 months ago
2004
Issues of digital preservation of shapes and internal structures of historical cultural objects are discussed. An overview of existing approaches to digital preservation related t...
DAC
2003
ACM
14 years 8 months ago
2003
ACM
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for certain functions, such as arbiters, and can easily be produced inadvertently ...
ICALP
2007
Springer
14 years 2 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...