yusuke1997/dblp-id-title huggingface dataset:
Elementary landscape decomposition of the frequency assignment problem
Identity-based ring signatures from RSA
Reconfiguration and enumeration of optimal cyclic ladder lotteries
Meta-Modelling for Formal Software Development
Algorithmic aspects of upper paired-domination in graphs
Rendezvous of heterogeneous mobile agents in edge-weighted networks
Dynamical analysis of a class of Euclidean algorithms
( h, k )-Arbiters for h -out-of- k mutual exclusion problem
On LR (k) Grammars and Languages
Self-Localization based on Ambient Signals
Reducing the Mean Latency of Floating-Point Addition
Verifying polymer reaction networks using bisimulation
A formal library of set relations and its application to synchronous languages
Improved distributed algorithms for coloring interval graphs with application to multicoloring trees
Flow shop scheduling problems with transportation constraints revisited
A Yacc Extension for LRR Grammar Parsing
Sparse convolution-based digital derivatives, fast estimation for noisy signals and approximation results
Motif trie: An efficient text index for pattern discovery with don't cares
A Curtis-Hedlund-Lyndon theorem for Besicovitch and Weyl spaces
Rewriting theory for the life sciences: A unifying theory of CTMC semantics
Permutation Representation of k-Ary Trees
Searching on a line: A complete characterization of the optimal solution
Idempotent cellular automata and their natural order
A Sublinear Parallel Algorithm for Some Dynamic Programming Problems
Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation
Fast relative Lempel-Ziv self-index for similar sequences
Randomized Boolean Decision Trees: Several Remarks
Primitive recursion for higher-order abstract syntax
Formulas, Regular Languages and Boolean Circuits
Fast exact algorithms for some connectivity problems parameterized by clique-width
Solving the maximum internal spanning tree problem on interval graphs in polynomial time
Comparison of Identification Criteria for Machine Inductive Inference
On varieties of meet automata
Completions in measure of languages and related combinatorial problems
Cut Elimination and Automatic Proof Procedures
Restriction categories I: categories of partial maps
Approximation algorithm for hotlink assignment in the greedy model
Exploration of NP-hard Enumeration Problems by Simulated Annealing - the Spectrum Values of Permanents
Uni-transitional Watson-Crick D0L systems
Optimal parameter choices via precise black-box analysis
Rule-based Programming for Building Expert Systems: a Comparison in the Microbiological Data Validation and Surveillance Domain
How to catch L 2 -heavy-hitters on sliding windows
On the Continued Fraction Representation of Computable Real Numbers
Load rebalancing games in dynamic systems with migration costs
Some Undecidability Results for Non-Monadic Church-Rosser Thue Systems
Two improved range-efficient algorithms for F 0 estimation
Restriction, Terms and Nonlinearity of Boolean Functions
Generalized scans and tridiagonal systems
Deductive verification of real-time systems using STeP
The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
Complexity of Canadian traveler problem variants
Treewidth distance on phylogenetic trees
Detecting quantum entanglement
Disjoint paths and connected subgraphs for H -free graphs
Parallel Load Balancing on constrained client-server topologies
Classic Nintendo games are (computationally) hard
Non-interference and local correctness in transactional memory
Two-Layer Planarization parameterized by feedback edge set
The Firing Squad Synchronization Problem for Graphs
Weighted register automata and weighted logic on data words
Two applications of analytic functors
exists-Universal termination of logic programs
Infinite Words with Linear Subword Complexity
On the computational complexities of three problems related to a privacy measure for large networks under active attack
Sequence similarity measures based on bounded hamming distance
Strong Fairness and Ultra Metrics
Last cases of Dejean's conjecture
Theory of átomata
Patterns of relation triples in inversion and ascent sequences
An Extension of Kleene's and Ochmanski's Theorems to Infinite Traces
On additive approximate submodularity
Wide-diameter and minimum length of fan
Operational Semantics of Rewriting with Priorities
A theory of L-shaped floor-plans
Supermartingales in prediction with expert advice
Enumeration of maximal irredundant sets for claw-free graphs
Developing (Meta)Theory of Lambda-calculus in the Theory of Context
Variety of mutual-visibility problems in graphs
On the linearity of the periods of subtraction games
Mutual witness Gabriel drawings of complete bipartite graphs
Forbidding and enforcing on graphs
Coloured Petri Nets and the Invariant-Method
On Proving Time Constructibility of Functions
Manipulating Derivation Forests by Scheduling Techniques
Algebra of Communicating Processes - Preface to the Special Issue
New Lower Bounds on the Cost of Binary Search Trees
Limiting partial combinatory algebras
Turing video-based cognitive tests to handle entangled concepts
Nearly k -universal words - Investigating a part of Simon's congruence
Secure Multiparty Computations Without Computers
On countable SFT covers of sparse multidimensional shift spaces
Resolvability and fault-tolerant resolvability structures of convex polytopes
Corrigendum to "On the rate of decrease in logical depth" [Theor. Comput. Sci. 702 (2017) 60-64] by L.F. Antunes, A. Souto, and P.M.B. Vitányi
Efficient approximation algorithms for maximum coverage with group budget constraints
An asymptotic theory for recurrence relations based on minimization and maximization
Ambiguous classes in mu-calculi hierarchies
Label updating to avoid point-shaped obstacles in fixed model
A symbolic dynamics approach to Epileptic Chronnectomics: Employing strings to predict crisis onset
Vaccinate your trees!
Online searching with turn cost
On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts
A linearly computable measure of string complexity
Dynamics of a class of ants on a one-dimensional lattice
A note on LP-based approximation algorithms for capacitated facility location problem
Parallel Chip Firing Games on Graphs
Lattice-based public-key encryption with equality test supporting flexible authorization in standard model
State complexity of basic operations on suffix-free regular languages
Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs
Rumor spreading with bounded in-degree
A note on the strong and weak generative powers of formal systems
Graph easy sets of mute lambda terms
Foreword (COCOON'95)
The "Smallest" Ring of Polynomial Invariants of a Permutation Group which has No Finite SAGBI Bases w.r.t. Any Admissible Order
Faster parameterized algorithms for two vertex deletion problems
Limiting negations in non-deterministic circuits
Weighted last-step min-max algorithm with improved sub-logarithmic regret
Non-adaptive learning of a hidden hypergraph
Efficient enumeration of ordered trees with k leaves
On small universal antiport P systems
Arithmetical Hierarchy and Complexity of Computation
Locally Boolean domains
Mechanism design for set cover games with selfish element agents
Some Polynomial-Time Algorithms for Finite Monadic Church-Rosser Thue Systems
Random Heuristic Search
Some Decision Problems Related to the Reachability Problem for Petri Nets
Tight lower bound instances for k-means++ in two dimensions
Scalable Threshold Closure
Towards the hierarchical verification of reactive systems
Probabilistic systems coalgebraically: A survey
From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems
Small Universal Register Machines
Growth rate of binary words avoiding xxx R
On the complexity of resolution with bounded conjunctions
A note on universal composable zero-knowledge in the common reference string model
The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties
Computational complexity aspects of super domination
Nets, Sequential Components and Concurrency Relations
Proper conflict-free coloring of Mycielskians with fast algorithms
Split algorithms for skewsymmetric Toeplitz matrices with arbitrary rank profile
On the exponential growth of geometric shapes
Solving systems of diagonal polynomial equations over finite fields
Reconfiguring spanning and induced subgraphs
The popular matching problem in the roommates instance remains NP-hard in bounded degree graphs
Fast solutions to k-parity and k-synchronisation using parallel automata networks
Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D
On Real Time One-Way Cellular Array
Distinct squares in run-length encoded strings
Reconstruction of binary matrices under fixed size neighborhood constraints
On the Status of Proving Program Properties in Effective Interpretations
On the degree of scattered context-sensitivity
Smooth words over arbitrary alphabets
Arc-disjoint spanning sub(di)graphs in digraphs
Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations
Biprefix Codes, Inverse Semigroups and Syntactic Monoids of Injective Automata
Decision procedures for inductive Boolean functions based on alternating automata
Smoothed analysis of binary search trees
A practical decision procedure for Propositional Projection Temporal Logic with infinite models
Oracle-based flocking of mobile robots in crash-recovery model
Loop-checking and the uniform word problem for join-semilattices with an inflationary endomorphism
Palindromes and Sturmian Words
A matching-based approximation algorithm for the traveling tournament problem
On determinism versus nondeterminism in P systems
Measuring diversity in heterogeneous information networks
An algorithmic approach to the problem of a semiretract base
Termination Modulo Equations by Abstract Commutation with an Application to Iteration
A Rationale for Conditional Equational Programming
A faster algorithm for testing polynomial representability of functions over finite integer rings
Selective strictness and parametricity in structural operational semantics, inequationally
On the 2-binomial complexity of the generalized Thue-Morse words
The ultimate strategy to search on m rays?
Verifying chemical reaction network implementations: A pathway decomposition approach
Drags: A compositional algebraic framework for graph rewriting
Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs
A Kripke model for simplicial sets
Games on triangulations
Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs
Eccentricity function in distance-hereditary graphs
Algorithmic introduction of quantified cuts
Sum of digits sequences modulo m
Words 2013
Determinisability of unary weighted automata over the rational numbers
On the representation of McCarthy's amb in the Pi-calculus
Parallel N-Free Order Recognition
Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
Some characteristics of strong innermost normalization
Optimal Byzantine-resilient convergence in uni-dimensional robot networks
Density elimination
( p , k )-coloring problems in line graphs
Word problems of groups: Formal languages, characterizations and decidability
Position-Restricted Grammar Forms and Grammars
Fully asynchronous behavior of double-quiescent elementary cellular automata
Data Representation and Computational Complexity
Amount of nonconstructivity in deterministic finite automata
Bisimilarity is not finitely based over BPA with interrupt
Learning unions of omega(1)-dimensional rectangles
A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category
Computation, on Macsyma, of the Minimal Differential Representation of Noncommutative Polynomials
On the expected time for Herman's probabilistic self-stabilizing algorithm
Admissible Heuristic Search in And/Or Graphs
Rounding Voronoi diagram
Metric semantics for true concurrent real time
The plurality problem with three colors and more
Graphical limit sets for general cellular automata
An automata-based approach for addressing erroneous behaviors and deadlocks in component-based systems
A parameterizable enumeration algorithm for sequence mining
On computing Hilbert bases via the Elliot-MacMahon algorithm
Polymorphic higher-order context-free session types
Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
Self-assembly of strings and languages
Fast balanced partitioning is hard even on grids and trees
The counting power of P systems with antimatter
Least and greatest fixed points in intuitionistic natural deduction
On-Line Chain Partitions of Orders
Automatic workflow verification and generation
Tautology Testing with a Generalized Matrix Reduction Method
Attribute-based signatures from RSA
Refined analysis to the extended tower number field sieve
Tiling problems, automata, and tiling graphs
Parikh-reducing Church-Rosser representations for some classes of regular languages
Cartesian authentication codes from functions with optimal nonlinearity
Singularity Analysis and Asymptotics of Bernoulli Sums
Separately Continuous Algebras
Recursive solution of initial value problems with temporal discretization
Relating Polynomial Time to Constant Depth
Semi-online scheduling with two GoS levels and unit processing time
Proof of a conjecture on 2-isometric words
The subdivision-constrained minimum spanning tree problem
Coordinated scheduling of production and delivery with production window and delivery capacity constraints
Polynomial Time 1-Turing Reductions from #PH to #P
Turning back time in Markovian process algebra
The higher-order meet-in-the-middle attack and its application to the Camellia block cipher
Towards Efficient Induction Mechanisms in Database Systems
Real-Time, Pseudo Real-Time, and Linear-Time ITA
Finding popular branchings in vertex-weighted directed graphs
Generalizations of Opt P to the Polynomial Hierarchy
Structure theory of multi-level deterministically synchronized sequential processes
Characterizations of quantum automata
The Convergence of Functions to Fixedpoints of Recursive Definitions
The Boolean SATisfiability Problem in Clifford algebra
Two Theorems Concerning Recognizable N-Subsets of sigma*
Uniform Generation of a Motzkin Word
On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
Computability with Low-Dimensional Dynamical Systems
Colouring generalized claw-free graphs and graphs of large girth: Bounding the diameter
On the steady state analysis of covariance matrix self-adaptation evolution strategies on the noisy ellipsoid model
Sequence Recursiveness Without Cylindrification and Limited Register Machines
Two-dimensional cellular automata and their neighborhoods
On Reversal-Bounded Picture Languages
Efficient algorithms for ride-hitching in UAV travelling
On the max-flow min-cut ratio for directed multicommodity flows
On the complexity of decidable cases of the commutation problem of languages
Parameterized counting matching and packing: A family of hard problems that admit FPTRAS
Optimal Algorithms for Sensitivity Analysis in Associative Multiplication Problems
Degree distribution of large networks generated by the partial duplication model
Communication costs in a geometric communication network
Ranked document selection
Solving Systems of Linear Equations over Polynomials
Temporal graph classes: A view through temporal separators
Combination of Constraint Solvers for Free and Quasi-Free Structures
Indexings of Subrecursive Classes
A Confluent Calculus for Concurrent Constraint Programming
On a Subclass of Infinite-Regular Languages
Quantum structures in qudit spaces
Efficient pattern matching for RNA secondary structures
Inferring local transition functions of discrete dynamical systems from observations of system behavior
A continuous strategy for collisionless gathering
Edge searching and fast searching with constraints
Attributed graph transformation with node type inheritance
Axiomatisation of an Interval Calculus for Theorem Proving
Mate with Bishop and Knight in Kriegspiel
FM-index of alignment: A compressed index for similar strings
Experiments in Linear Natural Deduction
Words avoiding repetitions in arithmetic progressions
Communication tree problems
The possible cardinalities of global secure sets in cographs
Deformation techniques to solve generalised Pham systems
G-good-neighbor diagnosability under the modified comparison model for multiprocessor systems
Variable projection methods for approximate (greatest) common divisor computations
A Uniform Approach to Obtain Diagonal Sets in Complexity Classes
Guarded Repair of Dependable Systems
Metagenomic reads binning with spaced seeds
On complete systems of automata
Recursive circulants and their embeddings among hypercubes
Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
Some properties of Ising automata
Verification of membrane systems with delays via Petri nets with delays
The cover times of random walks on random uniform hypergraphs
Novel algorithms for maximum DS decomposition
Preference Structures and Their Numerical Representations
Unfold/Fold Transformations of Stratified Programs
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness I
Characteristic Sturmian words are extremal for the Critical Factorization Theorem
A coding theory construction of new systematic authentication codes
Authentication of fragments with short tags
On the ambiguation of Polish notation
Finite axiom systems for testing preorder and De Simone process languages
Packing resizable items with application to video delivery over wireless networks
A solution to the problem of (A, B)-invariance for series
Model independent approach to probabilistic models
A new algorithm based on copulas for VaR valuation with empirical calculations
Lower Bounds on Probabilistic Linear Decision Trees
Aliased register allocation for straight-line programs is NP-complete
Utilization of nonclairvoyant online schedules
A randomized competitive algorithm for evaluating priced AND/OR trees
Temporally connected components
An enhanced property of factorizing codes
A game-based approximate verification of deep neural networks with provable guarantees
Prefix frequency of lost positions
On the complex behavior of simple tag systems - An experimental approach
On the complexity of injective colorings and its generalizations
Multilayered Cellular Automata
Computing by Splicing
The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory
Optimal graph exploration without good maps
Algorithms solving the Matching Cut problem
Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect
Integer-valued martingales and cl-Turing reductions
Analysis of randomized load distribution for reproduction trees in linear arrays and rings
Some Machines Defined bu Directed Graphs
Can a breakpoint graph be decomposed into none other than 2-cycles?
Approximate counting of standard set-valued tableaux
Using data-independence in the analysis of intrusion detection systems
On D0L Systems with Immigration
Randomized Routing on Generalized Hypercubes
Tradeoffs in worst-case equilibria
Modularity in term rewriting revisited
A large-scale assessment of exact lumping of quantitative models in the BioModels repository
Proper orientation of cacti
Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata
Classifying Molecular Sequences Using a Linkage Graph With Their Pairwise Similarities
Infinity-Regular Temporal Logic and its Model Checking Problem
Universal coating for programmable matter
Unification and extension of weighted finite automata applicable to image compression
Treasure evacuation with one robot on a disk
Feasibility analysis of recurrent DAG tasks is PSPACE-hard
Constrained flows in networks
The complexity of the characteristic and the minimal polynomial
Command-based importance sampling for statistical model checking
Dominoes Over a Free Monoid
On the Consistency of Koomen's Fair Abstraction Rule
On some derivation mechanisms and the complexity of their Szilard languages
Theoretical aspects of equitable partition of networks into sparse modules
A path to computational efficiency through membrane computing
Adaptive multiple minor directions extraction in parallel using a PCA neural network
Essential Transitions to Bisimulation Equivalences
Communication Aspects of Networks Based on Geometric Incidence Relations
The 2-radius and 2-radiian problems on trees
A new algorithm design technique for hard problems
Determining the equivalence for one-way quantum finite automata
A Lower Bound on the Number of Additions in Monotone Computations
Statistical Zero Knowledge and quantum one-way functions
Longest fault-free paths in star graphs with vertex faults
Normalization, approximation, and semantics for combinator systems
Some i -Mark games
A circular matrix-merging algorithm with application in Volumetric Intensity-Modulated Arc Therapy
Computation power of asynchronous spiking neural P systems with polarizations
On learning monotone Boolean functions under the uniform distribution
Linear space bootstrap communication schemes
Convex p-partitions of bipartite graphs
A Note on Decidability Questions on Presentations of Word Semigroups
Space-efficient construction of compressed suffix trees
Efficient String Matching with k Mismatches
A theoretical and empirical investigation of search in imperfect information games
Refining the r -index
Asymptotic Properties of Keys and Functional Dependencies in Random Databases
The Equivalence Problem of Multitape Finite Automata
A tour of general Hanoi graphs
Alice in the Land of Oz - An Interoperability-based Implementation of a Functional Language on Top of a Relational Language
#P-Hardness proofs of matrix immanants evaluated on restricted matrices
TransMCS: A hybrid CNN-transformer autoencoder for end-to-end multi-modal medical signals compressive sensing
Searching games with errors - fifty years of coping with liars
The Semantics of Lazy Functional Languages
An Algorithm for Dynamic Subset and Intersection Testing
Interpolation functor and computability
Efficient timed model checking for discrete-time systems
A Semantically Meaningful Characterization of Reducible Flowchart Schemes
Long-lived Rambo: Trading knowledge for communication
On the Structure of Sets in NP and Other Complexity Classes
Lessons from the Congested Clique applied to MapReduce
Mixed Computation and Compilation: New Approaches to Old Problems
On the strongly generic undecidability of the Halting Problem
Finiteness is Mu-Ineffable
On the equivalence of the cube-product and the general product of automata
Complete Proof Rules for Strong Fairness and Strong Extreme Fairness
Optimizing Paxos with batching and pipelining
Improved upper bound for sorting permutations by prefix transpositions
Languages generated by numerical P systems with thresholds
On the competitiveness of AIMD-TCP within a general network
Structure and complexity of extreme Nash equilibria
Conditioning a State by a Lukasiewicz Event: A Probabilistic Approach to Ulam Games
Synchronization Languages
Non-expansive epsilon-bisimulations for probabilistic processes
Structure and substructure connectivity of divide-and-swap cube
Parametrisation of solutions of parametric equation in free monoid
Self-stabilizing robots in highly dynamic environments
Deterministic polynomial-time algorithms for designing short DNA words
Three-variable statements of set-pairing
On Interprocess Communication and the Implementation of Multi-Writer Atomic Registers
Terminal Metric Spaces of Finitely Branching and Image Finite Linear Processes
Matching influence maximization in social networks
On Parsing Coupled-Context-Free Languages
Reductions for monotone Boolean circuits
Efficient randomized routing algorithms on the two-dimensional mesh of buses
Recursive equations in higher-order process calculi