Sciweavers

8699 search results - page 10 / 1740
» Elements of the Theory of Computation
Sort
View
IPPS
1996
IEEE
13 years 11 months ago
An Element-Based Concurrent Partitioner for Unstructured Finite Element Meshes
A concurrent partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The partitioner uses an element-based partitioning st...
Hong Q. Ding, Robert D. Ferraro
LICS
2006
IEEE
14 years 1 months ago
Boolean Algebras for Lambda Calculus
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In every combinatory algebra there is a Boolean algebr...
Giulio Manzonetto, Antonino Salibra
CIE
2006
Springer
13 years 11 months ago
Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests
Abstract. We prove that the homomorphic quasiorder of finite k-labeled forests has undecidable elementary theory for k 3, in contrast to the known decidability result for k = 2. W...
Oleg V. Kudinov, Victor L. Selivanov
AAAI
2007
13 years 9 months ago
Computational Aspects of Covering in Dominance Graphs
Various problems in AI and multiagent systems can be tackled by finding the “most desirable” elements of a set given some binary relation. Examples can be found in areas as d...
Felix Brandt, Felix A. Fischer
AAECC
2006
Springer
125views Algorithms» more  AAECC 2006»
13 years 7 months ago
Combinatorial Group Theory and Public Key Cryptography
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
Vladimir Shpilrain, Gabriel Zapata