Sciweavers

434 search results - page 46 / 87
» Monadic Bounded Algebras
Sort
View
FOCS
1992
IEEE
14 years 1 months ago
Reconstructing Algebraic Functions from Mixed Data
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...
Sigal Ar, Richard J. Lipton, Ronitt Rubinfeld, Mad...
JSYML
2008
74views more  JSYML 2008»
13 years 10 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
13 years 11 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
IFM
2009
Springer
107views Formal Methods» more  IFM 2009»
14 years 4 months ago
Realizability of Choreographies Using Process Algebra Encodings
Abstract. Service-oriented computing has emerged as a new programming paradigm that aims at implementing software applications which can be used through a network via the exchange ...
Gwen Salaün, Tevfik Bultan
RELMICS
2005
Springer
14 years 3 months ago
Relational Correspondences for Lattices with Operators
In this paper we present some examples of relational correspondences for not necessarily distributive lattices with modal-like operators of possibility (normal and additive operato...
Jouni Järvinen, Ewa Orlowska