Sciweavers

40 search results - page 4 / 8
» Developing the Algebraic Hierarchy with Type Classes in Coq
Sort
View
CP
2003
Springer
14 years 28 days ago
An Algebraic Approach to Multi-sorted Constraints
Abstract. Most previous theoretical study of the complexity of the constraint satisfaction problem has considered a simplified version of the problem in which all variables have t...
Andrei A. Bulatov, Peter Jeavons
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
14 years 14 days ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet
JUCS
2002
93views more  JUCS 2002»
13 years 7 months ago
On the Semiautomatic Generation of WordNet Type Synsets and Clusters
: WordNet (WN) is a lexical knowledge base, first developed for English and then adopted for several Western European languages, which was created as a machinereadable dictionary b...
Florentina Hristea
TCS
2002
13 years 7 months ago
Process algebra for performance evaluation
This paper surveys the theoretical developments in the field of stochastic process algebras, process algebras where action occurrences may be subject to a delay that is determined...
Holger Hermanns, Ulrich Herzog, Joost-Pieter Katoe...
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