yusuke1997/dblp-id-title huggingface dataset:
Elimination of quantifiers and undecidability in spatial logics for concurrency
The complexity of the unit stop number problem and its implications to other related problems
An NC Algorithm for Brooks' Theorem
Preserving differential privacy under finite-precision semantics
Arithmetics in number systems with a negative base
New LP relaxations for Minimum Cycle/Path/Tree Cover Problems
An abstract model for proving safety of autonomous urban traffic
Design and analysis of different alternating variable searches for search-based software testing
Adaptive packet scheduling over a wireless channel under constrained jamming
Functional equivalence and a cover relation for reaction systems
The connected p -center problem on cactus graphs
Nonmodal Classical Linear Predicate Logic is a Fragment of Intuitionistic Linear Logic
The online knapsack problem: Advice and randomization
Incremental algorithms for Facility Location and k -Median
On the k -partition dimension of graphs
Pattern Spectra, Substring Enumeration, and Automatic Sequences
Dialectica principles via Gödel doctrines
Phase semantics and decidability of elementary affine logic
Long lived transients in gene regulation
Latency-optimal communication in wireless mesh networks
On the containment and equivalence problems for two-way transducers
Monotonically controlling right linear grammars with unknown behaviors to output a target string
On the joint subword complexity of automatic sequences
On the orbit of closure-involution operations - The case of formal languages
Two semi-online scheduling problems on two uniform machines
Enhancing unsatisfiable cores for LTL with information on temporal relevance
Minimal Automaton for a Factorial, Transitive and Rational Language
k-Arbiter: A Safe and General Scheme for h-out of-k Mutual Exclusion
Alternative Semantics for Temporal Logics
Dividing connected chores fairly
Conjugacy relations of prefix codes
Parametrized semantics of logic programs--a unifying framework
On efficiency of notations for natural numbers
On the Disjunctive Set Problem
Backbone colouring: Tree backbones with small diameter in planar graphs
Weak linearization of the lambda calculus
Using Theory Interpretation to Mechanise the Reals in a Theorem Prover
Equality sets of binary D0L sequences
A String-Matching Interpretation of the Equation xmyn = zp
Multiset random context grammars, checkers, and transducers
Maximum star deleted from Ramsey graphs of book and tree
A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
Notes on acyclic orientations and the shelling lemma
Improved Shortest Path Algorithms for Nearly Acyclic Graphs
Ancilla-driven quantum computation with twisted graph states
Constructions of rotation symmetric Boolean functions satisfying almost all cryptographic criteria
An algebraic model of observable properties in distributed systems
A Note on omega-Regular Languages
Vertex disjoint paths on clique-width bounded graphs
Accelerate the classification statistics in RFID systems
Parameterized complexity of the list coloring reconfiguration problem with graph parameters
Concurrent Systems and Inevitability
Bigraphs with sharing
Finding Cheeger cuts in hypergraphs via heat equation
Two Time-Space Tradeoffs for Element Distinctness
Associative language descriptions
The 4-component connectivity of alternating group networks
The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete
Efficient Simplicity Testing of Automata
Dynamic algorithms for monotonic interval scheduling problem
A new similarity in clustering through users' interest and social relationship
A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
Calcul de Longueurs de Chaînes de Réécriture dans le Monoïde Libre
Decidability of Reachability for Disjoint Union of Term Rewriting Systems
Entangling and disentangling in Grover's search algorithm
Sorting permutations with transpositions in O ( n 3 ) amortized time
Language equations with complementation: Expressive power
Probabilistic anonymity via coalgebraic simulations
Sturmian words and a criterium by Michaux-Villemaire
Compressed data structures: Dictionaries and data-aware measures
L(2, 1)-Labelings on the composition of n graphs
On the expressive power of movement and restriction in pure mobile ambients
Quantum algorithms for finding constant-sized sub-hypergraphs
A new regular grammar pattern matching algorithm
Finite-state transducer cascades to extract named entities in texts
Information-Theoretic Characterizations of Recursive Infinite Strings
Trainyard is NP-Hard
Mathematics based on incremental learning - Excluded middle and inductive inference
On the rate of decrease in logical depth
Immunity and pseudorandomness of context-free languages
Spiking neural P systems with weights and delays on synapses
Euclidean division by d in base b
Outfix-guided insertion
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
Simple random sampling of binary forests with fixed number of nodes and trees
Gathering asynchronous oblivious mobile robots in a ring
Asynchronous deterministic rendezvous in bounded terrains
Systemes de Numeration et Fonctions Fractales Relatifs aux Substitutions
Coreness of cooperative games with truncated submodular profit functions
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
Abstract flows over time: A first step towards solving dynamic packing problems
Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
Codes and sofic constraints
Measuring the confinement of probabilistic systems
Model checking open systems with alternating projection temporal logic
Theoretical approximation ratios for Warm-Started QAOA on 3-regular max-cut instances at depth p = 1
Relating the extra connectivity and the conditional diagnosability of regular graphs under the comparison model
Brzozowski Hierarchy of omega-Languages
Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
Nonholonomic Systems: Controllability and Complexity
Wait-Free Implementations in Message-Passing Systems
On Simulating Non-Returning PC Grammar Systems with Returning Systems
On the Algebraic Structure of Combinatorial Problems
One-Step Recurrent Terms in lambda-beta-Calculus
Masking traveling beams: Optical solutions for NP-complete problems, trading space for time
An algorithm to construct independent spanning trees on parity cubes
Polynomial-delay enumeration algorithms in set systems
Restricted connectivity and good-neighbor diagnosability of split-star networks
State complexity of permutation on finite languages over a binary alphabet
Drawing graphs with right angle crossings
Finitely ambiguous and finitely sequential weighted automata over fields
Rational subsets of partially reversible monoids
Threes!, Fives, 1024!, and 2048 are hard
A2CCKS: Atomic Actions for CCS
On the complexity of interval scheduling with a resource constraint
The complexity of Free-Flood-It on 2×n boards
Recursion Theory on the Reals and Continuous-Time Computation
On the Relations between Stable and Well-Founded Semantics of Logic Programs
State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis
Searching Subsequences
Pict correctness revisited
The ring of k-regular sequences, II
Temporal stratification tests for linear and branching-time deductive databases
The derivational complexity of string rewriting systems
Reducing behavioural to structural properties of programs with procedures
Functions Computed by Monotone Boolean Formulas with no Repeated Variables
An introduction to metric semantics: operational and denotational models for programming and specification languages
Heuristic algorithms for Hadamard matrices with two circulant cores
The biased, distance-restricted n-in-a-row game for small p
Behavioural specification for hierarchical object composition
A formal system of reduction paths for parallel reduction
The price of anarchy of affine congestion games with similar strategies
Strict coherence of conditional rewriting modulo axioms
Groups and tilings
On synchronization and orientation in distributed barrier coverage with relocatable sensors
On network formation games with heterogeneous players and basic network creation games
Positive expansiveness versus network dimension in symbolic dynamical systems
Belief propagation for the maximum-weight independent set and minimum spanning tree problems
Group sweep coverage with guaranteed approximation ratio
Two undecidable variants of Collatz's problems
Boolean nested canalizing functions: A comprehensive analysis
Finite Complete Rewriting Systems for the Jantzen Monoid and the Greendlinger Group
The Church-Rosser Property for Ground Term-Rewriting Systems is Decidable
Complexity Analysis of Term-Rewriting Systems
A new study on clustering of adaptive asymmetric graph regularized semi-nonnegative matrix factorization under orthogonal subspace with auxiliary variable
On structural parameterizations of firefighting
A new lower bound for the on-line coloring of intervals with bandwidth
A quotient-universal digital topology
Tiara: A self-stabilizing deterministic skip list and skip graph
Introducing time in reaction systems
Covering orthogonal polygons with sliding k -transmitters
Interpolation in logics with constructors
Four one-shot learners for regular tree languages and their polynomial characterizability
Solving the N-Queens problem using dP systems with active membranes
Lattice paths and the Prouhet-Thue-Morse sequence
An efficient two-stage diagnostic algorithm for assessing system reliability
Counting suffix arrays and strings
On execution spaces of PV-programs
Matching cut and variants on bipartite graphs of bounded radius and diameter
Determining whether a given cryptographic function is a permutation of another given cryptographic function - A problem in intellectual property
Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms
Calibration scheduling with time slot cost
Partial gathering of mobile agents in dynamic rings
Efficient algorithms for network localization using cores of underlying graphs
Complexity of computing the anti-Ramsey numbers for paths
Convergence analysis of the OJAn MCA learning algorithm by the deterministic discrete time method
Approximate string matching with address bit errors
Self-stabilizing local k-placement of replicas with local minimum variance
The proof complexity of analytic and clausal tableaux
Structure fault tolerance of WK-recursive networks
Nonuniform Complexity and the Randomness of Certain Complete Languages
Fixed points of the RSA encryption algorithm
Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
The chilean highway problem
Complexity of single-swap heuristics for metric facility location and related problems
Definability by Programs in First-Order Structures
Visual cryptography schemes with optimal pixel expansion
A constructive theory of point-set nearness
Quasi-interpretations a way to control resources
On the geometry and algebra of networks with state
Star-free languages are Church-Rosser congruential
Maximizing the minimum load for selfish agents
Non-confluence in divisionless P systems with active membranes
Maximal closed set and half-space separations in finite closure systems
Normal forms for binary relations
Gap theorems for robust satisfiability: Boolean CSPs and beyond
An algorithm for the secure total domination problem in proper interval graphs
Optimal state reductions of automata with partially specified behaviors
Deciding determinism of caterpillar expressions
Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
Single-machine batch scheduling with job processing time compatibility
Online scheduling on two uniform machines to minimize the makespan
Queries revisited
The Functional Dimension of Inductive Definitions
Know when to persist: Deriving value from a stream buffer
Approximating directed weighted-degree constrained networks
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority
Computability and the morphological complexity of some dynamics on continuous domains
Remarks on context-free grammars with subregular control languages
On the exploration of time-varying networks
Revisiting orthogonal lattice attacks on approximate common divisor problems
Order compression schemes
Probabilistic analysis of upper bounds for 2-connected distance k-dominating sets in graphs
Synthesis, Structure and Power of Systolic Computations
An iteration method for computing the total number of spanning trees and its applications in graph theory
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
On the Intersection of Stacks and Queues
GPGCD: An iterative method for calculating approximate GCD of univariate polynomials
Finding the Intersection of n Half-Spaces in Time O(n log n)
Fast recognition of doubled graphs
On the Stability of some Biological Schemes with Cellular Interactions
The number of binary words avoiding abelian fourth powers grows exponentially
On the differential approximation of MIN SET COVER
Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model
A novel fault diagnostic algorithm with multiple characteristics for multiprocessor systems
Tail Recursion Through Universal Invariants
A simple transitive signature scheme for directed trees
Pairwise edge disjoint shortest paths in the n-cube
The Bounded-Complete Hull of an Alpha-Space
Parameterized tractability of the maximum-duo preservation string mapping problem
Parallel Computation of Polynomial GCD and Some Related Parallel Computations over Abstract Fields
Coupled Map Lattices Dynamics on a Variable Space for the Study of Development: A General Discussion on Caenorhabditis Elegans
Separation numbers of trees
Characterizations of recognizable picture series
Which is the fairest allocation in the max-min fairness-based coalitional game?
Gentzen-Type Axiomatization for PAL
I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
Semantic models of a timed distributed dataspace architecture
On perfectly secure 2PC in the OT-hybrid model
Fragile complexity of adaptive algorithms
The size of subsequence automaton
Classifying RNA pseudoknotted structures
A List-Oriented Extension of the lambda-Calculus Satisfying the Church-Rosser Theorem
Language Learning Without Overgeneralization
A randomised approximation algorithm for the hitting set problem
Experiments with deterministic omega -automata for formulas of linear temporal logic
Centralised connectivity-preserving transformations for programmable matter: A minimal seed approach
Operational and Denotational Semantics for the Box Algebra
Asynchronous homogenous spiking neural P systems with local rule synchronization
On the Bound of the Synchronization Delay of a Local Automaton
Reversibility in the higher-order π-calculus
Proof theory for locally finite many-valued logics: Semi-projective logics
Lie Patterns in Search Procedures
Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity
Topology of Strings: Median String is NP-Complete
Proportional cost buyback problem with weight bounds
Complexity of independent set reconfigurability problems
Approximations for the Steiner Multicycle problem
k -Valued non-associative Lambek grammars are learnable from generalized functor-argument structures
Planar Stage Graphs: Characterizations and Applications
Linear-time version of Holub's algorithm for morphic imprimitivity testing
A Sound and Complete Semantics for a Version of Negation as Failure
Constructive Domain Theory as a Branch of Intuitionistic Pointfree Topology
An Algebra of Mixed Computation
Space-efficient path-reporting approximate distance oracles
Algorithmic complexity of proper labeling problems
On decidability and expressive power of fusion grammars
Arity hierarchy for temporal logics
Theory of genetic algorithms
Prior-free multi-unit auctions with ordered bidders
Liminf Convergence in Omega-Categories
On the complexity of solution extension of optimization problems
Parameterized algorithms for feedback set problems and their duals in tournaments
A Lower Bound for the Length of Addition Chains
Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis
Robustness of stochastic bandit policies
Parameterized maximum path coloring
A new approach to practical function-private inner product encryption
Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem
Consistency of multidimensional combinatorial substitutions
Process versus Unfolding Semantics for Place/Transition Petri Nets
Sparse approaches for the exact distribution of patterns in long state sequences generated by a Markov source
Finite graph automata for linear and boundary graph languages
An undecidability result for AGh
Accurate data aggregation created by neural network and data classification processed through machine learning in wireless sensor networks
Robust random number generation for peer-to-peer systems
Linear circuits, two-variable logic and weakly blocked monoids
The number of short cycles in Fibonacci cubes
Paired 2-disjoint path covers of faulty k-ary n-cubes
Approximating the shortest path problem with scenarios
No NP Problems Averaging Over Ranking of Distributions are Harder
Linear constructions for DNA codes
Space-efficient bimachine construction based on the equalizer accumulation principle
Intersection types for lambda-trees
Detection of common subtrees with identical label distribution
Behavioural Theories and the Proof of Behavioural Properties
Timed recursive state machines: Expressiveness and complexity
Kolmogorov Characterizations of Complexity Classes
A framework for co-optimization algorithm performance and its application to worst-case optimization
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
Total coloring of recursive maximal planar graphs
Modifying Edges of a Network to Obtain Short Subgraphs
When is a Monoid a Group? The Church-Rosser Case is Tractable
From Nerode's congruence to suffix automata with mismatches
Simultaneous consecutive ones submatrix and editing problems: Classical complexity and fixed-parameter tractable results
Parameterizing path partitions
Sketches and Parametrization
The connected metric dimension at a vertex of a graph
Computability and Decidability Issues in the Theory of Consistency Enforcement
Extended color visual cryptography for black and white secret image
On the spanning connectivity and spanning laceability of hypercube-like networks
Canonical extensions and canonicity via dcpo presentations
Alternating weighted automata over commutative semirings
On timeline-based games and their complexity
Generalized cryptanalysis of small CRT-exponent RSA
Anonymous protocols: Notions and equivalence
Fast set intersection and two-patterns matching
Semi-online machine covering for two uniform machines
Dynamic threshold P systems with delay on synapses for shortest path problems
Kolmogorov-Loveland betting strategies lose the Betting game on open sets
Partitioning graphs into connected parts
(Nearly-)tight bounds on the contiguity and linearity of cographs
Computing conforming partitions of orthogonal polygons with minimum stabbing number
Unraveling simplicity in elementary cellular automata
Rules + strategies for transforming lazy functional logic programs
Why Does Information-Based Complexity Use the Real Number Model?
Drawing graphs with k vertices per face: Complexity and algorithms
On finding optimal polytrees
Finite maximal solid codes
Synthesizing ranking functions for loop programs via SVM
Recent Advances in Computer Games
Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds
On rainbow-free colourings of uniform hypergraphs
Efficient sampling of non-strict turnstile data streams
Confluency and strong normalizability of call-by-value lambda-µ-calculus
Compressed string-matching in standard Sturmian words
The state complexity of random DFAs
Reliability measures in relation to the h-extra edge-connectivity of folded hypercubes
Cyclic diagnosability of folded hypercubes under the PMC model and MM* model
Branching cells for asymmetric event structures
Separating k-Separated eNCE Graph Languages
The Complexity of Monadic Recursion Schemes: Executability Problems, Nesting Depth, and Applications
A large population size can be unhelpful in evolutionary algorithms
Practical Proofs of Knowledge without Relying on Theoretical Proofs of Membership on Languages
Generalised Nyldon words
Partial key exposure attacks on Prime Power RSA with non-consecutive blocks
The traveling tournament problem: Improved algorithms based on cycle packing
A Discrimination Algorithm Inside lambda-beta-Calculus
A Category-Theoretic Characterization of Functional Completeness
Gaining degrees of freedom in subsymbolic learning
Recognizing geometric intersection graphs stabbed by a line
Transformations of CLP Modules
A tractable NP-completeness proof for the two-coloring without monochromatic cycles of fixed length
Longest increasing subsequences in sliding windows
Truthful mechanisms for two-range-values variant of unrelated scheduling
The Complexity of the Parity Function in Unbounded Fan-In, Unbounded Depth Circuits
A uniform family of tissue P systems with cell division solving 3-COL in a linear time
On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space
A Solution of the Sperner-Erdös Problem
The convergence classes of Collatz function
Computable formal contexts
Tree shuffle
On Distributed Catenation
Gaussian downlink user selection subject to access limit, power budget, and rate demands
Graph editing to a given degree sequence
Real algebraic numbers and polynomial systems of small degree
Open-shop scheduling for unit jobs under precedence constraints
Efficient abstraction algorithms for predicate detection
Computing abelian complexity of binary uniform morphic words
The Effective Riemann Mapping Theorem
Online algorithms for scheduling on batch processing machines with interval graph compatibilities between jobs
On three variants of rewriting P systems
Normal numbers and finite automata
From words to pictures: Row-column combinations and Chomsky-Schützenberger theorem
On "On Graph Rewritings"
Linear and affine logics with temporal, spatial and epistemic operators
Exploring the topological entropy of formal languages
Generalized Pete's Pike is PSPACE-complete
TCTL-preserving translations from timed-arc Petri nets to networks of timed automata
Some results on Hahn-Banach-type theorems for continuous D-cones
Randomization, Derandomization and Antirandomization: Three Games
Completing codes and the Rédei property of groups
Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
Efficient Voting with No Selling of Votes
Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
A weak inverse of language neighborhoods and its properties
A logic for the stepwise development of reactive systems
Resource bounded immunity and simplicity
Local rule distributions, language complexity and non-uniform cellular automata
New insights on neutral binary representations for evolutionary optimization
Detecting synchronisation of biological oscillators by model checking
Transfer of trust in event-based reputation systems
On notions of regularity for data languages
A Theory for Nondeterminism, Parallelism, Communication, and Concurrency
Nondeterminism and Infinite Computations in Constraint Programming
Asymptotic growth rate of square grids dominating sets: A symbolic dynamics approach
Extending alignments with k-mismatches and ℓ-gaps
Covering by squares