ASCEND
BY NTHRYS

NTHRYS › PhD Assistance › Algorithm Design Complexity

Algorithm Design Complexity

Field
▾
Category
▾

Algorithm Design Complexity

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Streaming Algorithms with Limited Memory

Design of space-efficient algorithms for processing data streams where only one or few passes over data are permitted.

Sketching Non-Euclidean Metrics in Single-Pass Streams
Adversarial Robustness Under Memory-Constrained Streaming
Temporal Locality in Sublinear Data Structure Maintenance
Approximation Gaps in Space-Optimal Graph Algorithms
Distributed Streaming with Information-Theoretic Bottlenecks
Adaptive Sampling for Heavy-Tailed Data Streams
Memory-Aware Trade-offs in Continuous Query Processing
Streaming Algorithms for Sparse High-Dimensional Geometry
Quantum-Classical Hybrid Streaming Under Space Constraints
Lower Bounds for Randomized Sketching in Dynamic Graphs

All Algorithm Design & Complexity PhD categories