MFCS 2023: 48TH INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
TALK KEYWORD INDEX

#
#P
3
3SUM problem
A
Agda
algebraic algorithms
algebraic branching programs
algorithmic game theory
Algorithmic graph theory
Algorithmic information theory
algorithms under uncertainty
Analog Computations
Approximation
approximation algorithms
Arithmetic circuits
arithmetic theories
asynchronous automata
automata
Automatic relations
B
Backreferences
Bayesian
Beyond Worst-case Analysis
binary rank
bipartite graphs
Bipartiteness
Boolean Function
Boolean functions
Boolean Hierarchy
C
Category Theory
chordal graphs
Circuit complexity
clique graphs
clique-width
Competitive analysis
Complexity
complexity dichotomy
Complexity Trichotomy
Computability
Computable Analysis
Computational Complexity
computational social choice
Concurrent games
connectivity problems
Consistency and robustness
constraint satisfaction
Constructive Type Theory
Context-free grammars
Continued fractions
Continuity
continuous approximation
convoy routing
Cops and Robber
Coq
core stability
Cost register automata
counter automata
counting logics
Counting problems
Cryptanalysis
Cryptography
Cut-free LK
D
Data Languages
decidability
Decidable fragment
decision procedures
Decision trees
Decomposition
depth of proofs
Depth-3 circuit
descriptive complexity
descriptive complexity theory
Deterministic finite automaton (DFA)
Dialogue trees
diameter
Dirac graphs
Directed Acyclic Graph
Discrete ordinary differential equations
disjointness function
Distributed algorithms
distributed computing
distributed quantum Merlin-Arthur
distributed verification
distribution testing
Domination problems
Dynamic complexity
Dynamic parallel algorithms
dynamic programming
Dynamical Systems
E
edge subdivision
Effective Hausdorff dimension
elementary graphs
emptiness
Energy Games
entropic risk
Entropy games
Enumeration problems
Enumerative Combinatorics
eqaulity function
eternal vertex cover
ETH
Exact real computation
Exponential sums
Expressive power
expressiveness
Extensional Type Theory
F
Fairness
Feedback Vertex Set
few subpowers
fine-grained complexity
Finite automata
finite colorability
Finite Differences
Finite languages
Finite model theory
Finite multisets
Finite-state compression
Finite-state dimension
First-order logic
first-order predicate logical theories
first-order theories
Fixed Parameter Tractability
Fixed parameterized algorithms
fixed-parameter tractability
fixed-parameter tractable
Forall-exact problem
forbidden subgraph
FPT Approximation
Fundamental Group
G
G-modular cardinality
Games on graphs
general algebra
Graph classes
Graph colouring
graph connectivity
graph drawing
Graph Exploration
graph minor
graph modification problem
graph motif
Graph Searching
Graph theory
graph-algorithms
guarded logics
H
H-free graph
H-graphs
Hamiltonian Cycle
Hamiltonian Path
hedonic games
Helly Property
Hereditary Systems
Hilbert projective metric
Hitting Set
homomorphism counting
homomorphism indistinguishability
Hunter and Rabbit Game
Hyperbolic graphs
Hypergraph Matchings
hypergraphs
Hyperproperties
Hyperspaces
hypertree decompositions
I
Implicit complexity
incidence graphs
independent feedback vertex set
information theory
inner product
input-driven automata
Intersection Graphs
Intuitionistic Logic
Isometric path complexity
Isometric Path Cover
K
kernel
Kernelization
Kolmogorov complexity
Krasnoselskii-Mann fixed point iteration
L
Linear and star search
Linear Temporal Logic
Locality
logic
logics for PTIME
loop invariants
lower bound
lower bounds
M
Markov chains
Markov decision processes
Markov kernel
matching cut
matrix multiplication
Matroid intersection
Matroids
Max Cut
MaxCut
maximum cardinality search
maximum cut
Mazurkiewicz traces
Median String
Minimality
Models of computation
Modular width
Modular-width
monochromatic rectangles
Monoid
Monotonicity
N
Nash equilibria
neural networks
noisy queries
Nominal Sets
noncommutative polynomial ring
Normal numbers
O
OBDD
Online Algorithm
online algorithms
Online Computation
opacity
Oracle Construction
Ordinary differential equations
Ore graphs
Outerstring graphs
P
p-Edge-Connected Graphs
parallel algorithms
parallel constant time
Parameterized Algorithms
Parameterized Approximation
Parameterized Complexity
Parameterized models
Parikh automata
Parity Games
parsing
partial search order
Partial Vertex Cover
Planar Embedding
Planar Graphs
polynomial factorization
Polynomial-delay enumeration
polynomially expressive
Predictions
Presheaves
price of anarchy
Primality
primitive positive definability
probabilistic automata
Probability
program analysis
Program Extraction
Program verification
Proof complexity
Proof Systems
proper circular-arc graph
proper Helly circular-arc graph
property testing
Pseudo-random generator
Pseudodeterminism
Q
quantitative logics
quantum computation
quantum graphs
query complexity
Query models
R
Randomness
Ranked Enumeration
reachability
real functions
real numbers
Realizability
recognizable relations
Reconfiguration
Recursion scheme
Reduced Ordered Binary Decision Diagram
Register Automata
Regular expressions
Regular languages
Relation algebra
relational clone
Relative value iteration
ReLU cicuits
Removability
Representative Families
Resolution
Reverse search
risk-aversion
Roman domination
Rényi-Ulam Games
S
Search problems
Semiring semantics
separability
shortest path problem
Shortest paths
sigmoid circuits
Simple Knapsack
Simple Stochastic Games
Spaces of subsets
spanning tree
Special graph classes
sprase activity
st-orientations
state complexity
Stateful computations
Steiner Subgraph Extension
stochastic games
Stochastic mean-payoff games
Strategy complexity
string diagrams
subexponential
Subexponential algorithms
Subgame-perfect equilibria
subpower membership
Subset-sum problem
Subshift of Finite Type
Subshifts
support size
symbolic computation
symmetric computation
symmetric monoidal categories
systems of equations
T
TBA1
TBA2
TBA3
Team Semantics
Temporal Graphs
Termination
the CONGEST model
Theorem proving
threshold circuits
Time Series
Topology
traveling salesperson problem
Travelling Salesperson Problem
Treewidth
Truemper Configurations
Type Theory
U
Undirected connectivity
Universality
V