yusuke1997/dblp-id-title huggingface dataset:
Ambiguity in omega context free languages
Subcomputable Hausdorff function dimension
Improved NP-hardness results for the minimum t -spanner problem on bounded-degree graphs
On Standard Locally Catenative L Schemes
Automated pattern detection - An algorithm for constructing optimally synchronizing multi-regular language filters
Effectively approximating measurable sets by open sets
Maximizing agreements and coagnostic learning
Remark on the Star-Height-Problem
Note on R g -conditional diagnosability of hypercube
A fixed-parameter tractable approximation for capacitated k -supplier
Shuffle Product of Generating Series
Optimal Transmission Schedules for Lightwave Networks Embedded with De Bruijn Graphs
Minimum degree condition for proper connection number 2
Special issue on Structural Information and Communication Complexity
Reversal of binary regular languages
The inapproximability of non-NP-hard optimization problems
Improved approximation for two dimensional Strip Packing with polynomial bounded width
Executions: A New Partial-Order Semantics of Petri Nets
Complete formal systems for equivalence problems
Ergodic Languages
On Using Temporal Logic for Refinement and Compositional Verification of Concurrent Systems
A space efficient algorithm for the longest common subsequence in k-length substrings
Decision problems and projection languages for restricted variants of two-dimensional automata
Synchronization Expressions with Extended Join Operation
Double declined subnetwork reliability analysis in bubble-sort networks under node fault model
New bounds for randomized busing
A space improved algorithm for chromatic number
The transposition median problem is NP-complete
Investigations on the Dual Calculus
European tenure games
Provable secure identity based generalized signcryption scheme
(Strong) conflict-free connectivity: Algorithm and complexity
Adaptive pruning-based Newton's method for distributed learning
Top-down decision tree learning as information based boosting
The cyclic genetic code as a constraint satisfaction problem
Efficient all path score computations on grid graphs
Bitonic sorters of minimal depth
Winner-imposing strategyproof mechanisms for multiple Facility Location games
Counting subwords in circular words and their Parikh matrices
Context-Free Grammars, Differential Operators and Formal Power Series
Pattern avoidance: themes and variations
Revisiting Shinohara's algorithm for computing descriptive patterns
On the multiplicative complexity of Boolean functions over the basis (cap, +, 1)
The subsequence composition of a string
k-Center problems with minimum coverage
Unification in Commutative Idempotent Monoids
A new dichotomic algorithm for the uniform random generation of words in regular languages
The complexity of counting quantifiers on equality languages
Recognizing binary shuffle squares is NP-hard
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling
CSL model checking algorithms for QBDs
Synthesis for continuous time
Computing sum of squares decompositions with rational coefficients
Improvements in the computing efficiency of the probabilities of the LIL test for the PRNG evaluation
Relating g-good-neighbor connectivity and g-good-neighbor diagnosability of strong digraph network
Near optimal algorithms for online maximum edge-weighted b-matching and two-sided vertex-weighted b-matching
Reachability in Cyclic Extended Free-Choice Systems
Call admission problems on trees
Pattern-avoiding inversion sequences and open partition diagrams
On Christoffel and standard words and their derivatives
When-and how-can a cellular automaton be rewritten as a lattice gas?
Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth
Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
Simple equations on binary factorial languages
Complexity of pairwise shortest path routing in the grid
A Generalization of Owicki-Gries's Hoare Logic for a Concurrent while Language
Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive
Behavioural and abstractor specifications revisited
Lifting results for categories of algebras
Guarded fixed point logics and the monadic theory of countable trees
DNA combinatorial messages and Epigenomics: The case of chromatin organization and nucleosome occupancy in eukaryotic genomes
The surviving rate of an infected network
Algorithmic complexity of weakly semiregular partitioning and the representation number
Polynomial-time algorithms for submodular Laplacian systems
Abstract Specification of Structures and Methods in Symbolic Mathematical Computation
Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
The pros and cons of flocking in the long-range "migration" of mobile robot swarms
Geographic routing on Virtual Raw Anchor Coordinate systems
Limit cycle structure for dynamic bi-threshold systems
On second-order iterative monads
On the runtime and robustness of randomized broadcasting
Deterministic rendezvous in infinite trees
A new algorithm for aligning nested arc-annotated sequences under arbitrary weight schemes
Terminating left-hand sides of scattered context productions M. Nivat
The Thue-Morse word contains circular 5/2+ power free words of every length
Randomized approximation algorithms for planar visibility counting problem
The 3-server problem in the plane
Tseitin's Formula Revisited
Approximating the smallest 2-vertex connected spanning subgraph of a directed graph
Theoretical foundations for parent divorcing transformations in Bayesian networks
Denotational Completeness Revisited
Partitioned probe comparability graphs
On the remote server problem or more about TCP acknowledgments
On the VC-Dimension of Depth four Threshold Circuits and the Complexity of Boolean-Valued Functions
Edge open packing: Complexity, algorithmic aspects, and bounds
Analyzing randomized search heuristics via stochastic domination
LA, permutations, and the Hajós Calculus
Games characterizing Levy-Longo trees
Self-improved gaps almost everywhere for the agnostic approximation of monomials
Influence of tree topology restrictions on the complexity of haplotyping with missing data
Clustering through Continuous Facility Location Problems
More on the Complexity of Slice Functions
On Conservative Extensions of Syntax in System Development
Using Induction and Rewriting to Verify and Complete Parameterized Specifications
Multiple Returns Under a Bounded Number of Iterations
Total Objects of Domains
Computing subset vertex covers in H-free graphs
Approximating k -spanner problems for k ge2
BABEL 2001 - Preface
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
Quantum counterfeit coin problems
Approximation algorithms for orienting mixed graphs
A Characterization of the Squares in a Fibonacci String
On the complexity of sampling query feedback restricted database repair of functional dependency violations
The prime number theorem is PRA-provable
On weighted balls-into-bins games
Logical Foundation Approach to Users' Domain Restriction in Data Bases
Universality of a Reversible Two-Counter Machine
Words and forbidden factors
Strong Time Bounds: Non-Computable Bounds and a Hierarchy Theorem
Geography, Kotzig's Nim, and variants
On finding convex cuts in general, bipartite and plane graphs
On the unique shortest lattice vector problem
Temporal BI: Proof system, semantics and translations
Algebraic Feedback Shift Registers
A lower bound on CNF encodings of the at-most-one constraint
Constructive Mathematics: A Foundation for Computable Analysis
On the computational complexity of behavioral description-based web service composition
One application of real-valued interpretation of formal power series
Avoiding coding tricks by hyperrobust learning
Algorithms and complexity for geodetic sets on partial grids
Term rewriting restricted to ground terms
Accelerating certain outputs of merging and sorting networks
Dynamical behavior of additive cellular automata over finite abelian groups
A Homomorphic Characterization of Recursively Enumerable Languages
Using edge contractions to reduce the semitotal domination number
Note on Free Algebras Over Continuous Domains
Recursion and topology on 2<=omega for possibly infinite computations
Alternating and empty alternating auxiliary stack automata
Linear and sublinear time algorithms for the basis of abelian groups
Combinatory Abstraction Bsing B, B' and Friends
Attribute-based optimistic fair exchange: How to restrict brokers with policies
Adaptively code-correlation robustness functions and its applications to private set intersection
On p-Creative Sets and p-Completely Creative Sets
Unique existence, approximate solutions, and countable choice
An efficient algorithm for online square detection
New Protocols for the Election of a Leader in a Ring
On the exact complexity of polyomino packing
Characterizing right inverses for spatial constraint systems with applications to modal logic
Computing the center region and its variants
Multi-engine Horn Clause Prolog
Lightweight merging of compressed indices based on BWT variants
List of R. V. Books's Publications
Proof nets, garbage, and computations
Binary words with a given Diophantine exponent
Cell complexes, oriented matroids and digital geometry
On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
Linear-time computation of local periods
Unbiasedness of estimation-of-distribution algorithms
Connectivity of discrete planes
Algebraic Specification of Documents
On the tree search problem with non-uniform costs
Finite state complexity
Quasipolynomial size proofs of the propositional pigeonhole principle
Strategic attack on the shrinking generator
On the Subword Complexity of Square-Free D0L Languages
On a Question About Factorization Forests
An effective two-level proof-number search algorithm
Cartesian logic
Systolic Convolution of Arithmetic Functions
PSPACE-completeness of two graph coloring games
Inductive star-semirings
On alpha-0-Products and alpha-2-Products
LTL to self-loop alternating automata with generic acceptance and back
Dynamic threshold spiking neural P systems with weights and multiple channels
A new approach to the periodicity lemma on strings with holes
Probabilistic Analysis of Bucket Recursive Trees
Planarity of streamed graphs
A regularization approach for estimating the type of a plane curve singularity
A generalized topological view of motion in discrete space
A note on ambiguity of internal contextual grammars
The Simple Dynamics of Super Turing Theories
Parameterized complexity of multicut in weighted trees
Counting modulo finite semigroups
A hybrid modified PSO algorithm for the inverse p-median location problem in fuzzy random environment
Fixed-parameter tractability for subset feedback set problems with parity constraints
Computational Interpretations of Linear Logic
Visualizing co-phylogenetic reconciliations
Towards bridging two cell-inspired models: P systems and R systems
A Specification-Oriented Semantics for the Refinement of Real-Time Systems
Characterizing Finite Kripke Structures in Propositional Temporal Logic
Order-preserving matching
Unions of non-disjoint theories and combinations of satisfiability procedures
Recursive quasi-metric spaces
Multiplicative Complexity of some Rational Functions
Bound-decreasing duplication system
Sleptsov nets are Turing-complete
Seven-State Solutions to the Firing Squad Synchronization Problem
Termination and Completion Modulo Associativity, Commutativity and Identity
On the hardness of labeled correlation clustering problem: A parameterized complexity view
The monadic second-order logic of graphs XIII: Graph drawings with edge crossings
Exponential slowdown for larger populations: The ( μ + 1)-EA on monotone functions
On Sillke's bijection
Fixed point guided abstraction refinement for alternating automata
Linear-time algorithm for sliding tokens on trees
Finding and enumerating large intersections
Some Fundamental Algebraic Tools for the Semantics of Computation. Part II: Signed and Abstract Theories
Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms
Stand-up indulgent gathering on lines
Robust digital signature revisited
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
PAC learning with nasty noise
Dealing with several parameterized problems by random methods
A calculus of branching processes
The Complexity of Computing Symmetric Functions Using Threshold Circuits
On minimal critical exponent of balanced sequences
Stackelberg packing games
Cops and robbers on oriented toroidal grids
Public-key cryptography based on bounded quantum reference frames
Towards a behavioural theory of access and mobility control in distributed systems
A PSPACE-complete Fragment of Second-order Linear Logic
Data collection in population protocols with non-uniformly random scheduler
Simple and subdirectly irreducible finitely supported Cb-sets
Reliability analysis of the generalized balanced hypercube
Structural parameters for scheduling with assignment restrictions
Restrained domination and its variants in extended supergrid graphs
On the complexity of kings
The l-Diversity problem: Tractability and approximability
Parameterized complexity of MaxSat Above Average
Reconfiguration of list L(2,1)-labelings in a graph
From Static to Dynamic Abstract Data-Types: An Institution Transformation
Excuse me! or the courteous theatregoers' problem
Maximal traces and path-based coalgebraic temporal logics
HiperTM: High performance, fault-tolerant transactional memory
Weighted automata and multi-valued logics over arbitrary bounded lattices
Capacity planning for dependable services
Specification, testing and implementation relations for symbolic-probabilistic systems
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Computing feasible toolpaths for 5-axis machines
A complete characterization of deterministic regular liveness properties
Global dynamics for non-autonomous reaction-diffusion neural networks with time-varying delays
Broadcastings and digit tilings on three-dimensional torus networks
Discrete Decision Theory: Manipulations
On the lengths of symmetry breaking-preserving games on graphs
A quadratic algorithm for the 2-cyclic robotic scheduling problem
Safe and stabilizing distributed multi-path cellular flows
Approximability of covering cells with line segments
Space efficient algorithm for solving reachability using tree decomposition and separators
Sur la distribution des anti-excédances dans le groupe symétrique et dans ses sous-groupes
Analysis of speedups in parallel evolutionary algorithms and (1+λ) EAs for combinatorial optimization
Confluence Results for the Pure Strong Categorical Logic CCL: lambda-Calculi as Subsystems of CCL
Partial algebras and complexity of satisfiability and universal theory for distributive lattices, boolean algebras and Heyting algebras
An inductive construction of minimally rigid body-hinge simple graphs
Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs
Sparse certificates for 2-connectivity in directed graphs
DNA computing based on splicing: universality results
Advances in Computational Methods in Systems Biology
On isoperimetrically optimal polyforms
The complete inclusion structure of leaf power classes
Random generation of DFAs
Learning how to separate
Popular and clan-popular b-matchings
The longest cycle problem is polynomial on interval graphs
On the limits of cache-oblivious rational permutations
Sur les Monoides À un Relateur qui sont des Groupes
Computations with quasiseparable polynomials and matrices
Equational Programming in Lambda-Calculus via SL-Systems. Part 1
On Another Boolean Matrix
Reducing rank of the adjacency matrix by graph modification
Analyzing different variants of immune inspired somatic contiguous hypermutations
More on the dynamics of the symbolic square root map
On deterministic ordered restart-delete automata
Tight bounds on ℓ 1 approximation and learning of self-bounding functions
On (simple) decision tree rank
Program schemes, arrays, Lindström quantifiers and zero-one laws
Improvements on Khrapchenko's theorem
Constructing independent spanning trees for locally twisted cubes
Hamiltonian cycles of balanced hypercube with more faulty edges
On the physical implementation of logical transformations: Generalized L-machines
A Kind of Logical Compilation for Knowledge Bases
Longest increasing subsequences in windows based on canonical antichain partition
Mathematical models to analyze Lua hybrid tables
A Process Algebraic View of Linda Coordination Primitives
NP-hardness of m -dimensional weighted matching problems
Limit behaviour of μ-equicontinuous cellular automata
Chosen-ciphertext secure anonymous conditional proxy re-encryption with keyword search
Sorting and selection on dynamic data
A deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
Restricted Relativizations of Probablistic Polynomial Time
Type-theoretic approaches to ordinals
Masking patterns in sequences: A new class of motif discovery with don't cares
Relations Among Mod-Classes
State complexity of union and intersection of square and reversal on k regular languages
Towards the animation of proofs - testing proofs by examples
The efficiency of primitive recursive functions: A programmer's view
Energy-optimal broadcast and exploration in a tree using mobile agents
A Type-Theoretical Alternative to ISWIM, CUCH, OWHY
Monge properties of sequence alignment
An exact algorithm for the Maximum Leaf Spanning Tree problem
Bond percolation in small-world graphs with power-law distribution
Regularity of Sets of Initial Strings of Periodic D0L-Systems
A rewriting logic framework for operational semantics of membrane systems
In Memoriam Attila Kuba (1953-2006)
Counting the Number of Solutions for Instances of Satisfiability
On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs
The Difference Between one Tape and two Tapes: with Respect to Reversal Complexity
Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking
A Pascal-like bound for the number of necklaces with fixed density
von Neumann entropy and quantum algorithmic randomness
On computing the diameter of real-world undirected graphs
Fine Covers of a VAS Language
Algorithmic Graph Embeddings
Finding large degree-anonymous subgraphs is hard
Binary sequences with optimal autocorrelation
Real or natural number interpretation and their effect on complexity
Toward an Abstract Theory of Data Compression
The Linear Abstract Machine
Max-min greedy matching problem: Hardness for the adversary and fractional variant
State complexity of inversion operations
A note on information systems for continuous semi-lattices
Simple and local independent set approximation
Periodic scheduling of marked graphs using balanced binary words
A linear time and space algorithm for detecting path intersection in Z d
Formalization and correctness of the PALS architectural pattern for distributed real-time systems
Coherence Spaces are Untopological
Simple strategies versus optimal schedules in multi-agent patrolling
Accelerating Boyer-Moore searches on binary texts
Non-regular iterators in process algebra
Automata-driven efficient subterm unification
Syntactic view of sigma-tau generation of permutations
Inverse eigenproblem for centrosymmetric and centroskew matrices and their approximation
Reliability analysis of the quinary n-cube networks with non-lexicographic order optimal solution of the edge isoperimetric problem
Bisimilarity as a Theory of Functional Programming
Complexity of Some Problems in Petri Nets
A strategy for searching with different access costs
A simple certifying algorithm for 3-edge-connectivity
Extracting string motif bases for quorum higher than two
A simpler analysis of Burrows-Wheeler-based compression
Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality
Approximating the Maximum Internal Spanning Tree problem
Universal product learning with errors: A new variant of LWE for lattice-based cryptography
Extracting constrained 2-interval subsets in 2-interval sets
Minimizing total completion time for re-entrant flow shop scheduling problems
Two-level languages for program optimization
Theoretical advances in artificial immune systems
Non-cooperative facility location and covering games
You can't solve these Super Mario Bros. levels: Undecidable Mario games
The complexity of equilibria for risk-modeling valuations
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds
A class of polynomially solvable range constraints for interval analysis without widenings
The extra connectivity, extra conditional diagnosability and t / k -diagnosability of the data center network DCell
Weighted 2-sections and hypergraph reconstruction
A Dual Problem to Least Fixed Points
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Test Sets for Finite Substitutions
Computing optimal contracts in combinatorial agencies
A (2 + ϵ ) k -vertex kernel for the dual coloring problem
Algorithm to find a maximum 2-packing set in a cactus
Some characterizations of finite Sturmian words
A Symbolic Reachability Graph for Coloured Petri Nets
Approximation algorithms for the p -hub center routing problem in parameterized metric graphs
Online facility assignment
Non-Uniform Partial-Match File Designs
On generalized Horn formulas and k-resolution
Local-entity resolution for building location-based social networks by using stay points
Codes and maximal monoids
The Structure of Generalized Complexity Cores
On some matching problems under the color-spanning model
C-Expressions: A Variable-Free Calculus for Equational Logic Programming
Control languages accepted by labeled spiking neural P systems with rules on synapses
More agents may decrease global work: A case in butterfly decontamination
Better guarantees for k -median with service installation costs
Counting maximal-exponent factors in words
On symmetric higher-dimensional automata and bisimilarity
Computing a metric basis of a 2-connected bipartite distance-hereditary graph
Interaction Nets and Term-Rewriting Systems
Machine Characterization of (E0L-E0L) Array Languages
An Improved Scheme for Set Equality Testing and Updating
On Tape Bounds for Single Letter Alphabet Language Processing
Any monotone property of 3-uniform hypergraphs is weakly evasive
Popular matchings with variable item copies
Obtaining split graphs by edge contraction
Theoretical Aspects of Computing (ICTAC 2011)
On the complexity of fair coin flipping
Space-efficient graph coarsening with applications to succinct planar encodings
Towards tight bounds on theta-graphs: More is not always better
If not Empty, NP - P is Topologically Large
On dispersable book embeddings
sigma-Game, sigma+-Game, and Two-Dimensional Additive Cellular Automata
Gathering problems for autonomous mobile robots with lights
A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles
Subroutines in P systems and closure properties of their complexity classes
Algorand: A secure and efficient distributed ledger
Checked corecursive streams: Expressivity and completeness
Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism
Emerging behavior as binary search trees are symmetrically updated
On the size of Boyer-Moore automata
Computing the hull and interval numbers in the weakly toll convexity
Speeding up Subtree Replacement Systems
Preface to the special issue dedicated to combinatorics, automata and number theory
Autonomous programmable DNA nanorobotic devices using DNAzymes
Innocent game models of untyped lambda-calculus
Towards an Algorithmic Theory of Adaptation
A Petri net view of covalent bonds