activity
20192026
most citedAlgorithms for Reconstructing DDoS Attack Graphs using Probabilistic Packet Marking

2 citations · 2 across the 7 of their papers we have counts for

collaborators

7 papers

math.ST2026

Power and Limits of Subset Selection in Statistical Estimation

Dina Barak-Pelleg, Daniel Berend

We study the power and limitations of subset selection in statistical estimation through the framework of \emph{super-teaching}, where a teacher selects a subset of i.i.d. data to…

math.CO2026

Fano Geometry and Slow Coupon Collecting

Dina Barak-Pelleg, Daniel Berend

We study the coupon collector's problem in a generalized setting where each draw reveals a fixed number of coupons and the sampling mechanism is required to be \emph{fair}, meaning…

math.PR2025

On Conjectures concerning the Labeled Coupon Collector Problem

Dina Barak-Pelleg, Daniel Berend

We study a labeled variant of the classical Coupon Collector Problem (CCP), recently introduced by Tan et al., where coupons arrive in groups and only the set of labels is revealed…

math.PR2023

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…

cs.CR2023★ 2 cited

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…

math.PR2020

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…

cs.DS2019

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…