Sciweavers

18 search results - page 2 / 4
» Generating a Random Sink-free Orientation in Quadratic Time
Sort
View
PODC
2011
ACM
12 years 7 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
13 years 8 months ago
Cryptanalysis of the Stream Cipher DECIM
DECIM is a hardware oriented stream cipher with an 80-bit key and a 64-bit IV. In this paper, we point out two serious flaws in DECIM. One flaw is in the initialization of DECIM. I...
Hongjun Wu, Bart Preneel
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 5 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
GECCO
2009
Springer
162views Optimization» more  GECCO 2009»
13 years 9 months ago
TestFul: using a hybrid evolutionary algorithm for testing stateful systems
This paper introduces TestFul, a framework for testing stateful systems and focuses on object-oriented software. TestFul employs a hybrid multi-objective evolutionary algorithm, t...
Matteo Miraz, Pier Luca Lanzi, Luciano Baresi
ICRA
2000
IEEE
117views Robotics» more  ICRA 2000»
13 years 9 months ago
Kinodynamic Motion Planning Amidst Moving Obstacles
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
Robert Kindel, David Hsu, Jean-Claude Latombe, Ste...