yusuke1997/dblp-id-title huggingface dataset:
Minimum sum vertex cover: Difficulty of ordering
Specializations and generalizations of the Stackelberg minimum spanning tree game
T-tetrominoes tiling's Markov chain mixes fast
Fuzzy context-free languages - Part 1: Generalized fuzzy context-free grammars
On the intercluster distance of a tree metric
Dichotomies for classes of homomorphism problems involving unary functions
Online bin packing with arbitrary release times
Exploration of dynamic tori by multiple agents
Causality analysis and fault ascription in component-based systems
Introducing ⦇ λ ⦈, a λ -calculus for effectful computation
Probable innocence revisited
Integrated scheduling of production and delivery on a single machine with availability constraint
Cooperating in video games? Impossible! Undecidability of Team Multiplayer Games
Coding by minimal linear grammars
Around probabilistic cellular automata
A Periodic Division Pattern that Cannot be Generated by D0L Systems
On shifting networks
On different topological classes of spherical geodesic paths and circles in Z 3
Classically simulating quantum circuits with local depolarizing noise
Corrigendum to "Parameterized tractability of the maximum-duo preservation string mapping problem" [Theoret. Comput. Sci. 646(2016) 16-25]
Palindromic Ziv-Lempel and Crochemore factorizations of m -bonacci infinite words
The complexity of snake and undirected NCL variants
On the Complexity of Edge Labelings for Trees
The Undecidability of Form Equivalence for Context-Free and E0L Forms
On the Latest Cersion of DESIR-II
Quotient complexity of ideal languages
On image reconstruction algorithms for binary electromagnetic geotomography
Online multi-coloring with advice
A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
2-node-connectivity network design
A causal semantics for CCS via rewriting logic
Confluence up to garbage in graph transformation
Corrigendum: DAL-A Logic for Data Analysis
Semantical Analysis of Perpetual Strategies in lambda-Calculus
Efficient non-isomorphic graph enumeration algorithms for several intersection graph classes
Discrete Warehouse Problem
Comparison-based interactive collaborative filtering
A new lower bound for the bipartite crossing number with applications
A Note on the Combinatorial Structure of the Visibility Graph in Simple Polygons
LOGSPACE and PTIME Characterized by Programming Languages
Implementations and the independent set polynomial below the Shearer threshold
The Hausdorff-Kuratowski Hierarchy of omega-Regular Languages and a Hierarchy of Muller Automata
On compressing and indexing repetitive sequences
Recognition of poly-slender context-free languages by trellis automata
Computing difference abstractions of linear equation systems
Exact and approximate algorithms for movement problems on (special classes of) graphs
Conditional edge-fault pancyclicity of augmented cubes
A prolongation-projection algorithm for computing the finite real variety of an ideal
Hierarchies of Weak Automata and Weak Monadic Formulas
On the Power of Multi-Prover Interactive Protocols
Aspects of shuffle and deletion on trajectories
Smash and grab: The 0 ⋅ 6 scoring game on graphs
Average Polynomial Time Complexity of Some NP-Complete Problems
The Kolmogorov birthday paradox
One-way probabilistic reversible and quantum one-counter automata
A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
A semantic approach to interpolation
Ein Satz über die Entropie von Untermonoiden (A Theorem on the Entropy of Submonoids)
Concerning Bounded-Right-Context Grammars
Online and semi-online hierarchical scheduling for load balancing on uniform machines
Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection
Preface for the Special Issue: Foundations of Software Science and Computation Structures
Modulo-Counting Quantifiers Over Finite Trees
Solvable Black-Box Group Problems are Low for PP
A note on vertices contained in the minimum dominating set of a graph with minimum degree three
Editorial fun
A Remark on the Length Problem
Cryptographically significant Boolean functions with five valued Walsh spectra
New approximation algorithms for RNA secondary structures prediction problems by local search
Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs
Computing and estimating the volume of the solution space of SMT(LA) constraints
A Model of Finite Automata on Timed omega-Trees
Graceful planes and lines
On square-free arithmetic progressions in infinite words
Degree-anonymization using edge rotations
The fixed point problem of a simple reversible language
Fast Linear-Space Computations of Longest Common Subsequences
Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics
Interpolation in Grothendieck Institutions
A simple dynamic logic
Fixed parameterized algorithms for generalized feedback vertex set problems
A formal fuzzy reasoning system and reasoning mechanism based on propositional modal logic
Special issue: International Colloquium on Theoretical Aspects of Computing - ICTAC 2010
Extending separation logic with fixpoints and postponed substitution
Process Logic with Regular Formulas
Efficient provably-secure hierarchical key assignment schemes
Corrigendum to "Complexity analysis of P 3 -convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]
Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
Efficient routing in carrier-based mobile networks
In memoriam: Alberto Del Lungo (1965-2003)
Jeux de Mots dans les Algèbres de Lie Libres: Quelques Bases et Formules
Intersection des Images de Certaines Suites Récurrentes Linéaires
Generating Algebraic Laws from Imperative Programs
A decomposition theorem for number-conserving multi-state cellular automata on triangular grids
Graph transformation for incremental natural language analysis
If NP has Polynomial-Size Circuits, then MA=AM
On the Expressive Power of Counting
The complexity of Tarski's fixed point theorem
On feasible cases of checking multi-agent systems behavior
An adversarial queueing model for online server routing
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs
Local 7-coloring for planar subgraphs of unit disk graphs
Bounded-degree spanners in the presence of polygonal obstacle
Reducing control alphabet size for the control of right linear grammars with unknown behaviors
Leader election in multi-hop radio networks
A reconstruction algorithm for a subclass of instances of the 2-color problem
Weakly Adaptive Comparison Searching
Temporal interval cliques and independent sets
GSOS and Finite Labelled Transition Systems
Birth and growth of multicyclic components in random hypergraphs
Computing maximal cliques in link streams
A quadratic time 2-approximation algorithm for block sorting
Corrigendum to Galmiche's and Perrier's "On Proof Normalization in Linear Logic"
Complete Systems of B-Rational Identities
The diagnosability of wheel networks with the condition: 2-extra
Preface to the special issue on Computing and Combinatorics
A toolbox for simpler active membrane algorithms
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
Constant-competitive tree node assignment
Behavior of various complexity functions
Fourth Brainstorming Week on Membrane Computing
Determining presentations of sofic shifts
Shortest covers of all cyclic shifts of a string
Code Selection by Inversion of Order-Sorted Derivors
Finding the leftmost critical factorization on unordered alphabet
Moment-based analysis of Bayesian network properties
Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences
Developments in Implicit Complexity (DICE 2012)
CTRL: Extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks
Erratum to "On the structure of graphs in the Caucal hierarchy" [Theoret. Comput. Sci 400 (2008) 19-45]
Note on matching preclusion number of random graphs
Distributed algorithms for random graphs
An Optimistic Ternary Simulation of Gate Races
Characteristics of Graph Languages Generated by Edge Replacement
Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
Erratum to "P-complete Problems in Data Compression"
Interpreting Abstract Interpretations in Membership Equational Logic
The Inference of Tree Languages from Finite Samples: An Algebraic Approach
Interpreting one Concurrent Calculus in Another
On existence of reporter strands in DNA-based graph structures
A quadratic lower bound for Topswops
Max-SAT with cardinality constraint parameterized by the number of clauses
On recognising words that are squares for the shuffle product
An Abstract Interpretation framework for genotype elimination algorithms
A Lower Bound for Polynomial Multiplication
Partial permutations comparison, maintenance and applications
Fixpoint semantics for logic programming a survey
Adapting innocent game models for the Böhm treelambda -theory
Formal Languages Defined by Uniform Substitutions
On the performance of a retransmission-based synchronizer
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Quad-kd trees: A general framework for kd trees and quad trees
Solving 8×8 Domineering
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel
Parameterized complexity of Strip Packing and Minimum Volume Packing
On Representing Recursively Enumerable Languages by Internal Contextual Languages
Realistic roofs without local minimum edges over a rectilinear polygon
Sequencing by hybridization with errors: handling longer sequences
Probabilistic Analysis of Some (Un)Directed Animals
On the construction of free algebras for equational systems
On the state complexity of partial word DFAs
A survey of size counting in population protocols
Classes of propositional UMU formulas and their extensions to minimal unsatisfiable formulas
Active learning in heteroscedastic noise
Games with secure equilibria
Parsing MELL proof nets
Developing Developments
An efficient approach for the rank aggregation problem
A church-style intermediate language for MLF
NP is as Easy as Detecting Unique Solutions
Approximating Max NAE-k-SAT by anonymous local search
MetaML and multi-stage programming with explicit annotations
An Elementary Proof of the Completness of PDL
Random product of substitutions with the same incidence matrix
Arrays, numeration systems and Frankenstein games
Information disclosure in the framework of Kolmogorov complexity
Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82]
About the number of C infinity -words of form w~ × w
Weak bisimilarity and regularity of context-free processes is EXPTIME-hard
If Deterministic and Nondeterministic Space Complexities are Equal for log log n , then they are also Equal for log n
wMSO theories as grammar formalisms
Partial words and the critical factorization theorem revisited
Flexible representation and manipulation of audio signals on quantum computers
On the complexity of clustering with relaxed size constraints in fixed dimension
Corrigenda: On the Continued Fraction Representation of Computable Real Numbers
Stochastic simulation of multiple process calculi for biology
A boundary result on enhanced time-varying distributed H systems with parallel computations
c-beta-Machine with lambda-beta-Reduction
Unbounded non-zero inner product encryption
Interfaces as functors, programs as coalgebras - A final coalgebra theorem in intensional type theory
Coupling Coefficients of a Distributed Execution
Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm
Hardness and inapproximability of convex recoloring problems
Model checking of distributed algorithms using synchronous programs
Exponential upper bounds for the runtime of randomized search heuristics
Constant factor approximation algorithm for TSP satisfying a biased triangle inequality
Some Fundamental Algebraic Tools for the Semantics of Computation. Part 1: Comma Categories, Colimits, Signatures and Theories
Probabilistic Hyperedge Replacement Grammars
The Receptor Density Algorithm
Improved SARSA and DQN algorithms for reinforcement learning
Polynomial algorithms for approximating Nash equilibria of bimatrix games
A Tight Upper Bound for the Path Length of AVL Trees
On some variants of the Ehrenfeucht conjecture
The algebra of stream processing functions
Efficient computation of spatial queries over points stored in k 2 -tree compact data structures
Improvements in the analysis of Kannan's CVP algorithm
Approximating the maximum consecutive subsums of a sequence
Resolution des Systemes d'Equations Algebriques
Automedian sets of permutations: direct sum and shuffle
Conditional Value-at-Risk: Structure and complexity of equilibria
Symmetry groups for beta-lattices
Inefficiency of Nash Equilibrium for scheduling games with constrained jobs: A parametric analysis
A Convex Geometric Approach to Counting the Roots of a Polynomial System
Polygon simplification by minimizing convex corners
Complexity of Monotone Networks for Boolean Matrix Product
Validating XML document adaptations via Hedge Automata transformations
Représentations des nombres réels par développements en base entière et complexité
Computing a longest common almost-increasing subsequence of two sequences
Towards a universal construction for transaction-based multiprocess programs
Occurrences of palindromes in characteristic Sturmian words
Temporal constraints in the logical analysis of regulatory networks
Some More Independence Results in Complexity Theory
The family of generalized variational network of cube-connected cycles
Network control games played on graphs
Scheduling multiprocessor UET tasks of two sizes
Lumpability abstractions of rule-based systems
Fixed-Point Operations on ccc's. Part I
Convergence of Pascal-like triangles in Parry-Bertrand numeration systems
Computability on Random Variables
On semi-perfect de Bruijn words
A computational model for RNA multiple structural alignment
Fast pattern matching in indexed texts
Quantum algorithm for the multicollision problem
Efficient algorithms for chemical threshold testing problems
On the optimal mixing problem of approximate Nash equilibria in bimatrix games
Constructing divisions into power groups
Alternating refinement relations for fuzzy concurrent game structures
Higher-Level Synchronising Devices in Meije-SCCS
Behavioural differential equations: a coinductive calculus of streams, automata, and power series
The decidability of a fragment of BB'IW-logic
Note on Optimal Gossiping in Some Weak-Connected Graphs
A self-stabilizing 2/3-approximation algorithm for the maximum matching problem
Continued Fraction Algorithms, Functional Operators, and Structure Constants
Lattice-free and point-free: Vickers duality for subbases of stably locally compact spaces
On Scott's Thesis for Domains of Information and Well-Quasi-Orderings
On-line exploration of an unbounded region with one obstacle
omega-Computations on Turing Machines
On normalizing, non-terminating one-rule string rewriting systems
On end extensions of models of subsystems of peano arithmetic
Completing prefix codes in submonoids
(min⁡,+) matrix and vector products for inputs decomposable into few monotone subsequences
Modular Nim
On the drift of short schedules
Upward planarity testing of biconnected outerplanar DAGs solves partition
Encoding transition systems in sequent calculus
Reliability evaluation of complete graph-based recursive networks
Some Polynomials that are Hard to Compute
An FPTAS for the parallel two-stage flowshop problem
Characterizing Complexity Classes by Higher Type Primitive Recursive Definitions
No-Free-Lunch theorems in the continuum
Separating codes and traffic monitoring
Conspiracy number search with relative sibling scores
Compatibility in a multi-component environment
Distributed strong diameter network decomposition
New approximation algorithms for the heterogeneous weighted delivery problem
The hardest language for grammars with context operators
Large independent sets in general random intersection graphs
Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly
Chordless paths through three vertices
A Parallel Algorithm for the Generation of a Permutation and Applications
Online scheduling on unbounded parallel-batch machines with incompatible job families
α-Concave hull, a generalization of convex hull
Accelerated training of max-margin Markov networks with kernels
Market equilibrium under piecewise Leontief concave utilities
Competitive algorithms for unbounded one-way trading
Structure fault tolerance of hypercubes and folded hypercubes
Algorithms for the parallel alternating direction access machine
Information flow in systems with schedulers, Part II: Refinement
A reconstruction algorithm for L-convex polyominoes
Flatwords and Post Correspondence Problem
Word Problems Over Traces which are Solvable in Linear Time
Reasoning about plan revision in BDI agent programs
Two optimal parallel algorithms on the commutation class of a word
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems
On the Complexity of Counting in the Polynomial Hierarchy
Tiling Allowing Rotations Only
Fractal dimension and logarithmic loss unpredictability
A theory of fine-grained lineage for functions on structured objects
Matroidal connectivity and conditional matroidal connectivity of star graphs
Compression of finite-state automata through failure transitions
A simple algorithm for 4-coloring 3-colorable planar graphs
Feedback vertex set reconfiguration in planar graphs
The Algebra of Communicating Processes With Empty Process
SOS formats and meta-theory: 20 years after
Validating firewalls using flow logics
Resolution and linear CNF formulas: Improved ( n , 3)-MaxSAT algorithms
Exact square coloring of certain classes of graphs: Complexity and algorithms
A Relation of Primal-Dual Lattices and the Complexity of Shortest Lattice Vector Problem
Processes are in the Eye of the Beholder
Finiteness problem for automaton groups over a binary alphabet is almost decidable
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Semigroups and Algebraic Engineering - Foreword
An integer linear programming approach to solving the Eternity Puzzle
Computing minimum length representations of sets of words of uniform length
An asymptotic study for path reversal
Matchings in higher-order Gabriel graphs
Automatic verification of real-time systems with discrete probability distributions
On counting functions and slenderness of languages
Words whose complexity satisfies lim p(n)/n = 1
The t / m -diagnosis strategy of augmented k -ary n -cubes
Characterizing and recognizing probe block graphs
On the number of gapped repeats with arbitrary gap
Finite state automata representing two-dimensional subshifts
Transactions and contracts based on reaction systems
Automata on the plane vs particles and collisions
Paracategories II: adjunctions, fibrations and examples from probabilistic automata theory
The customizable fault/error model for dependable distributed systems
Discrete sets with minimal moment of inertia
PAC-Learning from General Examples
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Shortest color-spanning intervals
A priori optimization for the probabilistic maximum independent set problem
Multiplicities: A Deterministsic View of Nondeterminism
Online knapsack of unknown capacity: How to optimize energy consumption in smartphones
On the Computational Power of Dynamical Systems and Hybrid Systems
A Universal Machine without Change of State
Ranking and unranking fixed-density necklaces and Lyndon words
Deterministic and unambiguous two-dimensional languages over one-letter alphabet
RESCOT: Restriction enzyme set and combination optimization tools for rNMP capture techniques
The convergence of stochastic algorithms solving flow shop scheduling
Generalizing Completeness Results for Loop Checks in Logic Programming
Successor rules for flipping pancakes and burnt pancakes
A four-stage algorithm for updating a Burrows-Wheeler transform
The Impact of the Number of Cooperating Grammars on the Generative Power
Winning strategies for infinite games: from large cardinals to computer science extended abstract
A computational model for tiling recognizable two-dimensional languages
Encoding safety in CLL R
Paths and trails in edge-colored graphs
Absoluteness of subword inequality is undecidable
Finding the N best vertices in an infinite weighted hypergraph
An Improvement on Valiant's Decision Procedure for Equivalence of Deterministic Finite Turn Pushdown Machines
A tutorial on coinductive stream calculus and signal flow graphs
Social context congestion games
A common algebraic description for probabilistic and quantum computations ,
Time-Based Expressivity of Time Petri Nets for System Specification
An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded
An improved algorithm for a two-stage production scheduling problem with an outsourcing option
On Games of Incomplete Information
Two non-holonomic lattice walks in the quarter plane
A note on "Posets having continuous interval"
Nonapplicable Nulls
Towards a unified view of bisimulation: a comparative study
Certain discrete dynamical systems, number systems and related integral self-affine sets
Neighborhood unions and regularity in graphs
Efficient revocable identity-based encryption with short public parameters
On the omega -language expressive power of extended Petri nets
Reaction automata
The worst case behavior of randomized gossip protocols
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Commutation with codes
Applications of Compactness in the Smyth Powerdomain of Streams
Positive planar satisfiability problems under 3-connectivity constraints
Improved Lower Bounds on the Number of Multiplications/Divisions which are Necessary of Evaluate Polynomials
On the tradeoff between compositionality and exactness in weak bisimilarity for integrated-time Markovian process calculi
Discrete random variables over domains
Pattern-based computing via sequential phase transitions in hierarchical mean field neuropercolation
Scheduling with variable-length calibrations: Two agreeable variants
Degree-constrained 2-partitions of graphs
Regular Unimodal Systems and Factors of Finite Automata
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
A tree structure for local diagnosis in multiprocessor systems under the comparison model
Minimality of the System of Seven Equations for the Category of Finite Sets
Cycle transversals in perfect graphs and cographs
Ruling out FPT algorithms for Weighted Coloring on forests
Descriptional Complexity of Context-Free Grammar Forms
Invariant games
Computational Complexity of Loss Networks
Multitree automata that count
Left ternary trees and non-separable rooted planar maps
Visibility extension via mirror-edges to cover invisible segments
A Note on Some Languages in Uniform ACC0
Discrete-time formulation, control, solution and verification of pendulum systems with zeroing neural dynamics
Vertex-critical graphs in co-gem-free graphs
Succint Representation of Regular Languages by Boolean Automata
Bubbles in Modularity
Partition dimension of certain classes of series parallel graphs
Efficient CTL model-checking for pushdown systems
Towards a semantics of proofs for non-commutative logic: multiplicatives and additives
Tightly secure inner product functional encryption: Multi-input and function-hiding constructions
Learning Approximately Regular Languages with Reversible Languages
A graph-based framework for sub-pixel image segmentation
The correctness of Newman's typability algorithm and some of its extensions
Failure-divergence semantics and refinement of long running transactions