Skip to main navigation
Skip to search
Skip to main content
Illinois Experts Home
LOGIN & Help
Link opens in a new tab
Search content at Illinois Experts
Home
Profiles
Research units
Research & Scholarship
Datasets
Honors
Press/Media
Activities
Union of Random Minkowski Sums and Network Vulnerability Analysis
Pankaj K. Agarwal
,
Sariel Har-Peled
, Haim Kaplan
, Micha Sharir
Siebel School of Computing and Data Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Union of Random Minkowski Sums and Network Vulnerability Analysis'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Expected Complexity
100%
Descriptional Complexity
100%
Minkowski Sum
100%
Network Vulnerability Analysis
100%
Probability Density Function
50%
Disjoint
50%
Vulnerability
50%
Physical Attacks
50%
Real numbers
50%
Convex Polygon
50%
Convex Set
50%
Random Permutation
50%
Negative numbers
50%
Mathematics
Permutation
100%
Minkowski Sum
100%
Probability Density Function
50%
Polygon
50%
Convex Set
50%
Multiset
50%
Nonnegative Real Number
50%
Random Permutation
50%
Pairwise Disjoint
50%
Negative Number
50%