Sciweavers

1302 search results - page 140 / 261
» On the Strong Chromatic Number
Sort
View
CRYPTO
2004
Springer
112views Cryptology» more  CRYPTO 2004»
15 years 12 months ago
Feistel Schemes and Bi-linear Cryptanalysis
Abstract. In this paper we introduce the method of bi-linear cryptanalysis (BLC), designed specifically to attack Feistel ciphers. It allows to construct periodic biased character...
Nicolas Courtois
FOCS
2000
IEEE
15 years 11 months ago
Extracting Randomness via Repeated Condensing
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
Omer Reingold, Ronen Shaltiel, Avi Wigderson
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 10 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
CP
1998
Springer
15 years 10 months ago
Error-Correcting Source Code
We study how constraint-based static analysis can be applied to the automated and systematic debugging of program errors. Strongly moding and constraint-based mode analysis are tur...
Yasuhiro Ajiro, Kazunori Ueda, Kenta Cho
ICALP
1998
Springer
15 years 10 months ago
Deciding Bisimulation-Like Equivalences with Finite-State Processes
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
Petr Jancar, Antonín Kucera, Richard Mayr