yusuke1997/dblp-id-title huggingface dataset:
Quantum finite automata: Advances on Bertoni's ideas
On Behavioural Abstraction and Behavioural Satisfaction in Higher-Order Logic
Some bijective results about the area of Schröder paths
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
Bin packing with fragmentable items: Presentation and approximations
Approximation of boolean functions by combinatorial rectangles
Introduction: Selected Papers of MFCS 1994
Intuitionistic differential nets and lambda-calculus
Corrigendum to "The frequent items problem, under polynomial decay, in the streaming model" [Theoret. Comput. Sci. 411(34-36) (2010) 3048-3054]
Algebraic and Operational Semantics of Specifications Allowing Exceptions and Errors
Greedy rectilinear drawings
Embedding Display Calculi into Logical Frameworks: Comparing Twelf and Isabelle
No Polynomial Bound for the Period of the Parallel Chip Firing Game on Graphs
Edge-colouring of regular graphs of large degree
Uncountable automatic classes and learning
On the power of breakable objects
Complexity of metric temporal logics with counting and the Pnueli modalities
Learning to score final positions in the game of Go
Ranking chain sum orders
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Move-to-Front, Distance Coding, and Inversion Frequencies revisited
A linear partitioning algorithm for Hybrid Lyndons using V V-order
Sparsification lower bound for linear spanners in directed graphs
A Decision Algorithm for Distributive Unification
Directional dynamics along arbitrary curves in cellular automata
Computing with viruses
Transforming Sequential Systems into Concurrent Systems
Set covering in fuel-considered vehicle routing problems
Iterative Factor Algebras and Induced Metrics
A Class of Rewriting Rules and Reverse Transformation for Rule-based Equivalent Transformation
On different generalizations of episturmian words
Game Theory Meets Theoretical Computer Science
Matrix columns allocation problems
Correctness of Constructing Optimal Alphabetic Trees Revisited
Lower bounds for the happy coloring problems
Taut Monads and T0-spaces
Simultaneous visibility representations of plane st-graphs using L-shapes
The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines
Linearisability on datalog programs
Graph realization of distance sets
The minimal Laplacian spectral radius of trees with diameter 4
Termination of Rewriting with Local Strategies
Cyclic connectivity and cyclic diagnosability of data center network DCell
The index of a binary word
Rank two bipartite bound entangled states do not exist
Sur la Determination du Rang d'une Equation dans le Monoide Libre
Specification languages in algebraic compilers
Logical argumentation by dynamic proof systems
Closure properties and descriptional complexity of deterministic regular expressions
New complexity estimation on the Rainbow-Band-Separation attack
On algorithms for ( P 5 , gem)-free graphs
Precategories for combining probabilistic automata
Parsing natural language idioms with bidirectional finite-state machines
Partial prime factor exposure attacks on some RSA variants
On some variations of two-way probabilistic finite automata models
Exploring pairwise compatibility graphs
Modular verification of multithreaded programs
Worst-Case Analysis of Fast Heuristics for Packing Squares into a Square
An efficient algorithm to construct disjoint path covers of DCell networks
Syntactic Theories in Practice
Dynamic minimum bichromatic separating circle
A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem
Fixed-Point Constructions in Order-Enriched Categories
Tree size reduction with keeping distinguishability
On Lazy Bin Covering and Packing problems
A generalization of Thue freeness for partial words
Locally identifying coloring of graphs with few P4s
The Context-Freeness of the Languages Associated with Vector Addition Systems is Decidable
"Robot Cloud" gradient climbing with point measurements
On the Existence of Acyclic Views in a Database Scheme
List-coloring - Parameterizing from triviality
Online batch scheduling on parallel machines with delivery times
Beyond the Alder-Strassen bound
Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
Synapses as stochastic concurrent systems
The longest almost increasing subsequence problem with sliding windows
Transducers and Repetitions
A Characterization of Digital Search Trees from the Successful Search Viewpoint
Factorization of products of hypergraphs: Structure and algorithms
Security types for dynamic web data
The joy of implications, aka pure Horn formulas: Mainly a survey
Covering points with convex sets of minimum size
Acyclic Logic Programs and the Completeness of SLDNF-Resolution
Byzantine-tolerant causal broadcast
Efficient k -out-of- n oblivious transfer scheme with the ideal communication cost
Nondeterministic Stack Register Machines
Applied semantics: Selected topics
An ordinal measure based procedure for termination of functions
Model checking of pushdown systems for projection temporal logic
Insertion and Deletion Closure of Languages
Some Examples of Formal Series Used in Non-Commutative Algebra
Une Démonstration Simple du Théorème de Skolem-Mahler-Lech
A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
On the Combinatorics of Finite Words
Strict self-assembly of discrete Sierpinski triangles
Is the Protein Model Assignment problem under linked branch lengths NP-hard?
H-Coloring dichotomy revisited
A Logic for Rough Sets
From diagrammatic confluence to modularity
Structural Presburger digit vector automata
A new attack on some RSA variants
Computation of arbitrage in frictional bond markets
Spiking neural P systems with rules on synapses and anti-spikes
On the classes of languages characterized by generalized P colony automata
A graph searching game for block treedepth and a cubic kernel by vertex cover
Corrigendum to "The exact number of squares in Fibonacci words" [Theoret. Comput. Sci. 218(1) (1999) 95-106]
Stack versus Sensitivity for One-Way Automata
Encapsulating deontic and branching time specifications
Combinatorial constructions associated to the dynamics of one-sided cellular automata
The size of Higman-Haines sets
Algorithms for energy conservation in heterogeneous data centers
Dynamic load balancing with group communication
Descriptional complexity of two-way pushdown automata with restricted head reversals
Distances on rhombus tilings
A derivative for complex Lipschitz maps with generalised Cauchy-Riemann equations
Expressivity of coalgebraic modal logic: The limits and beyond
An Algorithmic Approach for Checking Closure Properties of Temporal Logic Specifications and Omega-Regular Languages
Average case analysis of the classical algorithm for Markov decision processes with Büchi objectives
The regular spaces with countably based models
On the lattice of prefix codes
Weak confluence and tau-inertness
Simple and flexible detection of contiguous repeats using a suffix tree
Reachability Trees for High-level Petri Nets
Hybrid diagrams
CCS with Hennessy's merge has no finite-equational axiomatization
Streaming algorithms for monotone non-submodular function maximization under a knapsack constraint on the integer lattice
A topological approach to transductions
Celia Wrathall: On Languages Specified by Relative Acceptance
Improved exploration of unknown polygons
Optimal Comparison Strategies in Ulam's Searching Game with Two Errors
Selfish bin packing with punishment
Decidability of model checking with the temporal logic EF
A linear-time 2-approximation algorithm for the watchman route problem for simple polygons
Constructive Logics Part I: A Tutorial on Proof Systems and Typed gamma-Calculi
Implementing exact real arithmetic in python, C++ and C
A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting
Exact Complexity Bounds for Ordinal Addition
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns
The reliability analysis of k -ary n -cube networks
Games for synthesis of controllers with partial observation
Flexible recovery of uniqueness and immutability
Online bin stretching with bunch techniques
Computing role assignments of split graphs
Rational Indexes of Generators of the Cone of Context-Free Languages
The use of tail inequalities on the probable computational time of randomized search heuristics
Algebraic Specifiability of Data Types with minimal Computable Parameters
On the power of pushing or stationary moves for input-driven pushdown automata
An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
Hanabi is NP-hard, even for cheaters who look at their cards
Approximating the longest paths in grid graphs
Genetic and Evolutionary Computation
Cellular automata with sparse communication
Testing computability by width-two OBDDs
Drawn k-in-a-row games
Size versus stability in the marriage problem
Constrained floorplans in 2D and 3D
Efficient collective communication in optical networks
Gossiping in chordal rings under the line model
Optimally competitive list batching
Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and Normal Form theorems
Filter Models with Polymorphic Types
Properties of Structure Generating Functions of Automata and their Applications for Linear Systems
Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
A codicity undecidable problem in the plane
From truth to computability I
A linear kernel for finding square roots of almost planar graphs
A co-Induction Principle for Recursively Defined Domains
Domino Tiling in Planar Graphs with Regular and Bipartite Dual
Bi-objective matchings with the triangle inequality
One-to-one disjoint path covers on alternating group graphs
A Decision Procedure for the Order of Regular Events
The Meet Operation in the Lattice of Codes
A Efficient Algorithm to Decide Whether a Monoid Presented by a Regular Church-Rosser Thue System is a Group
Optimal algorithms for semi-online machine covering on two hierarchical machines
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
On codes defined by bio-operations
Mutual Exclusion Scheduling
Backbone coloring of planar graphs without special circles
The cut operation in subclasses of convex languages
Rational Series with Coefficients in a Commutative Ring
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Verifying and enumerating parameterized border arrays
Characterization of Glushkov automata
A format for semantic equivalence comparison
Efficient algorithms for the sum selection problem and k maximum sums problem
Strong Rabin numbers of folded hypercubes
α-words and the radix order
On Denotational Completeness
On symmetric nonlocal games
A Turing Machine Time Hierarchy
A Pi-Calculus with Explicit Substitutions
The Fixed Points of Logic Programs with Herbrand Base N
Convergence of preference functions
Energy efficient alert in single-hop networks of extremely weak devices
Aperiodic SFTs on Baumslag-Solitar groups
Interface simulation distances
On conditional fault tolerance and diagnosability of hierarchical cubic networks
Location Equivalence in Parametric Setting
On the string consensus problem and the Manhattan sequence consensus problem
On the tractability of finding disjoint clubs in a network
Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000
Improved approximability and non-approximability results for graph diameter decreasing problems
The Level Ancestor Problem simplified
Subnetwork reliability analysis of bubble-sort graph networks
Probabilistic cluster fault diagnosis for multiprocessor systems
Axiomatisation des Tests
High level communication functionalities for wireless sensor networks
Extremality of submodular functions
Efficient retrieval of approximate palindromes in a run-length encoded string
A metric for rooted trees with unlabeled vertices based on nested parentheses
On modification of Boyer-Moore-horspool's algorithm for tree pattern matching in linearised trees
An O(log⁡n) query time algorithm for reducing ϵ -NN to ( c , r )-NN
Translating a Linear Logic Programming Language into Java
Hardness of edge-modification problems
Systemes de numeration linearires et Theta-representations
A solution to the GHI problem for best-first search
On the minimum hitting set of bundles problem
Polynomial-size Frege and resolution proofs of st -connectivity and Hex tautologies
Generalized pattern matching and periodicity under substring consistent equivalence relations
The Alternating BWT: An algorithmic perspective
Counting the solutions of Presburger equations without enumerating them
Continuously non-malleable codes with split-state refresh
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
The theory of interactive generalized semi-Markov processes
Comparing and aggregating partially resolved trees
The Revised Report on the Syntactic Theories of Sequential Control and State
Reallocating multiple facilities on the line
Quantization of games: Towards quantum artificial intelligence
Stochastic complexity for mixture of exponential families in generalized variational Bayes
The true story of TCS
On the Complexity of omega-Type Turing Acceptors
Bounded Linear Logic: A Modular Approach to Polynomial-Time Computability
On exponential time lower bound of Knapsack under backtracking
Realtime subshifts
An Approach to the Subgraph Homeomorphism Problem
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
A Quantitative Interpretation of Girard's System F
Transducers and the Decidability of Independence in Free Monoids
A plane graph representation of triconnected graphs
Semicommutations and Algebraic Languages
An Algebraic Approach to Semantics of Programming Languages
The complexity of degree anonymization by vertex addition
On the hardness of finding near-optimal multicuts in directed acyclic graphs
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Trade-off results for connection management
A concurrent lambda calculus with futures
On shuffled-square-free words
The parameterized complexity landscape of two-sets cut-uncut
The antimagicness of the Cartesian product of graphs
Extra path-structure connectivity of modified bubble-sort networks
Semi-on-line multiprocessor scheduling with given total processing time
Computational friendly attribute-based encryptions with short ciphertext
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
An EPTAS for scheduling fork-join graphs with communication delay
On the Cartesian skeleton and the factorization of the strong product of digraphs
Approximate Testing and Its Relationship to Learning
Computing the reveals relation in occurrence nets
An improved kernel and parameterized algorithm for deletion to induced matching
An automata-theoretic approach to the word problem for omega -terms over R
Reprint of: Palindromization and construction of Markoff triples
On the computational complexity of Longley's H functional
Using Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays
Theory of Traces
Finite Petri Nets as Models for Recursive Causal Behaviour
Abstract state machines and high-level system design and analysis
Complex zeros, unimodality and log-concavity in independent domination polynomial of zero divisor graphs
Approximability of the vertex cover problem in power-law graphs
Small SNQ P Systems with multiple types of spikes
On categorical equivalence of Gentzen-style derivations in IMLL
Integer Summing Algorithms on Reconfigurable Meshes
Nature-inspired framework for measuring visual image resemblance: A near rough set approach
Combinatoire des motifs d'une suite sturmienne bidimensionnelle
Correctness of Java card method lookup via logical relations
The Quotient of an Abstract Interpretation
Adaptive influence maximization under fixed observation time-step
Cryptographically-masked flows
On the computability of Solomonoff induction and AIXI
Modular discrete time approximations of distributed hybrid automata
Minimization of the maximum distance between the two guards patrolling a polygonal region
Rauzy substitutions and multi-dimensional Sturmian words
Step-by-step community detection in volume-regular graphs
Fast and simple (1 + ε)Δ-edge-coloring of dense graphs
The μ-calculus alternation hierarchy collapses over structures with restricted connectivity
On Transductions of Formal Power Series over Complete Semirings
An infinite class of unsaturated rooted trees corresponding to designable RNA secondary structures
The max-plus algebra of the natural numbers has no finite equational basis
A characterization of 2-threshold functions via pairs of prime segments
An Asymptotic Equality for the Number of Necklaces in a Shuffle-Exchange Network
Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space
Leakage-resilient attribute-based encryption scheme with CCA security
Characterization of locally most split reliable graphs
On the distribution of betweenness centrality in random trees
Inoculation strategies for bounded degree graphs
Iterative Tree Automata
Every Two Equivalent D0L Systems have a Regular True Envelope
On the Space Complexity of Some Algorithms for Sequence Comparison
Exact algorithms for the repetition-bounded longest common subsequence problem
Modal Resolution in Clausal Form
Conjugacy on partial words
A random growth model with any real or theoretical degree distribution
Crossing information in two-dimensional Sandpiles
NP-completeness and APX-completeness of restrained domination in graphs
On cartesian closed extensions of non-pointed domains
P systems with minimal insertion and deletion
On the complexity of reconfiguration problems
Computing the best-case energy complexity of satisfying assignments in monotone circuits
Complexity issues in color-preserving graph embeddings
Post-challenge leakage in public-key encryption
Deterministic parallel backtrack search
Efficient resource management for linear logic proof search
Generalized communicating P systems
Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: Algebraic and analytic approaches collated
Preface: Special issue on theoretical aspects of computing
Efficient approximation algorithms for the achromatic number
Dynamic Analysis of some Relational Databases Parameters
Complexity of the game domination problem
On Rational Definitions in Complete Algebras without Rank
On the structure of Thue-Morse subwords, with an application to dynamical systems
Is there an Axiomatic Semantics for Standard Pure Prolog
Analysis of a memory-efficient self-stabilizing BFS spanning tree construction
Concrete Models of Computation for Topological Algebras
On the sum-max graph partitioning problem
Sur les Relations Rationnelles Entre Monoides Libres
Two-Level Semantics and Abstract Interpretation
Cost-sharing games with rank-based utilities
Parallelizing quantum circuits
On the Many Facets of Lists
Transformational Approach to Program Concretization
On the runtime analysis of the Simple Genetic Algorithm
Closure properties of linear context-free tree languages with an application to optimality theory
Evolvability of reaction systems and the invisibility theorem
Application of branching cells to QoS aware service orchestrations
Highly concurrent multi-word synchronization
Gene assembly through cyclic graph decomposition
q-Adic Spectral Analysis of Some Arithmetic Sequences
Streaming deletion problems parameterized by vertex cover
Mutation strength control via meta evolution strategies on the ellipsoid model
On the landscape ruggedness of the quadratic assignment problem
On RAC drawings of graphs with one bend per edge
Algebraic dynamic programming for multiple context-free grammars
Independent domination in hereditary classes
Gathering of asynchronous robots with limited visibility
Exact exponential algorithms to find tropical connected sets of minimum size
On RAC drawings of 1-planar graphs
A note on short palindromes in square-free words
Algebraic properties of substitution on trajectories
Products of Languages with Counter
A robust map matching method by considering memorized multiple matching candidates
A Characterization of lambda Definability in Categorical Models of Implicit Polymorphism
The complexity of LSH feasibility
A Unified Approach for Studying the Properties of Transition Systems
Trap spaces of Boolean networks are conflict-free siphons of their Petri net encoding
Extremal minimality conditions on automata
Hamiltonian problems in directed graphs with simple row patterns
Polynomial-time counting and sampling of two-rowed contingency tables
The size-cost of Boolean operations on constant height deterministic pushdown automata
Opinion diffusion in graphs: An adversarial approach
On balanced and abelian properties of circular words over a ternary alphabet
First-order satisfiability in Gödel logics: An NP-complete fragment
Runtime analysis of the 1-ANT ant colony optimizer
Web of things based social media fake news classification with feature extraction using pre-trained convoluted recurrent network with deep fuzzy learning
*-μ-semirings and *-λ-semirings
On 1-inkdot Alternating Turing Machines with Small Space
Closure and decision properties for higher-dimensional automata
The binomial transform and the analysis of skip lists
Computational Adequacy of the FIX-Logic
Completely independent spanning trees in the line graph of complete multipartite graphs
On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers
On a simple sampling lemma
The classes PPA- k : Existence from arguments modulo k
Weighted asynchronous cellular automata
Classification of rotations on the torus T 2
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures
Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations
State complexity of some operations on binary regular languages
Approximate string matching using factor automata
Uniform characterizations of polynomial-query learnabilities
On Two-Dimensional Pattern Matching by Optimal Parallel Algorithms
The solid-metric dimension
Spanners for bounded tree-length graphs
If P neq NP then some strongly noninvertible functions are invertible
Partitioning powers of traceable or hamiltonian graphs
A general approximation method for bicriteria minimization problems
Improved algorithms for two single machine scheduling problems
A Complete Axiom System for Rational Sets with Multiplicity
Branching automata with costs - a way of reflecting parallelism in costs star
Fault tolerant additive and (μ, α)-spanners
Hypothesis finding with proof theoretical appropriateness criteria
Average Running Time of the Boyer-Moore-Horspool Algorithm
Optimal resilient sorting and searching in the presence of memory faults
Permuted scaled matching
The cyclical scheduling problem
Syntactic Control of Interference Revisited
Open block scheduling in optical communication networks
Atomic Semicommutations
A note on measuring in P
Catalan structures and Catalan pairs
Two-Dimensional Pattern Matching by Two-Dimensional on-Line Tessellation Acceptors
A simple optimal contention resolution scheme for uniform matroids
Testing preorders for probabilistic processes can be characterized by simulations
Reachability-based acyclicity analysis by Abstract Interpretation
On the expansion of three-element subtraction sets
A randomized algorithm for determining dominating sets in graphs of maximum degree five
A compositional approach to defining logics for coalgebras
Counter Machines and Verification Problems
Scheduling with families of jobs and delivery coordination under job availability
Sticker Systems
Realizability with a local operator of A.M. Pitts
On the number of occurrences of a symbol in words of regular languages