yusuke1997/dblp-id-title huggingface dataset:
Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract)
Augmenting Local Edge-Conncectivity between Vertices and Vertex Subsets in Undirected Graphs
On the Adequacy of Per Models
Separation Results for Rebound Automata
Perfect Forests in Graphs and Their Extensions
The Role of Polymorphism in the Characterisation of Complexity by Soft Types
Pushdown Automata on Infinite Trees and Omega-Kleene closure of Context-Free Tree Sets
Complexity Classes of Formal Languages (Preliminary Report)
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners
Approximation Algorithms for Generalized Plant Location
Dual Connectedness of Edge-Bicolored Graphs and Beyond
Correctness of Mixed Computation in Algol-Like Programs
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
Comorphism-Based Grothendieck Logics
On Efficiently Solvable Cases of Quantum k-SAT
On Polynomially Time Bounded Symmetry of Information
Goal-Oriented Derivation of Logic Programs
Dynamic Membership for Regular Tree Languages
Distance Labeling Schemes for Cube-Free Median Graphs
The Complexity of SORE-definability Problems
Test of Quantumness with Small-Depth Quantum Circuits
Strategy Complexity of Concurrent Safety Games
On the Completeness of Query Languages for Relational Data Bases
Real-Time Refinement: Semantics and Application
The Characteristic Polynomial of a Finite Automaton
Exponential-Size Model Property for PDL with Separating Parallel Composition
The Shuffle Exchange Network has a Hamiltonian Path
On Property Testing of the Binary Rank
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems
On Realization and Implementation
Meta-Envy-Free Cake-Cutting Protocols
Periodicity Algorithms for Partial Words
Complexity of Decision Problems for Simple Regular Expressions
Synchronizing Finite Automata on Eulerian Digraphs
Towards Regular Languages over Infinite Alphabets
The Emptiness Problem for Intersections of Regular Languages
Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems
From Expanders to Hitting Distributions and Simulation Theorems
Generalizing Singly-Linked List Reorganizing Heuristics for Doubly-Linked Lists
A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries
Approaches to Concurrency in B-Trees
Automata and Rational Expressions on Planar Graphs
D-Width: A More Natural Measure for Directed Tree Width
Agent-Based Information Handling in Large Networks
Computing DAWGs and Minimal Absent Words in Linear Time for Integer Alphabets
On Mappings of Machines
Untimed Language Preservation in Timed Systems
Relational definition of Computer Languages
A Probabilistic Restriction of Branching Plans
Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves
Two-Variable Logic over Countable Linear Orderings
The Longest Path Problem Is Polynomial on Interval Graphs
Algorithmic Information Theory and Cellular Automata Dynamics
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles
Cooperation in Contextual Grammars
Modelling Concurrency with Semi-Commutations
Every Binary Pattern of Length Greater Than 14 Is Abelian-2-Avoidable
On Complexity of Counting
Efficient View Point Selection for Silhouettes of Convex Polyhedra
Graph Similarity and Approximate Isomorphism
An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs
On Finite Automata with Limited Nondeterminism
The Ground-Set-Cost Budgeted Maximum Coverage Problem
A Uniform Approach to Balanced Binary and Multiway Trees
Constructing Premaximal Ternary Square-Free Words of Any Level
Context-Free Programmed Grammars and ETOL Systems
A Survey of Recent Problems and Results in Analytic Computational Complexity
A Sound and Complete Proof System for Partial Program Correctness
Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes
Catalytic Computing and Register Programs Beyond Log-Depth
Testing Isomorphism of Outerplanar Graphs in Parallel
On Sampling Simple Paths in Planar Graphs According to Their Lengths
Intelligent Languages: A Preliminary Syntactic Theory
Finding Short Synchronizing Words for Prefix Codes
A Taxonomy of Forgetting Automata
Powerdomains
A Survey on Oracle Techniques
Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests
Quantum Weakly Nondeterministic Communication Complexity
Unary Pushdown Automata and Auxiliary Space Lower Bounds
Key-Equivalence of Functional Dependency Statements Systems
ATIME(N) is Closed Under Counting
Maximum Area Axis-Aligned Square Packings
Equations on Partial Words
Dynamic Constant Time Parallel Graph Algorithms with Sub-Linear Work
On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking Problem
A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree
Unique Deciperability for Partially Commutative Alphabet (Extended Abstract)
Constrained Representations of Map Graphs and Half-Squares
Strictness of the Collapsible Pushdown Hierarchy
A Characterization of Bispecial Sturmian Words
On Computing the Average Distance for Some Chordal-Like Graphs
On Minimising Automata with Errors
Finding and Counting Vertex-Colored Subtrees
Classes of Languages Generated by the Kleene Star of a Word
The Hoare-Like Verification System for a Language with an Exception Handling Mechanism
The Equivalence, Unambiguity and Sequentiality Problems of Finitely Ambiguous Max-Plus Tree Automata are Decidable
Asynchronous Omega-Regular Games with Partial Information
A Super-Polynomial Separation Between Resolution and Cut-Free Sequent Calculus
Reducing Operators for Normed General Formal Systems
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Solving 3-Superstring in 3 n/3 Time
Equational Properties of Iteration in Algebraically Complete Categories
Formalization of Algorithmic Reasoning
On the Word, Subsumption, and Complement Problem for Recurrent Term Schematizations
Space-Economical Construction of Index Structures for All Suffixes of a String
An Algebraic Approach to Concurrence
Algebras as Knowledge Structures
Affine Automata: A Technique to Generate Complex Images
Decomposing Finite Languages
Computing the Maximum using (min, +) Formulas
Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
Quicksort Without a Stack
Maximum Votes Pareto-Efficient Allocations via Swaps on a Social Network
Formal Definition of Semantics of Generated Control Regimes
When are Two Rewrite Systems More than None?
Shuffle on Trajectories: The Schützenberger Product and Related Operations
Semantics of Nondeterminism, Concurrency and Communication (Extended Abstract)
Short Proofs of Strong Normalization
Synthesis of Robust Optimal Real-Time Systems
An Approximation Semantics for the Propositional Mu-Calculus
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem
Griddings of Permutations and Hardness of Pattern Matching
Bisimilarity Problems Requiring Exponential Time
Lambda Substitution Algebras
A Mathematical Approach to Multi-Pass Parsing
Relational Specifications and Observational Semantics
Graph Walking Automata
Succinctness of Regular Expressions with Interleaving, Intersection and Counting
Structural Parameters for Dense Temporal Graphs
Efficient Testing of Optimal Time Adders (Extended Abstract)
Model Checking Concurrent Recursive Programs Using Temporal Logics
One Quantifier Will Do in Existential Monadic Second-Order Logic over Pictures
Infinite Behaviour if Deterministic Petri Nets
Inverse Monoids: Decidability and Complexity of Algebraic Questions
Solving Partial Dominating Set and Related Problems Using Twin-Width
Computational Complexity of String and Graph Identification
Compressed Word Problems for Inverse Monoids
Scott Is Always Simple
Approximation in (Poly-) Logarithmic Space
Decomposition of TrPTL Formulas
Stably Computing Order Statistics with Arithmetic Population Protocols
Mathematical Foundations of Computer Science 1984, Praha, Czechoslovakia, September 3-7, 1984, Proceedings
A Hierarchy for (1, +k)-Branching Programs with Respect of k
Online Domination: The Value of Getting to Know All Your Neighbors
Partial Randomness and Dimension of Recursively Enumerable Reals
Metastability of Asymptotically Well-Behaved Potential Games - (Extended Abstract)
On Unconditional Transfer
Grammars for Indentation-Sensitive Parsing
On Verifying Fair Lossy Channel Systems
Cohomology in Constraint Satisfaction and Structure Isomorphism
On Logics of Discovery
Random Subgroups of Rationals
On the Power of Alternation in Finite Automata
Minimum Cycle Bases in Graphs Algorithms and Applications
An Optimal Lower Bound for Resolution with 2-Conjunctions
Conter Machines: Decidable Properties and Applications to Verification Problems
On Rational Expressions Representing Infinite Rational Trees: Application to the Structure of Flow Charts
A Logical Operational Semantics of Full Prolog, Part II: Built-in Predicates for Database Manipulation
XML Grammars
Can Everybody Sit Closer to Their Friends Than Their Enemies?
An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
On the Computing Paradigm and Computational Complexity
The Complexity of Manipulating Hierarchically Defined Sets of Rectangles
Flip Algorithm for Segment Triangulations
Universal Gauge-Invariant Cellular Automata
Introducing Negative Information in Relational Databases
Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs
Mathematical Foundations of Computer Science 2006, 31st International Symposium, MFCS 2006, Stará Lesná, Slovakia, August 28-September 1, 2006, Proceedings
Mastering Contextsensitivity in Programming Languages
A v-Calculus with Local Views for Systems of Sequential Agents
Size-Change Abstraction and Max-Plus Automata
The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection Width
On the Generation of Trees by Hyperedge Replacement
omega+-Valued Algorithmic Logic as a Tool to Investigate Procedures
An Eassay about Research on Sparse NP Complete Sets
Fine and Wilf's Theorem and Pseudo-repetitions
Inductive Syntactical Synthesis of Programs from Sample Computations
Weak Cost Monadic Logic over Infinite Trees
Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations
Explicit Fusions
Two variable fragment of Term Modal Logic
Optimal Linear Arrangement of Interval Graphs
Word Level Model Checking (Abstract)
Solving minones-2-sat as Fast as vertex cover
On the Complexity of Speed Scaling
Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes
Robust Computations with Dynamical Systems
Synthesis of Concurrent Schemes
Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
Decision Problems for Origin-Close Top-Down Tree Transducers
From Static to Dynamic Abstract Data-Types
Adversarial Queueing Model for Continuous Network Dynamics
On-Line Addition in Real Base
Equivalence and Optimization of Recursive Program Schemata
On Approximation of Bookmark Assignments
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families
Validity of Tree Pattern Queries with Respect to Schema Information
A Reachability Algorithm for General Petri Nets Based on Transition Invariants
On the Implicit Graph Conjecture
Reducing the Number of Solutions of NP Functions
Complex and Complex-Like Traces
A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums
Consistent Semantics for a Data Flow Language
Second-Order Algebraic Theories - (Extended Abstract)
A Pumping Lemma for Two-Way Finite Transducers
A Complete Axiomatic Characterization of Algorithmic Properties of Block-Structured Programs with Procedures
Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem
When Lawvere Meets Peirce: An Equational Presentation of Boolean Hyperdoctrines
A Dichotomy Theorem for Polynomial Evaluation
A General Class of Models of H *
Kernels for Edge Dominating Set: Simpler or Smaller
The Kleene Equality for Graphs
Defining Soft Sortedness by Abstract Interpretation
Sparse Graphic Degree Sequences Have Planar Realizations
Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions
Quasiperiodicity and Non-computability in Tilings
Regular Language Distance and Entropy
Game Semantics for Programming Languages (Abstract)
Approximating Maximum Independent Sets in Uniform Hypergraphs
Relating Hierarchy of Temporal Properties to Model Checking
Partial Characterization of Synchronization Languages
Computational Model for Parsing Expression Grammars
On Matroid Properties Definable in the MSO Logic
Structural Model Checking for Communicating Hierarchical Machines
Automata on Linear Orderings
Smoothed Analysis of Three Combinatorial Problems
Communication Complexity of the Secret Key Agreement in Algorithmic Information Theory
On Dynamic α + 1 Arboricity Decomposition and Out-Orientation
On Searching of Special Cases of Mazes and Finite Embedded Graphs
Learning Reductions to Sparse Sets
Representations of Graphs by Means of Products and Their Complexity
Graph Layout Problems
Lazy B-Trees
Two-Level Meta-Controlled Substitution Grammars
Concurrent Games and Semi-Random Determinacy
One-Dimensional Logic over Trees
Algorithms for Computing Small NFAs
Least and Greatest Solutions of Equations over Sets of Integers
Finding Optimal Solutions With Neighborly Help
Pure Nash Equilibria in Games with a Large Number of Actions
Complexity of Propositional Independence and Inclusion Logic
Log-Concavity and Lower Bounds for Arithmetic Circuits
Collective Fast Delivery by Energy-Efficient Agents
A Term Model for CCS
Generalized Definite Tree Languages
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk)
Informative Labeling Schemes for Graphs
A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs
Some Results on the Full Abstraction Problem for Restricted Lambda Calculi
Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings
Randomness and Effective Dimension of Continued Fractions
Adhesivity Is Not Enough: Local Church-Rosser Revisited
The Complexity of Finding Replicas Using Equality Tests
Semigroup Characterizations of Some Language Varieties
Paradigms for Parameterized Enumeration
The Average Complexity of Moore's State Minimization Algorithm Is O(n log log n)
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields
Regular Augmentation of Automata and Transducers (Extended Abstract)
Tree Transformations via Finite Recursive Transition Machines
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
On Synchronizing Colorings and the Eigenvectors of Digraphs
An Introduction to Dynamic Labled 2-Structures
On the Use of Duality and Geometry in Layouts for ATM Networks
Minimal Forbidden Words and Factor Automata
Complexity Framework for Forbidden Subgraphs III: When Problems Are Tractable on Subcubic Graphs
A Robust Measure on FDFAs Following Duo-Normalized Acceptance
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms
Computational Complexity Based on Expectation of the Time of Computation on Minsky Machines
Heuristic Representation of State-Space by Finite Automata
On Optimal Merging Networks
Parikh One-Counter Automata
Finite Constants: Characterizations of a New Decidable Set of Constants
Ch(k) Grammars: A Characterization of LL(k) Languages
on And/Or Schemes
Mathematical Foundations of Computer Science 1997, 22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings
Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs
Enumeration of Preferred Extensions in Almost Oriented Digraphs
Unveiling the Connection Between the Lyndon Factorization and the Canonical Inverse Lyndon Factorization via a Border Property
Derivation of Rational Expressions with Multiplicity
On Possibilities of One-Way Synchronized and Alternating Automata
Analysis of Bounded Disorder
A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs
Dynamic Planar Embedding Is in DynFO
Making Dynamic Logic First-Order
Streaming in Graph Products
Tree-Stack Automata
The Reachability Problem for Vector Addition System with One Zero-Test
Some Remarks on the Test Complexity of Iterative Logic Arrays
From Bidirectionality to Alternation
Probabilistic LCF
Separating Automatic Relations
Properties of Complexity Classes: A Short Survey
Characterization of Rational and Algebraic Power Series
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
Fixed-Point Cycles and Approximate EFX Allocations
Equations of Formal Power Series over Non Commutative Semiring
A Fast Parallel Algorithm for Eigenvalue Problem of Jacobi Matrices
How Far Are We From Having a Satisfactory Theory of Clustering?
Sequential Functions and Generalized Moore and Mealy Automata
Fast Algorithms for General Spin Systems on Bipartite Expanders
Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width
Some Results Concerning the Situation Calculus
The Algebraic Semantics of Recursive Program Schemes
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps
Intersection Graphs of L-Shapes and Segments in the Plane
On Grammatical Complexity of Context-Free Languages (Extended Abstract)
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, Aalborg, Denmark, August 21-25, 2017
Arthur and Merlin as Oracles
Complexity Hierarchies of Oracles
Turing Machine Recognition
Some Remarks on Deciding Equivalence for Graph-To-Graph Transducers
Construction of List Homomorphisms by Tupling and Fusion
Bases of Paths in Correctness Proofs
Efficient Provably-Secure Hierarchical Key Assignment Schemes
Average Case Analysis of Leaf-Centric Binary Tree Sources
Acceptors for Iteration Languages
Dividing Splittable Goods Evenly and With Limited Fragmentation
A Competitive Analysis of the List Update Problem with Lookahead
Randomized and Approximation Algorithms for Blue-Red Matching
Pancake Flipping Is Hard
On the Exact Learnability of Graph Parameters: The Case of Partition Functions
A Probabilistic PTAS for Shortest Common Superstring
Approximate Suffix-Prefix Dictionary Queries
On a Generalization of Bi-Complement Reducible Graphs
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems
Scheduling Parallel Communication: The h-relation Problem
Proof Systems for Cause Based Equivalences
Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
RLE Edit Distance in Near Optimal Time
Minimization of Deterministic Finite Automata Modulo the Edit Distance
Complexity and Minimality of Context-Free Grammars and Languages
Call-by-Value versus Call-by-Name: A proof-Theoretic Comparison
Tree Exploration with an Oracle
Nested Weighted Limit-Average Automata of Bounded Width
Syntactic Semiring of a Language
Dijkstra's Predicate Transformer, Non-Determinism, Recursion and Termination
Sublogarithmic Ambiguity
Pricing Problems with Buyer Preselection
A Decidable Case of the Semi-Unification Problem
Approximating Earliest Arrival Flows with Flow-Dependent Transit Times
The Complexity of Finding Small Separators in Temporal Graphs
Boolean Automata and Atoms of Regular Languages
Agafonov's Theorem for Probabilistic Selectors
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones
FO-Query Enumeration over SLP-Compressed Structures of Bounded Degree
Stochastic Games with Finitary Objectives
On Languages, Accepted by Machines in the Category of Sets
RAC Drawings of Graphs with Low Degree
PRAM-On-Chip: A Quest for Not-So-Obvious Non-obviousness
Lower and Upper Bounds for the Problem of Page Replication in Ring Networks
Towards an Understanding of Complex Processes
Faster Exploration of Degree-Bounded Temporal Graphs
Satisfiability of Systems of Equations over Finite Monoids
An Algebraic Proof of the Real Number PCP Theorem
Inferring Strings from Graphs and Arrays
Locality of Order-Invariant First-Order Formulas
Computable Data Types
Complexity of Computing the Anti-Ramsey Numbers for Paths
Recurrence Function on Sturmian Words: A Probabilistic Study
Monadic Second-Order Logic and Context-Free Graph-Grammars
Approximating Dominating Set on Intersection Graphs of Rectangles and L-frames
Directed Percolation Arising in Stochastic Cellular Automata Analysis
The Structure of Tractable Constraint Satisfaction Problems
New Algorithms for k -SAT Based on the Local Search Principle
Abstract Dynamic Data Types: A Temporal Logic Approach
Constructing Deterministic ω-Automata from Examples by an Extension of the RPNI Algorithm
A Bin Packing Algorithm with Complexity O(n log n) and Performance 1 in the Stochastic Limit
On Upward-Planar L-Drawings of Graphs
Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
One-Parametric Presburger Arithmetic Has Quantifier Elimination
Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays
Reducing the Domination Number of Graphs via Edge Contractions
Walrasian Pricing in Multi-Unit Auctions
Universal Test for Quantum One-Way Permutations
Separating +L From L, NL, co-NL and AL (=P) for Oblivious Turing Machines of Linear Access Time
An Algebraic Characterization of Stochastic Finite-State Automata and Their Behaviour Functions
On Algorithmic Theory of Stacks
On the Weighted Path Length of Binary Search Trees for Unknown Access Probabilities
On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model
The Minimal Graph Model of Lambda Calculus
Characterizing Simpler Recognizable Sets of Integers
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics
On the Number of Random Digits Required in MonteCarlo Integration of Definable Functions
Once More on Order-Sorted Algebras
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
Parallel Construction of Minimal Suffix and Factor Automata
Bilinear Functions and Trees over the (max, +) Semiring
An Algebraic Approach to Programs and Their Computations
Making Metric Temporal Logic Rational
Reachability in Symmetric VASS
Online and Offline Access to Short Lists
Processes and Hyperuniverses
On Finding All Solutions of the Partitioning Problem
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
Measure Properties of Game Tree Languages
Double Threshold Digraphs
Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups
Positional-Player Games
Fast Parallel Computation of Polynomials Using Few Processes
On Word Equations in One Variable
On Affine Reachability Problems
Multiplicative Complexity of a Bilinear Form over a Commutative Ring
Choosability of P5-Free Graphs
Some Computational Issues in Membrane Computing
Self-indexed Text Compression Using Straight-Line Programs
Error-Bounded Probabilistic Computations between MA and AM
Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority
Theory and Applied Computing: Observations and Anecdotes
Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
Maximum Minimal Vertex Cover Parameterized by Vertex Cover
Ideal Membership Problem and a Majority Polymorphism over the Ternary Domain
Error-Tolerant Non-Adaptive Learning of a Hidden Hypergraph
Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian
A Proof System for Asynchronously Communicating Deterministic Processes