Sciweavers

2681 search results - page 179 / 537
» Problem F
Sort
View
PPDP
2005
Springer
14 years 4 months ago
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures
Formal methods have proved to be very useful for analyzing cryptographic protocols. However, most existing techniques apply to the case of abstract encryption schemes and pairing....
Véronique Cortier, Michaël Rusinowitch...
COMPUTING
2006
130views more  COMPUTING 2006»
13 years 10 months ago
Factorized Solution of Lyapunov Equations Based on Hierarchical Matrix Arithmetic
We investigate the numerical solution of large-scale Lyapunov equations with the sign function method. Replacing the usual matrix inversion, addition, and multiplication by format...
Ulrike Baur, Peter Benner
PC
1998
140views Management» more  PC 1998»
13 years 10 months ago
A Framework for Structured Distributed Object Computing
This paper presents a four-faceted framework for distributed applications that use worldwide networks connecting large numbers of people, software tools, monitoring instruments, a...
K. Mani Chandy, Joseph Kiniry, Adam Rifkin, Daniel...
STACS
1993
Springer
14 years 2 months ago
The Complexity of Logic-Based Abduction
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
Thomas Eiter, Georg Gottlob
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
14 years 2 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó