yusuke1997/dblp-id-title huggingface dataset:
Modular Approach to the Logical Theory of Programs
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
Comparative Semantics for Linear Arrays of Communicating Processes: A Study of the UNIX Fork and Pipe Commands
Space Bounded Computations: Review And New Separation Results
The Power of Programs over Monoids in DA
One Query Reducibilities Between Partial Information Classes
Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch's Theorem
Detecting Regularities on Grammar-Compressed Strings
Why Sometimes Probabilistic Algorithms Can Be More Effective
Recent Results on Automata and Infinite Words
Enumerating Minimal Transversals of Hypergraphs without Small Holes
Compositional Characterizations of lambda-Terms Using Intersection Types
Local Disambiguating Transformation
Distribution of Sequential Processes
Intuitive Counterexamples for Constructive Fallacies
Inverse NP Problems
The Boundary of Substitution Systems
On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
Some Remarks on Boolean Sums
A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games
Computational Complexity of Simultaneous Elementary Matching Problems (Extended Abstract)
Deleting Edges to Restrict the Size of an Epidemic in Temporal Networks
Separating Hierarchical and General Hub Labelings
A Complete Axiomatization for Branching Bisimulation Congruence of Finite-State Behaviours
Measures of Ambiguity in the Analysis of Complex Systems
Minimum Bisection Is NP-hard on Unit Disk Graphs
A Fully Abstract Semantics for Termination in Petri Nets
Verifying Properties of Module Construction in Type Theory
Clustering on k-Edge-Colored Graphs
Multicoloring: Problems and Techniques
Undecidable Properties of Self-affine Sets and Multi-tape Automata
On the Size of Independent Systems of Equations in Semigroups
Finding Equilibria: Simpler for Pessimists, Simplest for Optimists
Indexing Graph Search Trees and Applications
Simple Qudit ZX and ZH Calculi, via Integrals
Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
A Homological Condition on Equational Unifiability
Implementing Abstract Data Structures in Hardware
A Universal Skolem Set of Positive Lower Density
Weighted Operator Precedence Languages
Conceptual Relations between Databases Transformed under Join and Projection
On Some Measures on Free Semigroups Induced by Semiautomata
A Generic Strategy Improvement Method for Simple Stochastic Games
Computational Complexity of Synchronization under Regular Constraints
Lower Bounds for Choiceless Polynomial Time via Symmetric XOR-Circuits
Facts in Place/Transition-Nets
Maximum Rooted Connected Expansion
Polynomial-Time Tractable Problems over the p-Adic Numbers
The Hardness of Solving Simple Word Equations
On Multitape Automata
44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, Aachen, Germany, August 26-30, 2019
A Note on the Complexity of Defensive Domination
Two Logical Hierarchies of Optimization Problems over the Real Numbers
Higher-Order Quantified Boolean Satisfiability
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates
On the Complexity of Some Equivalence Problems for Propositional Calculi
Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
Selfish Routing in Non-cooperative Networks: A Survey
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
Decidability of the Equivalence Problem for Synchronous Deterministic Pushdown Automata
On Defect Effect of Bi-Infinite Words
Two Simple Characterizations of Well-Founded Semantics
Reachability Problems in Quaternion Matrix and Rotation Semigroups
The Semantic Foundations of a Compositional Proof Method for Synchronously Communicating Processes
A New Dimension Sensitive Property for Cellular Automata
On Representation of Sequential and Parallel Functions
Proof Systems and Transformation Games
Exponential Space Complexity for Symbolic Maximum Flow Algorithms in 0-1 Networks
The Complexity of Transducer Synthesis from Multi-Sequential Specifications
Decision Complexity of Variants of Propositional Dynamic Logic
A Finite Basis for 'Almost Future' Temporal Logic over the Reals
Optimal Satisfiability for Propositional Calculi and Constraint Satisfaction Problems
Iteration Theories of Boolean Functions
Subtractive Reductions and Complete Problems for Counting Complexity Classes
Slice Rank of Block Tensors and Irreversibility of Structure Tensors of Algebras
Solving Packing Problems with Few Small Items Using Rainbow Matchings
Computational Politics: Electoral Systems
A Protocol for Serializing Unique Strategies
Shrinking Restarting Automata
Efficient Computation in Congested Anonymous Dynamic Networks
Time-Bounded Kolmogorov Complexity and Solovay Functions
On a Deterministic Subclass of Context-Free Languages
On Plain and Hereditary History-Preserving Bisimulation
Sofic-Dyck Shifts
Axiomatic Semantics of Indirect Addressing
Improved Complexity Results on k-Coloring P t -Free Graphs
Progreedings of the MFCS '98 Satellite Workshop on Grammar Systems, Brno, Czech Republic, August 22-23, 1998
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory
Obstructing Classification via Projection
Strong Normalization of Substitutions
Tight Approximability Results for the Maximum Solution Equation Problem over Z p
Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract)
Sliding into the Future: Investigating Sliding Windows in Temporal Graphs (Invited Talk)
Multiplicative Complexity of a Pair of Bilinear Forms and of the Polynomial Multiplication
Generating Words by Cellular Automata
Observe and Remain Silent (Communication-Less Agent Location Discovery)
An Algebraic Model for Parallel Processes
On the Finite Variable-Occurrence Fragment of the Calculus of Relations with Bounded Dot-Dagger Alternation
Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations
Towards DNA Sequencing Chips
Deciding Testing Equivalence for Real-Time Processes with Dense Time
Fixed Points in the Power-Set Algebra of Infinite Trees (Abstract)
On the Generative Capacity of Some Classes of Grammars with Regulated Rewriting
A Lower Bound Technique for Nondeterministic Graph-Driven Read-Once-Branching Programs and Its Applications
Deterministic Rendezvous of Asynchronous Bounded-Memory Agents in Polygonal Terrains
Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases
Two Recursively Inseparable Problems for Probabilistic Automata
Uniformization Problems for Tree-Automatic Relations and Top-Down Tree Transducers
An Approach to Proof Checker
Magic Numbers in the State Hierarchy of Finite Automata
Depth Two Majority Circuits for Majority and List Expanders
Parallel Identity Testing for Skew Circuits with Big Powers and Applications
Routing with Congestion in Acyclic Digraphs
Problems with Cannot Be Reduced to Any Proper Subproblems
Completeness and Degeneracy in Information Dynamics of Cellular Automata
Toward Grünbaum's Conjecture for 4-Connected Graphs
Constructive Aspects of the Omega-Rule: Application to Proof Systems in Computer Science and Algorithmic Logic
Stochastic Automata and Length Distributions of Rational Languages
Another Hierarchy Defined by Multihead Finite Automata
Tree Decompositions of Small Diameter
The Power of the Future Perfect in Program Logics
Improved Approximation Algorithms for the Traveling Tournament Problem
How to Use Spanning Trees to Navigate in Graphs
A Formal Exploration of Nominal Kleene Algebra
Exploring the Space of Colourings with Kempe Changes (Invited Talk)
P-Genericity and Strong G-Genericity
On the Dilation of Interval Routing
On Varieties of Languages Closed Under Products with Counter
On the Work of Dynamic Constant-Time Parallel Algorithms for Regular Tree Languages and Context-Free Languages
Balance Problems for Integer Circuits
NP by Means of Lifts and Shadows
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
Modern Dynamic Data Structures (Invited Talk)
Distributed Synthesis for Regular and Contextfree Specifications
Recursive Program Schemas and Computable Functionals
Analog Processes
Interval-Like Graphs and Digraphs
New Pumping Technique for 2-Dimensional VASS
Tree Exploration in Dual-Memory Model
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry
On Memory Requirements of Strassen's Algorithms
Traces, Histories, Graphs: Instances of a Process Monoid
A New Approach to Analyse Coupled-Context-Free Languages
Characterization of Recognizable Families by Means of Regular Languages
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
Query Maintenance Under Batch Changes with Small-Depth Circuits
The Transitivity Problem of Turing Machines
Faster Approximation Schemes for (Constrained) k-Means with Outliers
Control Structures in Single Block Programs
Coloring k-Colorable Semirandom Graphs in Polynomial Expected Time via Semidefinite Programming
Computing and Comparing Semantics of Programs in Four-Valued Logics
Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
Semicomputable Points in Euclidean Spaces
Event Structures for Resolvable Conflict
Hypothesis-Founded Semantics for Datalog Programs with Negation
Physics and the New Computation
Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs
Schemes for Nonsequential Processing Systems
A Reconfigurations Analogue of Brooks' Theorem
On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata
Mathematical Foundations of Computer Science 2007, 32nd International Symposium, MFCS 2007, Ceský Krumlov, Czech Republic, August 26-31, 2007, Proceedings
Finding Exact and Maximum Occurrences of Protein Complexes in Protein-Protein Interaction Graphs
Electronic Category Theory
Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases
Local Checking of Trace Synchroniziability
When Ignorance Helps: Graphical Multicast Cost Sharing Games
From Parity and Payoff Games to Linear Programming
Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings
The Use of Graphs of Elliptical Influence in Visuel Hierarchical Clustering
Approximation Algorithms for Covering Vertices by Long Paths
Small Alliances in Graphs
Modularization and Abstraction: The Keys to Practical Formal Verification
Parameterized Algorithms and Kernels for Rainbow Matching
(H, C, K)-Coloring: Fast, Easy, and Hard Cases
On Synthesizing Computable Skolem Functions for First Order Logic
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets
Twin-Width of Graphs on Surfaces
An Oracle with no UP-Complete Sets, but NP = PSPACE
On the Domain of Iteration in Iterative Algebraic Theories
A Note on the Join of Varieties of Monoids with LI
A Completeness Property of Wilke's Tree Algebras
Combining Self-reducibility and Partial Information Algorithms
Rényi-Ulam Games and Online Computation with Imperfect Advice
Public Key Identification Based on the Equivalence of Quadratic Forms
The Complexity of Lexicographic Sorting and Searching
Monitor Logics for Quantitative Monitor Automata
The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable
Editing to a Connected Graph of Given Degrees
A Superpolynomial Lower Bound for (1, +k(n))-Branching Programs
Transportation under Nasty Side Constraints
Cooperating Distributed Hyperedge Replacement Grammars
A Model for Retrieval Systems and Some Mathematical Problems Behind
Synchronizing Automata with Extremal Properties
New Advances in Reoptimizing the Minimum Steiner Tree Problem
Pushdown Automata with Restricted Use of Storage Symbols
A Method to Compare the Descriptive Power of Different Types of Petri Nets
Visibly Counter Languages and the Structure of NC 1
Semiboolean Algebras of Submachines
On Two Subclasses of Real-Time Grammars
Lossy Kernels for Hitting Subgraphs
On Expansions of Monadic Second-Order Logic with Dynamical Predicates
Rational Rewriting
A Hierarchy of Regular Sequence Sets
Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
Comparing Interconnection Networks
Picking Random Vertices (Invited Talk)
Generalized Bundled Fragments for First-Order Modal Logic
Nonstochastic Languages as Projections of 2-Tape Quasideterministic Languages
Periodic-Like Words
A Dichotomy Theorem for Homomorphism Polynomials
An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games
Alternating Vector Addition Systems with States
Word Problems for 2-Homogeneous Monoids and Symmetric Logspace
Approximate Counting CSP Seen from the Other Side
Semantics and Proof Rules for Coroutine Hierarchies in Block-Structured Programming Languages
CCS Dynamic Bisimulation is Progressing
NP-Hard Sets Have Many Hard Instances
Deciding Regular Games: a Playground for Exponential Time Algorithms
On Complexity of Nondeterministic Turing Machines Computations
Ratio and Weight Quantiles
Fast Matrix Multiplication by Boolean RAM in Linear Storage
The Least-Core of Threshold Network Flow Games
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2)
Automating OBDD proofs is NP-hard
Additive Cellular Automata Over Finite Abelian Groups: Topological and Measure Theoretic Properties
Probabilistic and Pluralistic Learners with Mind Changes
Guarding Orthogonal Art Galleries Using Sliding Cameras: Algorithmic and Hardness Results
From Timed Automata to Logic - and Back
R-Fuzzy Automata with a Time-Variant Structure
Some Hierarchies for the Communication Complexity Measures of Cooperating Grammar Systems
Operational and Mathematical Semantics for Recursive Polyadic Program Schemata
An Asymptotically Optimal Linear-Time Algorithm for Locally Consistent Constraint Satisfaction Problems
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds
IFS and Control Languages
Undecidability of Two-dimensional Robot Games
Deliverables: A Categorial Approach to Program Development in Type Theory
From Algorithms to Working Programs: On the Use of Program Checking in LEDA
Lower Bounds for the Transition Complexity of NFAs
The Geometry of Reachability in Continuous Vector Addition Systems with States
Retractions in Comparing Prolog Semantics (Extended Abstract)
On Time Lookahead Algorithms for the Online Data Acknowledgement Problem
Ultralinear Expressions
Non-cooperative Tree Creation
Completeness of Global Evaluation Logic
Challenges of the Reachability Problem in Infinite-State Systems (Invited Paper)
On Attribute Grammars
On Synthesis of Resynchronizers for Transducers
On the Hardness of Almost-Sure Termination
Cutoff Theorems for the Equivalence of Parameterized Quantum Circuits
The Complexity of the Minimal Polynomial
A Basis of Tiling Motifs for Generating Repeated Patterns and Its Complexity for Higher Quorum
Mortality for 2×2 Matrices Is NP-Hard
Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings
Stochastization of Weighted Automata
Correctness of Recursive Flow Diagram Programs
Logical Characterization of Bisimulation for Transition Relations over Probability Distributions with Internal Actions
Emergence on Decreasing Sandpile Models
On Diving in Trees
Equations on Trees
Model Theoretical Methods in the Theory of Automata
Reducing a Target Interval to a Few Exact Queries
On the Complexity of Universality for Partially Ordered NFAs
A Weyl Criterion for Finite-State Dimension and Applications
Formalizing Hyperspaces for Extracting Efficient Exact Real Computation
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-hardness
An FPT Algorithm for Spanning Trees with Few Branch Vertices Parameterized by Modular-Width
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence
A Comparative Review of Some Program Verification Methods
On Repetition Languages
On Vector Languages
Graph Clustering in All Parameter Regimes
Invariant Properties of Informational Bulks
On Kleene Algebras and Closed Semirings
Two Applications of Fürer's Counter to One-Tape Nondeterministic TMs
The Computational Power of a Family of Decision Forests
A Robust Class of Languages of 2-Nested Words
On Saturated Calculi for a Linear Temporal Logic
Ordering Metro Lines by Block Crossings
Models, Languages, and Compiler Technology for High Performance Computers
Routing on Triangles, Tori and Honeycombs
Using Transitive-Closure Logic for Deciding Linear Properties of Monoids
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups
Decidability of Reachability in Persistent Vector Replacement Systems
Voronoi Games on Cycle Graphs
Towards a Theory of Randomized Search Heuristics
Full Abstraction for the Second Order Subset of an Algol-Like Language
On the Length of Values in a Finite Transducer
Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems
Graph Connectivity with Noisy Queries
A Survey of Some Syntactic Results in the lambda-Calculus
Extended Simple Regular Expressions
Parameterized Complexity of Non-Separating and Non-Disconnecting Paths and Sets
On Genome Evolution with Innovation
Question/Answer Games on Towers and Pyramids
OBDD(Join) Proofs Cannot Be Balanced
May and Must Convergencey in Concurrent Lambda-Calculus
Automata for the Modal mu-Calculus and related Results
Switching Classes: Characterization and Computation
Remark on the Power of Compass (Extended Abstract)
Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic (Abstract)
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
Counting Homomorphisms from Hypergraphs of Bounded Generalised Hypertree Width: A Logical Characterisation
Capturing the Shape of a Point Set with a Line Segment
Determining Sets of Quasiperiods of Infinite Words
Stable Bistructure Models of PCF
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
On Some Approximation Problems of Continuous Computation
Timed Network Games with Clocks
On the Complexity of Community-Aware Network Sparsification
On-Line Scheduling of Parallel Jobs
Completeness Results for Linear Logic on Petri Nets
An Algebraic Approach to Knowledge Representation
Shattered Sets and the Hilbert Function
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings
Attainable Values of Reset Thresholds
Programming Languages as Mathematical Objects
On Endomorphism Semigroup of Nilpotent Automata
New Perspectives in Distributed Computing
A Timecop's Work Is Harder Than You Think
A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds
Specification and Verification of Timed Lazy Systems
On Two Types of Loops
Keyboards as a New Model of Computation
Counting Problems over the Reals
Necessary Conditions for Containment of Principal (Semi-)AFL with Bounded Generators
Invited Lecture: The Burrows-Wheeler Transform: Theory and Practice
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
A Universal Uniform Approximation Theorem for Neural Networks
Mathematical Foundations of Motivation Languages and Synthesis Maps
Shortest Synchronizing Strings for Huffman Codes
Directed Graph Minors and Serial-Parallel Width
The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups
Results on the Glory of the Past
Upper and Lower Bounds on Long Dual Paths in Line Arrangements
Descriptional Complexity of Deterministic Regular Expressions
Document Retrieval with One Wildcard
Size and Computation of Injective Tree Automatic Presentations
Failures Semantics and Deadlocking of Modular Petri Nets
A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract)
A Contribution to Error Recovery
On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity
Angles and Lengths in Reconfigurations of Polygons and Polyhedra
On Time-Space Trade-Offs in Dynamic Graph Pebbling
On Consecutive Storage of Records
Exponential Lower Bounds for Threshold Circuits of Sub-Linear Depth and Energy
Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs
Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-Calculus
Computing Partial Information out of Intractable One - The First Digit of 2 n at Base 3 as an Example
The Complexity of Minimizing FBDDs
On the Power of Nonconservative PRAM
Lower Bounds for a Proof System with an Expentential Speed-up over Constant-Depth Frege Systems and over Polynomial Calculus
Logical Aspects of the Lexicographic Order on 1-Counter Languages
Four Subareas of the Theory of Constraints, and Their Links
Symbolic Semantics and Analysis for Crypto-CCS with (Almost) Generic Inference Systems
Using Contracted Solution Graphs for Solving Reconfiguration Problems
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
Epistemic Foundation of the Well-Founded Semantics over Bilattices
On the Complexity of Finite Memory Policies for Markov Decision Processes
Pattern-Guided Data Anonymization and Clustering
Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals
A Criterion of Undecidability of Algorithmic Theories
Communication Complexity of Pairs of Graph Families with Applications
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory
LTL with Past and Two-Way Very-Weak Alternating Automata
Complexity and Normal Forms of Contex-Free Languages
Approximating Boolean Functions by OBDDs
Parameterized Counting Problems
On the Complexity of List Ranking in the Parallel External Memory Model
Nonuniform Lower Bounds for Exponential Time Classes
A First-Order Logic for Partial Recursive Functions
Complexity of Checking Bisimilarity between Sequential and Parallel Processes
A Thesis for Bounded Concurrency
On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems
The Pseudo-Skolem Problem is Decidable
Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs
Breadth-First Phrase Structure Grammars and Queue Automata
On Closure Properties of Context-Free Derivation Complexity Classes
Generic Techniques to Round SDP Relaxations
Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact-Satisfiability
A Characterisation of Functions Computable in Polynomial Time and Space over the Reals with Discrete Ordinary Differential Equations: Simulation of Turing Machines with Analytic Discrete ODEs
Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants
Abstract Data Types as Lattices of Finitely Generated Models
Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria
Very Sparse Leaf Languages
Total Correctness for Procedures
An Improved Online Algorithm for the Traveling Repairperson Problem on a Line
Selfish Load Balancing Under Partial Knowledge
∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games
Pomset Semantics for True Concurrency with Synchronization and Recursion (Extended Abstract)
On Selection Functions that Do Not Preserve Normality
Faster Algorithms on Branch and Clique Decompositions
Random Databases and Threshold for Monotone Non-recursive Datalog
The lazy call-by-value Lamda-Calculus
Introduction to Recent Quantum Algorithms
Algorithms for String Editing which Permit Arbitrarily Complex Editing Constraints
Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules
Parity Games and Propositional Proofs
Optimal Data Flow Analysis via Observational Equivalence
Negated String Containment Is Decidable
Counting Dependent and Independent Strings