yusuke1997/dblp-id-title huggingface dataset:
Bit-Parallel Algorithms for the Merged Longest Common Subsequence Problem
An universality result for a (mem)brane calculus based on mate/drip operations
Weighted Automata and Regular Expressions over Valuation Monoids
Self stabilization in Distributed Knot Detection
Mathematical Modelling and Computational Analysis of Covid-19 Epidemic in Erbil Kurdistan Using Modified Lagrange Interpolating Polynomial
A New Study of Parikh Matrices Restricted to Terms
An Inequality for the Number of Periods in a Word
Decidability and complexity in automatic monoids
Update-Efficient Data Structures for Dynamic IP Router Tables
Optimal Embedded and Enclosing Isosceles Triangles
A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler
Minimizing Total Weighted earliness-tardiness on a Single Machine around a Small Common due date: an FPTAS Using Quadratic Knapsack
Planar Crossing Numbers of Graphs Embeddable in Another Surface
On the Performance and Cost of Some PRAM Models on CMP Hardware
Higher-Order Analysis of 2-3 Trees
Algorithms for k-Disjoint Maximum Subarrays
Steiner Points in the Space of Genome Rearrangements
Gandy's principles for mechanisms and membrane computing
Cover transducers for functions with finite domain
On the Performance of Static and Dynamic Location Management Strategies in Mobile Computing
Monomial Generalized Almost Perfect Nonlinear Functions
Almost Perfect c-Nonlinear Permutations with Trace Functions over 픽2n
Hyper-Minimization for Deterministic Tree Automata
On Finding Topologically Valid Matchings in Restriction-Fragment Maps
Exploration of Faulty Hamiltonian Graphs
Weak Separation Problem for Tree Languages
Two-Dimensional Context-Free Grid Grammars
A New Convertible Authenticated Encryption Scheme Based on the ElGamal Cryptosystem
One-Space Bounded Algorithms for Two-Dimensional Bin Packing
Giovanni in Paris
On Modal μ-Calculus over Finite Graphs with Small Components or Small Tree Width
Design and Analysis of the Symmetric Banyan Network(SBN): A Min with High Performance and High Fault Tolerance
Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube
Formal Descriptions of Code Properties: Decidability, Complexity, Implementation
A Novel Identity-Based Key-Insulated Convertible Authenticated Encryption Scheme
Complexity of Scenario-Based Portfolio Optimization Problem with VaR Objective
Martin-Löf's Type Theory as an Open-Ended Framework
The Longest Path Problem in Odd-Sized O-Shaped Grid Graphs
On Self-Dual Four Circulant Codes
A Type-Free Theory of Half-Monotone Inductive Definitions
Inverse Spectral Problems for a Special Acyclic Matrix
Analysis of complements in Multi-Exponentiation Algorithms Using Signed Digit Representations
Approximating the Spanning k-Tree forest Problem
The First Approximated Distributed Algorithm For The Minimum Degree Spanning Tree Problem On General Graphs
Analysis of PRAM Instruction Sets from a Log Cost Perspective
Multi-Stability, Limit Cycles, and Period-Doubling Bifurcation with Reaction Systems
IDPM: An Improved Degenerate Pattern Matching Algorithm for Biological Sequences
Neighbor Aware Adaptive Power Flooding (NAAP) in Mobile Ad Hoc Networks
Optimal Cellular Network Deployment Reusing Existing Base Stations
Special Issue: 25th International Conference on Developments in Language Theory (DLT 2021) - Preface
Routing Algorithms for Double Loop Networks
On the number of Abelian Bordered Words (with an Example of Automatic Theorem-Proving)
Minimum Feedback Arc Sets in Rotator and Incomplete Rotator Graphs
Fast Factorization by Similarity of Fuzzy Concept Lattices with Hedges
Complement, Complexity, and Symmetric Representation
Infinite iterated function systems in cantor space and the hausdorff measure of omega-power languages
Network Orientation
Automatic Result Verification by Complete Run-Time Checking of Computations
Petri Nets and Step Transition Systems
Ems1: an Elegant Algorithm for Edit Distance Based Motif Search
Constrained Point Set Embedding of a Balanced Binary Tree
Conditionally accepted sampling: AB15 IO scheme with smaller deviation ratio
Strict Local Testability with Consensus Equals Regularity, and Other Properties
Relaxed Inorder Heaps
Language Quotients Revisited
Uniform Algebraic Specifications of Finite Sets with Equality
On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages
Decidability of Uniform Recurrence of Morphic Sequences
Further results on P systems with promoters/inhibitors
State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs
The Differential Properties of Certain Permutation Polynomials over Finite Fields
Provably Shorter Regular Expressions from Finite Automata
Routing in optical multistage networks with limited crosstalk using ant colony optimization
Hierarchies of Generalized Kolmogorov Complexities and Nonenumerable Universal Measures Computable in the Limit
The Complexity of Finding Middle Elements
Customizing Adaptive Software to Object-Oriented Software Using Grammars
The Structure of Factor Oracles
Potential of Quantum Finite Automata with Exact Acceptance
Performance Evaluation of Practical Parallel Computer Model LogPQ
Approximation Algorithms for Partial Vertex Covers in Trees
Parallel Hybrid Genetic Algorithms for Solving Q3AP on Computational Grid
On one-membrane P systems operating in sequential mode
Conversions Between Six Models of Finite Automata
A Note on the Determination of the Immediate Predecessors in a Distributed Computation
Union-Freeness Revisited - Between Deterministic and Nondeterministic Union-Free Languages
Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator
On the Edge of Decidability in Complexity Analysis of Loop Programs
Number of Occurrences of powers in Strings
On the Average Altitude of Heap-Ordered Trees
Structural Synthesis of PLC Program for Real-Time Specification Patterns
Words Guaranteeing Minimum Image
Approximation Algorithm for Resource Allocation Problems with Time Dependent Penalties
Holes and Dominoes in Meyniel Graphs
A Parameterized Algorithm to Explore Formal Contexts with a Taxonomy
Boundary Triangulations Approximating Developable Surfaces that Interpolate a Close Space Curve
New Results on Vector and Homing Vector Automata
An Efficient Parallel Sorting Compatible with the Standard Qsort
Geometric Transformations on Language Families: The Power of Symmetry
The h-Component Diagnosability of Alternating Group Graphs
Shortest Journeys in Directed Temporal Graphs
State Complexity of Boundary of Prefix-Free Regular Languages
Eulerian and Hamiltonian Soft Semigraphs
On various notions of parallelism in P Systems
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks
SpliceTAPyR - An Efficient Method for Transcriptome Alignment
Exact Affine Counter Automata
Decomposition of Weighted multioperator Tree Automata
Random Regular Expression Over Huge Alphabets
When is a Category of Many-Sorted Algebras Cartesian Closed?
Identity-Based Batch Provable Data Possession with Detailed Analyses
Erratum: On The Minimal Polynomial Of A Matrix
On the Non-Deterministic Communication Complexity of Regular Languages
Magic numbers for symmetric difference NFAS
Some Remarks on Quantum Automata
From Tree Automata to Rational Tree Expressions
One-Way Restarting Automata and Their Sensitivitys
Morphic Characterizations of Language Families in Terms of Insertion Systems and Star Languages
Searching a Pseudo 3-Sided Solid Orthoconvex Grid
Boolean Grammars and GSM Mappings
Privacy-Preserving Subgraph Matching Protocol for Two Parties
On the Construction of Multiply Constant-Weight Codes
Partially Ordered Two-Way BüChi Automata
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns
Lindström Quantifiers and Leaf Language Definability
Discrete Nondeterministic Modeling of the Fas Pathway
Flipping Letters to minimize the Support of a String
A Note on the Asymptotic Probabilities of Existential Second-Order Minimal Gödel Sentences with Equality
A Method for Evaluating the Expected Load of Dynamic Tree Embeddings in Hypercubes
A Graph Based Davidson Algorithm for the Graph Partitioning Problem
The (n, k)-Modified-Bubble-Sort Graph: A Generalized Modified-Bubble-Sort Graph
Reachability Problems in Low-Dimensional Iterative Maps
An NP-complete fragment of LTL
Binding Number and Wheel Related Graphs
The Complexity of Model Checking for Boolean Formulas
Computing with Light: toward Parallel Boolean Algebra
An Extension of an Automated Termination Method of Recursive Functions
On The Minimal Polynomial Of A Matrix
Language families defined by a ciliate bio-operation: hierarchies and decision problems
Zoom Structures and reaction Systems Yield Exploration Systems
Arithmetic coding in parallel
Special Issue: Articles Dedicated to the Memory of Magnus Steinby - Preface
NP-Hardness and Approximation Algorithms for Iterative Pricing on Social Networks with Externalities
Component Edge Connectivity of Hypercubes
The Quine-Bernays Combinatory Calculus
The Generalized Connectivity of Bubble-Sort Star Graphs
Erratum: Customizing Adaptive Software to Object-Oriented Software Using Grammars
Improving Two Novel Three-Party Encrypted Key Exchange Protocols with Perfect Forward Secrecy
State Complexity of the Quotient Operation on Input-Driven Pushdown Automata
On the Decidability of the Intersection Problem for Quantum Automata and Context-Free Languages
Regular Approximation of Weighted Linear Context-Free Tree Languages
The Magic Number Problem for Subregular Language Families
Efficient clustering for parallel tasks execution in distributed systems
Generation of Languages by Rewriting Systems that Resemble Automata
Residual Closeness and Generalized Closeness
A Note on Scheduling Parallel Unit Jobs on Hypercubes
Convergecast Tree on Temporal Graphs
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL ⋆
The Iota-Delta Function as an Alternative to Boolean Formalism
New Worst-Case upper Bound for Counting Exact Satisfiability
Balanced-by-Construction Regular and ω-Regular Languages
On the Complexity of Computing Optimal Solutions
The Development of Formal Language Theory Since 1956 (Review Paper)
A Technique for Exact Computation of precoloring Extension on Interval Graphs
On the Circuit-Size of inverses
Inside the Class of regex Languages
On Serializable Languages
On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers
Temporal Logics for Communicating Sequential Agents: I
It is NL-Complete to Decide Whether a Hairpin Completion of Regular Languages is Regular
On the Propositional SLDNF-Resolution
Suboptimal-Optimal Routing for LAN Internetworking Using Transparent Bridges
A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests
Successful Elementary Gene Assembly Strategies
Algorithms for Jumbled Pattern Matching in Strings
Incompleteness Theorems, Large Cardinals, and Automata Over Finite Words
Aspects of Persistent Computations
Sets of Pictures Avoiding Overlaps
Energy-Efficient Node Scheduling Models In Sensor Networks With Adjustable Ranges
One-Variable Word Equations and Three-Variable Constant-Free Word Equations
Conditional Fault Diagnosability of Dual-Cubes
Linear Bounds on the Size of Conformations in Greedy Deterministic Oritatami
From Standard to Non-Standard Semantics by Semantics Modifiers
A Ring-Theoretic Basis for Logic Programming
On the descriptional complexity of metalinear cd grammar systems
Randomized Sorting On The Pops Network
Three Applications to Rational Relations of the High Undecidability of the Infinite Post Correspondence Problem in a Regular ω-Language
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages
Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
Historical Searching
Vertex Splitting in Dags and Applications to Partial Scan Designs and Lossy Circuits
Efficiently Enumerating Spanning Trees of k-Trees
From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity
Shuffle-Ring: A New Constant-Degree Network
Approximate Nash Equilibria for Scheduling Game on Serial-Batching-Machines with Activation Cost
Minimum Local Disk Cover Sets for Broadcasting in Heterogeneous Multihop Wireless Networks
Rewriting Logic-Based Semantics of P Systems and the Maximal Concurrency
Shortest, Fastest, and Foremost Broadcast in Dynamic Networks
Relating Various Types of Distributed Reaction Systems
The B-Prize-Collecting Multicut Problem in Paths, Spider Graphs and Rings
A Unified Method for Private Exponent Attacks on RSA Using Lattices
On Recognizable Languages Of Infinite Pictures
Sc-Expressions in Object-Oriented Languages
Left is Better Than Right for Reducing Nondeterminism of NFAs
Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs
A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers
Out Subword-Free Languages and Its Subclasses
Selected Papers from Irregular 1999 - Preface
Simultaneous Avoidance Of Large Squares And Fractional Powers In Infinite Binary Words
Efficiency Analysis of the Time-Shuffling Method for the Evolution of Agent Behavior
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ
Optimal Software Pipelining Under Resource Constraints
Reasoning About Object Systems in VTLoE
Earliest Normal Form and Minimization for Bottom-up Tree Transducers
Scheduling Two Salesmen in a Network
The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications
Using Alignment for Multilingual Text Compression
Hybridization of Genetic and Quantum Algorithm for gene Selection and Classification of microarray Data
Efficient Pairing Functions - and Why You Should Care
An Application of Well-orderly Trees in Graph Drawing
Marriage and Roommate
Fuzzy Dynamic Obstacle Avoidance Algorithm for Basketball Robot Based on Multi-Sensor Data Fusion Technology
On M-Equivalence and Strong M-Equivalence for Parikh Matrices
On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs
Mealy multiset automata
Cut-Property and Negation as Failure
On the Terminating Derivation Mode in Cooperating Distributed Grammar Systems with Forbidding Components
Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification
Strong (2 ⋅ t) and Strong (3 ⋅ t) Transformations for Strong M-Equivalence
On the Span of ℓ Distance Coloring of Infinite Hexagonal Grid
Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars
Methods to Overlap Communications in Parallel Numerical Algorithms
Linkage disequilibrium study with a parallel adaptive GA
Some Special Perfect c-Nonlinear Functions on ℤn
Fast Algorithms for Local Similarity Queries in Two Sequences
Functional Production Systems Viewed as Grammars
A Parallel Algorithm for the Constrained Multiple Sequence Alignment Problem Designed for GPUs
Fusing Loopless Algorithms for Combinatorial Generation
Minimization of Planar Directed Acyclic Graph Algebras
A Non-Definability Result for a Predicational Language with the Usual Control
Exponential Domination Critical and Stability in Some Graphs
Constructing Red-Black Tree Shapes
HYPER-MINIMIZATION IN O(n 2 )
Several Classes of Boolean Functions with Four-Valued Walsh Spectra
Sizes of Ordered Decision Trees
Uniform Sampling of Subshifts of Finite Type on Grids and Trees
Dynamic Random-Access Stored-Program Machine for Runtime Code Modification
Asynchronous Parallel Communicating Systems of Pushdown Automata
The Roles of Advice to One-Tape Linear-Time Turing Machines and Finite Automata
A New FM Screening Method to Generate Cluster-Dot Binary Images Using the Local Exhaustive Search with FPGA Acceleration
Generic e-Removal and Input e-Normalization Algorithms for Weighted Transducers
Critical Path Scheduling Parallel Programs on an Unbounded Number of Processors
A Tissue P System Based solution to quadratic Assignment Problem
State Complexity of Additive Weighted Finite Automata
Errata: "representation of Semiautomata by Canonical Words and Equivalences"
Self-Stabilizing Algorithms For Orderings And Colorings
Oracles in S p 2 are Sufficient for Exact Learning
On the State Complexity of Combined Operations and their Estimation
On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences
Jumping Grammars
Bond-free languages: formalizations, maximality and construction methods
Computational Power of intramolecular gene Assembly
An automata approach to match gapped sequence tags against protein database
Subword Occurrences, Parikh Matrices and Lyndon Images
On the Efficient Computation of the Minimal Coverability Set of Petri Nets
Some Limit Distributions in Analysis of Algorithms for Problems on Trace Languages
Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output
A Family of Scheduling Algorithms for Hybrid Parallel Platforms
Graph Algorithm Based Submodular Function for Sparsest Cut Problem
On Subword Symmetry of Words
Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model
Sturmian Words and Ambigous Context-Free Languages
Efficient Symbolic Representations for Arithmetic Constraints in Verification
Adjusting Annotated Taxonomies
On Minimizing Total Completion Time In Batch Machine Scheduling
Parameterized Complexity Classes Defined by Threshold Circuits and Their Connection with Sorting Networks
On-Demand Bounded Broadcast Scheduling with Tight Deadlines
Swarm Intelligence Models: Ant Colony Systems Applied to BNF Grammars Rule Derivation
Solution of a Number Theoretic Problem Involving Knowledge
A Space-Optimal Hidden Surface Removal Algorithm for Iso-Oriented Rectangles
Controllability and Cooperativeness Analysis for Automatic Abstraction Refinement
Predicate Boundedness of Linear Monadic Datalog is in PSPACE
A Proof of Parikh's Theorem via Dickson's Lemma
Exponential Independence Number of Some Graphs
Solving Symbolic Ordering Constraints
Worst Case Branching and Other Measures of Nondeterminism
EDZL Scheduling and Schedulability Analysis for Performance Asymmetric Multiprocessors
Path Decomposition and Semilinearity of Petri Nets
New Constructions of Vectorial Boolean Functions with Good Cryptographic Properties
Erratum: Iteration Algebras
Pattern Matching Code Minimization in Rewriting-Based Programming Languages
The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems
Algorithms for approximate k-covering of strings
Network modeling issues for grid application scheduling
A Note on the Minimum H-Subgraph Edge Deletion
New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation
Triple-Cycle Permutations Over Finite Fields of Characteristic Two
Descriptional Complexity of Semi-Simple Splicing Systems
A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
5th Asian Computing Science Conference - Preface
A Unified Framework for Bi(Tri)Connectivity and Chordal Augmentation
A Distributed Approximation Algorithm for Fault-Tolerant Metric Facility Location
Procedures for Computing the Maximum with DNA
The Virtual Suffix Tree
Virtual Operations On Virtual Networks: The Priority Union
Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs
A Systematic Scan for 7-colourings of the Grid
Vulnerability Measures of Transformation Graph G xy +
Unconditionally Secure Conference Key Distribution: Security Notions, Bounds and Constructions
The Computational Paradigm of Cellular Automata in Crowd Evacuation
Edit Distance with Combinations and Splits and its Applications in OCR Name Matching
The Coordination Mechanism for Scheduling Game with Deterioration Jobs and Uniform-Batch Machines
Dynamical probabilistic P systems
On the Existence of Lookahead Delegators for NFA
A Top-Down Updating Algorithm for Weight-Balanced Trees
Investigations on Automata and Languages Over a Unary Alphabet
Computing the rupture Degree in Composite Graphs
Edge-Disjoint Hamiltonian Cycles in Balanced Hypercubes with Applications to Fault-Tolerant Data Broadcasting
Network Properties of Double and Triple Fixed Step Graphs
Square-Free Partial Words with Many Wildcards
Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
In Memoriam Zoltán Ésik (1951-2016)
On the Lower Bounds of (1, 0)-Super Solutions for Random k-SAT
A Parallel Approach in Computing Correlation Immunity up to Six Variables
On the Effect of Variable Identification on the Essential Arity of Functions on Finite Sets
A Near-Optimal Broadcasting Protocol for Mobile Video-on-Demand
Restricted Existence and Approximation Algorithms for PMMS
Constructing Premaximal Binary Cube-Free Words of any Level
Communication Issues in Parallel Systems with Optical Interconnections
Variants of Networks of Evolutionary Processors with Polarizations and a Small Number of Processors
Simulation of Systolic Tree Automata on Trellis Automata
Operational State Complexity of Subtree-Free Regular Tree Languages
Most Complex Non-Returning Regular Languages
Weighted Nested Word Automata and Logics over Strong bimonoids
Content Networks: Distributed Routing Decisions In Presence Of Repeated Queries
Two Related Algorithms for Root-to-frontier Tree Pattern Matching
A Minimum-Process Coordinated Checkpointing Protocol for Mobile Computing Systems
Approximate Block Sorting
A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four Connected Planar Graphs
Fast Simulation of Conway's Game of Life Using Bitwise Parallel Bulk Computation on a GPU
Leakage-Resilient Hierarchical Identity-Based Encryption with Recipient Anonymity
Graph Convolutional Network-Guided Mine Gas Concentration Predictor
The Cube-of-Rings Interconnection Network
Light Affine Logic as a Programming Language: A First Contribution
A Pumping Condition for Ultralinear Languages
Complementation of Branching Automata for Scattered and Countable N-Free Posets
ℐ 2 radical in Automata nearrings
Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines
From Computing to Interaction: on the Expressiveness of Asynchronous pi-Calculus
Fast Clustering and Minimum Weight Matching Algorithms for Very Large Mobile Backbone Wireless Networks
Pairing-Free Identity-Based Encryption with Authorized Equality Test in Online Social Networks
Minimal Concept Identification and Reliability
Grammars Based on Patterns
Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property
A Simulation Algorithm for Multienvironment Probabilistic P Systems: a Formal Verification
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree
Properties of Quasi-Relabeling Tree Bimorphisms
Some Sufficient Conditions of Learnability in the Limit From Positive Data
Parallel Vertex Colouring of Interval Graphs
Neighbor Rupture Degree of Transformation Graphs Gxy-
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices
Rainbow Domination in Cartesian Product of Paths and Cycles
A Comparison Between Edge Neighbor Rupture Degree and Edge Scattering Number in Graphs
Online Minimum Spanning Tree with Advice
Population Size Modeling for GA in Time-Critical Task Scheduling
Online Minimum makespan Scheduling with a Buffer
One-Way Jumping Finite Automata
On-Line Construction of a Small Automaton for a Finite Set of Words
Linear-Time Prime Decomposition Of Regular Prefix Codes
Rewriting with Strategies in ELAN: A Functional Semantics
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case
Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin games
Improved Approximation Algorithms for Matroid and Knapsack Means Problems
Average Measure, Descriptive Complexity and Approximation of Maximization Problems
Improved Online Algorithms for 2-Space Bounded 2-Dimensional Bin Packing