Sciweavers

1559 search results - page 52 / 312
» Some Group Theory Problems
Sort
View
SIGSOFT
1994
ACM
15 years 1 months ago
Foundations of Software Testing: Dependability Theory
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
Richard G. Hamlet
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
14 years 11 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
ACSC
2008
IEEE
15 years 4 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
ICCAD
2003
IEEE
100views Hardware» more  ICCAD 2003»
15 years 6 months ago
A Theory of Non-Deterministic Networks
Both non-determinism and multi-level networks compactly characterize the flexibility allowed in implementing a circuit. A theory for representing and manipulating non-deterministi...
Alan Mishchenko, Robert K. Brayton
LION
2009
Springer
125views Optimization» more  LION 2009»
15 years 4 months ago
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
This work introduces new bounds on the clique number of graphs derived from a result due to S´os and Straus, which generalizes the Motzkin-Straus Theorem to a specific class of h...
Samuel Rota Bulò, Marcello Pelillo