yusuke1997/dblp-id-title huggingface dataset:
Probabilistic Metric Semantics for a Simple Language with Recursion
Set-Theoretic Properties of Programs in Stored Program Computers
All Symmetric Predicates in NSPACE ( n 2 ) Are Stably Computable by the Mediated Population Protocol Model
Partial Interpretations of Program Schemata
Nearly Private Information Retrieval
Polynomial-Delay Enumeration of Large Maximal Common Independent Sets in Two Matroids
Operators on Families of Languages
Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
Optimal Reachability in Weighted Timed Automata and Games
Reductions to the Set of Random Strings: The Resource-Bounded Case
Plain Stopping Time and Conditional Complexities Revisited
Deterministic Parameterized Algorithms for the Graph Motif Problem
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence
Depth-First Search in Directed Planar Graphs, Revisited
A Simple Class of Algorithmic Specifications for Abstract Software Modules
Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part I
Shorter Queues for Permutation Routing on Meshes
The Multivariate Resultant Is NP-hard in Any Characteristic
Half-Space Separation in Monophonic Convexity
Optimal Regular Expressions for Palindromes of Given Length
Specification & Verification of Higher Order Processes
A Unifying Approach for Multistack Pushdown Automata
Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set
Constructing Brambles
Reachability in Pushdown Register Automata
Hardness Results for Tournament Isomorphism and Automorphism
A Threshold for Unsatisfiability
p-Projection Reducibility and the Complexity Classes L(nonuniform) and NL(nonuniform)
Hierarchical Clusterings of Unweighted Graphs
Rational omega-Transductions
On the Binary and Boolean Rank of Regular Matrices
The Complexity of Boolean Surjective General-Valued CSPs
Dependent k-Set Packing on Polynomoids
Ackermannian Integer Compression and the Word Problem for Hydra Groups
LO_v-Calculus: A Graphical Language for Linear Optical Quantum Circuits
Weighted Automata and Logics on Graphs
Decision Problems for Multihead Finite Automata
Approximating the Value of Energy-Parity Objectives in Simple Stochastic Games
Decision Problems Concerning Parallel Programming
Dependency-Based Action Refinement
Combinatorial Results on the Complexity of Teaching and Learning
Arithmetical Complexity of Some Problems in Computer Science
A Proof System to Derive Evantually Properties Under Justice Hypothesis
Combining T and level-N
The Hamilton Compression of Highly Symmetric Graphs
On the Topological Complexity of MSO+U and Related Automata Models
Axioms or Algorithms
Improving Memory Utilization in Transforming Recursive Programs (Extended Abstract)
Methods in Parallel Algorithmics (Abstract)
Asynchronous Deterministic Rendezvous in Graphs
A Stronger Version of Parikh Theorem
Decidability of Predicate Logics with Team Semantics
Models for Analysis of Races in Sequential Networks
A Characterisation of Pi^0_2 Regular Tree Languages
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems
Automata in the Category of Glued Vector Spaces
Describing Average- and Longtime-Behavior by Weighted MSO Logics
HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete
Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
The Complexity of Satisfiability Problems: Refining Schaefer's Theorem
The Dual of Concatenation
Sublinear Algorithms for Edit Distance (Invited Talk)
The Cubic Search Method
Program Equivalence and Provability
On Semantic Issues in the Relational Model of Data
Simulation as a Correct Transformation of Rewrite Systems
Synchronizing Deterministic Push-Down Automata Can Be Really Hard
Degrees and Reducibilities of Easy Tally Sets
Ten Years of Speedup
The Quantifier Alternation Hierarchy of Synchronous Relations
The Gödel Fibration
Modification Problems Toward Proper (Helly) Circular-Arc Graphs
Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems
Improved Bounds and Schemes for the Declustering Problem
Helly Circular-Arc Graph Isomorphism Is in Logspace
Boundaries to Single-Agent Stability in Additively Separable Hedonic Games
Speed Me up If You Can: Conditional Lower Bounds on Opacity Verification
Complete Abstract Interpretations Made Constructive
On Search Complexity of Discrete Logarithm
Multistage Knapsack
Parameterized Algorithms for Parity Games
Approximating Good Simultaneous Diophantine Approximations Is Almost NP-Hard
Membership and Reachability Problems for Row-Monomial Transformations
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups
The Prismoid of Resources
Multicast Transmissions in Non-cooperative Networks with a Limited Number of Selfish Moves
On the Complexity of Countable Functions (Abstract)
Generating Control Mechanisms by Restrictions
Simulation of Specification Statements in Hoare Logic
Investigation of Finitary Calculi for the Temporal Logics by Means of Infinitary Calculi
Black-Box Hypotheses and Lower Bounds
Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs
Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
Consensus Strings with Small Maximum Distance and Small Distance Sum
Unambiguous Finite Automata over a Unary Alphabet
Grammatical Models for Some Process Synchronizers
Finding a Maximum 2-Matching Excluding Prescribed Cycles in Bipartite Graphs
Mathematical Methods of the Theory of Stochastic Automata
The Price of Anarchy for Polynomial Social Cost
On the Recognizability of Self-generating Sets
The Complexity of Quantum Disjointness
Relationships between AFDL's and Cylinders
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs
Packing Weighted Rectangles into a Square
Equivalences and Preorders of Transition Systems
Models and Operators for Nondeterministic Processes
One-One Degrees of Turing Machines Decision Problems
Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
Generalized Regular Counting Classes
Models for Concurrency
Romeo and Juliet Is EXPTIME-Complete
Impossibility of Independence Amplification in Kolmogorov Complexity Theory
Embedding Complete Binary Trees into Star Networks
Temporal Reachability Minimization: Delaying vs. Deleting
Structured Nets
A Model for Real-Time Process Algebras (Extended Abstract)
A Note on the Minimum Distance of Quantum LDPC Codes
Some Applications of Algebraic Semantics
Tow Down versus Bottom Up Syntax Analysis Revised
An Updated Survey of Bidding Games on Graphs (Invited Talk)
Optimal Randomized Comparison Based Algorithms for Collision
Mathematical Foundations of Computer Science 1994, 19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994, Proceedings
Derivability in Locally Quantified Modal Logics via Translation in Set Theory
A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments
An Elementary Proof for the Non-parametrizability of the Equation xyz=zvx
A Modal Logic for Data Analysis
Pushdown-Automata and Families of Languages Generating Cylinders
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract)
Generalized Heapsort
Relating Complete and Partial Solution for Problems Similar to Graph Automorphism
Algebraic and Uniqueness Properties of Parity Ordered Binary Decision Diagrams and Their Generalization
The Complexity of Separability for Semilinear Sets and Parikh Automata
Languages Representable by Vertex-Labeled Graphs
Complexity of Finding Short Resolution Proofs
Higher-Order Causal Theories Are Models of BV-Logic
Parameterized (Modular) Counting and Cayley Graph Expanders
Compound Algebraic Implementations: An Approach to Stepwise Refinement of Software Systems
W-Automata and Their Languages
Type Inference Problems: A Survey
Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics
Local LTL with Past Constants Is Expressively Complete for Mazurkiewicz Traces
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition
The Algebraic Approach to the Theory of Computing Systems
On Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor
Automatic Verification of Recursive Procedures with One Integer Parameter
Decision Questions for Probabilistic Automata on Small Alphabets
On the Number of Quantifiers Needed to Define Boolean Functions
Simplification Orders for Term Graph Rewriting
Hard Functions for Low-Degree Polynomials over Prime Fields
Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument
Even Faster Algorithms for CSAT Over supernilpotent Algebras
Using Inductive Counting to Simulate Nondeterministic Computation
An Algebraic Generalization of omega-Regular Languages
On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem
D0L-Systems and Surface Automorphisms
Some Lower Bounds in Parameterized AC^0
Goals in the Propositional Horn Language Are Monotone Boolean Circuits
Continuous and Monotone Machines
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials
Tree-Structures for Set Manipulation Problems
Crochemore Factorization of Sturmian and Other Infinite Words
Geometry of Interaction for ZX-Diagrams
Quantum Programming in Polylogarithmic Time
Bisections of Free Monoids and a New Unavoidable Regularity
Separating Sets of Hyperrectangles
A Finite Hierarchy of the Recursively Enumerable Real Numbers
A Polychromatic Ramsey Theory for Ordinals
Comonadic semantics for hybrid logic
Termination of Rewriting is Undecidable in the One-Rule Case
On Positive Occur-Checks in Unification
Lower Bounds for Linear Decision Trees via an Energy Complexity Argument
Algebraic Synchronization Criterion and Computing Reset Words
All Growth Rates of Abelian Exponents Are Attained by Infinite Binary Words
The Power of One Clean Qubit in Communication Complexity
Syntax and Semantics of Procol
Superposable Trellis Automata
Decision Algorithms for Havel's Branching Automata
The Complexity of the Extended GCD Problem
Ordered Fragments of First-Order Logic
Towards a Polynomial Kernel for Directed Feedback Vertex Set
Subtyping Calculus of Construction (Extended Abstract)
Fibonacci Numeration Systems and Rational Functions
A Compositional Model for Confluent Dynamic Data-Flow Networks
Metric Dimension of Bounded Width Graphs
Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings
Interactive Algorithms 2005
Optimal Algorithms for Complete Linkage Clustering in d Dimensions
Why so Many Temporal Logics Climb up the Trees?
A Random Oracle Does Not Help Extract the Mutual Information
Query Automata for Nested Words
State Complexity of Basic Operations on Suffix-Free Regular Languages
Clique-Width for Graph Classes Closed under Complementation
Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract)
Geometric Optimization and Unique Sink Orientations of Cubes p
Almost All Functions Require Exponential Energy
Temporal Valued Constraint Satisfaction Problems
Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits
Local Certification of Geometric Graph Classes
Uniformisation Gives the Full Strength of Regular Languages
Inferring Strings from Lyndon Factorization
Comparisons Among Classes of Y-Tree Systolic Automata
Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through Circuits and Degree
Weak Parallel Machines: a New Class of Physically Feasible Parallel Machine Models
Polynomial Complexity of the Newton-Puiseux Algorithm
Quantitative Refinement for Weighted Modal Transition Systems
Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik, Poland, August 28 - September 1, 1989, Proceedings
The Power of Linear-Time Data Reduction for Maximum Matching
Efficient Type Reconstruction in the Presence of Inheritance
Lambdas, Transducers and MSO (Invited Talk)
Observing Located Concurrency
Register Automata with Permutations
An Extended Polymorphic Type System for Applicative Languages
Analyzing Program Solutions of Coordination problems by CP-Nets
On the Logic of Incomplete Transformation
Deciding Verbose Languages with Linear Advice
On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional Space
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles
Unification Modulo Associativity and Idempotency Is NP-complete
Private Capacities in Mechanism Design
Proofs that Release Minimum Knowledge
A Bridge Between the Asynchronous Message Passing Model and Local Computations in Graphs
Multiprocessor Systems and Their Concurrency
Cluster Deletion on Interval Graphs and Split Related Graphs
Grammars with Context Dependency Restricted to Synchronization
Graphs Identified by Logics with Counting
On NC-Real Complexity Classes for Additive Circuits and Their Relations with NC
Evolvability
Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract)
Dynamic Algebras which are not Kripke Structures
On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes
An Exact 2.9416 n Algorithm for the Three Domatic Number Problem
Duality and Recognition
Variations on a Theorem of Fine & Wilf
Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts
Constructing Infinite Graphs with a Decidable MSO-Theory
Partial Match Retrieval in Implicit Data Structures
On the Analysis and Synthesis Problems for Context-Free Expressions
Decomposition of Semi Commutations
One Useful Logic That Defines Its Own Truth
A Hierarchy of Context-Sensitive Languages
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
Evolutive Tandem Repeats Using Hamming Distance
Network Creation Games: Think Global - Act Local
Bounding the Clique-Width of H-free Chordal Graphs
Randomized Polynomial Time Protocol for Combinatorial Slepian-Wolf Problem
Computing Lempel-Ziv Factorization Online
On Representing CCS Programs by Finite Petri Nets
Decision Problems for Multi-Tape Automata
New Approximability Results for 2-Dimensional Packing Problems
Rational Verification for Nash and Subgame-Perfect Equilibria in Graph Games
Promise Problems and Access to Unambiguous Computation
On the Complexity of Computing Treelength
On the Shortest Linear Straight-Line Program for Computing Linear Forms
On Divergence Problems for Program Schemas
Kernelization of the Subset General Position Problem in Geometry
On Polynomial Reducibility of Word Problem Under Embedding of Recursively Presented Groups in Finitely Presented Groups
Some Recent Results on Data Mining and Search
New Parameterized Algorithms for the Edge Dominating Set Problem
Breaking a Graph into Connected Components with Small Dominating Sets
Pairing heaps: the forward variant
On Adaptability of a System of Programs
Matching Modulo Associativity and Idempotency Is NP-Complete
Computing a Minimum-Cost k-Hop Steiner Tree in Tree-Like Metrics
The Influence of the Data Presentation on the Computational POwer of Machines
Continuous Simple Z-Machines, Z-Computable Functions and Sets of Functions of n Real Variables
Upper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs
Polynomial Time Samplable Distributions
Equational Properties of Fixed Point Operations in Cartesian Categories: An Overview
Loop Programs and Classes of Primitive Recursive Functions
Edit and Alphabet-Ordering Sensitivity of Lex-Parse
A Uniform Approach to Applicative and Imperative Features in Programming Languages
News from the Online Traveling Repairman
The Expressiveness of Datalog Circuits (DAC)
On the Complexity of Ontological Reasoning under Disjunctive Existential Rules
Lower Bounds for the Majority Communication Complexity of Various Graph Accessibility Problems
Construction and Properties of Context-Sensitive Grammars and Languages (in Russian)
SZX-Calculus: Scalable Graphical Quantum Reasoning
On the Voting Time of the Deterministic Majority Process
Positive/Negative Conditional Rewriting
On the Amount of Nondeterminism and the Power of Verifying (Extended Abstract)
About Synchronization Languages
A Theoretical Basis for the Systematic Proof Method
Traveling Salesman Problems in Temporal Graphs
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances
U-Bubble Model for Mixed Unit Interval Graphs and Its Applications: The MaxCut Problem Revisited
Determinising Parity Automata
Enumeration Classes Defined by Circuits
Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey)
Choiceless Logarithmic Space
Rewriting Conjunctive Queries Determined by Views
Unrestricted Resolution versus N-Resolution
A Sequent Calculus for Subtyping Polymorphic Types
Linear-Space Data Structures for Range Frequency Queries on Arrays and Trees
Algorithms and Real Numbers
Equivalence Testing of Weighted Automata over Partially Commutative Monoids
On the Hybrid Extension of CTL and CTL +
The b-Branching Problem in Digraphs
Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
On the Lower Bounds for One-Way Quantum Automata
Complexity of Anchored Crossing Number and Crossing Number of Almost Planar Graphs
A Deep Dive into the Weisfeiler-Leman Algorithm (Invited Talk)
Resolution Lower Bounds for Refutation Statements
A Computational Interpretation of the lambda-µ-Calculus
Average-Case Polynomial-Time Computability of Hamiltonian Dynamics
A Generalization of Repetition Threshold
Writing and Verifying Sequential Files Updating Programs
L ax F: Side Conditions and External Evidence as Monads
The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract)
Optical Routing of Uniform Instances in Tori
Reversibility of Computations in Graph-Walking Automata
Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II
On the Unification Free Prolog Programs
A Time Hierarchy for Bounded One-Way Cellular Automata
Atomic Refinement in Process Description Languages
On Kernels for d-Path Vertex Cover
Non-Linear Speed-Up Theorem for Two Register Minsky Machines
A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs
One More Method For Proving Lower Bounds on the Formula Complexity of Boolean Functions
Quantum Lower and Upper Bounds for 2D-Grid and Dyck Language
Representing Hyper-Graphs by Regular Languages
Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
Deciding Termination of Simple Randomized Loops
Longest Common Subsequences
Optimizing OBDDs Is Still Intractable for Monotone Functions
Data Types as Functions
Incremental Model Checking for Decomposable Structures (Extended Abstract)
Sorting Long Sequences in a Single Hop Radio Network
Boxed Ambients with Communication Interfaces
A Semantic Matching Algorithm: Analysis and Implementation
The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
Computable Versions of Baire's Category Theorem
Axioms for the Term-Wise Correctness of Programs
Graph Realization of Distance Sets
A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem
Light Spanners in Bounded Pathwidth Graphs
Communication in Networks with Random Dependent Faults
Polynomial Time Approximation Schemes and Parameterized Complexity
Schematology in a Multi-Language Optimizer
Representations lf Integers and Language Theory
Alignment between Two RNA Structures
The Complexity of Computing Second Solutions
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes
Analysis of Maximal Repetitions in Strings
50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, Warsaw, Poland, August 25-29, 2025
On the Constructive Description of Graph Languages Accepted by Finite Automata
Conflict Free Feedback Vertex Set: A Parameterized Dichotomy
Deepening the (Parameterized) Complexity Analysis of Incremental Stable Matching Problems
The Infinite Versions of LOGSPACE != P Are Consistent with the Axioms of Set Theory
Properties of Visibly Pushdown Transducers
Partial Order Reduction: Model-Checking Using Representatives
Computational Aspects of Cellular Automata on Countable Sofic Shifts
Vectors of Coroutines
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers
An Extension of Rabin's Complete Proof Concept
The Snack Powerdomain for Database Semantics
DP-Complete Problems Derived from Extremal NP-Complete Properties
0-1 Laws for Fragments of Existential Second-Order Logic: A Survey
Exponential Optimization for the {LLP($k$)} Parsing Method
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization
On the Expressive Strength of the Finitely Typed Lambda-Terms
On Parallel Complexity of Maximum f-matching and the Degree Sequence Problem
About Boundedness for some DATALOG and DATALOG_neg Programs
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Texts
PBS-Calculus: A Graphical Language for Coherent Control of Quantum Computations
Eliminating Recursion from Monadic Datalog Programs on Trees
May I Borrow Your Logic?
First-Order Reductions of Call-by-Name to Call-by-Value
On the Complexity of Computing Time Series Medians Under the Move-Split-Merge Metric
On the Expansion of Combinatorial Polytopes
Roman Census: Enumerating and Counting Roman Dominating Functions on Graph Classes
Optimal Free Binary Decision Diagrams for Computation of EAR n
Reversible and Irreversible Computations of Deterministic Finite-State Devices
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
Approximating Independent Set and Coloring in Random Uniform Hypergraphs
Treewidth: Algorithmic Techniques and Results
Constant Time Reductions in Lambda-Caculus
On Approximation Hardness of the Minimum 2SAT-DELETION Problem
Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings
Supercritical Size-Width Tree-Like Resolution Trade-Offs for Graph Isomorphism
Time and Space Bounds in Producing Certain Partial Orders
A Theoretical Study of the Time Analysis of Programs
Time-Processor Trade-offs for Universal Parallel Computers
Structured Connectivity Augmentation
Finitely Tractable Promise Constraint Satisfaction Problems
Parameterized Analysis of the Cops and Robber Game
Counting Locally Optimal Tours in the TSP
The Finest Homophonic Partition and Related Code Concepts
Verifying Proofs in Constant Depth
New Proofs in Graph Minors
Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
On Pseudodeterministic Approximation Algorithms
Mathematical Foundations of Computer Science 1996, 21st International Symposium, MFCS'96, Cracow, Poland, September 2-6, 1996, Proceedings
A Calculus to Build Up Correct Programs
Sample Compression Schemes for Balls in Graphs
The Complexity of Counting Functions with Easy Decision Version
The Weighted Sperner's Set Problem
Integer Relations Among Algebraic Numbers
Approximating Polygonal Objects by Deformable Smooth Surfaces
On Maximizing the Throughput of Multiprocessor Tasks
On the Termination of Simple Computer Programs
Deriving Structures from Structures
On a Special Class of Primitive Words
Computing Behavioral Distances, Compositionally
Size and Energy of Threshold Circuits Computing Mod Functions
A Survey of Grammar and L Forms-1978
A Timecop's Chase Around the Table
Decidability (Undecidability) of Equivalence of Minsky Machines with Components Consisting of at Most Seven (Eight) Instructions
Relating Nominal and Higher-Order Rewriting
Representing Groups on Graphs
Palindromic k-Factorization in Pure Linear Time
The Covering Canadian Traveller Problem Revisited
Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs