Sciweavers

13214 search results - page 22 / 2643
» Pseudorandomness for network algorithms
Sort
View
WDAG
2005
Springer
101views Algorithms» more  WDAG 2005»
15 years 11 months ago
Keeping Denial-of-Service Attackers in the Dark
Abstract. We consider the problem of overcoming (Distributed) Denial of Service (DoS) attacks by realistic adversaries that can eavesdrop on messages, or parts thereof, but with so...
Gal Badishi, Amir Herzberg, Idit Keidar
ICRA
2003
IEEE
119views Robotics» more  ICRA 2003»
15 years 10 months ago
Incremental low-discrepancy lattice methods for motion planning
We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the increme...
Stephen R. Lindemann, Steven M. LaValle
147
Voted
AAECC
1990
Springer
100views Algorithms» more  AAECC 1990»
15 years 9 months ago
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
15 years 7 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan
137
Voted
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
15 years 7 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu