Sciweavers

1390 search results - page 78 / 278
» On the Algebraic Structure of Convergence
Sort
View
PEPM
2010
ACM
16 years 3 months ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
TYPES
2000
Springer
15 years 10 months ago
A Constructive Proof of the Fundamental Theorem of Algebra without Using the Rationals
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
CSL
2010
Springer
15 years 7 months ago
Fibrational Induction Rules for Initial Algebras
This paper provides an induction rule that can be used to prove properties of data structures whose types are inductive, i.e., are carriers of initial algebras of functors. Our res...
Neil Ghani, Patricia Johann, Clément Fumex
JLP
2006
98views more  JLP 2006»
15 years 6 months ago
Partiality I: Embedding relation algebras
As long as no cooperation between processes is supposed to take place, one may consider them separately and need not ask for the progress of the respective other processes. If a c...
Gunther Schmidt
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 8 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