Pooria Namyar
where else to find them
what they talk about
all 5 in the filters
where they keep going back
no series more than once — all 3 in the filters
on a stage with
all 18 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… | ||
| Enhancing Network Failure Mitigation with Performance-Aware Ranking | NSDI '25 | 2025-04-28 |
Swarm ranks mitigation actions by directly estimating end-to-end flow metrics using fast approximations: epoched traffic samples, splitting short/long flows… | ||
| Everything Matters in Programmable Packet Scheduling | NSDI '25 | 2025-04-28 |
Presents PACKS, a quantile-based admission and queue-mapping design that approximates both PIFO queues scheduling and admission behaviors using a… | ||
| 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… | ||
| 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 | ||