yusuke1997/dblp-id-title huggingface dataset:
Virtual Substitution for SMT-Solving
FJMIP: A Calculus for a Modular Object Initialization
Martingales on Trees and the Empire Chromatic Number of Random Trees
Composing Equipotent Teams
On Complexity of Computations with Limited Memory
On the Digital System Diagnostics under Uncertainty
Edge-Matching Problems with Rotations
AC 0 Circuit Complexity
On Oblivious Branching Programs of Linear Length (Extended Abstract)
The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics
Bounded Concurrency
Parallel General Prefix Computations with Geometric, Algebraic and Other Applications
Representation of Recursively Enumerable Languages Using Alternating Finite Tree Recognizers
Deterministic Context-Free Dynamic Logic is More Expressive than Deterministic Dynamic Logic of Regular Programs
Generalized Thue-Morse sequences
Efficient Parallel Computing with Memory Faults
Approximation Algorithms for Time-Dependent Orienteering
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs
On Two-Sided Infinite Fixed Points of Morphisms
A Duration Calculus with Infinite Intervals
Evaluatiobn of Cardinalities of Some Families of -Classes in P roh0
Complexity of Identifying Fitting-Free Groups
Deterministic Dynamic Logic of Recursive Programs is Weaker than Dynamic Logic
Reliable Networks from Unreliable Gates With Almost Minimal Complexity
Stable Finite Automata Mappings and Church-Rosser Systems
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching
1-Local 17/12-Competitive Algorithm for Multicoloring Hexagonal Graphs
Regular Approximations to Shuffle Products of Context-free Languages, and Convergence of their Generating Functions
The Parallel Complexity of Some Arithemic and Algebraic Operations
A Note on Decidable Separability by Piecewise Testable Languages
About a Family of Binary Morphisms which Stationary Words are Sturmian
On the Structure of Equilibria in Basic Network Formation
On Containment Problems for Finite-Turn Languages (Extended Abstract)
On Cartesian Powers of P 2
On Comparison of Boolean Bases
Co-Algebras as Machines for the Interpretations of Flow Diagrams
The New Way of Probabilistic Compact Testing
An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem
On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract)
Pebbling and Bandwith
Parallel time O(log n) recognition of unambiguous CFLs
Automata and Program Analysis
Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes
Fully Incremental LCS Computation
Certifying Unsatisfiability of Random 2 k -SAT Formulas Using Approximation Techniques
Adaptive Zooming in Point Set Labeling
Multiway In-Place Merging
Rewriting, Möbius Functions and Semi-Commutations
Discrete extremal problems on covering
New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
Alternating Weighted Automata
On the Average Size of Glushkov and Equation Automata for KAT Expressions
Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space (Extended Abstract)
Query Order in the Polynomial Hierarchy
Bounds on the Power of Constant-Depth Quantum Circuits
Almost Optimal Explicit Selectors
P Systems with Adjoining Controlled Communication Rules
Quantum Real-Time Turing Machine
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Exact Analysis of Three Tree Contraction Algorithms
Complexity of Suffix-Free Regular Languages
The complexity of complex division (extended abstract)
Pseudorandom Number Generation and Space Complexity
Operations Preserving Recognizable Languages
Some Recent Results on Recognizable Formal Power Series
On Recognizable Languages in Divisibility Monoids
Finding Dominators
Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Kraków, Poland, September 1-3, 1997, Proceedings
Mengerian Temporal Graphs Revisited
On Complexity of Colouring Mixed Hypertrees
Saturating Flows in Networks
Linearized Disjunctive Normal Forms of Boolean Functions
On the Power of Unambiguity in Alternating Machines
Some Notes on Threshold Circuits, and Multiplication in Depth 4
On Boundaries of Highly Visible Spaces and Applications
Synthesis of O(lg n) Testable Trees
Deterministic Dequeue Automata and LL(1) Parsing of Breadth-Depth Grammars
Some Results of Zoltán Ésik on Regular Languages
A General Method for Graph Isomorphism
New Sequential and Parallel Algorithms for Computing the β-Spectrum
Computational Problems in Alphabetic Coding Theory
Computational Complexity of Synchronization Under Sparse Regular Constraints
Liveness of Weighted Circuits and the Diophantine Problem of Frobenius
Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings
Recognition of Properties in K-Valued Logic and Approximate Algorithms
Boolean Functions with a Large Number of Subfunctions and Small Complexity and Depth
Statistically Effective Algorithms for Automata Control
Synthesis of Universal Finite Automats
Strong Duality in Horn Minimization
Logic Programming of Some Mathematical Paradoxes
Algorithmization of Obtaining the Converse Comparison Theorems Based on Solving a Logical Equation
The Space Complexity of Sum Labelling
Computing Petri Net Languages by Reductions
Ranomized Parallel Computation
Apects of Programs With Finite Modes
Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time
On Analysis of Protoschemes
On the Complexity of Locally Rainbow Path
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
Divisibility Monoids: Presentation, Word Problem, and Rational Languages
Universal Algebra and Computer Science
A Simple and Fast Min-cut Algorithm
Approximation Results for the Weighted P 4 Partition Problems
Decision Problems and Coxeter Groups
A New Operation Between Languages
Remarks on the Notion of Concurrency Relation in the Case of Systems
A unifying theorem for algebraic semantics and dynamic logics
On Minimizing Average Weighted Completion Time: A PTAS for Scheduling General Multiprocessor Tasks
Disjunctive Languages and Codes
Some Remarks on the Algebra of Automation Mapping
Elements of a general theory of combinatorial structures
Time/Space Efficient Compressed Pattern Matching
Propositional Gossip Protocols
Tree Automata and Discrete Distributed Games
A Fair Calculus of Communicating Systems
Complexity of Common Subsequence Problems
Moderately Exponential Bound for Graph Isomorphism
On the Complexity of Analyzing Experiments for Checking local Faults of an Automaton
Relations Between Average-Case and Worst-Case Complexity
Noise-Resilient Group Testing: Limitations and Constructions
A Dushnik - Miller Type Dimension of Graphs and its Complexity
On a Stable Generating of Random Sequences by Probabilistic Automata
Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete
Minimal Numberings of the Vertices of Trees - Approximate Approach
Soliton Automata
Cones, Semi-AFPs, and AFPs of Algebraic Power Series
Games and Networks
Separating Completely Complexity Classes Related to Polynomial Size Omega-Decision Trees
Recent results on codes
Pattern Languages: Problems of Decidability and Generation
An Axiomatization of the Rational Data Objects
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
Hardness of Pre-assignment Problem for Unique Minimum Vertex Cover on Planar Graphs with Maximum Degree 3
A Characterization of Sequential Machines by Means of Their Behaviour Fragments
Concerning the Time Bounds of Existing Shortest Watchman Route Algorithms
Constructive Relationships Between Algebraic Thickness and Normality
Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract)
Nondeterministic Finite Algorithmic Procedures as the Models of Abstract Computability
A language theoretic approach to serialization problem in concurrent systems
Built-in Self-testing of Logic Circuits Using Imperfect Duplication
Efficient Interpretation of State Charts
Logic programming and substitutions
From a Concurrent Lambda-Calculus to the Pi-Calculus
The Fault-Tolerant Metric Dimension of Cographs
Are lower bounds on the complexity lower bounds for universal circuits
Tree Language Problems in Pattern Recognition Theory (Extended Abstract)
Biautomatic Semigroups
On Approximating Real-World Halting Problems
Learning Under Uniform Distribution
Decidable Classes of the Verification Problem in a Timed Predicate Logic
Cancellation-Free Circuits in Unbounded and Bounded Depth
Fast Triangulation of Simple Polygons
Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs
Relating Automata-Theoretic Hierarchies to Complexity-Theoretic Hierarchies
Processes with Multiple Entries and Exits
The Snow Team Problem - (Clearing Directed Subgraphs by Mobile Agents)
Dimension- and Time-Hierarchies for Small Time Bounds
Space and Reversal Complexity of Probabilistic One-Way Turing Machines
Deterministic Oblivious Local Broadcast in the SINR Model
Small Weakly Universal Turing Machines
Closure of Polynomial Time Partial Information Classes under Polynomial Time Reductions
Representation of Autonomous Automata
Some "Geometrical" Categories Associated with Flowchart Schemes
An Optimal Adaptive In-place Sorting Algorithm
Procedural Implementation of Algebraic Specifications of Abstract Data Types
delta-Uniformly Decidable Sets and Turing Machines
Axiomatizing Petri Net Concatenable Processes
On the Structure of Solution-Graphs for Boolean Formulas
On the Size of Conjunctive Representations of n-ary Relations
On Maximal Repetitions in Words
m-Eternal Domination and Variants on Some Classes of Finite and Infinite Graphs
The Classifikation of Problems which have Fast Parallel Algorithms
On Efficiency of Prefix Word-Encoding of Binary Messages
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
Interpretations of Extensible Objects and Types
The Subword Complexity of Fixed Points of Binary Uniform Morphisms
Constructive Notes on Uniform and Locally Convex Spaces
On the Power of Color Refinement
Automatic synthesis of programs and inductive inference of functions
Almost Transparent Short Proofs for NPℝ
Does Transitivity Help? On the Complexity of Poset Properties
Fundamentals of Computation Theory - 20th International Symposium, FCT 2015, Gdańsk, Poland, August 17-19, 2015, Proceedings
An Algorithmic Approach to Set Theory
Average-Case Non-approximability of Optimisation Problems
A Tour of Recent Results on Word Transducers
Ambainis-Freivalds' Algorithm for Measure-Once Automata
About two-way transducers
Maintaining Arrays of Contiguous Objects
New Small Universal Circular Post Machines
Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings
Classes of Functions over Binary Trees
Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies
Challenges of Commutation
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
Decision Version of the Road Coloring Problem Is NP-Complete
Piecewise and Local Threshold Testability of DFA
Fuzzy Sets and Algorithms of Distributed Task Allocation for Cooperative Agents
Parameterized Complexity of the T h+1 -Free Edge Deletion Problem
Rewriting Systems with Data
On the decidability of the theory of free groups (in Russian) = К Вопросу О Раэрещимости Теории Свободной Группы
Stochastic Algebras and Stochastic Automata over General Measurable Spaces: Algebraic Theory and a Decomposition Theory
On Finding Separators in Temporal Split and Permutation Graphs
Reliable Communication via Semilattice Properties of Partial Knowledge
On the Theory of Syntactic Monoids for Rational Languages
Stratified Petri Nets
On Memoryless Quantitative Objectives
Equivalence of Deterministic Nested Word to Word Transducers
On the Role of Selectors in Selective Substitution Grammars
On the Synchronization of Semi-Traces
Sewing Grammars
k-k Sorting on the Multi-Mesh
On some topological properties of logic programs
Recent Progress in Circuit and Communication Complexity (Abstract)
Economy of Description for Program Schemes -Extended Abstract-
Systolic Y-Tree Automata: Closure Properties and Decision Problems
Generating Graph Languages Using Hypergraph Grammars
Estimation Algorithms of Infinite Graphs Percolation Threshold
On the Enumeration of Permutominoes
Generalized Topological Sorting in Linear Time
Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs
The Consistency of a Noninterleaving and an Interleaving Model for Full TCSP
Approximation Algorithms for the Antenna Orientation Problem
Generalized vector addition systems with finite exception sets
Efficient Sampling of Non-strict Turnstile Data Streams
The Delayed k -Server Problem
Minimizers in Semi-dynamic Strings
Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
About the by Codings of Environments Induced Posets [a z , <=] and [L z , <=]
Mathematical Models and Optimal Algorithms of Dynamic Data Structure Control
Efficient Algorithmic Construction of Designs
Descriptive and Computational Complexity
Complete Disjoint CoNP-Pairs but No Complete Total Polynomial Search Problems Relative to an Oracle
Monte-Carlo Polynomial Versus Linear Time - The Truth-Table Case
A Gemometrical Bound for Integer Programming with Polynomial Constraints
Quantifiers in combinatory PDL: completeness, definability, incompleteness
ϵ-Almost Selectors and Their Applications
Transformationas of Derivation Sequences in Graph Grammars
The Complexity of (P k, P ℓ )-Arrowing
Families of R-Fuzzy Languages
Interprocedural Reachability for Flat Integer Programs
Linear Time Recognizer for Subsets of Z 2
A fast heuristic for covering polygons by rectangles
The Complexity of Routing with Few Collisions
On the Finite Degree of Ambiguity of Finite Tree Automata
Generalized Synchronization Languages
Discrete Time Process Algebra with Abstraction
First-Order Logic and Its Infinitary Quantifier Extensions over Countable Words
Logical Description of Computation Processes
Using Depth to Capture Average-Case Complexity
Notions of Hyperbolicity in Monoids
Free Dynamic and Algebraic Semantics
Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981
An Efficient Computation of the Rank Function of a Positroid
The Complexity of the Sequential Choice Mechanism
Approximations with Axis-Aligned Rectangles (Extended Abstract)
On Block-Wise Symmetric Signatures for Matchgates
One-way Cellular Automata on Cayley Graphs
Sub-computabilities
Tight Bounds for the Number of Absent Subsequences
The Quantum Query Complexity of Algebraic Properties
On the definition of hierarchies of infinite sequential computations
Product Rules in Semidefinite Programming
Tropical Combinatorial Nullstellensatz and Fewnomials Testing
Recent results on continuous ordered algebras
Exponential Output Size of Top-Down Tree Transducers
Depletable Channels: Dynamics and Behaviour
On Computability of Kolmogorov Complexity
On the Communication Complexity of Planarity
On Scattered Syntactic Monoids
Extensions of Symmetric Hom-Functors to the Kleisli Category
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages
Computing Digraph Width Measures on Directed Co-graphs - (Extended Abstract)
On Languages Generated by Semigroups
Metric Properties of Random Sequence
Completeness in Approximation Classes
Structured Randomized Rounding and Coloring
Tree-group automata
The Complexity of the Coverability, the Containment, and the Equivalence Problems for Commutative Semigroups
On Metric Properties of Automata and Epsilon-Approximation of Automaton Mapping
FO Model Checking on Map Graphs
A Primitive for Proving the Security of Every Bit and About Universal Hash Functions & Hard Core Bits
Tiling with Bars and Satisfaction of Boolean Formulas
On Lawson's Oriented Walk in Random Delaunay Triangulations
Pattern-Matching Problems for 2-Dimensional Images Described by Finite Automata
Generalized Rational Relations and their Logical Definability
Necessary decidable conditions for the word and equivalence problem of formal languages
Earliest Query Answering for Deterministic Nested Word Automata
A Single Shortest Path Algorithm for Graphs with Separators
Inducibility of the Composition of Frontier-to-Root Tree Transformations
Effective Category and Measure in Abstract Complexity Theory (Extended Abstract)
Algebras of Partial Sequences - A Tool to Deal with Concurrency
Some Results Concerning Two-Dimensional Turing Machines and Finite Automata
Number Theoretic Algorithms and Cryptology
On Order-Complete Universal Algebra and Enriched Functorial Semantics
Iterated linear control and iterated one-turn pushdowns
One-Way Communication Complexity of Symmetric Boolean Functions
Programming and P=NP Conjecture
Fundamentals of Computation Theory, 8th International Symposium, FCT '91, Gosen, Germany, September 9-13, 1991, Proceedings
Guarding Thin Orthogonal Polygons Is Hard
Recurring Comparison Faults: Sorting and Finding the Minimum
Fundamentals of Computation Theory, FCT '85, Cottbus, GDR, September 9-13, 1985
On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity
An Interpretation of Extensible Objects
Longest α-Gapped Repeat and Palindrome
A Formal Framework for Property-Driven Obfuscation Strategies
Randomized Complexity of Linear Arrangements and Polyhedra
A Combinatorial Aggregation Algorithm for Stationary Distribution of a Large Markov Chain
Fundamentals of Computation Theory, Proceedings of the 1977 International FCT-Conference, Poznan-Kórnik, Poland, September 19-23, 1977
Fast Recognition of Rings and Lattices
Equality Languages and Language Families
Analysis of vectors of coroutines by means of components
Kolmogorov complexity and lower bounds
Designing PTASs for MIN-SUM Scheduling Problems
The Parallel Complexity of Arithmetic Computation
On Convex Quadrangulations of Point Sets on the Plane
An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs
Reconfirmation of Two Results on Disjoint Empty Convex Polygons
Some Topics on Edge-Coloring
The Decycling Number of Cubic Planar Graphs
A Note on the Integrity of Middle Graphs
Fractional Vertex Arboricity of Graphs
Note on Characterization of Uniquely 3-List Colorable Complete Multipartite Graphs
Hamiltonicity of Complements of Total Graphs
Fitting Triangles into Rectangles
The Kauffman Bracket Polynomial of Links and Universal Signed Plane Graph
Coverage Problem of Wireless Sensor Networks
Rotational Steiner Ratio Problem Under Uniform Orientation Metrics
Discrete Geometry, Combinatorics and Graph Theory, 7th China-Japan Conference, CJCDGCGT 2005, Tianjin, China, November 18-20, 2005, Xi'an, China, November 22-24, 2005, Revised Selected Papers
The (Adjacent) Vertex-Distinguishing Total Coloring of the Mycielski Graphs and the Cartesian Product Graphs
Core Stability of Flow Games
On the Upper Chromatic Numbers of Mixed Interval Hypertrees
Infinite Series of Generalized Gosper Space Filling Curves
Three Classes of Bipartite Integral Graphs
General Balanced Subdivision of Two Sets of Points in the Plane
Contractible Edges in a k -Connected Graph
A Neighborhood Condition for Graphs to Have [ a , b ]-Factors III
Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs
Regular Coronoids and Ear Decompositions of Plane Elementary Bipartite Graphs
Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs
Isolated Toughness and Existence of f -Factors
Two Classes of Simple MCD Graphs
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order
Indecomposable Coverings
On the Choice Numbers of Some Complete Multipartite Graphs
The Binding Number of a Digraph
A Cascade Decomposition of Weighted Finite Transition Systems
On shrinking restarting automata
Second Workshop on Non-Classical Models for Automata and Applications - NCMA 2010, Jena, Germany, August 23 - August 24, 2010. Proceedings
Input-driven pushdown automata: nondeterminism and unambiguity
One-way simulation of two-way finite automata over small alphabets
Two-way frequency finite automata
Evolving Under Small Disruption
On regular expressions with backreferences and transducers
On the Expressiveness of Parikh Automata and Related Models
Is computation observer-relative?
On the dissimilarity operation on finite languages
Concatenation on deterministic and alternating automata
Streaming Tree Automata and XPath
A family of two-head pushdown automata
Computing by Observing Change in Insertion/Deletion Systems
Expressive capacity of subregular expressions
Latrunculi - on the complexity of Roman chess
(In)Dependencies in Functional Generative Description by Restarting Automata
The support of nested weighted automata
Characterizations of LRR-languages by correctness-preserving computations
On the application of Watson-Crick finite automata for the resolution of bioinformatic problems
Programming language specification by a grammar with contexts
Minimality problems for promise versions of finite automata
Events and Languages on Unary Quantum Automata
Subregular Restrictions for Some Language Generating Devices
Regularity of Languages Defined by Formal Series with Isolated Cut Point
Strongly limited automata
One Pebble Versus log(n) Bits
Dynamic Sync-Programs for Modular Verification of Biological Systems
A relation between definite and ordered finite automata
New reformulations of Cerny's conjecture and related problems
Catalytic and purely catalytic P automata: control mechanisms for obtaining computational completeness
P Automata: Automata-like constructs modeling complex natural systems
String Assembling Systems
Uncountable classical and quantum complexity classes
One-way topological automata and the tantalizing effects of their topological features
On a class of rational functions for pictures
Computing by observing reductions in partial orders
A recursive definition of quantum polynomial time computability (extended abstract)
DNA self-assembly by hairpin (extended abstract)
State Complexity of Intersection and Union of Suffix-Free Languages and Descriptional Complexity
Language Operators for Multiset Languages and Modal Logic
On relations between some subregular language families
Systems of Parallel Communicating Restarting Automata
An Alternating Hierarchy for Finite Automata
Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13 - August 14, 2013, Proceedings
Digging input-driven pushdown automata
A note on the complexity of deterministic tree-walking transducers
On bonded sequential and parallel insertion systems
Automata that may change their mind
Discrete Signal Machines via Pretopology
Transducing by Observing and Restarting Transducers
Survey: Tree Transducers in Machine Translation
Closure Operators Associated to Partially Ordered Sets
An Automaton-based Formalism for Cooperative Augmented Reality Systems
Non-classical Turing machines: extending the notion of computation
Automata Walking over Trees and Graphs
Growing Grammars and Length-Reducing Automata
Complexity classes in membrane computing: P-conjecture and related issues
Minimization and characterizations for biautomata
On Biautomata
Reversible Turing machines with a small number of states
Regular grammars for array languages
Cyclically extended variants of Sgraffito and restarting automata for picture languages
Language classes associated with automata over matrix groups
Pushdown Automata with Translucent Pushdown Symbols
On the optimal reachability problem in weighted timed automata and games
Taxonomy of Red-Automata Motivated by Error Localization
On double-jumping finite automata
k-Counting Automata