Sciweavers

1922 search results - page 118 / 385
» ie 2007
Sort
View
FAW
2007
Springer
115views Algorithms» more  FAW 2007»
15 years 6 months ago
An O ( nm )-Time Certifying Algorithm for Recognizing HHD-Free Graphs
In this paper, we consider the recognition problem on a class of perfectly orderable graphs, namely, the HHD-free graphs, i.e., graphs that do not contain any induced subgraph iso...
Stavros D. Nikolopoulos, Leonidas Palios
93
Voted
FMCAD
2007
Springer
15 years 6 months ago
Induction in CEGAR for Detecting Counterexamples
— Induction has been studied in model checking for proving the validity of safety properties, i.e., showing the absence of counterexamples. To our knowledge, induction has not be...
Chao Wang, Aarti Gupta, Franjo Ivancic
105
Voted
FORMATS
2007
Springer
15 years 6 months ago
Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
Sergio Giro, Pedro R. D'Argenio
89
Voted
FSE
2007
Springer
136views Cryptology» more  FSE 2007»
15 years 6 months ago
New Lightweight DES Variants
In this paper we propose a new block cipher, DESL (DES Lightweight), which is based on the classical DES (Data Encryption Standard) design, but unlike DES it uses a single S-box re...
Gregor Leander, Christof Paar, Axel Poschmann, Kai...
84
Voted
GD
2007
Springer
15 years 6 months ago
Multi-circular Layout of Micro/Macro Graphs
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
Michael Baur, Ulrik Brandes