No article text was recorded for this version.
adaptive adversary robustness (oblivious adversary assumption)
Version 2 of 2214 papers305 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Fully-Dynamic Graph Sparsifiers Against an Adaptive Adversary
- Blog: Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
- Blog: Fully Dynamic Adversarially Robust Correlation Clustering in Polylogarithmic Update Time
- Blog: Separations between Oblivious and Adaptive Adversaries for Natural Dynamic Graph Problems
- Blog: On Robust Streaming for Learning with Experts: Algorithms and Lower Bounds
- Blog: Decremental (1+ε)-Approximate Maximum Eigenvector: Dynamic Power Method
- Blog: Efficient Centroid-Linkage Clustering
- Blog: Fully Dynamic Consistent k-Center Clustering
- Blog: Dynamic Maxflow via Dynamic Interior Point Methods
- Blog: Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time
- Blog: Bloom Filters in Adversarial Environments
- Blog: A New Deterministic Algorithm for Dynamic Set Cover
- Blog: Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary
- Blog: Optimal Fully Dynamic k-Center Clustering for Adaptive and Oblivious Adversaries
- Blog: Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds
- Blog: On the Robustness of CountSketch to Adaptive Inputs
- Blog: Relaxed Models for Adversarial Streaming: The Advice Model and the Bounded Interruptions Model
- Blog: Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
- Blog: Dynamic Matching with Better-than-2 Approximation in Polylogarithmic Update Time
- Blog: Differentially Private Continual Release with Relative Error
- Blog: Adversarially Robust Streaming Algorithms via Differential Privacy
- Blog: Fully Dynamic Embedding into ℓp Spaces
- Blog: Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
- Blog: Streaming Algorithms for Learning with Experts: Deterministic Versus Robust
- Blog: Leveraging Well-Conditioned Bases: Streaming \& Distributed Summaries in Minkowski p-Norms
- Blog: A Strong Separation for Adversarially Robust ℓ0 Estimation for Linear Sketches
- Blog: Constructing Light Spanners Deterministically in Near-Linear Time
- Blog: Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers
- Blog: Fully Dynamic Euclidean k-Means
- Blog: Simple Algorithms for Fully Dynamic Edge Connectivity
- Blog: Robust Streaming, Sampling, and a Perspective on Online Learning
- Blog: Fully Dynamic k-Center Clustering in Doubling Metrics
- Blog: Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in $O(1)$ Amortized Update Time
- Blog: The Predicted-Updates Dynamic Model: Offline, Incremental, and Decremental to Fully Dynamic Transformations
- Blog: Adversarially Robust Distributed Count Tracking via Partial Differential Privacy
- Blog: New Deterministic Approximation Algorithms for Fully Dynamic Matching
- Blog: Decremental Matching in General Graphs
- Blog: A Strong Separation for Adversarially Robust $\ell_0$ Estimation for Linear Sketches
- Blog: Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach
- Blog: Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
- Blog: Optimal Decremental Connectivity in Non-Sparse Graphs
- Blog: Adversarially Robust Dense-Sparse Tradeoffs via Heavy-Hitters
- Blog: Dynamic Maximal Matching in Clique Networks
- Blog: Dynamic High-Dimensional Facility Location with Low Recourse
- Blog: Deterministic Rounding of Dynamic Fractional Matchings
- Blog: Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
- Blog: Light Agents Searching for Hot Information
- Blog: A Simple Algorithm for Dynamic Carpooling with Recourse
- Blog: Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
- Blog: Fully Dynamic (Δ+1)-Coloring in Constant Update Time
- Blog: Incremental SSSP for Sparse Digraphs Beyond the Hopset Barrier
- Blog: A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and their Applications
- Blog: Adaptively Robust Resettable Streaming
- Blog: Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
- Blog: A Framework for Adversarially Robust Streaming Algorithms
- Blog: Fully Dynamic Matching: Beating 2-Approximation in Δε Update Time
- Blog: Dynamic Connectivity in Disk Graphs
- Blog: Dynamic Algorithms for Maximum Matching Size
- Blog: Dynamic Kernel Sparsifiers
- Blog: Deterministic Online Bipartite Edge Coloring
Showing 60 of 214 papers.
History & citation
Current · Permanent link
- Adaptively Robust Data Sketching merged into this direction (68% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_adaptive_adversary_robustness_oblivious__9e9f2cb9,
title = {adaptive adversary robustness (oblivious adversary assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/adaptive-adversary-robustness-oblivious-adversary-assumption/rdr_9e9f2cb9122a42349e22f39a49747849},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 2, frozen text):
@misc{lacuna_adaptive_adversary_robustness_oblivious__9e9f2cb9_v2,
title = {adaptive adversary robustness (oblivious adversary assumption)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/adaptive-adversary-robustness-oblivious-adversary-assumption/rdr_9e9f2cb9122a42349e22f39a49747849/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-22},
}