50 citations · 69 across the 17 of their papers we have counts for
19 papers
Simultaneous visibility in the integer lattice
Daniel Berend, Rishi Kumar, Andrew Pollington
Two lattice points are visible from one another if there is no lattice point on the open line segment joining them. Let be a finite subset of . The asymptotic den…
The Time for Reconstructing the Attack Graph in DDoS Attacks
Dina Barak-Pelleg, Daniel Berend
Despite their frequency, denial-of-service (DoS\blfootnote{Denial of Service (DoS), Distributed Denial of Service (DDoS), Probabilistic Packet Marking (PPM), coupon collector's pro…
Algorithms for Reconstructing DDoS Attack Graphs using Probabilistic Packet Marking
Dina Barak-Pelleg, Daniel Berend, Thomas J. Robinson +1
DoS and DDoS attacks are widely used and pose a constant threat. Here we explore Probability Packet Marking (PPM), one of the important methods for reconstructing the attack-graph…
Maximum of Exponential Random Variables, Hurwitz's Zeta Function, and the Partition Function
Dina Barak-Pelleg, Daniel Berend, Grigori Kolesnik
A natural problem in the context of the coupon collector's problem is the behavior of the maximum of independent geometrically distributed random variables (with distinct parameter…
On Biased Random Walks, Corrupted Intervals, and Learning Under Adversarial Design
Daniel Berend, Aryeh Kontorovich, Lev Reyzin +1
We tackle some fundamental problems in probability theory on corrupted random processes on the integer line. We analyze when a biased random walk is expected to reach its bottommos…
A Model of Random Industrial SAT
Dina Barak-Pelleg, Daniel Berend, J. C. Saunders
One of the most studied models of SAT is random SAT. In this model, instances are composed from clauses chosen uniformly randomly and independently of each other. This model may be…