Theoretical Computer Science

Quantum Algorithm Design and Complexity

Studies the design and analysis of quantum algorithms and their computational complexity advantages over classical approaches.

RESEARCH GAP FRONTIERS

Approximation Algorithms for NP-Hard Problems

Develops polynomial-time algorithms that produce near-optimal solutions for computationally intractable optimization problems.

RESEARCH GAP FRONTIERS

Parameterized Complexity and Fixed-Parameter Tractability

Analyzes computational complexity with respect to multiple parameters beyond input size to identify tractable problem instances.

RESEARCH GAP FRONTIERS

Interactive Proofs and Zero-Knowledge Systems

Investigates verification protocols where a prover convinces a verifier of a claim without revealing underlying information.

RESEARCH GAP FRONTIERS

Probabilistic Method and Derandomization

Explores constructive and non-constructive probabilistic techniques for proving existence of combinatorial objects and their deterministic alternatives.

RESEARCH GAP FRONTIERS

Lower Bounds in Computational Complexity

Establishes fundamental barriers on the resources required to solve specific computational problems across various models.

RESEARCH GAP FRONTIERS

Boolean Function Analysis and Learning

Studies structural properties of Boolean functions including Fourier analysis, learning theory, and circuit complexity.

RESEARCH GAP FRONTIERS

Cryptographic Protocols and Security Proofs

Designs and analyzes formal security models and cryptographic constructions with provable guarantees against adversaries.

RESEARCH GAP FRONTIERS

Homomorphic Encryption and Secure Computation

Develops encryption schemes enabling computation on encrypted data and protocols for multi-party secure function evaluation.

Lattice-Based Cryptography and Post-Quantum Security

Investigates cryptographic primitives based on hard lattice problems that remain secure against quantum adversaries.

Algorithmic Game Theory and Mechanism Design

Analyzes strategic interaction between agents and designs mechanisms that incentivize truthful behavior while optimizing outcomes.

Streaming Algorithms and Data Structure Design

Develops algorithms for processing massive data streams using sublinear space while maintaining approximation guarantees.

Distributed Computing and Consensus Protocols

Studies synchronization, fault tolerance, and agreement problems in distributed systems with communication constraints.

Complexity of Counting and Enumeration

Analyzes the hardness of counting solutions and enumerating combinatorial structures including sharp-P and #P-completeness.

Satisfiability Solving and SAT Solver Theory

Develops theoretical foundations and algorithms for Boolean satisfiability including resolution proofs and backtracking techniques.

Constraint Satisfaction Problem Algorithms

Studies the algorithmic and structural aspects of constraint satisfaction problems including parameterized approaches and algebraic methods.

Graph Algorithm Complexity and Hardness

Analyzes computational complexity of graph problems and designs efficient algorithms for specific graph classes.

Dynamic Algorithms and Online Computation

Studies algorithms that maintain solutions efficiently under continuous updates and decisions made without future information.

Sublinear Algorithms and Property Testing

Develops algorithms using substantially less than linear time or space to approximate properties and distinguish between problem instances.

Computational Complexity of Learning Problems

Investigates computational hardness of learning tasks including sample complexity, PAC learning, and learning from queries.

Algebraic Computation and Symbolic Computing

Studies the complexity of polynomial computation, solving polynomial equations, and algebraic circuit models.

Formal Methods and Program Verification

Develops formal techniques for proving correctness of programs including theorem proving, model checking, and temporal logic.

Computational Topology and Persistent Homology

Analyzes algorithms for computing topological invariants and develops efficient persistent homology computation methods.

Computational Geometry and Motion Planning

Studies algorithmic solutions to geometric problems including path planning, collision detection, and geometric optimization.

Natural Language Processing and Parsing Theory

Investigates formal language theory and complexity of parsing natural language with various grammar formalisms.

Circuit Complexity and Boolean Circuit Lower Bounds

Establishes fundamental limits on the size and depth of Boolean circuits computing specific functions.

Communication Complexity and Information Theory

Analyzes the amount of communication required to compute functions and information-theoretic lower bounds on protocols.

Query Complexity and Decision Tree Models

Studies the minimum number of queries needed to solve problems and analyzes decision tree complexity models.

Randomized Algorithms and Probabilistic Analysis

Designs and analyzes randomized algorithms with guarantees on expected performance and concentration bounds.

Rewriting Systems and Term Rewriting Theory

Studies abstract properties of term rewriting systems including termination, confluence, and computational power.

Automata Theory and Regular Languages

Analyzes expressiveness and decidability properties of various automata models and their corresponding language classes.

Computability Theory and Turing Machines

Investigates fundamental limits of computation, halting problem variants, and degrees of unsolvability.

Descriptive Complexity and Logic-Based Characterization

Characterizes complexity classes using logical systems and studies connections between expressiveness and computational power.

Fine-Grained Complexity and Conditional Hardness

Establishes conditional hardness results based on widely-believed conjectures about the complexity of core problems.

Pseudorandomness and Expander Graphs

Develops pseudorandom objects, constructs expander graphs, and analyzes applications in derandomization and algorithms.

Spectral Methods and Linear Algebra Algorithms

Studies eigenvalue-based techniques, matrix factorization algorithms, and spectral graph theory applications.

Hardness of Approximation and PCP Theorem

Proves inapproximability results for optimization problems using probabilistically checkable proofs and gap problems.

Combinatorial Optimization and Polyhedral Methods

Studies polytopes associated with optimization problems and develops branch-and-cut algorithms using cutting planes.

Quantum Information Theory and Entanglement

Analyzes quantum communication complexity, entanglement measures, and quantum information processing fundamentals.

Computational Aspects of Optimization Problems

Analyzes computational complexity and algorithms for continuous optimization including convex and non-convex problems.

Graph Isomorphism and Structure Recognition

Studies the complexity of graph isomorphism testing and algorithms for recognizing specific graph structures.

Matroid Theory and Combinatorial Structures

Develops algorithmic theory of matroids and generalizations including matroid optimization and intersection problems.

Algebraic Methods in Algorithm Design

Applies algebraic and geometric techniques to design efficient algorithms for combinatorial and algebraic problems.

Complexity of Machine Learning Algorithms

Analyzes computational barriers to training neural networks, sample complexity, and optimization landscape hardness.

Average-Case Complexity and Worst-Case Analysis

Studies behavior of algorithms on typical inputs versus adversarial inputs and average-case hardness assumptions.

Recursion Theory and Degrees of Unsolvability

Investigates Turing degrees, jump operators, and hierarchies of computability within the degrees of unsolvability.

Subexponential Algorithms and ETH Framework

Designs algorithms running in subexponential time and studies implications of the exponential time hypothesis.

Complexity in Continuous Models and Real Computation

Analyzes computational complexity in models over real numbers including Blum-Shub-Smale machines.

Information-Based Complexity and Optimal Algorithms

Studies optimal algorithms for problems where information about inputs is revealed through queries or oracles.

Hyperbolicity and Graph Sparsification Techniques

Develops algorithms for sparse graph approximation, cut-based sparsification, and spectral sparsification methods.

Temporal Logic and Model Checking

Investigates automated verification of concurrent systems using temporal logics like LTL and CTL to ensure correctness properties hold throughout system execution.

Proof Complexity and Lower Bounds

Studies the length and depth of formal proofs in various proof systems to understand fundamental limits of automated theorem proving.

Approximation Hardness and Inapproximability

Characterizes which optimization problems resist approximation algorithms beyond certain thresholds using PCP-based hardness reductions.

Complexity of Algebraic Geometry

Analyzes computational complexity of solving polynomial equations and geometric problems in algebraic varieties.

Distributed Algorithm Design and Lower Bounds

Develops efficient algorithms for distributed systems and establishes fundamental communication and synchronization barriers.

Metric Dimension and Graph Metrics

Studies computational aspects of determining metric generators in graphs and related distance-based structural properties.

Parameterized Approximation Algorithms

Combines parameterized complexity with approximation theory to design algorithms with bounds on multiple complexity measures.

Streaming Complexity Lower Bounds

Establishes space and time lower bounds for single-pass algorithms processing massive data streams.

Stochastic Gradient Descent Theory

Analyzes convergence rates and optimization landscape properties of SGD in machine learning contexts.

Quantum Cryptography and Key Distribution

Studies security properties of quantum key distribution protocols and quantum-resistant cryptographic constructions.

Complexity of Sampling Problems

Investigates computational hardness of approximating probability distributions and sampling from complex combinatorial structures.

Folklore Algorithms and Implicit Representation

Develops algorithms operating on implicitly represented objects without explicitly constructing large data structures.

Algorithmic Aspects of Coding Theory

Studies efficient decoding algorithms for error-correcting codes and their complexity-theoretic limitations.

Oracle Separation and Relativization

Constructs oracle models demonstrating polynomial hierarchy separations and limitations of proof techniques.

Complexity of Network Flow Problems

Develops optimal algorithms for maximum flow, minimum cost flow, and variants in dynamic and general settings.

Average-Case Hardness and Planted Problems

Analyzes computational hardness of random instances and planted problem variants as foundations for cryptography.

Algebraic Circuits and Depth Complexity

Studies the depth and size of algebraic circuits computing multivariate polynomials over various fields.

Algorithmic Fairness and Bias Mitigation

Analyzes algorithmic mechanisms for ensuring fair outcomes and detecting implicit bias in decision-making systems.

Complexity of Coalition Formation Games

Studies computational hardness of computing stable coalitions and determining game-theoretic solution concepts.

Holographic Algorithms and Matchgates

Applies matchgate theory and holographic reductions to efficiently compute weighted sums over constraint satisfaction instances.

Polynomial Time Approximation Schemes

Develops PTAS and FPTAS algorithms for optimization problems and characterizes approximation boundaries.

Complexity of Optimal Transport

Investigates computational aspects of computing Wasserstein distances and optimal transport plans efficiently.

Cache-Oblivious Algorithm Design

Designs algorithms that adapt automatically to unknown memory hierarchies achieving near-optimal performance.

Tree Width and Graph Decomposition Methods

Applies tree decomposition techniques to solve NP-hard problems on restricted graph classes efficiently.

Complexity Theory of Constraint Logic Programming

Analyzes decidability and complexity of constraint satisfaction in logic programming frameworks.

Randomized Rounding and Semidefinite Programming

Develops approximation algorithms by rounding solutions to linear and semidefinite programming relaxations.

Expander Graphs and Mixing Time Analysis

Studies spectral properties of expanders and analyzes convergence rates of random walks for applications.

Complexity of Subgraph Isomorphism Problems

Investigates hardness and algorithms for detecting subgraph patterns in large graphs.

Parameterized Enumeration and Counting Algorithms

Studies efficient enumeration of solutions to problems with structural parameters.

Quantum Communication Complexity

Analyzes communication requirements for computing functions using quantum protocols and quantum entanglement.

Complexity of Scheduling on Unrelated Machines

Develops approximation algorithms for NP-hard scheduling problems on heterogeneous computing resources.

Fourier Analysis and Noise Sensitivity

Studies Fourier spectrum of Boolean functions and their robustness to input perturbations and noise.

Algorithmic Randomness and Kolmogorov Complexity

Analyzes incompressibility and algorithmic randomness of sequences in computational frameworks.

Complexity of Equilibrium Computation

Studies computational hardness of finding Nash equilibria in various classes of games.

Reachability Problems in Dynamical Systems

Analyzes computability and complexity of determining state reachability in continuous and hybrid systems.

Derandomization and Pseudo-Random Generators

Converts randomized algorithms to deterministic ones using pseudo-random number generators and hardness assumptions.

Complexity of Linear Programming and Interior Points

Analyzes iterations and arithmetic complexity of interior point methods for linear and convex optimization.

Graph Sparsification and Spectral Approximation

Constructs sparse subgraphs preserving spectral and connectivity properties of original graphs.

Symbolic Regression and Equation Discovery

Develops algorithms for automatically inferring mathematical equations from observational data.

Complexity of Verification Problems

Studies hardness of verifying properties of computational objects and formal systems.

Algorithmic Game Theory: Auction Design

Designs truthful mechanisms and analyzes strategic behavior in auction and allocation systems.

Branching Programs and Nondeterministic Complexity

Studies computational models of branching programs and their lower bounds for decision problems.

Approximation Algorithms for Clustering Problems

Develops polynomial-time approximation algorithms for k-means, k-center, and facility location variants.

Complexity of Graph Reconstruction and Isomorphism

Analyzes hardness of reconstructing graphs from local information and determining structural equivalence.

Quantum Supremacy and Complexity Separation

Studies concrete problems demonstrating quantum computational advantage over classical computers.

Complexity of String Matching and Pattern Recognition

Develops optimal algorithms for substring searching, sequence alignment, and pattern discovery.

Online Learning and Regret Bounds

Analyzes convergence rates and strategy-dependent regret guarantees in online decision-making problems.

Distributed Ledger and Blockchain Protocols

Analyzes safety and liveness properties of consensus protocols in decentralized and Byzantine settings.

Fine-Grained Hardness from Computational Conjectures

Establishes conditional hardness results based on SETH, OVH, and other computational conjectures.

Complexity of Lifting and Variable Elimination

Studies automated reasoning through systematic variable elimination and resolution-based proof generation.

Graph Neural Networks and Expressiveness

Investigates the computational power and expressive limitations of graph neural networks through the lens of graph isomorphism and Weisfeiler-Lehman tests.

Byzantine Fault Tolerance and Consensus

Studies distributed algorithms that achieve agreement among nodes under adversarial failures and their information-theoretic lower bounds.

Approximation Schemes and PTAS Development

Develops polynomial-time approximation schemes and quasi-polynomial approximation algorithms for computationally hard optimization problems.

Tree Decomposition and Treewidth Methods

Explores algorithmic techniques based on tree decompositions, treewidth, and pathwidth for solving NP-hard problems on restricted graph classes.

Kernel Methods and Lower Bounds

Studies polynomial kernelization and kernel lower bounds for parameterized problems under complexity-theoretic assumptions.

Quantum Error Correction and Fault Tolerance

Analyzes theoretical foundations of quantum error correcting codes and fault-tolerant quantum computation with complexity implications.

Sunflower Lemma and Combinatorial Bounds

Explores applications and extensions of the sunflower lemma and combinatorial structures in proving tight complexity bounds.

Oblivious Algorithms and Cache Optimality

Studies algorithms that achieve optimal performance without knowledge of memory hierarchies and analyzes cache-oblivious computational models.

Branching Programs and Non-Uniform Computation

Analyzes computational power and limitations of branching programs, decision diagrams, and non-uniform circuits.

Differential Privacy and Algorithmic Guarantees

Studies privacy-preserving algorithms and the fundamental trade-offs between privacy, utility, and computational complexity.

Metric Embedding and Dimensionality Reduction

Develops algorithms for embedding metrics into low-dimensional spaces with complexity analysis of distortion bounds.

Algebraic Complexity of Polynomial Computations

Studies arithmetic circuit complexity, depth-width tradeoffs, and lower bounds for polynomial computation over algebraic models.

Combinatorial Auctions and Winner Determination

Analyzes computational complexity and approximation algorithms for determining winners in combinatorial auctions.

Monotone and Monotone Arithmetic Circuits

Investigates complexity of monotone functions and monotone arithmetic circuits with applications to lower bounds.

Complexity of Counting Paths and Cycles

Studies #P-completeness and approximation algorithms for counting combinatorial structures like paths, cycles, and matchings.

Derandomization via Conditional Expectations

Explores techniques for converting randomized algorithms to deterministic ones with analysis of derandomization methods.

Fine-Grained Reductions and Equivalence Classes

Studies conditional hardness via fine-grained reductions under hypotheses like SETH and develops new equivalence classes.

Sparse Recovery and Compressed Sensing Theory

Analyzes algorithms for signal recovery from minimal measurements with information-theoretic and computational bounds.

Complexity of Verification and Certificates

Studies the complexity of verifying proofs, certificates, and solutions with applications to NP and beyond.

Arithmetic Progressions and Ramsey Theory

Explores algorithmic aspects of finding arithmetic progressions and computational Ramsey theory with hardness results.

Robust Optimization and Adversarial Resilience

Studies algorithms for optimization under uncertainty and adversarial perturbations with complexity analysis.

Sorting Networks and Comparator Circuits

Analyzes depth and size of sorting networks, comparator circuits, and their applications to circuit complexity.

Approximation Resistance and Optimal Hardness

Studies optimization problems that resist approximation and establishes optimal hardness ratios via PCP-based techniques.

Polynomial Identity Testing and Algorithms

Develops deterministic and randomized algorithms for testing polynomial identities with lower bounds and derandomization.

Probabilistic Correctness and Monte Carlo Methods

Analyzes probability amplification, Monte Carlo algorithms, and correctness guarantees for randomized computation.

Clique and Independence Set Approximation

Studies hardness of approximation and algorithms for maximum clique and independence set in graphs.

Algebraic Circuits and Skew Circuits

Investigates non-commutative and skew polynomial computations with complexity lower bounds and circuit characterizations.

Complexity of Linear Programming Pivoting Rules

Analyzes worst-case complexity of simplex algorithm variants and smoothed complexity of pivoting rule selections.

Threshold Functions and Juntas

Studies properties, learning algorithms, and complexity of threshold functions and juntas over Boolean variables.

Complexity of Graph Decompositions

Analyzes computational complexity of finding graph decompositions including path covers, edge colorings, and vertex partitions.

Holographic Algorithms and Quantum Computation

Studies holographic reduction techniques and connections to quantum algorithms via Pfaffian computations.

Noise Sensitivity and Majority Functions

Analyzes noise sensitivity of Boolean functions and properties of majority-based computation with applications to hardness.

Complexity of Neural Network Training

Studies computational hardness of training neural networks and approximation guarantees for gradient-based methods.

Expander Codes and Error Correction

Develops efficient error-correcting codes based on expander graphs with decoding algorithms and complexity analysis.

Vertex Separator and Balanced Partition Algorithms

Studies algorithms for computing vertex separators and balanced graph partitions with approximation and hardness results.

Randomness Extraction and Pseudo-Entropy

Analyzes randomness extractors, entropy loss, and connections to pseudorandomness and derandomization.

Computational Aspects of Convex Geometry

Studies algorithms for convex hull computation, volume estimation, and lattice problems in high dimensions.

Complexity of Network Design Problems

Analyzes approximation algorithms and hardness for Steiner tree, Steiner forest, and facility location problems.

Lifting Theorems and Communication Bounds

Studies lifting theorems that relate circuit complexity to communication complexity with applications to lower bounds.

Distributed Algorithms and Lower Bounds

Analyzes complexity of distributed algorithms in the LOCAL and CONGEST models with matching lower bounds.

Complexity of Satisfiability Under Restrictions

Studies computational complexity of SAT variants including weighted, partial, and restricted satisfiability problems.

Natural Proofs and Barriers to Lower Bounds

Investigates limitations of proof techniques through natural proofs framework and connections to cryptographic hardness.

Approximation Algorithms for Scheduling

Develops polynomial-time approximation algorithms and hardness results for machine scheduling and job shop problems.

Witness-Indistinguishability and Extractability

Studies cryptographic notions of witness-indistinguishable and extractable proofs with complexity-theoretic implications.

Complexity of Graph Coloring and Chromatic Numbers

Analyzes hardness of approximating graph coloring and chromatic numbers in various graph classes.

Algorithmic Coding Theory and Decoding

Studies efficient algorithms for decoding linear codes, list decoding, and complexity of maximum likelihood decoding.

Complexity of Integer Linear Programming

Analyzes complexity of integer linear programming, cutting planes, and approximation algorithms for IP variants.

Temporal Logic and Model Checking Algorithms

Studies algorithmic verification of reactive systems using temporal logics like LTL and CTL with focus on scalability and symbolic methods.

Proof Complexity and Automated Theorem Proving

Investigates the lengths and structures of formal proofs in various proof systems and develops efficient automated reasoning techniques.

Type Theory and Dependent Type Systems

Explores type-theoretic foundations for programming languages and formal verification with emphasis on computational content and decidability.

Lambda Calculus and Functional Programming Semantics

Studies denotational and operational semantics of typed and untyped lambda calculus with applications to program equivalence and optimization.

Partial Evaluation and Program Specialization

Analyzes techniques for automatic program transformation that specialize general programs to particular input subsets for efficiency gains.

Reversible Computing and Conservative Logic

Investigates computational models where every operation is reversible with applications to quantum computing and low-power computation.

Petri Nets and Concurrent System Verification

Studies Petri net models for concurrent systems including reachability analysis, deadlock detection, and performance evaluation.

Process Algebra and Behavioral Equivalences

Explores formal semantics of concurrent processes using calculi like CCS and pi-calculus with focus on bisimulation and trace equivalence.

Markov Decision Processes and Stochastic Games

Analyzes optimal control and equilibrium computation in stochastic systems with applications to planning under uncertainty.

Tiling and Wang Tiles Computational Properties

Studies computational universality and decidability questions arising from tiling problems and Wang tile systems.

Cellular Automata and Self-Organizing Systems

Investigates computational capabilities and emergent behavior in cellular automata models including reversibility and classification.

Abstract State Machines and Algorithmic Specification

Studies high-level algorithmic specifications using abstract state machines with applications to system design and verification.

Molecular Computing and DNA-Based Algorithms

Explores computation using molecular substrates including DNA and RNA with analysis of information capacity and algorithmic implementability.

Optical Computing and Photonic Algorithm Design

Investigates computational models based on photonic systems with potential for parallel processing and novel algorithmic approaches.

Natural Computation and Bio-Inspired Algorithms

Analyzes computational power and complexity of algorithms inspired by biological processes like evolution and swarm behavior.

Game Tree Complexity and Perfect Information Games

Studies complexity of solving perfect information games including minimax algorithms and game-playing strategy optimization.

Kolmogorov Complexity and Algorithmic Information Theory

Investigates fundamental limits of compression and description length with applications to randomness and computability.

Complexity of Geometric Problems and Exact Computing

Analyzes computational complexity of geometric decision and optimization problems with emphasis on exact algebraic computation.

Distributed Algorithms and Fault Tolerance

Studies algorithms for distributed systems under various fault models with focus on asynchrony, partitions, and Byzantine failures.

Complexity of Numerical Computation and Approximation

Investigates computational complexity of solving continuous problems with analysis of approximation requirements and convergence rates.

Membership and Covering Complexity in Combinatorics

Studies computational complexity of membership and covering problems in combinatorial structures and polyhedra.

Integer Linear Programming and Branch-and-Bound Methods

Analyzes complexity and practical performance of algorithms for integer programming with focus on cutting planes and enumeration.

Matching Theory and Network Flow Algorithms

Studies algorithms for matching and flow problems in graphs including complexity analysis and scaling techniques.

Prefix-Free Codes and Information Compression

Investigates optimal coding theory and compression algorithms with information-theoretic bounds and practical implementations.

Sorting Networks and Comparison-Based Complexity

Studies depth and size complexity of sorting networks and comparison circuits with applications to parallel sorting.

Algebraic Complexity and Arithmetic Circuits

Analyzes complexity of polynomial computation using arithmetic circuits with focus on algebraic lower bounds.

Transducers and Sequential Machines Theory

Studies computational properties of finite transducers and sequential machines for string transformation and language recognition.

Complexity Classes and Separations Hierarchy

Investigates relationships between complexity classes and develops techniques for proving separations and containments.

Randomized Rounding and Linear Programming Relaxations

Studies approximation algorithms using LP relaxations and randomized rounding with derandomization techniques.

Scheduling and Load Balancing Approximations

Analyzes approximation algorithms for scheduling and load balancing problems on various machine models.

Covering and Packing Problems in Approximation

Studies approximability and hardness of covering and packing problems including Set Cover and geometric variants.

Clustering Algorithms and Approximation Quality

Investigates computational complexity and approximation ratios of clustering problems with various distance metrics.

Streaming Graph Algorithms and Sketching

Studies space-efficient algorithms for graph problems in streaming setting using sketching and sampling techniques.

Sparse Graphs and Spanner Construction

Analyzes algorithms for constructing sparse graph approximations with bounded distance distortion.

Tree Decompositions and Branch-Width Algorithms

Studies tree and branch decompositions of graphs with applications to parameterized algorithms and graph structure theory.

Counting Complexity and Sharp-P

Investigates computational complexity of counting problems and properties of Sharp-P-complete problems.

Expander Mixing and Spectral Graph Theory

Analyzes spectral properties of graphs and their applications to algorithm design and complexity lower bounds.

Hardness of Approximation via Gap Problems

Studies reduction techniques for proving approximation hardness using gap versions of computational problems.

Constraint Logic Programming and Resolution

Investigates computational aspects of constraint logic programming with focus on resolution-based proof systems.

Data Structure Lower Bounds via Communication

Studies lower bounds on data structure performance using communication complexity techniques.

Median Computation and Order Statistics Complexity

Analyzes optimal algorithms for finding order statistics including comparison complexity and adaptive techniques.

Reachability in Directed Graphs and Transitive Closure

Studies algorithms and complexity of reachability and transitive closure problems in directed graphs.

Average-Case Hardness and Planted Problem Complexity

Investigates average-case hardness of computational problems through analysis of planted and random instances.

Complexity of Boolean Satisfiability and Extensions

Analyzes computational complexity of SAT, MaxSAT, and quantified Boolean formula problems.

String Matching Algorithms and Pattern Recognition

Studies efficient algorithms for exact and approximate string matching with applications to pattern discovery.

Knapsack Problems and Pseudo-Polynomial Algorithms

Investigates computational complexity and algorithms for knapsack variants with pseudo-polynomial time solutions.

Temporal Logic and Model Checking for Reactive Systems

Research on automated verification of concurrent and reactive systems using temporal logic specifications and efficient model checking algorithms for safety and liveness properties.

Matrix Chain Multiplication and Dynamic Programming

Analyzes optimization of matrix operations and develops efficient dynamic programming approaches for structured problems.

Parameterized Approximation and Kernelization Techniques

Investigation of algorithms that combine parameterized complexity with approximation guarantees, focusing on preprocessing, data reduction, and kernel lower bounds for intractable problems.

Steiner Trees and Network Design Optimization

Studies algorithms and approximation techniques for Steiner tree and network design problems.

Implicit Computational Complexity and Recurrence Relations

Study of characterizing computational complexity classes through logical systems, lambda calculus variants, and recursive function theories without explicit resource bounds.

Distributed Graph Algorithms and Network Locality

Analysis of algorithms for distributed networks emphasizing local computation, message complexity, and fundamental limitations of decentralized graph processing in heterogeneous topologies.

Metric Embeddings and Distortion Bounds

Investigates embedding metrics into Euclidean and other spaces with analysis of distortion requirements.