yusuke1997/dblp-id-title huggingface dataset:
A self-generating sequence
On the reliability of alternating group graph-based networks
On the Security of Name-Stamp Protocols
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems
The vulnerability of the diameter of the enhanced hypercubes
Conflict-free coloring on subclasses of perfect graphs and bipartite graphs
Message lower bounds via efficient network synchronization
Busy beaver machines and the observant otter heuristic (or how to tame dreadful dragons)
Pushdown Machines for the Macro Tree Transducer
On the parameterized complexity of 2-partitions
Some geometrical and topological properties of DNNs' decision boundaries
A new framework for declarative programming
Functions and sequences generated by reaction systems
Open Maps for Tessellation Automata
On the commutative equivalence of bounded context-free and regular languages: The code case
Timing Conditions for Linearizability in Uniform Counting Networks
A Contructive Method for Abstract Algebraic Software Specification
On a valuation of rational subsets of Z k Dédié à Jean Berstel
Context-Free Grammars with Cancellation Properties
A Hierarchy of eNCE Families of Graph Languages
Quantitative information in the tuple space coordination model
Fuzzy quartile encoding as a preprocessing method for biomedical pattern classification
The sparsest additive spanner via multiple weighted BFS trees
P systems with randomized right-hand sides of rules
On Reachability Equivalence for BPP-Nets
Determination of finite automata accepting subregular languages
Language Operators Related to Init
An Operator Embedding Theorem for Complexity Classes of Recursive Functions
The Word Problem for Inverse Monoids Presented by One Idempotent Relator
Higher-Dimensional Word Problems with Applications to Equational Logic
Covers and Fans of Polynomial Ideals
System T, Call-by-Value and the Minimum Problem
On a conjecture concerning positive semi-definiteness
Existential Diophantine definability of string length
Computational Complexity of Functions
Adding symbolic information to picture models: definitions and properties
Competitive analysis of most-request-first for scheduling broadcasts with start-up delay
Algebraic tools for the concatenation product
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Three "quantum" algorithms to solve 3-SAT
Proofs as Processes
Finding a minimum source set in temporal graphs
Call-by-Name, Call-by-Value and the lambda-Calculus
A survey on the local divisor technique
Set multi-covering via inclusion-exclusion
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
Controlled reversibility in communicating reaction systems
On the broadcast domination number of permutation graphs
Repetitions in strings: Algorithms and combinatorics
Covering graphs with few complete bipartite subgraphs
Priority algorithms for graph optimization problems
Eliminating the storage tape in reachability constructions
No tiling of the 70 × 70 square with consecutive squares
Some results about the Markov chains associated to GPs and general EAs
Semantics of plan revision in intelligent agents
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas
Inapproximability results for equations over finite groups
Latticial Structures in Data Analysis
Bi-immunity over different size alphabets
Sturmian Words, Lyndon Words and Trees
Generalized Schröder permutations
From distribution to replication in cooperative systems with active membranes: A frontier of the efficiency
Monotone k -submodular secretary problems: Cardinality and knapsack constraints
Complexity and palindromic defect of infinite words
Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
Improved adaptive genetic algorithm for the vehicle Insurance Fraud Identification Model based on a BP Neural Network
A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
Identity-based encryption with equality test and datestamp-based authorization mechanism
Reeb graph based segmentation of articulated components of 3D digital objects
Parameter estimation for Boolean models of biological networks
Active symbols in grammars with valuations
Dynamic algorithms for shortest paths in planar graphs
An Arithmetical Characterization of NP
Comparing chemical reaction networks: A categorical and algorithmic perspective
An exact characterization of symmetric functions in qAC 0 [2]
Systolic tree omega-Languages: the operational and the logical view
Separating Classes in the Exponential-Time Hierarchy From Classes in PH
Minimal pairs for P
Computations with a deck of cards
A logical approach to stable domains
An NP decision procedure for protocol insecurity with XOR
Parameterizing cut sets in a graph by the number of their components
Derivatives of rational expressions and related theorems
Bayesian inference for differential equations
Defining syntax-directed translations by tree bimorphisms
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
Data abstractions for decision tree induction
Information Storage and Retrieval Systems: Mathematical Foundations
Contention-related crash failures: Definitions, agreement algorithms, and impossibility results
Approximate membership for regular languages modulo the edit distance
The Behavior-Realization Adjunction and Generalized Homomorphic Relations
QUBO formulations of the longest path problem
A coalgebraic approach to the semantics of the ambient calculus
Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
Structure of 3-Infix-Outfix Maximal Codes
Time-stamps for Mazurkiewicz traces
Normal forms of quasiperiodic strings
A representation theorem for Boolean contact algebras
Cop-robber guarding game with cycle robber-region
From reversible programming languages to reversible metalanguages
Reducing the ambiguity of Parikh matrices
Constructing partial words with subword complexities not achievable by full words
Nonterminal complexity of tree controlled grammars
Some Properties of Space-Bounded Synchronized Alternating Turin Machines with Universal States ONly
Effective simultaneous approximability of reals
A Simplified Design Strategy for Mapping Image Processing Algorithms on a SIMD Torus
Floyds Principle, Correctness Theories and Program Equivalence
Morphic characterizations with insertion systems controlled by a context of length one
Mellin Transforms and Asymptotics: Digital Sums
Evolving BlenX programs to simulate the evolution of biological networks
A certified, corecursive implementation of exact real numbers
Scanning integer matrices by means of two rectangular windows
A simple proof that the ( n 2 - 1)-puzzle is hard
Equivalence of conservative, free, linear program schemas is decidable
On fan-crossing graphs
A Counterexample to a Conjecture of Schnorr Referring to Monotone Networks
Improved fault-tolerant sorting algorithm in hypercubes
Harmonic is 3-Competitive for Two Servers
On Polynomial-Time Turing and Many-One Completeness in PSPACE
Cumulative defect
Combinatorics of perfect matchings in plane bipartite graphs and application to tilings
Speed scaling with a solar cell
The Smallest Automaton Recognizing the Subwords of a Text
Learning intersection-closed classes with signatures
Some results on tries with adaptive branching
Effective dimension of points visited by Brownian motion
Special issue in honor of the 70th birthday of Prof. Wojciech Rytter
Striking the balance: Optimizing pricing schemes for time-sensitive buyers
Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields
Counting bordered and primitive words with a fixed weight
Optimal 2-traceability codes of length 4
A Generalized Setting for Fixpoint Theory
Scheduling resource allocation with timeslot penalty for changeover
Authentication tests and the structure of bundles
Effectful applicative similarity for call-by-name lambda calculi
Comments on "On the Balance Property of Patricia Tries: External Path Length Viewpoint"
Hardness results for stable exchange problems
Parameterized and approximation algorithms for finding two disjoint matchings
Paired many-to-many disjoint path covers in restricted hypercube-like graphs
A Solution for the Coloured Cubes Problem
Declarative Modeling of the Operational Behavior of Logic Languages
A family of sand automata
Enumerative Sequences of Leaves and Nodes in Rational Trees
Analogy Calculus
Efficient computation of longest single-arm-gapped palindromes in a string
Limit Values of the Recurrence Quotient of Sturmian Sequences
Colored cut games
Approximate distance oracles with improved stretch for sparse graphs
On the final sequence of a finitary set functor
Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m
Injective synchronisation: An extension of the authentication hierarchy
Wide-Sense Nonblocking for Multirate 3-Stage Clos Networks
Weak repetitions in Sturmian strings
Realizing Boolean Functions on Disjoint sets of Variables
On One-One Polynomial Time Equivalence Relations
On Characterizations of the Class PSPACE/POLY
The CNN problem and other k-server variants
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Purchase preferences-based air passenger choice behavior analysis from sales transaction data
Residue polynomial systems
Algebraic graph rewriting with controlled embedding
Approximating the minimum weight weak vertex cover
Running time of the Treapsort algorithm
The Complexity of Partial Derivatives
Maximizing the minimum load: The cost of selfishness
Reducing the time complexity of testing for local threshold testability
The Exact Number of Squares in Fibonacci Words
Algebraic and Fixed Point Equations over Inverse Limits of Algebras
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
Complete Sets of Transformations for General E-Unification
A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systems
Model checking restricted sets of timed paths
Minimum-Energy Broadcast and disk cover in grid wireless networks
Maximal width learning of binary functions
Counting in one-hop beeping networks
A compiler for multi-key homomorphic signatures for Turing machines
Rule set design problems for oritatami systems
Compositional synthesis of asynchronous automata
Solving hard stable matching problems involving groups of similar agents
A reduction of security notions in designated confirmer signatures
Structured Theories and Institutions
Playing monotone games to understand learning behaviors
Distributed approximation algorithms for k -dominating set in graphs of bounded genus and linklessly embeddable graphs
Alpha equivalence equalities
Basic Notions of Universal Algebra for Language Theory and Graph Grammars
Giorgio Levi in Pisa
Threshold-based network structural dynamics
Unary patterns under permutations
Linear rank-width and linear clique-width of trees
Stochastically Costed Tree Automata: Turakainen's Theorem
A Kolmogorov complexity proof of the Lovász Local Lemma for satisfiability
Parallel machine scheduling with restricted job rejection
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
Precise quantitative information flow analysis - a symbolic approach
Complexity dichotomy on partial grid recognition
Undecidability of existential properties in picture languages
Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents
Equitable list tree-coloring of bounded treewidth graphs
Conditional complexity and codes
Join Sizes, urn Models and Normal Limiting Distributions
Observing Localities
Subset feedback vertex set on graphs of bounded independent set size
Deadlock and Fairness in Morphisms of Transition Systems
On-line bin-stretching
A Uniform Approach to Semi-Dynamic Problems on Digraphs
Scheduling Inverse Trees Under the Communication Model of the LogP-Machine
Characterization of omega-Regular Languages by First-Order Formulas
In Memoriam Ronald V. Book
A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
Towards a theory of data entanglement
Weighted finite automata over hemirings
Close to optimal decentralized routing in long-range contact networks
P != NP over the Nonstandard Reals Implies P != NP over R
Support preorder on finitely supported Cb -Sets
Metric spaces and FS-domains
A note on fuzzy derivations of some ideals on d -algebras
Verification, refinement and scheduling of real-time programs
Set of periods of additive cellular automata
Solving Systems of Explicit Language Relations
On the conjugacy class of the Fibonacci dynamical system
A new heuristic algorithm for the machine scheduling problem with job delivery coordination
beta-Expansions and Symbolic Dynamics
The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
Two edge-disjoint paths with length constraints
A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets
The complexity of bisimilarity-checking for one-counter processes
Higher-Order Rewrite Systems and Their Confluence
On the geometric red-blue set cover problem
Invertible classes
Formalization of the Standard Uniform random variable
Interference automata
Program equivalence in linear contexts
Two agent scheduling with a central selection mechanism
An algorithmic analysis of the Honey-Bee game
Less space: Indexing for queries with wildcards
Decision lists and related Boolean functions
Manipulative elicitation - A new attack on elections with incomplete preferences
The Exact Subset MultiCover problem
Complexity of perceptron recognition for a class of geometric patterns
Polynomial ideals for sandpiles and their Gröbner bases
Scattered Deletion and Commutativity
Asymptotically efficient in-place merging
A characterization of periodicity of bi-infinite words
The multiple facets of the canonical direct unit implicational basis
Tightly secure ring signatures in the standard model
The Shortest Common Nonsubsequence Problem is NP-Complete
Hierarchies for classes of priority algorithms for Job Scheduling
Decomposition of Linear Automata over Residue Rings Into Shift-Registers
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
True-concurrency probabilistic models: Markov nets and a law of large numbers
Two-way and one-way quantum and classical automata with advice for online minimization problems
Non-Repetitive Words Relative to a Rewriting System
Type inference for set theory
The word problem for 1LC congruences is NP-hard
Approximation algorithms for facility location and k-median with differential privacy
Algebraic (trapdoor) one-way functions: Constructions and applications
Toward a theory of intelligence
Generating bicliques of a graph in lexicographic order
Analysis of security protocols as open systems
Langages algébriques de mots biinfinis
Observational proofs by rewriting
Fast one-way cellular automata
Reductions in binary search trees
Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule
Special Issue on Theoretical Foundations of Evolutionary Computation
A 3/2 log 3-Competitive Algorithm for the Counterfeit Coin Problem
Suites équilibrées
Fixed-parameter algorithms for graph constraint logic
Highlights in infinitary rewriting and lambda calculus
Dichotomy results for fixed point counting in boolean dynamical systems
On-line approximate string matching with bounded errors
Information hiding in probabilistic concurrent systems
A Lambda-Calculus for Dynamic Binding
Descriptional complexity of unambiguous input-driven pushdown automata
N-player partizan games
On the sequential access theorem and deque conjecture for splay trees
Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
Multi-player subtraction games
Complexity of Computing Vapnik-Chervonenkis Dimension and Some Generalized Dimensions
Swapping labeled tokens on graphs
Space Bounded Computations: Review and New Separation Results
Right and left locally testable languages
Minimizing subsequential transducers: a survey
Fixed Points Without Completeness
Computationally universal P systems without priorities: two catalysts are sufficient
Structural Polymorphism
Remarks on an Example of Jantzen
Randomness of formal languages via automatic martingales
Pure Nash equilibria in player-specific and weighted congestion games
Optimal algorithms for inverse vertex obnoxious center location problems on graphs
Three-matching intersection conjecture for perfect matching polytopes of small dimensions
Monoid-matrix type automata
Equational Type Logic
On tiling under tomographic constraints
Seventeen lines and one-hundred-and-one points
A note on the paper "On Brlek-Reutenauer conjecture"
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Non-redundant random generation algorithms for weighted context-free grammars
A Safe Approach to Parallel Combinator Reduction
Labeled cuts in graphs
Verification of qualitative Z constraints
Traffic grooming on the path
Finding compact structural motifs
Faster deterministic parameterized algorithm for k -Path
The complexity of tree automata and XPath on grammar-compressed trees
Sequential decision based learning method for influence maximization
On automata recognizing birecurrent sets
Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
Implicit computation of maximum bipartite matchings by sublinear functional operations
Complexity dichotomy for oriented homomorphism of planar graphs with large girth
Generalised online colouring problems in overlap graphs
Relations between robustness and RKA security under public-key encryption
Relative interval analysis of paging algorithms on access graphs
An approach to intrinsic complexity of uniform learning
On an Effective Hierarchy of Communicating Processes: Separation Principle and Testing
Lower and upper competitive bounds for online directed graph exploration
Truthful optimization using mechanisms with verification
Binary Search Trees Constructed from Nondistinct Keys with/without Specified Probabilities
A calculus and logic of bunched resources and processes
Losing recognizability
Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005
Graph colorings
Cellular automata with limited inter-cell bandwidth
Communication complexity tools on recognizable picture languages
Une Extension du Theoreme de Winograd
Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
Computations by fly-automata beyond monadic second-order logic
Testing Satisfiability of a Class of Object-Oriented Conjunctive Queries
Testing for the Ground (Co-)Reducibility Property in Term-Rewriting Systems
Combinatorial auctions with verification are tractable
On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings. II. Optimal Algorithms for 2x2-Matrix Multiplication
On the uselessness of quantum queries
Periodicity and arithmetic-periodicity in hexadecimal games
Observational Specifications and the Indistinguishability Assumption
A coalgebraic view on positive modal logic
On the commutative equivalence of semi-linear sets of N k
A Lower Bound on Branching Programs Reading Some Bits Twice
On Test Sets for Checking Morphism Equivalence on Languages with Fair Distribution of Letters
The discrete strategy improvement algorithm for parity games and complexity measures for directed graphs
Minimum weight connectivity augmentation for planar straight-line graphs
Complex network dimension and path counts
Frameproof codes against limited coalitions of pirates
Solving dependency quantified Boolean formulas using quantifier localization
Distributed algorithms for partitioning a swarm of autonomous mobile robots
Analysis of particle interaction in particle swarm optimization
A Variant of Random Context Grammars: Semi-Conditional Grammars
Retreat Bounded Picture Languages
Game authority for robust and scalable distributed selfish-computer systems
Multistage online maxmin allocation of indivisible entities
Greedy routing via embedding graphs onto semi-metric spaces
On the complexity of redescription mining
Developments from enquiries into the learnability of the pattern languages from positive data
C-Tree Systolic Automata
Complexité d'algorithmes et opérations sur les arbres
Reaction systems and extremal combinatorics properties
On Categorical Graph Grammars Integrating Structural Transformations and Operations on Labels
Endgame problems of Sim-like graph Ramsey avoidance games are PSPACE-complete
Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
Weak algebraic information systems and a new equivalent category of DOM of domains
Simple dynamics on graphs
On the curve complexity of 3-colored point-set embeddings
The Ancestor Width of Grammars and Languages
Robust periodic solutions and evolution from seeds in one-dimensional edge cellular automata
Parallel communicating grammar systems with bounded resources
Probabilistic Recurrence Relations Revisited
A True Concurrency Model of CCS Semantics
Towards tightly secure short linearly homomorphic signatures
How fast can we play Tetris greedily with rectangular pieces?
Subsequence covers of words
An effective parameter tuned deep belief network for detecting anomalous behavior in sensor-based cyber-physical systems
The lattice structure of n-player games
A decidable theory involving addition of differentiable real functions
Computational complexity of counting coincidences
Embedding a θ -invariant code into a complete one
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
Treewidth and logical definability of graph products
Filters defined by random contexts versus polarization in networks of evolutionary processors
Shuffle and scattered deletion closure of languages
Cost-sharing scheduling games on restricted unrelated machines
Chemical mass-action systems as analog computers: Implementing arithmetic computations at specified speed
A tractability gap beyond nim-sums: It's hard to tell whether a bunch of superstars are losers
Deterministic Turing machines in the range between real-time and linear-time
Alberto Bertoni: A scientist and a friend
Copy complexity of Horn formulas with respect to unit read-once resolution
Closed Action Calculi
List homomorphisms to separable signed graphs
Graphs and Free Partially Commutative Monoids
Spiking neural P systems with rules on synapses
Super link-connectivity of iterated line digraphs
Canonical disjoint NP-pairs of propositional proof systems
Generalized discrete timed automata: decidable approximations for safety verificatio
The Complexity of Colouring Problems on Dense Graphs
Self-Reproduction in a Reversible Cellular Space
Recurrence in infinite partial words
On Tape-Bounded Probabilistic Turing Machine Acceptors
Topology matters: Smoothed competitiveness of metrical task systems
Conditional probability logic, lifted Bayesian networks, and almost sure quantifier elimination
The asymptotic distribution of elements in automatic sequences
A cost-effective estimation of uncaught exceptions in Standard ML programs
Telephone Broadcast on graphs of treewidth two
Complexity Results for Two-Way and Multi-Pebble Automata and their Logics
A simple P-complete problem and its language-theoretic representations
Computing degree and class degree
Complexity of node coverage games
The Solutions of Two Star-Height Problems for Regular Trees
Decidable Sentences of Church-Rosser Congruences
The Compexity of Counting Homeomorphs
Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs
Local and global price of anarchy of graphical games
k -Spine, 1-bend planarity
Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets
A comparison of three authentication properties
Fast Parallel and Serial Multidimensional Aproximate Array Matching