Sciweavers

650 search results - page 55 / 130
» On Coalgebras over Algebras
Sort
View
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III
ICDT
1997
ACM
138views Database» more  ICDT 1997»
13 years 12 months ago
Tractable Iteration Mechanisms for Bag Languages
Abstract. The goal of this paper is to study tractable iteration mechanisms for bags. The presence of duplicates in bags prevents iteration mechanisms developed in the context of s...
Latha S. Colby, Leonid Libkin
WAIM
2005
Springer
14 years 1 months ago
An Algebraic Framework for Schema Matching
It is well known that a formal framework for the schema matching problem (SMP) is important because it facilitates the building of algorithm model and the evaluation of algorithms....
Zhi Zhang, Haoyang Che, Pengfei Shi, Yong Sun, Jun...
APAL
2010
123views more  APAL 2010»
13 years 7 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
IJAC
2007
59views more  IJAC 2007»
13 years 7 months ago
Automorphic Equivalence Problem for Free Associative Algebras of Rank Two
Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
Vesselin Drensky, Jie-Tai Yu