yusuke1997/dblp-id-title huggingface dataset:
Optimal gathering of robots in anonymous butterfly networks via leader election
Approximating the Number of Linear Extensions
A context-free and a 1-counter geodesic language for a Baumslag-Solitar group
Working in binary protects the repetends of 1/3 h : Comment on Colussi's 'The convergence classes of Collatz function'
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II
A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization
Some Combinatorial Properties of the Thue-Morse Sequence and a Problem in Semigroups
Approximate String Matching with q-grams and Maximal Matches
On the approximability of the Steiner tree problem
Queries and computation on the web
A Theory of Binding Structures and Applications to Rewriting
A lower bound on compression of unknown alphabets
Expired data collection in shared dataspaces
NC Solving of a System of Linear Ordinary Differential Equations in Several Unknowns
On Input Read-Modes of Alternating Turing Machines
The surviving rate of planar graphs
Approximation schemes for knapsack problems with shelf divisions
Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids
The optimal LLL algorithm is still polynomial in fixed dimension
Nominal essential intersection types
Dependences related to strict binary relations
Infinite Arrays and Infinite Computations
Shuffle on Trajectories: Syntactic Constraints
Deep learning and natural language processing in computation for offensive language detection in online social networks by feature selection and ensemble classification techniques
Error analysis in minimax trees
On the (parameterized) complexity of recognizing well-covered ( r , ℓ )-graph
Partial Specifications and Compositional Verification
The complexity of computing the MCD-estimator
An Average-Case Analysis of MAT and Inverted File
Large deviation properties for pattern statistics in primitive rational models
Quantifier elimination for the reals with a predicate for the powers of two
Network connectivity assessment and improvement through relay node deployment
Markov's Constructive Analysis: A Participant's View
Inductive inference and computable numberings
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics
On Universality of Concurrent Expressions with Synchronization Primitives
Generalized abstraction-refinement for game-based CTL lifted model checking
Euclidean chains and their shortcuts
Reconstruction of a word from a multiset of its factors
Structured coalgebras and minimal HD-automata for the pi -calculus
The Congruence Theory of Closure Properties of Regular Tree Languages
Gracefully degrading consensus and k -set agreement in directed dynamic networks
A matroidal approach to rough set theory
An Analysis of Loop Checking Mechanisms for Logic Programs
Longest common subsequence problem for unoriented and cyclic strings
Almost periodic sequences
A fully dynamic algorithm for distributed shortest paths
Approximate Solution of NP Optimization Problems
Continuous speed scaling with variability: A simple and direct approach
Improved parameterized algorithms for minimum link-length rectilinear spanning path problem
Metric structures and probabilistic computation
The Membership and Equivalence Problems for Picture Languages
Deterministic Lindenmayer Languages, Nonterminals and Homomorphisms
Probability distribution for simple tautologies
Efficient seed computation revisited
A decomposition method for CNF minimality proofs
On the µ-calculus over transitive and finite transitive frames
Space-efficient data-analysis queries on grids
Distributed computing in the asynchronous LOCAL model
Counting maps on doughnuts
Sampling weighted perfect matchings on the square-octagon lattice
Associative and commutative tree representations for Boolean functions
Boolean operations and inclusion test for attribute-element constraints
Polymer dynamics via cliques: New conditions for approximations
On probabilistic timed automata
The Expressive Power of Cardinality-Bounded Set Values in Object-Based Data Models
Scott Induction and Closure under omega-Sups
Utility-sharing games: How to improve the efficiency with limited subsidies
Two-group knapsack game
On Multiple Context-Free Grammars
Projective topology on bifinite domains and applications
Burrows-Wheeler compression: Principles and reflections
Existence and nonexistence of descriptive patterns
Negation-closure for JSON Schema
Parallelism increases iterative learning power
Verification of well-formed communicating recursive state machines
Computing on anonymous networks with sense of direction
Regular production systems and triangle tilings
Embedding fault-free hamiltonian paths with prescribed linear forests into faulty ternary n -cubes
Restriction categories II: partial map classification
Algorithms for Plane Representations of Acyclic Digraphs
Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
Characterization of real time iterative array by alternating device
Reasoning in BDI agents using Toulmin's argumentation model
Time constrained graph searching
Chronic obstructive pulmonary disease prediction using Internet of things-spiro system and fuzzy-based quantum neural network classifier
Online pricing for multi-type of items
A Generalization of the Concept of Sketch
Uniformly monotone partitioning of polygons
Generalized P colonies with passive environment
On suffix tree detection
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization in linear time
Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes
Complexity and algorithms for neighbor-sum-2-distinguishing {1, 3}-edge-weighting of graphs
The component connectivity, component diagnosability, and t / k -diagnosability of Bicube networks
Balancedness and coboundaries in symbolic systems
Sampling automata and programs
Trimming and gluing Gray codes
The bridge-connectivity augmentation problem with a partition constraint
Some points in formal topology
Finding houses and holes in graphs
Any-world assumptions in logic programming
Multi-player End-Nim games
Digital misinformation and fake news detection using WoT integration with Asian social networks fusion based feature extraction with text and image classification by machine learning architectures
Efficient deterministic algorithms for maximizing symmetric submodular functions
Reachability in parametric Interval Markov Chains using constraints
New kernels for several problems on planar graphs
Bounded Greedy Nim
Decidability and independence of conjugacy problems in finitely presented monoids
A comparison of confluence and ample sets in probabilistic and non-probabilistic branching time
Overdetermined Weierstrass iteration and the nearest consistent system
A Grammatical Characterization of Alternating Pushdown Automata
Optimal algorithms for complete linkage clustering in d dimensions
Divergence in testing and readiness semantics
On the properties of language classes defined by bounded reaction automata
On the k-path partition of graphs
Ordered multi-stack visibly pushdown automata
Quantifier-free logic for nondeterministic theories
Faster shortest paths in dense distance graphs, with applications
Block Edit Models for Approximate String Matching
The Comparison of the Expressive Power of First-Order Dynamic Logics
Necessary and sufficient conditions for learning with correction queries
On the fixed points of the iterated pseudopalindromic closure operator
Tree Adjoining Grammars for RNA Structure Prediction
A generalized palindromization map in free monoids
Elastic founder graphs improved and enhanced
Dynamic of cyclic automata over Z 2
On the phenomenon of autocomputability
Verification of component-based systems with recursive architectures
Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21]
Centralized asynchronous broadcast in radio networks
The minimum broadcast range assignment problem on linear multi-hop wireless networks
Regular splicing languages and subclasses
A QUBO formulation for the Tree Containment problem
Plug-in context providers for reaction systems
A new decomposition technique for maximal clique enumeration for sparse graphs
The DNF exception problem
Optimal radio labellings of block graphs and line graphs of trees
Efficient Union-Find for Planar Graphs and other Sparse Graph Classes
The search for a reduction in combinatory logic equivalent to λβ-reduction
A simulation of cellular automata on hexagons by cellular automata on rings
Loosely-stabilizing maximal independent set algorithms with unreliable communications
The Communication Complexity of Computing Differentiable Functions in a Multicomputer Network
The complexity of boolean failure identification
Solving polynomial systems with noise over F 2 : Revisited
Editorial: Quantitative Aspects of Programming Languages and Systems
Enhanced string covering
Generalized bitstring rotation and its applications to toggle dynamical systems
Irreversible conversion of graphs
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
Positive and negative proofs for circuits and branching programs
On the Hardness of Approximating Shortest Integer Relations among Rational Numbers
Iterated sequential transducers as language generating devices
Denotational Semantics in the CPO and Metric Approach
Characterization of Normal Forms Possessing Inverse in the lambda-beta-eta -Calculus
On Weakly Confluent Monadic String-Rewriting Systems
The Inclusion Problem for Simple Languages
Programs in Partial Algebras
Computability of a Map and Decidability of its Graph in the Model of Blum, Shub and Smale
Algebraic structures computable without delay
Mechanizing omega -Order Type Theory Through Unification
Optimizing squares covering a set of points
On Some Decidability Problems for HD0L Systems with Nonsingular Parikh Matrices
Logical Analysis of Demonic Nondeterministic Programs
On the construction of stable models of untyped lambda-calculus
Corrigendum to "On pairwise compatibility graphs having Dilworth number two" [Theoret. Comput. Science (2014) 34-40]
Membership Problems for Data Dependencies in Relational Expressions
Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
Efficient web searching using temporal factors
Identification of function distinguishable languages
A formula for the number of tilings of an octagon by rhombi
Algorithms for minimum m-connected k-tuple dominating set problem
Bisimulation on speed: A unified approach
Approximation algorithms for spherical k -means problem using local search scheme
A sublinear parallel algorithm for stable matching
Well-structured transition systems everywhere!
Memoryless search algorithms in a network with faulty advice
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A Characterization of Recognizable Picture Languages by Tilings by Finite Sets
On the Representation of Finite Deterministic 2-Tape Automata
Preface: Algorithms, complexity and models of computation
General Cops and Robbers games with randomness
The dual of concatenation
Free lunches on the discrete Lipschitz class
Partial Confluence of Proceses and Systems of Objects
Ranking k maximum sums
Fault tolerance in k-ary n-cube networks
Asynchronous fully-decentralized SGD in the cluster-based model
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
A type assignment system for game semantics
Complete and directed complete Omega-categories
The End of Pumping?
Coalgebraic modal logic: soundness, completeness and decidability of local consequence
Corrigendum to "Inductive-data-type systems" [Theoret. Comput. Sci. 272 (1-2) (2002) 41-68]
Special Issue: Selected papers of the 7th and 8th workshops on Logical and Semantic Frameworks with Applications (LSFA)
Computing by commuting
Reconstruction of convex polyominoes with a blocking component
Rationality of the Möbius Function of Subword Order
The maximum time of 2-neighbor bootstrap percolation: Complexity results
Bernstein-Bezoutian matrices and curve implicitization
Continuous leakage-resilient certificate-based signcryption scheme and application in cloud computing
Segmenting microarray images using a contour-based method
Completing comma-free codes
Locating maximal approximate runs in a string
Extending inclusion dependencies with conditions
Regular sets over extended tree structures
Push-forward method for piecewise deterministic biochemical simulations
Algebraic Domains of Natural Transformations
Transition systems without transitions
New sequential and parallel algorithms for computing the β-spectrum
Secure cloud model for intellectual privacy protection of arithmetic expressions in source codes using data obfuscation techniques
On Floyd and Rivest's SELECT algorithm
Cellular automata and communication complexity
A convergence technique for the game i-MARK
Sharing information for the all pairs shortest path problem
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
Partition functions on k k-regular graphs with {0, 1}{0, 1}-vertex assignments and real edge functions
Pushdown automata, multiset automata, and Petri nets
On Positive Matrices
Parameterized pursuit-evasion games
A characterization of Moessner's sieve
On Some Properties of Very Pure Codes
Learning Semilinear Sets from Examples and via Queries
Forcing numbers of stop signs
Embedding longest fault-free paths onto star graphs with more vertex faults
Similarity metrics, metrics, and conditionally negative definite functions
Propositional Dynamic Logic with Local Assignments
Refinement calculus: A basis for translation validation, debugging and certification
Finitely distinguishable erasing pattern languages
Precise bounds for the distinguishing index of the Cartesian product
Complexity and approximability of Minimum Path-Collection Exact Covers
Restricted adaptive oblivious transfer
Quantum and classical tradeoffs
On the semantics of the call-by-name CPS transform
Anatomy of a domain of continuous random variables I
Order-Sorted Model Theory for Temporal Executable Specifications
Approximation algorithms for sorting permutations by extreme block-interchanges
Superposition Theorem Proving for Abelian Groups Represented as Integer Modules
Constant bounds on the moments of the height of binary search trees
Complexity of planning for connected agents in a partially known environment
Complexity for Finite Factors of Infinite Sequences
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets
Selected Papers in honour of Maurice Nivat - Editorial
Implementation of the Painlevé Test for Ordinary Differential Systems
Period recovery of strings over the Hamming and edit distances
Equivalence, Reduction and Minimization of Finite Automata over Semirings
A Comparison of Polynomial Time Reducibilities
A Specification Structure for Deadlock-Freedom of Synchronous Processes
Policy controlled system with anonymity
Normal form algorithms for extended context-free grammars
An improvement on a spernerity proof of Horrocks
Which fragments of the interval temporal logic HS are tractable in model checking?
Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
Evolvability via the Fourier transform
Some necessary clarifications about the chords' problem and the Partial Digest Problem
Representing model theory in a type-theoretical logical framework
Completeness for the modal μ -calculus: Separating the combinatorics from the dynamics
On the decidability and complexity of the structural congruence for beta-binders
Combining a monad and a comonad
Matching preclusion for n-dimensional torus networks
The complexity of multicut and mixed multicut problems in (di)graphs
New operations and regular expressions for two-dimensional languages over one-letter alphabet
On Resource-Bounded Instance Complexity
Virtual world consistency: A condition for STM systems (with a versatile protocol with invisible read operations)
Virus Tests to Maximize Availability of Software Systems
Proof-carrying code from certified abstract interpretation and fixpoint compression
The Complexity of Linear Programming
Cellular automata and strongly irreducible shifts of finite type
On the conjectures of neighbor locating coloring of graphs
Computing generalized de Bruijn sequences
From rewrite rules to bisimulation congruences
Generalized Regular Expressions-A Language for Synthesis of Programs with Braching in Loops
k-difference matching in amortized linear time for all the words in a text
Interval-valued computations and their connection with PSPACE
On the kernelization of split graph problems
Fixed-parameter algorithms for the weighted Max-Cut problem on embedded 1-planar graphs
Mixing logics and rewards for the component-oriented specification of performance measures
On the Hamming distance of constraint satisfaction problems
On the structure of the counting function of sparse context-free languages
A further study on weak Byzantine gathering of mobile agents
Recognizing when a preference system is close to admitting a master list
On Generalized Language Equations
On Classes of Tractable Unrestricted Regular Expressions
A tiling system for the class of L -convex polyominoes
Recognizing hyperelliptic graphs in polynomial time
On the Linearity of On-Line Computable Functions
Fault tolerance analysis of hierarchical folded cube
Generating Power of Lazy Semantics
Convex language semantics for nondeterministic probabilistic automata
On graph problems in a semi-streaming model
GemCell: A generic platform for modeling multi-cellular biological systems
Hardness of subgraph and supergraph problems in c-tournaments
Disproving a conjecture on planar visibility graphs
Encoding Generic Judgments: Preliminary results
A complete symbolic bisimulation for full applied pi calculus
On the Complexity of Partially Observed Markov Decision Processes
Algorithm for constraint partial inverse matroid problem with weight increase forbidden
MR4UM: A framework for adding fault tolerance to UML state diagrams
Reducibility of gene patterns in ciliates using the breakpoint graph
The t / k -diagnosability of m -ary n -cube networks
Symmetry breaking depending on the chromatic number or the neighborhood growth
A new structure for a vertex to be locally t -diagnosable in large multiprocessor systems
Algèbre de Processus et Synchronisation
Decomposition of Recognizable Strong Maximal Codes
LMNtal as a hierarchical logic programming language
From Partial Evaluation to Mixed Computation
Low complexity classes of multidimensional cellular automata
Decidability of the halting problem for Matiyasevich deterministic machines
Fast Verification, Testing, and Generation of Large Primes
Computing Abstract Decorations of Parse Forests Using Dynamic Programming and Algebraic Power Series
Reeb graphs for shape analysis and applications
New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs
Bubble-Flip - A new generation algorithm for prefix normal words
Planar quorums
On the Time-Space Tradeoff for Sorting with Linear Queries
Incremental construction of minimal deterministic finite cover automata
Memoryless computation: New results, constructions, and extensions
The Generating Function of the Number of Subpatterns of a D0L Sequence
"Green" barrier coverage with mobile sensors
A termination proof for epsilon substitution using partial derivations
Short and efficient convertible undeniable signature schemes without random oracles
Specifications for decidable hybrid games
The Propositional Dynamic Logic of Deterministic, Well-Structured Programs
Computational fuzzy extractor from LWE
Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
Weak minimization of DFA - an algorithm and applications
Approximating activation edge-cover and facility location problems
WORDS '99 - Preface
The complexity of explaining neural networks through (group) invariants
Computational complexity of threshold automata networks under different updating schemes
Polynomial time learning of simple deterministic languages via queries and a representative sample
Finite complete rewriting systems for regular semigroups
Another proof of Soittola's theorem
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms
Hybrid automata, reachability, and Systems Biology
Dynamic 3-sided planar range queries with expected doubly-logarithmic time
Two-stage BP maximization under p-matroid constraint
On the effects of hierarchical self-assembly for reducing program-size complexity
Generalized Sub-Shifts in Elementary Cellular Automata: The "Strange Case" of Chaotic Rule 180
Stack and register complexity of radix conversions
Fast Algorithms for the Characteristic Polynomial
Cook's versus Valiant's hypothesis
Better 3-coloring algorithms: Excluding a triangle and a seven vertex path
Incremental learning with temporary memory
Linear-time limited automata
Alternation for sublogarithmic space-bounded alternating pushdown automata
Counting nondeterministic computations
The Weisfeiler-Leman algorithm and recognition of graph properties
On page migration and other relaxed task systems
Error-pruning in interface automata
Pictures worth a thousand tiles, a geometrical programming language for self-assembly
Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
Implications of Forbidden Structures for Extremal Algorithmic Problems
Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
Lattice-based group signatures: Achieving full dynamicity (and deniability) with ease
Relating strong behavioral equivalences for processes with nondeterminism and probabilities
On the Interpretability of Arithmetic in Temporal Logic
An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators
On Topological Dynamics of Turing Machines
Probabilistic approximations of ODEs based bio-pathway dynamics
The Typed lambda-Calculus is not Elementary Recursive
A comparison of graph-theoretic DNA hybridization models
Scheduling maintenance jobs in networks
The game of n-player Cutcake
Language-theoretic aspects of DNA complematarity
New techniques for approximating optimal substructure problems in power-law graphs
Algorithms for computing lengths of chains in integral partition lattices
A Partial Trace Semantics for Petri Nets
Equations and Monoid Varieties of Dot-Depth One and Two
Testing the (s, t)-disconnectivity of graphs and digraphs
On a conjecture about Parikh matrices
An Improved Shellsort Algorithm
Certificateless cryptography with KGC trust level 3
Skolemization and Herbrand theorems for lattice-valued logics
The complexity of synchronous notions of information flow security
Sharing Out Control in Distributed Processes
Extended dualization: Application to maximal pattern mining
Asynchronous games 2: The true concurrency of innocence
Partial quasi-metrics
Strong matching preclusion for torus networks
Lower Bounds for One-Way Probabilistic Communication Complexity and Their Application to Space Complexity
Semantics of a sequential language for exact real-number computation
The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages
Nondeterministic Multicounter Machines and Complementation
Improved upper bounds on the L(2, 1) -labeling of the skew and converse skew product graphs
Random binary search tree with equal elements
On the relations between monadic semantics
Efficient enumeration of all ladder lotteries and its application
From CML to its Process Algebra
On the Operational Semantics of Nondeterminism and Divergence
I-Categories as a Framework for Solving Domain Equations
Closure Functions and General Iterates as Reflectors
Intersection number and topology preservation within digital surfaces
Reconnaissance parallele des langages rationnels sur automates cellulaires plans