General Algorithms for Testing the Ambiguity of Finite Automata

Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms

Generalization of automatic sequences for numeration systems on a regular language

Generalized Counters and Reversal Complexity

Generalized Majority-Minority Operations are Tractable

Generalized Modal Satisfiability

Generic case complexity and One-Way functions

Geometric Complexity III: on deciding positivity of Littlewood-Richardson coefficients

Geometric Complexity Theory and Tensor Rank

Geometric Complexity Theory II: Towards explicit obstructions for embeddings among class varieties

Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem

Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient

Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry

Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem

Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups

Geometric Complexity Theory: Introduction

Geometric properties of satisfying assignments of random $ε$-1-in-k SAT

Geometry and the complexity of matrix multiplication

Graham's Schedules and the Number Partition Problem

Graph and Election Problems Parameterized by Feedback Set Numbers