yusuke1997/dblp-id-title huggingface dataset:
A solution to the tennis ball problem
A dozen of research topics in membrane computing
Truly concurrent constraint programming
Enumeration of Polyominoes Using Macsyma
Strong Separations of the Polynomial Hierarchy with Oracles: Constructive Separations by Immune and Simple Sets
Hyperedge Replacement Jungle Rewriting for Term-Rewriting Systems and Programming
Fast Generalized Fourier Transforms
Corrigendum: Stability in L Systems
Covering and packing of rectilinear subdivision
The method of polynomial ring calculus and its potentialities
Sublinear P system solutions to NP-complete problems
On Meije and SCCS: Infinite Sum Operators VS. Non-Guarded Definitions
Free Shuffle Algebras in Language Varieties
Polymorphic lambda calculus and subtyping
New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling
Min (a)cyclic feedback vertex sets and min ones monotone 3-SAT
Presorting algorithms: An average-case point of view
Geometry of information: Classical and quantum aspects
The Decomposition of Stochastic Systems
Canonical substitutions tilings of Ammann-Beenker type
Connectivity and diagnosability of the complete Josephus cube networks under h-extra fault-tolerant model
On a special class of primitive words
Combining decomposition approaches for the Maximum Weight Stable Set problem
New Values in Domineering
Algebraic Structures for Transitive Closure
Solving Word Equations modulo Partial Commutations
Generalized Metric Spaces: Completion, Topology, and Powerdomains via the Yoneda Embedding
An analysis of optimal link bombs
A novel identity-based multi-signature scheme over NTRU lattices
A general approach to comparing infinite-state systems with their finite-state specifications
On the complexity of multi-dimensional interval routing schemes
On the computational power of context-free PC grammar systems
Computing power of Turing machines in the framework of unsharp quantum logic
Capacitated Max-Batching with interval graph compatibilities
Online algorithms for BP functions maximization
On the Complexity of Multiplication in Finite Fields
Hypothesis finding based on upward refinement of residue hypotheses
k-Block parallel addition versus 1-block parallel addition in non-standard numeration systems
Reduction Strategies for Declarative Programming
A short proof that adding some permutation rules to β preserves SN
Matching cutsets in graphs of diameter 2
On the domino problem of the Baumslag-Solitar groups
Extensions and submonoids of automatic monoids
Context-Free Complexity of Finite Languages
Testing and Reconfiguration of VLSI Linear Arrays
On universal prediction and Bayesian confirmation
Hierarchy Theorems for k OBDDs and k IBDDs
Complexity and algorithms for injective edge coloring of graphs
State succinctness of two-way finite automata with quantum and classical states
A note about words which coincide except in one position
Symmetric digit sets for elliptic curve scalar multiplication without precomputation
More Languages of Generalised Star Height 1
Opinion evolution among friends and foes: The deterministic majority rule
Proof of the Brlek-Reutenauer conjecture
Safe termination detection in an asynchronous distributed system when processes may crash and recover
Constant-size CCA-secure multi-hop unidirectional proxy re-encryption from indistinguishability obfuscation
Length Considerations in Context-Free Languages
On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs
Some classes of prolog programs inferable from positive data
On viewing block codes as finite automata
The metric dimension of Zn×Zn×Zn is ⌊3 n /2⌋
Analysis of edge deletion processes on faulty random regular graphs
Counting models for 2SAT and 3SAT formulae
Pushdown Acceptor Forms
On the problem of Best Arm Retention
Hot Topics in Reduction Strategies - A Panelist's View
Timed encryption with application to deniable key exchange
NP-completeness of the game Kingdomino TM
The 4-way deterministic tiling problem is undecidable
Diagnosability for two families of composition networks
Understanding the mismatch combinator in chi calculus
Ranked document retrieval for multiple patterns
Alternating Multihead Finite Automata
Online scheduling on the unbounded drop-line batch machines to minimize the maximum delivery completion time
Total Correctness in Nonstandard Logics of Programs
Independent Sets Versus Perfect Matchings
Formal design and verification of operational transformation algorithms for copies convergence
π 1 1 -Martin-Löf random reals as measures of natural open sets
Biography of A.O. Slissenko
Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
Weakly unambiguous morphisms
Correctness of Parallel Programs: The Church-Rosser Approach
Deterministic normal position transformation and its applications
Attributed Tree Grammars
Block-graph width
Lambda calculus with patterns
Optimally integrating ad auction into e-commerce platforms
How to Decide the Lark
The consistency dimension and distribution-dependent learning from queries
On the Concentration of Infinite Traces
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
Alternation on Cellular Automata
Leader election on two-dimensional periodic cellular automata
A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms
Approximate set union via approximate randomization
Equational Logic of Circular Data Type Specification
New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors
Rational relations having a rational trace on each finite intersection of rational relations
Minimizing total interference in asymmetric sensor networks
On a Family of L Languages Resulting from Systolic Tree Automata
Move-optimal gossiping among mobile agents
A nondeterministic Turing machine variant to compute functions
A dynamic data structure for top-k queries on uncertain data
Edit distance neighbourhoods of input-driven pushdown automata
Variations on Mobile Processes
Relativizing Relativized Computations
Reflective inductive inference of recursive functions
Honest Polynomial Degrees and P=?NP
Generic Sort-Preserving Traversal Strategies
Rules and Strategies for Contextual Specialization of Constraint Logic Programs
A new model for selfish routing
Parallel algorithms for red-black trees
Parallel and serial hypercoherences
A Polynomial Algorithm for the Membership Problem with Categorial Grammars
The complexity of zero-visibility cops and robber
Equational rules for rewriting logic
The Covering and Boundedness Problems for Vector Addition Systems
Deterministic local algorithms, unique identifiers, and fractional graph colouring
Computational complexity characterization of protecting elections from bribery
Re-examining regular expressions with backreferences
Emptiness problems for integer circuits
Probabilistic temporal logics via the modal mu-calculus
Arithmetical definability and computational complexity
A better LP rounding for feedback arc set on tournaments
Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs
A Conjecture on Continued Fractions
Building self-stabilizing overlay networks with the transitive closure framework
Kernel methods for learning languages
Algebraic Approach to Single-Pushout Graph Transformation
Computation of the suffix array, Burrows-Wheeler transform and FM-index in V -order
On Müller context-free grammars
Balanced allocation and dictionaries with tightly packed constant size bins
Co-evolution and information signals in biological sequences
Hybrid action systems
Bounded D0L Languages
On efficient connectivity-preserving transformations in a grid
1.5D terrain guarding problem parameterized by guard range
A new Gröbner basis conversion method based on stabilization techniques
Testing avoidability on sets of partial words is hard
Guest editorial: Structural Information and Communication Complexity 2021
A new method to obtain lower bounds for polynomial evaluation
Non-approximability of weighted multiple sequence alignment
A Semantics for lambda-Prolog
Approximation algorithms for maximum cut with limited unbalance
The complexity of small universal Turing machines: A survey
A hierarchy of shift equivalent sofic shifts
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Efficient shape formation by 3D hybrid programmable matter: An algorithm for low diameter intermediate structures
Special issue on selected papers from the 16th International Conference and Workshops on Algorithms and Computation (WALCOM 2022)
Fibonacci arrays and their two-dimensional repetitions
An exact algorithm for the minimum dominating clique problem
A Partial Ordering Semantics for CCS
On the effectiveness of the incremental approach to minimal chordal edge modification
Bounding the firing synchronization problem on a ring
Selecting evaluation functions in Opponent-Model search
A Polynomial Determination of the Most-Recent Property in Pascal-Like Programs
Computing the Tutte polynomial of lattice path matroids using determinantal circuits
When object production tunes the efficiency of membrane systems
The minimal Laplacian spectral radius of trees with a given diameter
Some Examples of Non-Existent Combinators
Dejean's conjecture holds for n>=30
Program Synthesis Using Realizability
Cobham-Semenov theorem and N d -subshifts
Regularity-Preserving Relations
Approximation algorithm for minimum weight connected- k -subgraph cover
The non-inclusive diagnosability of a kind of networks
On Computational Complexity of Contextual Languages
Alternating traps in Muller and parity games
Mergible states in large NFA
Hybrid fault diagnosis capability analysis of regular graphs
Self-stabilizing systems in spite of high dynamics
Sink location problems in dynamic flow grid networks
On-line scheduling of parallel jobs with runtime restrictions
Relation-Algebraic Semantics
From Multiple Sequent for Additive Linear Logic to Decision Procedures for Free Lattices
Clearing an orthogonal polygon to find the evaders
On maximal suffixes, constant-space linear-time versions of KMP algorithm
Automated higher-order complexity analysis
Partial Words and a Theorem of Fine and Wilf
Hypersequent rules with restricted contexts for propositional modal logics
Uniformity of quantum circuit families for error-free algorithms
Asymptotic behavior in a heap model with two pieces
Proxy-invisible CCA-secure type-based proxy re-encryption without random oracles
Grzegorczyk's hierarchy of computable analysis
D _ PSNI : Delimited persistent stochastic non-interference
On excessive index of certain networks
A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits
On the intuitionistic force of classical search
The Scott model of linear logic is the extensional collapse of its relational model
On hard instances
The Laws of Occam Programming
On the System of Word Equations x 0 u i 1 x 1 u i 2 x 2 u i 3 x 3 = y 0 v i 1 y 1 v i 2 y 2 v i 3 y 3 ( i =0, 1, 2, ...) in a Free Monoid
Optimal gossiping in square 2D meshes
Optimal trees for minimizing average individual updating cost
Planar maximum-box problem revisited
Sequential aggregate signatures with short public keys without random oracles
Unique Decomposition of Processes
Hereditarily-Finite Sets, Data Bases and Polynomial-Time Computability
Algorithms for the rainbow vertex coloring problem on graph classes
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Negation in Rule-Based Database Languages: A Survey
On the approximation of largest common subtrees and largest common point sets
Computer arithmetic and hardware: "off the shelf" microprocessors versus "custom hardware"
A volume first maxima-finding algorithm
An asymptotic fully polynomial time approximation scheme for bin covering
A relation between trinucleotide comma-free codes and trinucleotide circular codes
Better bounds on online unit clustering
A classification of wait-free loop agreement tasks
Space-efficient planar convex hull algorithms
Polynomial time algorithm for an optimal stable assignment with multiple partners
On Efficient Parallel Computations for some Dynamic Programming Problems
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Approximate analysis of biological systems by hybrid switching jump diffusion
A colouring protocol for the generalized Russian cards problem
Fast error-tolerant quartet phylogeny algorithms
Taming randomness and complexity - Essays in honour of Professor Péter Gács
Real-Time and Probabilistic Systems - Foreword
Monadic Simultaneous Rigid E-unification
An algebraic proof of Rabin's Tree Theorem
On the number of minimal dominating sets on some graph classes
Almost optimal distributed M2M multicasting in wireless mesh networks
Approximation algorithms for drone delivery scheduling with a fixed number of drones
Expressive power of LL(k) Boolean grammars
The fashion game: Network extension of Matching Pennies
State complexity of the concatenation of regular tree languages
The College Admissions problem with lower and common quotas
Subword Complexities of Various Classes of Deterministic Developmental Languages without Interactions
Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory
Efficient corona training protocols for sensor networks
A "thermodynamic" approach to multi-robot cooperative localization
Bounded sequence testing from deterministic finite state machines
Approximation algorithms for cutting a convex polyhedron out of a sphere
Completion of codes with finite bi-decoding delays
Exponential transient length generated by a neuronal recurrence equation
On dynamic bit-probe complexity
Modular verification of chemical reaction network encodings via serializability analysis
New results in two identical machines scheduling with agreement graphs
Convergence results for the (1, lambda)-SA-ES using the theory of phi-irreducible Markov chains
Ancestors graph and an upper bound for the subword complexity function
A self-stabilizing algorithm for cut problems in synchronous networks
Finding maximal closed substrings
How to analyse evolutionary algorithms
The search for a reduction in combinatory logic equivalent to λβ-reduction, Part II
On the Holonomy Decomposition of Transformation Semigroups
Optimal analysis for bandit learning in matching markets with serial dictatorship
A study of the neutrality of Boolean function landscapes in genetic programming
Alphabetic Tree Relations
Inducing enhanced suffix arrays for string collections
Note on Ramsey theorems for spatial graphs
A light-weight bit commitment protocol based on unpredictable channel noise
Complexity and succinctness issues for linear-time hybrid logics
The Equivalence of Finite Valued Transducers (On HDT0L Languages) is Decidable
Tile invariants: new horizons
Mapping a polygon with holes using a compass
A Characterization of Reversal-Bounded Multipushdown Machine Languages
Bisimulation invariant monadic-second order logic in the finite
On the approximability and hardness of minimum topic connected overlay and its special instances
Parameterized algorithm for 3-path vertex cover
On equal μ-terms
On the edge-length ratio of outerplanar graphs
Claw finding algorithms using quantum walk
On the coverability and reachability languages of monotonic extensions of Petri nets
Factorizing fault tolerance
Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems
On the complexity of bribery with distance restrictions
Lambek calculus is NP-complete
Alternating-time temporal logics with linear past
Problems Concerning Fairness and Temporal Logic for Conflict-Free Petri Nets
The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness
Stability for the Zigzag Submonoids
Process and truth-table characterisations of randomness
Improved algorithms for optimal k sink location on path networks
Skew Power Series Rings with General Commutation Formula
Wireless capacity with arbitrary gain matrix
On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
Approximation algorithms for the scaffolding problem and its generalizations
Solving the maximum duo-preservation string mapping problem with linear programming
Theory and applications of models of computation (TAMC 2008)
Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
Buchberger's Algorithm: The Term Rewriter's Point of View
Trapping Mutual Exclusion in the Box Calculus
Universal test for quantum one-way permutations
RNA secondary structure comparison: exact analysis of the Zhang-Shasha tree edit algorithm
Non-lattice-periodic tilings of R 3 by single polycubes
Spreading messages
Improved time complexity analysis of the Simple Genetic Algorithm
On the maximum edge-pair embedding bipartite matching
Dynamic bin packing of unit fractions items
An Order-Sorted Resolution in Theory and Practice
A bi-criteria algorithm for online non-monotone maximization problems: DR-submodular+concave
Private multiparty sampling and approximation of vector combinations
Algorithms, nymphs, and shepherds
A Closure Property of Regular Languages
From Constructivism to Computer Science
Sumcheck-based delegation of quantum computing to rational server
On computing the diameter of a point set in high dimensional Euclidean space
Separating sets of strings by finding matching patterns is almost always hard
Mixed integer programming with convex/concave constraints: Fixed-parameter tractability and applications to multicovering and voting
On prefixal one-rule string rewrite systems
Rainbow edge-pancyclicity of strongly edge-colored graphs
Equal-area locus-based convex polygon decomposition
An infinite hierarchy of language families generated by scattered context grammars with n-limited derivations
Explicit formulas for a sequence of binary tree polynomials
Animaux et arbres guingois
Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
Non-overlapping inversion on strings and languages
On the complexities of consistency checking for restricted UML class diagrams
New results on multi-level aggregation
Tractability conditions for numeric CSPs
Errata for the paper "Predecessor existence problems for finite discrete dynamical systems" [TCS 386 (1-2) (2007) 3-37]
Visual cryptograms of random grids for threshold access structures
On Deciding Confluence of Finite String-Rewriting Systems Modulo Partial Commutativity
Total colorings of planar graphs with sparse triangles
Encoding Hamiltonian circuits into multiplicative linear logic
To catch a falling robber
A Function for Evaluating the Computing Time of a Bubbling System
Distributed balanced color assignment on arbitrary networks
On Efficient Recognition of Transductions and Relations
Post-processing hierarchical community structures: Quality improvements and multi-scale view
Full sets of pictures to encode pictures
Finite Labelling Problem in Event Structures
New bounds for energy complexity of Boolean functions
Many-to-many edge-disjoint paths in ( n , k )-enhanced hypercube under three link-faulty hypotheses
Computably strongly self-absorbing C*-algebras
The Logic Engine and the Realization Problem for Nearest Neighbor Graphs
Process-commutative distributed objects: From cryptocurrencies to Byzantine-Fault-Tolerant CRDTs
Higher-level constructs for families and multisets
Lattice grids and prisms are antimagic
R g conditional diagnosability: A novel generalized measure of system-level diagnosis
Some Results on Subclass Containment Problems for Special Classes of DPDA's Related to Nonsingular Machines
A physicist's approach to number partitioning
A study on multi-dimensional products of graphs and hybrid logics
On CNF formulas irredundant with respect to unit clause propagation
Balancing and clustering of words in the Burrows-Wheeler transform
Polarized proof-nets and lambda-µ-calculus
Encoding nearest larger values
Foundations of block-parallel automata networks
Tight bound on mobile Byzantine Agreement
A characterization of c.e. random reals
Approximation algorithms for decomposing octilinear polygons
Another look at degree lower bounds for polynomial calculus
Guest editorial - Fun with algorithms 2024
The Max problem revisited: The importance of mutation in genetic programming
On the cost of recomputing: Tight bounds on pebbling with faults
New parameterized algorithms for the edge dominating set problem
Abduction from Logic Programs: Semantics and Complexity
An approximation algorithm for the parity-constrained k-supplier problem
Lower Bounds for Polynomials with Algebraic Coefficients
On caterpillar factors in graphs
A new approach to regular & indeterminate strings
Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform
Processes and Formalism for Unbounded Choice
The Weighted List Update Problem and the Lazy Adversary
Implication of Clauses is Undecidable
On switching classes, NLC-width, cliquewidth and treewidth
Morphic Congruences and D0L Languages
Degree distributions of evolving alphabetic bipartite networks and their projections
Some Natural Properties of Strong-Identification in Inductive Inference
Higher-order matching for program transformation
A Representation of Fomega in LF
Min Cut is NP-Complete for Edge Weighted Treees
A Proof-Planning Framework with Explicit Abstractions Based on Indexed Formulas
Border tracing in oriented adjacency graphs of polygonal tilings
Discrete solutions to differential equations by metabolic P systems
Random Generation of Combinatorial Structures from a Uniform Distribution
Refinement and state machine abstraction
Approximate composable truthful mechanism design
Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms
A more effective linear kernelization for cluster editing
On coalgebra based on classes
Planar graph is on fire
Improved upper bounds on all maximal α -gapped repeats and palindromes
Subword histories and associated matrices
Completeness, minimal logic and programs extraction
Eulerian entropy and non-repetitive subword complexity
Edge fault tolerance of graphs with respect to λ 2 -optimal property
Majority rule cellular automata
Combinatorics of geometrically distributed random variables: run statistics
Theory and Applications of Models of Computation at the Turing Centenary in China
Completeness of type assignment systems with intersection, union, and type quantifiers
Smaller solutions for the firing squad
Infinitary lambda calculus and discrimination of Berarducci trees
Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
Energy efficiency optimization for multiple chargers in Wireless Rechargeable Sensor Networks
A typed context calculus
A distributed algorithm for finding Hamiltonian cycles in random graphs in O(log⁡n) time
Semantic distance between specifications
Identification of genetic networks by strategic gene disruptions and gene overexpressions under a boolean model
On the Vector Space of the Automatic Reals
Parallel construction of succinct trees
Norms on Terms and their use in Proving Universal Termination of a Logic Program
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius
Bounds on the minimax rate for estimating a prior over a VC class from independent learning tasks
Towards a real time algorithm for parameterized longest common prefix computation
Fibred models of processes
Units of Special Church-Rosser Monoids
Not All Insertion Methods Yield Constant Approximate Tours in the Euclidean Plane
Efficient algorithms for shortest partial seeds in words
Probabilistic Communicating Processes
A chain rule for the expected suprema of Gaussian processes
Triangle edge deletion on planar glasses-free RGB-digraphs
Robust fault tolerant uncapacitated facility location
Exact algorithms to minimize interference in wireless sensor networks
Tighter upper bound for sorting permutations with prefix transpositions
A fast algorithm for the all-pairs suffix-prefix problem