Sciweavers

922 search results - page 132 / 185
» A generalization of the Lin-Zhao theorem
Sort
View
COCO
2001
Springer
122views Algorithms» more  COCO 2001»
14 years 1 months ago
Hausdorff Dimension in Exponential Time
In this paper we investigate effective versions of Hausdorff dimension which have been recently introduced by Lutz. We focus on dimension in the class E of sets computable in line...
Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, F...
CONCUR
2001
Springer
14 years 1 months ago
Compositional Modeling of Reactive Systems Using Open Nets
In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designate...
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Rei...
ICDT
2001
ACM
131views Database» more  ICDT 2001»
14 years 1 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
FM
1999
Springer
107views Formal Methods» more  FM 1999»
14 years 1 months ago
A Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural descripti...
John Herbert, Bruno Dutertre, Robert A. Riemenschn...
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
14 years 23 days ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers