yusuke1997/dblp-id-title huggingface dataset:
Datalog and Constraint Satisfaction with Infinite Templates
Alternative Algorithms for Counting All Matchings in Graphs
Extracting the Kolmogorov Complexity of Strings and Sequences from Sources with Limited Independence
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
How Fast Can You Escape a Compact Polytope?
Coding and Strong Coding in Trace Monoids
Optimal Parallelization of Las Vegas Algorithms
Cycle Counting Under Local Differential Privacy for Degeneracy-Bounded Graphs
A Quantum Goldreich-Levin Theorem with Cryptographic Applications
A Faster Algorithm for Finding Tarski Fixed Points
Avoidance Games Are PSPACE-Complete
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem
Regular Expressions and NFAs Without epsilon -Transitions
41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, Clermont-Ferrand, France, March 12-14, 2024
A Simple Optimal Parallel Algorithm for Reporting Paths in a Tree
Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs
On the Undecidability of Deadlock Detection in Families of Nets
Approximate Selection with Unreliable Comparisons in Optimal Expected Time
Space Bounds for Resolution
Computing Graph Roots Without Short Cycles
A Pumping Lemma for Pushdown Graphs of Any Level
Partial Derivates of Regular Expressions and Finite Automata Constructions
Linear-Space Data Structures for Range Mode Query in Arrays
Graph Searching Games and Width Measures for Directed Graphs
Improved Ackermannian Lower Bound for the Petri Nets Reachability Problem
PLEXUS: A System for Implementing Hierarchical Graph Algorithms
Violating Constant Degree Hypothesis Requires Breaking Symmetry
Adaptive Sorting and the Information Theoretic Lower Bound
Listing All Potential Maximal Cliques of a Graph
39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, Marseille, France (Virtual Conference), March 15-18, 2022
The Ubiquitous Digital Tree
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
Some Complexity Theoretic Aspects of AC Rewriting
Geodesic Fréchet Distance Inside a Simple Polygon
Reachability and the Power of Local Ordering
Randomized Acceleration of Fundamental Matrix Computations
Polynomial Time Algorithm for the Equivalence of two Morphisms on Omega-Regular Languages
38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbrücken, Germany (Virtual Conference), March 16-19, 2021
Growing Context-Sensitive Languages and Church-Rosser Languages
Adherence Equivalence Is Decidable for DOL Languages
Tight Lower Bounds for Problems Parameterized by Rank-Width
Getting Back to the Past in the Union-Find Problem
Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number
Parameterized Lower Bounds for Problems in P via Fine-Grained Cross-Compositions
On Low for Speed Oracles
Fast Online Multiplication of Real Numbers
Multi-k-ic Depth Three Circuit Lower Bound
Interval Routing Schemes
Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers
Edge-disjoint Odd Cycles in 4-edge-connected Graphs
Tilings: Recursivity and Regularity
Logics Capturing Local Properties
Denotational Semantics of Concurrent Programs with Shared Memory
Invariants of Automatic Presentations and Semi-synchronous Transductions
On Regularity of Unary Probabilistic Automata
On the k-Colouring of Circle-Graphs
Cost Functions Definable by Min/Max Automata
On the Structure of Polynomial Time Degrees
NP-Completeness of Perfect Matching Index of Cubic Graphs
The Commutation with Codes and Ternary Sets of Words
Compact Visibility Representation of Plane Graphs
Submodular Stochastic Probing on Matroids
On the Termination of Flooding
Packing Groups of Items into Multiple Knapsacks
A Lower Bound on the Complexity of Polynomial Multiplication Over Finite Fields
Paging with Dynamic Memory Capacity
Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs
On Minimal Sturmian Partial Words
A Conditional-Logical Approach to Minimum Cross-Entropy
About Changing the Ordering During Knuth-Bendix Completion
A Generalization of Automatic Sequences
Automates a pile sur des alphabets infinis
Algorithmic Information, Plane Kakeya Sets, and Conditional Dimension
On Singleton Arc Consistency for CSPs Defined by Monotone Patterns
Tractable Probabilistic mu-Calculus That Expresses Probabilistic Temporal Logics
A Decomposition Theorem for Probabilistic Transition Systems
Online Matching for Scheduling Problems
Partition Expanders
On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits
Designing Exploration Contracts
Languages Defined With Modular Counting Quantifiers (Extended Abstract)
Visibly Pushdown Languages over Sliding Windows
Solving the Rubik's Cube Optimally is NP-complete
On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages
On Weighted Balls-into-Bins Games
Pumping Lemmas for Weighted Automata
Flip Distance Is in FPT Time O(n+ k * c^k)
The CNN Problem and Other k-Server Variants
Simplifying the Modal Mu-Calculus Alternation Hierarchy
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model
Communication Complexity of Approximate Matching in Distributed Graphs
Colouring Square-Free Graphs without Long Induced Paths
The Weighted 2-Server Problem
Superlinear Lower Bounds Based on ETH
Data Monoids
The Weakness of Self-Complementation
Counting Classes: Thresholds, Parity, Mods, and Fewness
Efficient Parallel Algorithms for Geometric k-Clustering Problems
Online Simple Knapsack with Reservation Costs
Economy of Description for Single-valued Transducers
Language Learning With Some Negative Information
Approximate Circular Pattern Matching Under Edit Distance
Faster Algorithms on Linear Delta-Matroids
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity
Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract)
Semi-Commutations and Algebraic Languages
Approximate Minimum Tree Cover in All Symmetric Monotone Norms Simultaneously
On the Boundary of a Union of Rays
Language Learning without Overgeneralization
Upper Bounds on Multiparty Communication Complexity of Shifts
Max Weight Independent Set in Sparse Graphs with No Long Claws
Weighted HOM-Problem for Nonnegative Integers
Strong Reductions and Immunity for Exponential Time
Physarum Computations (Invited talk)
Simpler Computation of Single-Source Shortest Paths in Linear Average Time
Extended Locally Definable Acceptance Types (Extended Abstract)
Circuit Equivalence in 2-Nilpotent Algebras
An O(n log n) Algorithm for Computing a Link Center in a Simple Polygon
Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment
Provable Security for Block Ciphers by Decorrelation
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space
Average-Case Quantum Query Complexity
Advice Complexity for a Class of Online Problems
Car-Sharing on a Star Network: On-Line Scheduling with k Servers
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers
Distributed System Simulator (DSS)
CMSO-Transducing Tree-Like Graph Decompositions
Extending the Reach of the Point-To-Set Principle
Efficient Memory Access in Large-Scale Computation
An Efficient Quantum Algorithm for Some Instances of the Group Isomorphism Problem
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract)
Succinct Oblivious RAM
Long Non-crossing Configurations in the Plane
An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups
Characterizing TC 0 in Terms of Infinite Groups
On the Average Parallelism in Trace Monoids
On Computing Pareto Stable Assignments
The Complexity of Boolean Constraint Isomorphism
Errata to Analysis of the Harmonic Algorithm for Three Servers
Probabilistic cellular automata, invariant measures, and perfect sampling
Layouts with Wires of Balanced Length
Memoryless Facility Location in One Pass
Approximating Acyclicity Parameters of Sparse Hypergraphs
Generalized Model-Checking over Locally Tree-Decomposable Classes
Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres
Monotone Weak Distributive Laws over the Lifted Powerset Monad in Categories of Algebras
On the Representation of Boolean Predicates of the Diffie-Hellman Function
Malign Distributions for Average Case Circuit Complexity
Small Space Representations for Metric Min-Sum k -Clustering and Their Applications
On Iterated Dominance, Matrix Elimination, and Matched Paths
Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton
On the Effective Jordan Decomposability
Computing Maximum Matchings in Temporal Graphs
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
Digraph Coloring and Distance to Acyclicity
Nonblocking Graphs: Greedy Algorithms to Compute Disjoint Paths
Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes
New Time Hierarchy Results for Deterministic TMs
Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram
Efficient Sharing of Many Secrets
On Sets Bounded Truth-Table Reducible to P-selective Sets
On Polynomial Time Graph Grammars
Costs of General Purpose Learning
Upper and Lower Bounds for Dynamic Data Structures on Strings
On the Computational Complexity of the Forcing Chromatic Number
Tree-Layout Based Graph Classes: Proper Chordal Graphs
Finding All Minimal Separators of a Graph
Unary negation
Card-Based Protocols Imply PSM Protocols
Polymorphism, Parameterization and Typing: An Algebraic Specification Perspective
On Voronoi Diagrams in the L_p-Metric in Higher Dimensions
Compositional Specification of Timed Systems (Extended Abstract)
Cut Paths and Their Remainder Structure, with Applications
Improved Time-Space Trade-Offs for Computing Voronoi Diagrams
Fault-Tolerant Shared Memory Simulations
Tight Bounds for the Performance of Longest-in-System on DAGs
The Worst Case Complexity of McDiarmid and Reed's Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1n
Oblivious Symmetric Alternation
Mixing of Permutations by Biased Transposition
Improved Approximations for Guarding 1.5-Dimensional Terrains
Visibly Counter Languages and Constant Depth Circuits
Subquadratic-Time Algorithm for the Diameter and All Eccentricities on Median Graphs
Extended Learning Graphs for Triangle Finding
Equivalence of Measures of Complexity Classes
Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract)
Satisfiability Problems Complete for Deterministic Logarithmic Space
On OBDD-Based Algorithms and Proof Systems That Dynamically Change Order of Variables
Line Segmentation of Digital Curves in Parallel
On Quadratic Word Equations
Enumerative Combinatorics and Computer Science
Two-Dimensional Longest Common Extension Queries in Compact Space
A Characterization of Subshifts with Computable Language
Symmetry and Quantum Query-To-Communication Simulation
Bounds on the maximum multiplicity of some common geometric graphs
A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance
Improved Local Search for Geometric Hitting Set
On a Fragment of AMSO and Tiling Systems
Self-Reducibility
External String Sorting: Faster and Cache-Oblivious
Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus
Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints
Structuring and Modularizing Algebraic Specifications: The PLUSS Specification Language, Evolutions and Perspectives
The Expanding Search Ratio of a Graph
The Simulated Greedy Algorithm for Several Submodular Matroid Secretary Problems
Multivariate Exploration of Metric Dilation
Cancellation on Context-Free Languages: Enrichment by Reduction
b-Coloring Parameterized by Clique-Width
Computing Twin-Width Parameterized by the Feedback Edge Number
The Complexity of Learning LTL, CTL and ATL Formulas
Axiomatising Tree-Interpretable Structures
Recursively Enumerable Reals and Chaitin Omega Numbers
Admissibility in Infinite Games
Tight bounds for Parameterized Complexity of Cluster Editing
The Complexity of Generating and Checking Proffs of Membership
Geometric Relations Among Voronoi Diagrams
Mathematics, Cryptology, Security
Word Equations Where a Power Equals a Product of Powers
Abstracts Collection - 25th International Symposium on Theoretical Aspects of Computer Science
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graphs
Minimal Pairs and Complete Problems
List Approximation for Increasing Kolmogorov Complexity
Average-Case Algorithms for Testing Isomorphism of Polynomials, Algebras, and Multilinear Forms
Arithmetic Circuit Complexity (Tutorial)
Analyzing XOR-Forrelation Through Stochastic Calculus
Tight Bounds for Blind Search on the Integers
Alternation-Trading Proofs, Linear Programming, and Lower Bounds
Recursion Schemes and the WMSO+U Logic
Lattice Reduction by Random Sampling and Birthday Methods
A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms
On the Complexity of Deadlock Recovery
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
On Polynomial Kernels for Sparse Integer Linear Programs
Dependences in Strategy Logic
Varieties of Cost Functions
Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
Dynamic Data Structures for Parameterized String Problems
Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time
A Reducibility Concept for Problems Defined in Terms of Ordered Binary Decision Diagrams
Minimum Cost Flows in Graphs with Unit Capacities
Probabilistic vs Deterministic Gamblers
An Interactive Proof Tool for Process Algebras
Probably Optimal Graph Motifs
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
Distributed Soft Path Coloring
Weighted Closest Pairs
Exact Quantum Algorithms for the Leader Election Problem
Online Learning and Resource-Bounded Dimension: Winnow Yields New Lower Bounds for Hard Sets
Stochastic Scheduling of Heavy-tailed Jobs
Improved Bounds for Bipartite Matching on Surfaces
Describing Semantic Domains with Sprouts
Finding the Maximum with Linear Error Probabilities: A Sequential Analysis Approach
Automata Theory on Sliding Windows
Examining the Satisfiability of Formulas of Propositional Dynamic Logic
Efficient Enumeration of Solutions Produced by Closure Operations
On the Ultimate Complexity of Factorials
Comparing Direct and Continuation Semantics Styles for Concurrent Languages: Revisiting an Old Problem from a New Viewpoint
A New Diagram from Disks in the Plane
Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes
Computability of the entropy of one-tape Turing machines
Differentiability of polynomial time computable functions
Irreversible computable functions
Expressibility of First Order Logic with a Nondeterministic Inductive Operator
On the Number of Lambda Terms With Prescribed Size of Their De Bruijn Representation
First Fit bin packing: A tight analysis
Lossy Kernels for Connected Dominating Set on Sparse Graphs
Star Transposition Gray Codes for Multiset Permutations
Untameable Timed Automata!
What Is a Theory?
Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors
Structurally Tractable Graph Classes (Invited Talk)
Minkowski Games
The Core of a Countably Categorical Structure
Almost Complete Sets
Finding Induced Subgraphs via Minimal Triangulations
Enclosing Many Boxes by an Optimal Pair of Boxes
Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths
A New Parallel Vector Model, with Exact Characterization of NC^k
Polynomial Size Constant Depth Circuits with a Limited Number of Negations
Gathering of Asynchronous Oblivious Robots with Limited Visibility
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
Improved Quantum Lower and Upper Bounds for Matrix Scaling
Total Protection of Analytic Invariant Information in Cross Tabulated Tables
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata
First-Order Properties of Trees, Star-Free Expressions, adn Aperiodicity
Counting, Selecting, adn Sorting by Query-Bounded Machines
Popular Matchings: Structure and Cheating Strategies
Using Domain Algebras to Prove the Correctness of a Compiler
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs
An Interactive, Incremental and Portable Computer Algebra System for Lambda-Calculus and Combinatory Logic Based on Video Edition and Rewriting Techniques
Sublinear-Time Probabilistic Cellular Automata
Balanced Interval Coloring
MaxMin Separation Problems: FPT Algorithms for st-Separator and Odd Cycle Transversal
On the k-Freeness of Morphisms on Free Monoids
An Observational Subset of First-Order Logic Cannot Specify the Behaviour of a Counter (Extended Abstract)
The Alternation Hierarchy for Sublogarithmic Space: An Exciting Race to STACS'93 (Editorial Note)
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results
13/9-approximation for Graphic TSP
Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games
Automata-Based Analysis of Recursive Cryptographic Protocols
Polynomial Operations on Rational Languages
Deciding Properties of Contract-Signing Protocols
Linear Loop Synthesis for Quadratic Invariants
Randomness on Computable Probability Spaces - A Dynamical Point of View
Communicating Finite-State Machines and Two-Variable Logic
Dependence Orders for Computations of Concurrent Automata
Games with a Uniqueness Property
Reverse Engineering Prefix Tables
The Denjoy alternative for computable functions
On Symmetric Circuits and Fixed-Point Logics
On the Tree Conjecture for the Network Creation Game
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
Token Sliding on Split Graphs
Rational Ralations with Bounded Delay
On the Complexity of the "Most General" Firing Squad Synchronization Problem
Bisimulation and Action Refinement
Finding the k Shortest Paths in Parallel
Paid Exchanges are Worth the Price
Asspegique: An Integrated Specification Environment
Distributed Coloring of Graphs with an Optimal Number of Colors
Timed Control Synthesis for External Specifications
Two-Dimensional Pattern Matching in Linear Time and Small Space
On the Equivalence Problem for Deterministic Multitape Automata and Transducers
STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings
Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof
Cover Time and Broadcast Time
Learnability and Definability in Trees and Similar Structures
The Descriptive Complexity Approach to LOGCFL
Fast and Optimal Simulations between CRCW PRAMs
Analysis of multi-stage open shop processing systems
Separating the Lower Levels of the Sublogarithmic Space Hierarchy
Area-time Optimal Division for T=Omega(log n) 1+epsilon
Finding Pseudo-repetitions
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games (Invited talk)
Decidability and Undecidability Results for Duration Calculus
Progressive Algorithms for Domination and Independence
Closure Properties of Deterministic Petri Nets
Algebre de machines et logique temporelle
Evasiveness and the Distribution of Prime Numbers
Hard Instances of Hard Problems
Describing Parameterized Complexity Classes
A Lower Bound on the Competitive Ratio of Truthful Auctions
Nonnegativity Problems for Matrix Semigroups
A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume
Effective Strong Dimension in Algorithmic Information and Computational Complexity
Measure, Stochasticity, and the Density of Hard Languages
Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight
The Inversion Problem for Computable Linear Operators
Extension of the Notion of Map and Subdivisions of a Three-Dimensional Space
Packing Odd Walks and Trails in Multiterminal Networks
The Global Power of Additional Queries to Random Oracles
Fast Pruning of Geometric Spanners
Are Short Proofs Narrow? QBF Resolution is not Simple
Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
Explicit Linear Kernels via Dynamic Programming
On Codes Having no Finite Completion
The First-Order Logic of Hyperproperties
Spectrum Preserving Short Cycle Removal on Regular Graphs
Succinctness of the Complement and Intersection of Regular Expressions
Optimal Tradeoffs Between Time And Bit Complexity In Distributed Synchronous Rings
Geometric Containment, Common Roots of Polynomials and Partial Orders
Quantum Algorithms for Testing Properties of Distributions
New Clocks, Optimal Line Formation and Self-Replication Population Protocols
Semënov Arithmetic, Affine {VASS}, and String Constraints
Polylog-Time Reductions Decrease Dot-Depth
Kernelization and Sparseness: the Case of Dominating Set
On O(sqrt(n))-Worst-Case-Time Solution to the Granularity Problem
Improved Bounds on Fourier Entropy and Min-Entropy
The Many Facets of String Transducers (Invited Talk)
30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, Kiel, Germany, February 27 - March 2, 2013
Simultaneous Feedback Vertex Set: A Parameterized Perspective
Extending Downward Collapse from 1-versus-2 Queries to j-versus-j+1 Queries
Capabilities and Complexity of Computations with Integer Division
Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse
Telling convex from reflex allows to map a polygon
Cache-Oblivious Implicit Predecessor Dictionaries with the Working-Set Property
STACS 89, 6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989, Proceedings
Recognizable Sets of Message Sequence Charts
On Fairness in Distributed Automated Deduction
Rectilinear Path Queries in a Simple Rectilinear Polygon
Languages Recognized by Finite Aperiodic Groupoids
Optimal Decremental Connectivity in Planar Graphs
A Time-Space Tradeoff for Element Distinctness
Topological Automata
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth
On Polynomially D-Verbose Sets
Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
Fast Integer Sorting in Linear Space
Pushdown Space Complexity and Related Full-AFLs
Approximation Schemes for Metric Clustering Problems
Approximation Algorithms for Minimizing Average Distortion
Reactive Variables for System Specification and Design
Erdös-Pósa Property of Obstructions to Interval Graphs
Towards a Theory of Relativizations: Positive Relativizations
The k-in-a-path Problem for Claw-free Graphs
A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width
Tight Bounds for Connectivity Problems Parameterized by Cutwidth
A New Logical Characterization of Büchi Automata
Transparent (Holographic) Proofs
LP can be a cure for Parameterized Problems
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Computing Hitting Set Kernels By AC^0-Circuits
Generating Shorter Bases for Hard Random Lattices
The PROSPECTRA System
Scalable Sparse Topologies with Small Spectrum
From Small Space to Small Width in Resolution
Distribution of the number of accessible states in a random deterministic automaton
Conditional Seme-Thue Systems for Presenting Monoids
Foreword -- 27th International Symposium on Theoretical Aspects of Computer Science