ASCEND
BY NTHRYS
🎓

You are exploring a lot!

Register free to continue exploring ASCEND — access research frontiers, workshops, training modules and more.

Register Free →

NTHRYS › PhD Assistance › Theoretical Computer Science

Theoretical Computer Science

Field
▾
Category
▾

Theoretical Computer Science

Select a category to explore research frontiers

Quantum Algorithm Design and Complexity
Explore frontiers →
Approximation Algorithms for NP-Hard Problems
Explore frontiers →
Parameterized Complexity and Fixed-Parameter Tractability
Explore frontiers →
Interactive Proofs and Zero-Knowledge Systems
Explore frontiers →
Probabilistic Method and Derandomization
Explore frontiers →
Lower Bounds in Computational Complexity
Explore frontiers →
Boolean Function Analysis and Learning
Explore frontiers →
Cryptographic Protocols and Security Proofs
Explore frontiers →
Homomorphic Encryption and Secure Computation
Explore frontiers →
Lattice-Based Cryptography and Post-Quantum Security
Explore frontiers →
Algorithmic Game Theory and Mechanism Design
Explore frontiers →
Streaming Algorithms and Data Structure Design
Explore frontiers →
Distributed Computing and Consensus Protocols
Explore frontiers →
Complexity of Counting and Enumeration
Explore frontiers →
Satisfiability Solving and SAT Solver Theory
Explore frontiers →
Constraint Satisfaction Problem Algorithms
Explore frontiers →
Graph Algorithm Complexity and Hardness
Explore frontiers →
Dynamic Algorithms and Online Computation
Explore frontiers →
Sublinear Algorithms and Property Testing
Explore frontiers →
Computational Complexity of Learning Problems
Explore frontiers →
Algebraic Computation and Symbolic Computing
Explore frontiers →
Formal Methods and Program Verification
Explore frontiers →
Computational Topology and Persistent Homology
Explore frontiers →
Computational Geometry and Motion Planning
Explore frontiers →
Natural Language Processing and Parsing Theory
Explore frontiers →
Circuit Complexity and Boolean Circuit Lower Bounds
Explore frontiers →
Communication Complexity and Information Theory
Explore frontiers →
Query Complexity and Decision Tree Models
Explore frontiers →
Randomized Algorithms and Probabilistic Analysis
Explore frontiers →
Rewriting Systems and Term Rewriting Theory
Explore frontiers →
Automata Theory and Regular Languages
Explore frontiers →
Computability Theory and Turing Machines
Explore frontiers →
Descriptive Complexity and Logic-Based Characterization
Explore frontiers →
Fine-Grained Complexity and Conditional Hardness
Explore frontiers →
Pseudorandomness and Expander Graphs
Explore frontiers →
Spectral Methods and Linear Algebra Algorithms
Explore frontiers →
Hardness of Approximation and PCP Theorem
Explore frontiers →
Combinatorial Optimization and Polyhedral Methods
Explore frontiers →
Quantum Information Theory and Entanglement
Explore frontiers →
Computational Aspects of Optimization Problems
Explore frontiers →
Graph Isomorphism and Structure Recognition
Explore frontiers →
Matroid Theory and Combinatorial Structures
Explore frontiers →
Algebraic Methods in Algorithm Design
Explore frontiers →
Complexity of Machine Learning Algorithms
Explore frontiers →
Average-Case Complexity and Worst-Case Analysis
Explore frontiers →
Recursion Theory and Degrees of Unsolvability
Explore frontiers →
Subexponential Algorithms and ETH Framework
Explore frontiers →
Complexity in Continuous Models and Real Computation
Explore frontiers →
Information-Based Complexity and Optimal Algorithms
Explore frontiers →
Hyperbolicity and Graph Sparsification Techniques
Explore frontiers →
Temporal Logic and Model Checking
Explore frontiers →
Proof Complexity and Lower Bounds
Explore frontiers →
Approximation Hardness and Inapproximability
Explore frontiers →
Complexity of Algebraic Geometry
Explore frontiers →
Distributed Algorithm Design and Lower Bounds
Explore frontiers →
Metric Dimension and Graph Metrics
Explore frontiers →
Parameterized Approximation Algorithms
Explore frontiers →
Streaming Complexity Lower Bounds
Explore frontiers →
Stochastic Gradient Descent Theory
Explore frontiers →
Quantum Cryptography and Key Distribution
Explore frontiers →
Complexity of Sampling Problems
Explore frontiers →
Folklore Algorithms and Implicit Representation
Explore frontiers →
Algorithmic Aspects of Coding Theory
Explore frontiers →
Oracle Separation and Relativization
Explore frontiers →
Complexity of Network Flow Problems
Explore frontiers →
Average-Case Hardness and Planted Problems
Explore frontiers →
Algebraic Circuits and Depth Complexity
Explore frontiers →
Algorithmic Fairness and Bias Mitigation
Explore frontiers →
Complexity of Coalition Formation Games
Explore frontiers →
Holographic Algorithms and Matchgates
Explore frontiers →
Polynomial Time Approximation Schemes
Explore frontiers →
Complexity of Optimal Transport
Explore frontiers →
Cache-Oblivious Algorithm Design
Explore frontiers →
Tree Width and Graph Decomposition Methods
Explore frontiers →
Complexity Theory of Constraint Logic Programming
Explore frontiers →
Randomized Rounding and Semidefinite Programming
Explore frontiers →
Expander Graphs and Mixing Time Analysis
Explore frontiers →
Complexity of Subgraph Isomorphism Problems
Explore frontiers →
Parameterized Enumeration and Counting Algorithms
Explore frontiers →
Quantum Communication Complexity
Explore frontiers →
Complexity of Scheduling on Unrelated Machines
Explore frontiers →
Fourier Analysis and Noise Sensitivity
Explore frontiers →
Algorithmic Randomness and Kolmogorov Complexity
Explore frontiers →
Complexity of Equilibrium Computation
Explore frontiers →
Reachability Problems in Dynamical Systems
Explore frontiers →
Derandomization and Pseudo-Random Generators
Explore frontiers →
Complexity of Linear Programming and Interior Points
Explore frontiers →
Graph Sparsification and Spectral Approximation
Explore frontiers →
Symbolic Regression and Equation Discovery
Explore frontiers →
Complexity of Verification Problems
Explore frontiers →
Algorithmic Game Theory: Auction Design
Explore frontiers →
Branching Programs and Nondeterministic Complexity
Explore frontiers →
Approximation Algorithms for Clustering Problems
Explore frontiers →
Complexity of Graph Reconstruction and Isomorphism
Explore frontiers →
Quantum Supremacy and Complexity Separation
Explore frontiers →
Complexity of String Matching and Pattern Recognition
Explore frontiers →
Online Learning and Regret Bounds
Explore frontiers →
Distributed Ledger and Blockchain Protocols
Explore frontiers →
Fine-Grained Hardness from Computational Conjectures
Explore frontiers →
Complexity of Lifting and Variable Elimination
Explore frontiers →
Graph Neural Networks and Expressiveness
Explore frontiers →
Byzantine Fault Tolerance and Consensus
Explore frontiers →
Approximation Schemes and PTAS Development
Explore frontiers →
Tree Decomposition and Treewidth Methods
Explore frontiers →
Kernel Methods and Lower Bounds
Explore frontiers →
Quantum Error Correction and Fault Tolerance
Explore frontiers →
Sunflower Lemma and Combinatorial Bounds
Explore frontiers →
Oblivious Algorithms and Cache Optimality
Explore frontiers →
Branching Programs and Non-Uniform Computation
Explore frontiers →
Differential Privacy and Algorithmic Guarantees
Explore frontiers →
Metric Embedding and Dimensionality Reduction
Explore frontiers →
Algebraic Complexity of Polynomial Computations
Explore frontiers →
Combinatorial Auctions and Winner Determination
Explore frontiers →
Monotone and Monotone Arithmetic Circuits
Explore frontiers →
Complexity of Counting Paths and Cycles
Explore frontiers →
Derandomization via Conditional Expectations
Explore frontiers →
Fine-Grained Reductions and Equivalence Classes
Explore frontiers →
Sparse Recovery and Compressed Sensing Theory
Explore frontiers →
Complexity of Verification and Certificates
Explore frontiers →
Arithmetic Progressions and Ramsey Theory
Explore frontiers →
Robust Optimization and Adversarial Resilience
Explore frontiers →
Sorting Networks and Comparator Circuits
Explore frontiers →
Approximation Resistance and Optimal Hardness
Explore frontiers →
Polynomial Identity Testing and Algorithms
Explore frontiers →
Probabilistic Correctness and Monte Carlo Methods
Explore frontiers →
Clique and Independence Set Approximation
Explore frontiers →
Algebraic Circuits and Skew Circuits
Explore frontiers →
Complexity of Linear Programming Pivoting Rules
Explore frontiers →
Threshold Functions and Juntas
Explore frontiers →
Complexity of Graph Decompositions
Explore frontiers →
Holographic Algorithms and Quantum Computation
Explore frontiers →
Noise Sensitivity and Majority Functions
Explore frontiers →
Complexity of Neural Network Training
Explore frontiers →
Expander Codes and Error Correction
Explore frontiers →
Vertex Separator and Balanced Partition Algorithms
Explore frontiers →
Randomness Extraction and Pseudo-Entropy
Explore frontiers →
Computational Aspects of Convex Geometry
Explore frontiers →
Complexity of Network Design Problems
Explore frontiers →
Lifting Theorems and Communication Bounds
Explore frontiers →
Distributed Algorithms and Lower Bounds
Explore frontiers →
Complexity of Satisfiability Under Restrictions
Explore frontiers →
Natural Proofs and Barriers to Lower Bounds
Explore frontiers →
Approximation Algorithms for Scheduling
Explore frontiers →
Witness-Indistinguishability and Extractability
Explore frontiers →
Complexity of Graph Coloring and Chromatic Numbers
Explore frontiers →
Algorithmic Coding Theory and Decoding
Explore frontiers →
Complexity of Integer Linear Programming
Explore frontiers →
Temporal Logic and Model Checking Algorithms
Explore frontiers →
Proof Complexity and Automated Theorem Proving
Explore frontiers →
Type Theory and Dependent Type Systems
Explore frontiers →
Lambda Calculus and Functional Programming Semantics
Explore frontiers →
Partial Evaluation and Program Specialization
Explore frontiers →
Reversible Computing and Conservative Logic
Explore frontiers →
Petri Nets and Concurrent System Verification
Explore frontiers →
Process Algebra and Behavioral Equivalences
Explore frontiers →
Markov Decision Processes and Stochastic Games
Explore frontiers →
Tiling and Wang Tiles Computational Properties
Explore frontiers →
Cellular Automata and Self-Organizing Systems
Explore frontiers →
Abstract State Machines and Algorithmic Specification
Explore frontiers →
Molecular Computing and DNA-Based Algorithms
Explore frontiers →
Optical Computing and Photonic Algorithm Design
Explore frontiers →
Natural Computation and Bio-Inspired Algorithms
Explore frontiers →
Game Tree Complexity and Perfect Information Games
Explore frontiers →
Kolmogorov Complexity and Algorithmic Information Theory
Explore frontiers →
Complexity of Geometric Problems and Exact Computing
Explore frontiers →
Distributed Algorithms and Fault Tolerance
Explore frontiers →
Complexity of Numerical Computation and Approximation
Explore frontiers →
Membership and Covering Complexity in Combinatorics
Explore frontiers →
Integer Linear Programming and Branch-and-Bound Methods
Explore frontiers →
Matching Theory and Network Flow Algorithms
Explore frontiers →
Prefix-Free Codes and Information Compression
Explore frontiers →
Sorting Networks and Comparison-Based Complexity
Explore frontiers →
Algebraic Complexity and Arithmetic Circuits
Explore frontiers →
Transducers and Sequential Machines Theory
Explore frontiers →
Complexity Classes and Separations Hierarchy
Explore frontiers →
Randomized Rounding and Linear Programming Relaxations
Explore frontiers →
Scheduling and Load Balancing Approximations
Explore frontiers →
Covering and Packing Problems in Approximation
Explore frontiers →
Clustering Algorithms and Approximation Quality
Explore frontiers →
Streaming Graph Algorithms and Sketching
Explore frontiers →
Sparse Graphs and Spanner Construction
Explore frontiers →
Tree Decompositions and Branch-Width Algorithms
Explore frontiers →
Counting Complexity and Sharp-P
Explore frontiers →
Expander Mixing and Spectral Graph Theory
Explore frontiers →
Hardness of Approximation via Gap Problems
Explore frontiers →
Constraint Logic Programming and Resolution
Explore frontiers →
Data Structure Lower Bounds via Communication
Explore frontiers →
Median Computation and Order Statistics Complexity
Explore frontiers →
Reachability in Directed Graphs and Transitive Closure
Explore frontiers →
Average-Case Hardness and Planted Problem Complexity
Explore frontiers →
Complexity of Boolean Satisfiability and Extensions
Explore frontiers →
String Matching Algorithms and Pattern Recognition
Explore frontiers →
Knapsack Problems and Pseudo-Polynomial Algorithms
Explore frontiers →
Temporal Logic and Model Checking for Reactive Systems
Explore frontiers →
Matrix Chain Multiplication and Dynamic Programming
Explore frontiers →
Parameterized Approximation and Kernelization Techniques
Explore frontiers →
Steiner Trees and Network Design Optimization
Explore frontiers →
Implicit Computational Complexity and Recurrence Relations
Explore frontiers →
Distributed Graph Algorithms and Network Locality
Explore frontiers →
Metric Embeddings and Distortion Bounds
Explore frontiers →