Sciweavers

738 search results - page 74 / 148
» cases 2001
Sort
View
FCT
2001
Springer
15 years 2 months ago
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
Abstract. We present three results on divisibility monoids. These divisibility monoids were introduced in [11] as an algebraic generalization of Mazurkiewicz trace monoids. (1) We ...
Dietrich Kuske
FSE
2001
Springer
190views Cryptology» more  FSE 2001»
15 years 2 months ago
ZIP Attacks with Reduced Known Plaintext
Abstract. Biham and Kocher demonstrated that the PKZIP stream cipher was weak and presented an attack requiring thirteen bytes of plaintext. The deflate algorithm “zippers” no...
Michael Stay
GI
2001
Springer
15 years 2 months ago
Corporate Information Network (COIN): The Fraunhofer IESE Experience Factory
Experience-based continuous learning is essential for improving products, processes, and technologies in emerging as well as established areas of business and engineering science....
Andreas Jedlitschka, Klaus-Dieter Althoff, Bjö...
ICALP
2001
Springer
15 years 2 months ago
Testing Hypergraph Coloring
In this paper we initiate the study of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain prope...
Artur Czumaj, Christian Sohler
ICCS
2001
Springer
15 years 2 months ago
On Parallel Pseudo-Random Number Generation
Parallel computing has been touted as the pinnacle of high performance digital computing by many. However, many problems remain intractable using deterministic algorithms. Randomiz...
Chih Jeng Kenneth Tan