NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field

▾

Algorithm Design Complexity

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Online Algorithm Analysis and Competitive Ratio

Analysis of algorithms that make irrevocable decisions without future knowledge, measuring performance through competitive analysis against optimal offline solutions.

Adaptive Adversaries and Non-Oblivious Competitive Barriers

Smoothed Competitive Analysis Beyond Worst-Case Bounds

Learning-Augmented Online Algorithms with Prediction Error

Competitive Ratios in Distributed and Asynchronous Systems

Polyhedral Methods for Tight Competitive Analysis

Online Optimization with Advice and Information Gaps

Randomization Barriers in Competitive Online Problems

Strategic Adversaries and Mechanism Design for Online Algorithms

Competitive Analysis of Streaming Algorithms with Limited Memory

Fair Division and Competitiveness in Sequential Allocation

All Algorithm Design & Complexity PhD categories