ERD

Periodic Reporting for period 2 - DistOpt-BydWorstCase (Distributed Optimization Beyond Worst-Case Topologies)

Project: DistOpt-BydWorstCase

Updated at: 31-05-2024

Show more information

Project acronym DistOpt-BydWorstCase

Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Undirected (1+epsilon)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Optimally Resilient Codes for List-Decoding from Insertions and Deletions

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Interactive Coding with Small Memory

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Tree Embeddings for Hop-Constrained Network Design

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Optimally Resilient Codes for List-Decoding From Insertions and Deletions

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Sparse Semi-Oblivious Routing: Few Random Paths Suffice

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Network Coding Gaps for Completion Times of Multiple Unicasts

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Hop-Constrained Oblivious Routing

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Fully Dynamic Consistent k-Center Clustering

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Fault-Tolerant Spanners against Bounded-Degree Edge Failures

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Computation-Aware Data Aggregation

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Synchronization Strings and Codes for Insertions and Deletions - a Survey

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Circuits Resilient to Short-Circuit Errors

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Near-Optimal Schedules for Simultaneous Multicasts

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

A Simple Deterministic Distributed Low-Diameter Clustering

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Writeback Aware Caching

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Improved Distributed Network Decomposition, Hitting Sets, and Spanners via Derandomization

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Hop-Constrained Expander Decompositions, Oblivious Routing, and Distributed Universal Optimality

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Low-Congestion Shortcuts for Graphs Excluding Dense Minors

Project: DistOpt-BydWorstCase

Updated at: 27-04-2024

Show more information

Project acronym DistOpt-BydWorstCase

Resources

Selected filters:

Periodic Reporting for period 2 - DistOpt-BydWorstCase (Distributed Optimization Beyond Worst-Case Topologies)

Rate-Distance Trade-offs for List-Decodable Insertion-Deletion Codes

Undirected (1+epsilon)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms

Optimally Resilient Codes for List-Decoding from Insertions and Deletions

Interactive Coding with Small Memory

Tree Embeddings for Hop-Constrained Network Design

Optimally Resilient Codes for List-Decoding From Insertions and Deletions

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances

Maximum Length-Constrained Flows and Disjoint Paths: Distributed, Deterministic, and Fast

Sparse Semi-Oblivious Routing: Few Random Paths Suffice

Network Coding Gaps for Completion Times of Multiple Unicasts

Hop-Constrained Oblivious Routing

Fully Dynamic Consistent k-Center Clustering

Fault-Tolerant Spanners against Bounded-Degree Edge Failures

Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and Parallel Applications

Computation-Aware Data Aggregation

Synchronization Strings and Codes for Insertions and Deletions - a Survey

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Circuits Resilient to Short-Circuit Errors

Near-Optimal Schedules for Simultaneous Multicasts

Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound

A Simple Deterministic Distributed Low-Diameter Clustering

Writeback Aware Caching

Efficient Linear and Affine Codes for Correcting Insertions/Deletions

Improved Distributed Network Decomposition, Hitting Sets, and Spanners via Derandomization

Hop-Constrained Expander Decompositions, Oblivious Routing, and Distributed Universal Optimality

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing

Low-Congestion Shortcuts for Graphs Excluding Dense Minors