Santiago Segarra
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
no series more than once — all 3 in the filters
on a stage with
all 19 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Heuristic Analysis from Source Code via Symbolic-Guided Optimization | NSDI '26 | 2026-05-04 |
MetaEase analyzes heuristic source code directly, using symbolic execution (KLEE) to generate seeds per code path and a duality-based gradient for the optimal… | ||
| Securing Public Cloud Networks with Efficient Role-based Micro-Segmentation | NSDI '25 | 2025-04-28 |
Introduces an end-to-end system, ZTS, that infers roles from large flow logs using contrastive learning with sparse labels to reach average ARRI ≈ 0.77 on real… | ||
| Finding Adversarial Inputs for Heuristics using Multi-level Optimization | 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) | 2024-04-16 |
MetaOpt is a solver-backed tool that encodes heuristics and an optimal baseline as a bilevel optimization, automatically rewrites inner problems into… | ||
| NetVigil: Robust and Low-Cost Anomaly Detection for East-West Data Center Security | 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) | 2024-04-16 |
NetVigil uses flow-level logs aggregated into IP-granularity communication graphs (300 vertices vs ~139k flow-vertex graphs) and a GNN autoencoder trained with… | ||
| Solving Max-Min Fair Resource Allocations Quickly on Large Graphs | 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI '24) | 2024-04-16 |
Converts the iterative max‑min fair solver into a single fast optimization by using epsilon weighting plus a sorting network, and introduces a multipath… | ||
| nothing matches | ||