yusuke1997/dblp-id-title huggingface dataset:
Enumeration and random generation of accessible automata
Unambiguous conjunctive grammars over a one-symbol alphabet
Online learning for min-max discrete problems
A Note on the Complexity of Deciding Bisimilarity of Normed Unary Processes
A Bound for the Degree of Nonholonomy in the Plane
Can abstract state machines be useful in language theory?
Duality and nonlinear graph Laplacians
Proof theory of Nelson's paraconsistent logic: A uniform perspective
Fault-tolerant spanners in networks with symmetric directional antennas
Analysis of the width- w w non-adjacent form in conjunction with hyperelliptic curve cryptography and with lattices
Operations preserving regular languages
Complementation of rational sets on scattered linear orderings of finite rank
Tracking routes in communication networks
Higher-order concepts for the potential infinite
Valiant's Holant Theorem and matchgate tensors
Representing recursively enumerable languages by iterated deletion
Language theoretical properties of hairpin formations
A nonadaptive NC checker for permutation group intersection
A symbolical algorithm on additive basis and double-loop networks
Complexity of reversible circuits and their quantum implementations
Extending concurrent signature to multiple parties
A visit to mutual exclusion in seven dates
Reconstruction of convex 2D discrete sets in polynomial time
Positive varieties of tree languages
Reversals and palindromes in continued fractions
Mixed Computation: Potential Applications and Problems for Study
Template-guided DNA recombination
Applications of polyhedral computations to the analysis and verification of hardware and software systems
Double Greibach operator grammars
Accepting splicing systems
TWDM Multichannel Lightwave Hypercube Networks
A general theory of concept lattice with tractable implication exploration
A spatial logic for concurrency - II
A note on dimensions of polynomial size circuits
On the exhaustive generation of k-convex polyominoes
Notions of hyperbolicity in monoids
A deterministic approximation algorithm for metric triangle packing
Refined computational complexities of Hospitals/Residents problem with regional caps
Presenting locale pullback via directed complete posets
Asynchronous process calculi: the first- and higher-order paradigms
Stable matchings of teachers to schools
Succinct encodings of binary trees with application to AVL trees
Deterministic secure positioning in wireless sensor networks
New Plethysm Operation, Chern Characters of Exterior and Symmetric Powers with Applications to Stiefel-Whitney Classes of Grassmannians
Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging
Stabilization, Safety, and Security of Distributed Systems (SSS 2009)
Multiple splicing systems and the universal computability
Splicing systems and the Chomsky hierarchy
Direct constructions of universal extended H systems
Deterministic top-down tree automata with Boolean deterministic look-ahead
On Finding Commong Subtrees
Multiple pass streaming algorithms for learning mixtures of distributions in R d
On Finding a Minimum Dominating Set in a Tournament
Relating the Power of Cellular Arrays to Their Closure Properties
Towards an algorithmic guide to Spiral Galaxies
The Essence of Constraint Propagation
Neighbourhood-preserving dimension reduction via localised multidimensional scaling
Noninterference for concurrent programs and thread systems
Deciding branching time properties for asynchronous programs
TCS Special Issue: Combinatorics on Words - WORDS 2015
Financial networks with singleton liability priorities
The undecidability of arbitrary arrow update logic
Dedekind Multisets and Function Shells
When are prime formulae characteristic?
Tight approximation for partial vertex cover with hard capacities
Automaton semigroups
Higher-order games with dependent types
Cut-and-project graphs and other complexes
The merged longest common increasing subsequence problem
Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees
On tree coalgebras and coalgebra presentations
The Implementation Technology of the Mercury Debugger
Idempotent analysis and continuous semilattices
Good spanning trees in graph drawing
Regions of Petri nets with a/sync connections
Partially dynamic efficient algorithms for distributed shortest paths
Grid exploration by a swarm of autonomous robots with minimum repetitions
A simple rounding scheme for multistage optimization
Securely computing the n -variable equality function with 2 n cards
On the complexity of searching in trees and partially ordered structures
Abstract Functional Dependency Structures
The Girard-Reynolds isomorphism (second edition)
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
An improved kernel for planar vertex-disjoint triangle packing
On the computational content of the Lawson topology
Genetic Algorithms: Bridging the Convergence Gap
The pos/neg-weighted 1-median problem on tree graphs with subtree-shaped customers
Recognizing Median Graphs in Subquadratic Time
On the complexity of 4-coloring graphs without long induced paths
Adding recursion to Dpi
Deterministic quantum non-locality and graph colorings
On the possibility of learning in reactive environments with arbitrary dependence
Non-Deterministic Information Systems and their Domains
Optimal bounds in parametric LTL games
Polymorphic Lambda Calculus: The Church-Rosser Property
A Representable Approach to Finite Nondeterminism
Byzantine agreement with homonyms in synchronous systems
Nonreturning PC Grammar Systems Can Be Simulated By Returning Systems
Timeline-based planning over dense temporal domains
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. TCS 14(1981) 155-186
The optimal capture time of the one-cop-moves game
On the generation of sentences with their parses by propagating regular-controlled grammars
Record Allocation for Minimizing Seek Delay
Efficient constructions of test sets for regular and context-free languages
Exact real number computations relative to hereditarily total functionals
Minimizing interference of a wireless ad-hoc network in a plane
Analogies and differences between quantum and stochastic automata
Closed-for Analytic Maps in One and Two Dimensions can Simulate Universal Turing Machines
Equations Over Finite Sets of Words and Equivalence Problems in Automata Theory
Undecidable properties of monoids with word problem solvable in linear time
The Complexity of the Word Problem for Abelian l-Groups
Approximate periods of strings
Approximating the Permanent of Graphs with Large Factors
On the confluence of lambda-calculus with conditional rewriting
Integer complexity: Representing numbers of bounded defect
A Second Step Toward the Polynomial Hierarchy
Iterative learning of simple external contextual languages
Colouring graphs with no induced six-vertex path or diamond
Special Issue on Implementation and Application of Automata
Power Domains and Second-Order Predicates
The hardness of placing street names in a Manhattan type map
Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
Coherence Completions of Categories
Topological evolution for embodied cellular automata
Chemical Master Equation and Langevin regimes for a gene transcription model
An O(m(m + n log n) log(n C))-time algorithm to solve the minimum cost tension problem
An Introduction to Pseudo-Linear Algebra
On algebra of languages representable by vertex-labeled graphs
A process model of Rho GTP-binding proteins
Modeling time and topology for animation and visualization with examples on parametric geometry
Sums and Rational Multiples of q-Automatic Sequences are q-Automatic
Truncations of Infinite Matrices and Algebraic Series Associated with Some CF Grammars
Online exploration outside a convex obstacle
On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
A flexible model for dynamic linking in Java and C#
Familles de Langages Fermees par Crochet Ouvert
On the algebraic structure of declarative programming languages
Loopless Gray code enumeration and the Tower of Bucharest
Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
An interpolating theorem prover
The parallel complexity of signed graphs: Decidability results and an improved algorithm
Properties of a First-Order Functional Language with Sharing
The expressive power of analog recurrent neural networks on infinite input streams
Algebraic Translations, Correctness and Algebraic Compiler Construction
General Approximation Algorithms for some Arithmetical Combinatorial Problems
An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields
Two spanning disjoint paths with required length in generalized hypercubes
Oracle-Dependent Properties of the Lattice of NP Sets
Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma-p-2-Complete
First-hitting times under drift
Homomorphic characterizations of recursively enumerable languages with very small language classes
A lower bound on complexity of optimization on the Wiener space
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Parameterized top- K algorithms
Intrinsic complexity of partial learning
On the probe problem for ( r , ℓ )-well-coveredness: Algorithms and complexity
Categories of rough sets and textures
On semimeasures predicting Martin-Löf random sequences
Heuristics for Optimum Binary Search Trees and Minimum Weight Triangulation Problems
Almost k-wise independence and hard Boolean functions
Robust learning with infinite additional information
Upward planar graphs and their duals
On Regularity of Context-Free Languages
Deterministic protocols for Voronoi diagrams and triangulations of planar point sets on the congested clique
The design of the Boost interval arithmetic library
A type of perfect matchings extend to hamiltonian cycles in k -ary n -cubes
Fast minimal triangulation algorithm using minimum degree criterion
A mechanism to detecting flooding attacks in quantum enabled cloud-based lowpower and lossy networks
Online strategies for backups
Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
On some generalizations of the primitive recursive arithmetic
A Hybrid Algorithm for Compiling Equality Constraints and its Implementation
Iterative inversion of structured matrices
Robust reachability in timed automata and games: A game-based approach
Random generation of source vectors with a fixed preponderant property
Applications of Scheduling Theory to Formal Language Theory
Independent perfect dominating sets in semi-Cayley graphs
Computing a tree having a small vertex cover
From regular expressions to smaller NFAs
On reachable assignments under dichotomous preferences
Generalized approximate counting revisited
Sur une involution sur les chemins de Dyck
Separability by piecewise testable languages is PTime-complete
Progressive-encoding-based transmission for DNN-enabled edge intelligence in unreliable network
The property suffix tree with dynamic properties
Evolving reaction systems
Dealing with 4-variables by resolution: An improved MaxSAT algorithm
Resource-sharing system scheduling and circular chromatic number
Polynomial space hardness without disjunction property
Combining Explicit Negation and Negation by Failure Via Belnap's Logic
Binary Periodic Synchronizing Sequences
Some arithmetical restatements of the Four Color Conjecture
Sequential and indexed two-dimensional combinatorial template matching allowing rotations
Fast distributed PageRank computation
Denotational Semantics of CSP
Tree-walking automata cannot be determinized
A compositional treatment of iterated open games
Combining Angles, Demons and Miracles in Program Specifications
Modular Specification of Process Algebras
Popular matchings with two-sided preference lists and matroid constraints
Alarm placement in systems with fault propagation
Translations Between Modal Logics of Reactive Systems
Simple Second-order Languages for which Unification is Undecidable
Static Semantics, Types, and Binding Time Analysis
Abstraction Problems in Combinatory Logic a Compositive Approach
Overlap-free words and spectra of matrices
Elementary Homomorphisms and a Solution of the D0L Sequence Equivalence Problem
Rules admissible in transitive temporal logic T S4 , sufficient condition
Weakly Expressive Models for Hoare Logic
On the parametrized complexity of read-once refutations in UTVPI+ constraint systems
Sequential SNP systems based on min/max spike number
A PTAS for the cardinality constrained covering with unit balls
On Powerdomains and Modality
Rewrite Orderings for Higher-Order Terms in eta-Long beta-Normal Form and Recursive Path Ordering
Equational Programming in Lambda-Calculus via SL-Systems. Part 2
Simulation techniques for the calculus of wrapped compartments
Stability of termination and sufficient-completeness under pushouts via amalgamation
Backward and forward bisimulation minimization of tree automata
Selection from Read-Only Memory and Sorting with Minimum Data Movement
Two Linear Time Union-Find Strategies for Image Processing
Non-maximal sensitivity to synchronism in elementary cellular automata: Exact asymptotic measures
Representation Theorems Using DOS Languages
Applications du calcul formel à la balistique
Partial Map Classifiers and Partial Cartesian Closed Categories
Combining effects: Sum and tensor
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Improved approximation algorithms for two-stage flowshops scheduling problem
Fast and frugal targeting with incentives
Optimal deterministic quantum algorithm for the promised element distinctness problem
Improved kernel results for some FPT problems based on simple observations
Perfectly matched sets in graphs: Parameterized and exact computation
Self-dual tilings with respect to star-duality
A general comparison of language learning from examples and from queries
Strong Categorical Datatypes II: A Term Logic for Categorical Programming
On institutions for modular coalgebraic specifications
The multi-service center problem
Model Checking the Full Modal mu-Calculus for Infinite Sequential Processes
Representation of Rational Functions with Prefix and Suffix Codings
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, . .
Rank and select revisited and extended
The undirected repetition threshold and undirected pattern avoidance
A strong induction scheme that leads to polynomially computable realizations
Input-driven multi-counter automata
The Connected Critical Node Problem
A multi-domain incremental analysis engine and its application to incremental resource analysis
Computational complexity of uniform quantum circuit families and quantum Turing machines
On the equation in a free semigroup
The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines
Better short-seed quantum-proof extractors
Weakly weighted generalised quasi-metric spaces and semilattices
Abelian complexity and abelian co-decomposition
On the complexity of the highway problem
Optimizing busy time on parallel machines
Automatic Generation of Invariants and Intermediate Assertions
On the complexity of real root isolation using continued fractions
Une breve biographie scientifique de Maurice Nivat
Restructuring Hierarchical Database Objects
A parameterized algorithm for the hyperplane-cover problem
Transformation rules with nested application conditions: Critical pairs, initial conflicts & minimality
Burrows-Wheeler transformations and de Bruijn words
Parameter Reduction of Higher Level Grammars
Expressiveness of propositional projection temporal logic with star
The category-theoretic solution of recursive program schemes
Speech enhancement with noise estimation and filtration using deep learning models
Corrigendum to "The orthogonal colouring game" [Theor. Comput. Sci. 795 (2019) 312-325]
Union acceptable profit maximization in social networks
Linear-size suffix tries
Reliability analysis of data center networks based on precise and imprecise diagnosis strategies
Completeness of Hoare logic with inputs over the standard model
On PSPACE generation of a solution set of a word equation and its applications
Three-part partition games on rectangles
Uniform asymptotics of some Abel sums arising in coding theory
Proof systems for Moss' coalgebraic logic
Scheduling with timed automata
Determinism and Non-determinism in PDL
Graph Grammars with Neighbourhood-Controlled Embedding
Brushing with additional cleaning restrictions
Dynamic Preference Logic meets iterated belief change: Representation results and postulates characterization
Logichart - Intelligible Program Diagram for Prolog and its Processing System
Recursive Query Processing: The Power of Logic
On the computation of the Möbius transform
Tightly secure (H)IBE in the random oracle model
Closures and Fairness in the Semantics of Programming Logic
Marked PCP is decidable
Corrigendum: A Graph-Based Regularity Test for Deterministic Context-Free Languages
Closure Properties of Slender Languages
On finding common neighborhoods in massive graphs
Lower bounds for the rate of convergence in nonparametric pattern recognition
Petri net reactive modules
The black paper of quantum cryptography: Real implementation problems
On factorially balanced sets of words
Fault-tolerant distance labeling for planar graphs
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
Optimal online algorithms for the multi-objective time series search problem
Kolmogorov complexity conditional to large integers
Query-competitive sorting with uncertainty
CSP is a retract of CCS
On the algebra of structured specifications
On g -extra conditional diagnosability of hierarchical cubic networks
Diagnosis of three types of constant faults in read-once contact networks over finite bases
First-Order Approximation of Algorithmic Theories
Automated techniques for provably safe mobile code
The Design Principles of a Weighted Finite-State Transducer Library
Degrees are useless in Snort when measuring temperature
Randomized competitive algorithms for online buffer management in the adaptive adversary model
Selfish bin packing with cardinality constraints
Bipartite graphs of small readability
Compositions with Superlinear Deterministic Top-Down Tree Transformations
Special Issue on Distributed Computing and Networking
A sound and complete proof system for a unified temporal logic
Deciding bisimulation-like equivalences with finite-state processes
Two-agent single-machine scheduling problem with just-in-time jobs
Constant query time (1 + ϵ )-approximate distance oracle for planar graphs
Approximability of the complementarily symmetric Holant problems on cubic graphs
Winning strategies for aperiodic subtraction games
Checking whether a word is Hamming-isometric in linear time
On the complexity of computing the k-restricted edge-connectivity of a graph
Wheeler graphs: A framework for BWT-based data structures
The complexity of deciding reachability properties of distributed negotiation schemes
An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
On the arithmetical complexity of Sturmian words
Structural properties of XPath fragments
Semantic Models for Concurrent Logic Languages
On optimal parsing for LZ78-like compressors
On the complexity of the misère version of three games played on graphs
UPGMA and the normalized equidistant minimum evolution problem
Call admission problems on grids with advice
Monomials, multilinearity and identity testing in simple read-restricted circuits
Towards a generic view of primality through multiset decompositions of natural numbers
The Directed Subgraph Homeomorphism Problem
On reasoning about structural equality in XML: a description logic approach
Efficient operations on discrete paths
A complementary survey on double-loop networks
On the Inference of Strategies
Lambda Abstraction Algebras: Representation Theorems
A type system for counting instances of software components
Counting and enumerating preferred database repairs
Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets
One-shot learners using negative counterexamples and nearest positive examples
The Rank of a Formal Tree Power Series
On min-max r-gatherings
The dynamic complexity of transitive closure is in DynTC 0
Dichotomy result on 3-regular bipartite non-negative functions
Proof Normalization with Nonstandard Objects
The State Complexities of Some Basic Operations on Regular Languages
Hamiltonian paths in L-shaped grid graphs
Role colouring graphs in hereditary classes
Functional-Logic Integration via Minimal Reciprocal Extensions
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states
Correspondences between classical, intuitionistic and uniform provability
Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem
Pebble guided optimal treasure hunt in anonymous graphs
Factor-balanced S-adic languages
Feedback vertex sets on restricted bipartite graphs
Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity
Completeness of Park Induction
Morse set theory as a foundation for constructive mathematics
Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality
Deque Automata and a Subfamily of Context-Sensitive Languages which Contains all Semilinear Bounded Languages
On the efficiency of normal form systems for representing Boolean functions
Completing codes in a sofic shift
A note on Gao's algorithm for polynomial factorization
Tradeoffs for Language Recognition on Alternating Machines
On synchronized multi-tape and multi-head automata
Formal Verification of a Leader Election Protocol in Process Algebra
Reductions between scheduling problems with non-renewable resources and knapsack problems
A Topological Characterization of Thinning
Logic of subtyping
Sturmian words, beta-shifts, and transcendence
Partial gathering of mobile agents in asynchronous unidirectional rings
Theories of initial segments of standard models of arithmetics and their complete extensions
On "On Graph Rewritings" (Corrigendum)
Approximating algebraic functions by means of rational ones
On the intersection of regex languages with regular languages
Crossing numbers of beyond-planar graphs
On the Complexity of Specification Morphisms
Induced subgraph isomorphism: Are some patterns substantially easier than others?
Specifying Causality in Action Theories: A Default Logic Approach
Interval selection in the streaming model
The per-character cost of repairing word languages
Look-ahead removal for total deterministic top-down tree transducers
A note on models for graph representations
On the Coarsest Congruence Within Global-Clock-Bounded Equivalence
Aspects of predicative algebraic set theory, II: Realizability
On the concurrent computational content of intermediate logics
Automorphism Groups of Context-Free Graphs
Mathematical Metaphysics of Randomness
List of Publications of Marcel-Paul Schützenberger
The difficulty of being moral
An algorithmic framework for network reconstruction
On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems
An efficient algorithm to detect common ancestor genes for non-overlapping inversion and applications
Repetitiveness measures based on string morphisms
Population monotonic allocation schemes for vertex cover games
Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels
Parallel Comparison Merging of Many-Ordered Lists
Applicative theories for logarithmic complexity classes
A Comparison of two Variations of a Pebble Game on Graphs
The benefit of adaptivity in stochastic packing problems with probing
Online parallel machines scheduling with two hierarchies
On the Minimal Firing Time of the Firing Squad Synchronization Problem for Polyautomata Networks