yusuke1997/dblp-id-title huggingface dataset:
Enumeration of symmetry classes of convex polyominoes on the honeycomb lattice
Computation on Graph-Like Expressions
On the permutation complexity of the Cantor-like sequences
Design, optimization and predictions of a coupled model of the cell cycle, circadian clock, DNA repair system, irinotecan metabolism and exposure control under temporal logic constraints
Parameterized complexity of finding subgraphs with hereditary properties
Dictionary matching with a few gaps
Probabilistic inductive inference: a survey
Genuine atomic multicast in asynchronous distributed systems
Decimations of languages and state complexity
Lift & project systems performing on the partial-vertex-cover polytope
Range minimum queries in minimal space
Corrigendum to "On the approximability and hardness of minimum topic connected overlay and its special instances" [Theoret. Comput. Sci. 429(2012) 144-154]
The First-Order Theory of Linear One-Step Rewriting is Undecidable
Approximate aggregation for tracking quantiles and range countings in wireless sensor networks
Multiple-model polynomial regression and efficient algorithms for data analysis
Unit-Cost Pointers versus Logarithmic-Cost Addresses
Unambiguous Computations and Locally Definable Acceptance Types
Codes Modulo Finite Monadic String-Rewriting Systems
Infinite linear programming and online searching with turn cost
Newton's method in practice: Finding all roots of polynomials of degree one million efficiently
A bad instance for k-means++
Two-way finite automata with quantum and classical state
Dependent choice, 'quote' and the clock
A type system for JVM threads
The partial diagnosability of interconnection networks under the Hybrid PMC model
Parameterized complexity of two-interval pattern problem
Synchronized Finite Automata and 2DFA Reductions
Global convergence for evolution strategies in spherical problems: some simple proofs and difficulties
Probabilistic quickest path algorithm
A Direct Branching Algorithm for Checking the Equivalence of Two Deterministic Pushdown Transducers, one of which is Real-Time Strict
Petri Nets, Event Structures and Domains, Part I
Progress analysis of a multi-recombinative evolution strategy on the highly multimodal Rastrigin function
The orthogonal colouring game
Induction in the Timed Interval Calculus
Hierarchical structures in Sturmian dynamical systems
Space lower bounds for online pattern matching
Formalizing generalized maps in Coq
Online algorithms with advice for bin packing and scheduling problems
Cell-like spiking neural P systems
Semantics of Horn and Disjunctive Logic Programs
Relative definability of boolean functions via hypergraphs
One-Sided Weak Dominance Drawing
Nash equilibria in stabilizing systems
Adding direction constraints to the 1-2-3 Conjecture
Ortho-polygon visibility representations of 3-connected 1-plane graphs
An approximation algorithm for the l -pseudoforest deletion problem
Resolution Proofs of Generalized Pigeonhole Principles
Geometric Sets of Low Information Content
The directed Hausdorff distance between imprecise point sets
Complete Extension of General Logic Programs
Publications of Jean Berstel
Linear tolls suffice: New bounds and algorithms for tolls in single source networks
Metacircularity in the Polymorphic lambda-Calculus
On fault tolerance of (n, k)-star networks
Characterizing CTL-like logics on finite trees
Improved upper bounds for vertex cover
Well quasi-orders and context-free grammars
Upper bounds on Fourier entropy
Physical zero-knowledge proof for Ripple Effect
A Criterion for Proving Noetherianity of a Relation
Inverse Hamiltonian Cycle and inverse 3Dimensional Matching are coNP-complete
Tissue P systems
Domains in H
Secondary Attribute Retrieval Using Tree Data Structures
Le nombre de posets à isomorphie près ayant 12 èlèments
Scheduling games with machine-dependent priority lists
In-place initializable arrays
Complexity of model checking for reaction systems
The Class of Problems That are Linearly Equivalent to Satisfiability or a Uniform Method for Proving NP-Completeness
Almost disjoint paths and separating by forbidden pairs
Compact representation of interval graphs and circular-arc graphs of bounded degree and chromatic number
The complexity of smooth words on 2-letter alphabets
Category-Sorted Algebra-Based Action Semantics
A study on several combination problems of classic shop scheduling and shortest path
A Fixed-Point Theorem in a Category of Compact Metric Spaces
Improved zeroing neural models based on two novel activation functions with exponential behavior
A Classification of Minimal Standard-Path 2x2 Switching Networks
Revisiting randomized parallel load balancing algorithms
Simulation relations for alternating Büchi automata
Connectivity and constructive algorithms of disjoint paths in dragonfly networks
Reliability analysis of twisted cubes
Latency-bounded target set selection in social networks
The monadic second-order logic of graphs XII: planar graphs and planar maps
Weak Arithmetics
A space-efficient Huffman decoding algorithm and its parallelism
Localization of VC classes: Beyond local Rademacher complexities
Games on Line Graphs and Sand Piles
On LLP(k) Grammars and Languages
Subnetwork reliability of the arrangement graphs under probabilistic fault condition
Optimal majority dynamics for the diffusion of an opinion when multiple alternatives are available
Graph Rewriting for a Partial Ordering Semantics of Concurrent Constraint Programming
Efficient card-based zero-knowledge proof for Sudoku
Path connected dynamic graphs with a study of dispersion and exploration
From cascade decompositions to bit-vector algorithms
The complexity of game isomorphism
Automatic verification of parameterized networks of processes
Derandomization and absolute reconstruction for sums of powers of linear forms
Typed stochastic semantics for the calculus of looping sequences
A linear process-algebraic format with data for probabilistic automata
Efficient dynamic threshold identity-based encryption with constant-size ciphertext
Complete bipartite graphs deleted in Ramsey graphs
Multimodal logic programming
Alternative parameterizations of Metric Dimension
Un Modèle Asynchrone pour les Systèmes Distribués
On the expressive power of hybrid branching-time logics
Corrigendum to "On functions preserving levels of approximation: a refined model construction for various lambda calculi"
A characterization of the words occurring as factors in a minimum number of words
On the state complexity of closures and interiors of regular languages with subwords and superwords
Syntactic structures of regular languages
Computing efficiently the lattice width in any dimension
Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations
Events and modules in reaction systems
Uniform test of algorithmic randomness over a general space
A probabilistic algorithm for vertex cover
Robust overlays meet blockchains: On handling high churn and catastrophic failures
The complexity of fixed point models of trust in distributed networks
On the Semantics of Message Passing Processes
Self-stabilization of circular arrays of automata
Personal portrait of Giorgio Levi
A few exercises in theorem processing
Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks
Space complexity equivalence of P systems with active membranes and Turing machines
A generalization of a theorem of Rothschild and van Lint
Runtime analysis of a binary particle swarm optimizer
Vertex-independent spanning trees in complete Josephus cubes
Geometrical regular languages and linear Diophantine equations: The strongly connected case
Shape matching by random sampling
Attibute Grammars are Useful for Combinatorics
On the number of anchored rectangle packings for a planar point set
The fixed-point theory of strictly causal functions
Green scheduling, flows and matchings
Message and time efficient multi-broadcast schemes
Finite automata on timed omega-trees
Axiomatizing the subsumption and subword preorders on finite and infinite partial words
Squares in partial words
Transposition invariant words
Optimizing incremental SDN upgrades for load balancing in ISP networks
Removing algorithmic discrimination (with minimal individual error)
A weak approach to suffix automata simulation for exact and approximate string matching
Dense-choice Counter Machines revisited
On the computability of the set of automorphisms of the unit square
Optimal L-algorithms for rendezvous of asynchronous mobile robots with external-lights
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane
An efficient algorithm to find a double-loop network that realizes a given L-shape
Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
Private authentication
On the neighbor sum distinguishing total coloring of planar graphs
On Ambiguity in E0L Systems
Restricted ambiguity of erasing morphisms
General time consistent discounting
Reconstruction of convex polyominoes from orthogonal projections of their contours
Energy and fan-in of logic circuits computing symmetric Boolean functions
A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead
A primal-dual approximation algorithm for the vertex cover P 3 problem
Lower bounds on the minus domination and k-subdomination numbers
Fundamental results for learning deterministic extended finite state machines from queries
The impossibility of non-signaling privacy amplification
Balanced branchings in digraphs
Corrigendum to "Reachability-based acyclicity analysis by abstract interpretation" [Theoretical Computer Science 474 (2013) 60-79]
Deadlocks and dihomotopy in mutual exclusion models
A probabilistic version of the game of Zombies and Survivors on graphs
On Commutativity and Approximation
Bijections between directed-column convex polyominoes and restricted compositions
Dot operators
Watson-Crick D0L systems: the power of one transition
Foreword: Special Issue on Theory and Applications of Graph Searching Problems
Embedding a Demonic Semilattice in a Relational Algebra
Repackable multi-Log 2 N networks
On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
Optimization Complexity of Linear Logic Proof Games
Three-player impartial games
A novel version of the hidden logarithm problem for post-quantum signature algorithms
Semantic Types and Approximation for Featherweight Java
On Hadamard square roots of unity
Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree
Corrigendum to "On the edge-length ratio of outerplanar graphs" [Theoret. Comput. Sci. 770 (2019) 88-94]
Model-checking games for logics of imperfect information
Formal molecular biology
Parameterized complexity analysis for the Closest String with Wildcards problem
A hierarchy of failures-based models: theory and application
On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems
Monitoring arc-geodetic sets of oriented graphs
On the boundary between decidability and undecidability of asynchronous session subtyping
On-Line Algorithms for 2-Coloring Hypergraphs Via Chip Games
Non-adaptive programmability of random oracle
Strategy templates for almost-sure and positive winning of stochastic parity games towards permissive and resilient control
Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security
Conway's Angel in three dimensions
Maximal and minimal representations of gapped and non-gapped motifs of a string
A note on the security of KHL scheme
On the complexity of neighbourhood learning in radio networks
Computational complexity of problems for deterministic presentations of sofic shifts
Full Abstraction and Limiting Completeness in Equational Languages
On the maximum weight minimal separator
Computing over the Reals with Addition and Order
When ignorance helps: Graphical multicast cost sharing games
Moderately exponential approximation for makespan minimization on related machines
Efficient Delay Routing
Conditional matching preclusion for the arrangement graphs
How to decide continuity of rational functions on infinite words
Definable transductions and weighted logics for texts
The drawability problem for minimum weight triangulations
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
Metric Temporal Logic with Durations
Complexity of paired domination in AT-free and planar graphs
On size-constrained minimum s-t cut problems and size-constrained dense subgraph problems
Geometric properties of matrices induced by pattern avoidance
Improved lower bound for deterministic broadcasting in radio networks
Listing closed sets of strongly accessible set systems with applications to data mining
Testing Approximate Symmetry in the Plane is NP-Hard
Focusing and polarization in linear, intuitionistic, and classical logics
Global convergence of Oja's PCA learning algorithm with a non-zero-approaching adaptive learning rate
Critical exponents of infinite balanced words
Combinatorial Gray codes for classes of pattern avoiding permutations
Disjoint directed and undirected paths and cycles in digraphs
Safe recursion revisited I: Categorical semantics for lower complexity
Conservation of some dynamical properties for operations on cellular automata
Constrained inverse minimum flow problems under the weighted Hamming distance
Bounds on contention management algorithms
K -Center and K -Median Problems in Graded Distances
On-the-fly TCTL model checking for time Petri nets
Efficiently computing succinct trade-off curves
QRT FIFO Automata, Breath-First Grammars and Their Relations
Touring a sequence of disjoint polygons: Complexity and extension
Hybrid dynamics of stochastic programs
Exception tracking in an open world
On two-way FA with monotonic counters and quadratic Diophantine equations
Preface - COCOON'2011
Complexity measures and decision tree complexity: a survey
Sparse matrix multiplication and triangle listing in the Congested Clique model
Compressed automata for dictionary matching
Optimizing static and adaptive probing schedules for rapid event detection
Compatibility of Parameter Passing and Implementation of Parameterized Data Types
Proving sequential function chart programs using timed automata
On the number of alpha-power-free binary words for 2alpha<=7/3
Special Issue on the 14th International Frontiers of Algorithmics Workshop
On representations of positive integers in the Fibonacci base
Resource allocation with time intervals
The syntactic prediction with token automata: application to HandiAS system
Distance- k knowledge in self-stabilizing algorithms
Attractor stability in nonuniform Boolean networks
Approximate Maxima Finding of Continuous Functions under Restricted Budget
A strand graph semantics for DNA-based computation
Finite Automata and Ordinals
Explaining DNA structure
Finite Games for a Predicate Logic Without Contractions
Périodes locales et propagation de périodes dans un mot
Computing the chromatic number using graph decompositions via matrix rank
Unique (optimal) solutions: Complexity results for identifying and locating-dominating codes
The complexity of computing the behaviour of lattice automata on infinite trees
Learning Elementary Formal Systems
On Strictly Arithmetical Completeness in Logics of Programs
Group nearest-neighbor queries in the L 1 plane
Period distribution of generalized discrete Arnold cat map
Decision lists over regular patterns
Radiocoloring in planar graphs: Complexity and approximations
Simple Chain Grammars and Languages
Bandwidth and low dimensional embedding
General Varieties of Tree Languages
Topological properties of real number representations
Compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption
A type-assignment of linear erasure and duplication
Some remarks on cops and drunk robbers
Time-energy tradeoffs for evacuation by two robots in the wireless model
The continuous Skolem-Pisot problem
Monotonic self-stabilization and its application to robust and adaptive pattern formation
Undirected Edge Geography
An Approximate String-Matching Algorithm
A comparison of two approaches to pseudorandomness
Optimal packet scan against malicious attacks in smart grids
Subtractive reductions and complete problems for counting complexity classes
Permutations Generated by Token Passing in Graphs
Flip-swap languages in binary reflected Gray code order
The largest component of faulty star graphs
Structure of some sand piles model
Applications quasi affines: pavages par images réciproques
Methods for Proving Completeness via Logical Reductions
Analysis of a cellular automaton model for car traffic with a slow-to-stop rule
Fusion of recursive programs with computational effects
The Undecidability of Simultaneous Rigid E-Unification
Bipartite instances of INFLUENCE
Random Trees in Queueing Systems with Deadlines
Evaluating the numerical instability in fuzzy clustering validation of high-dimensional data
Polynomial-Time Algorithms for Testing Strong Isomorphism and Computing the Automorphism Group of R-Strongly Connected Automata
A dichotomy theorem for circular colouring reconfiguration
Ulam's Searching Game with a Fixed Number of Lies
For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability
Corrigendum: A Fast Stable Sorting Algorithm with Absolutely Minimum Storage
Selfish bin covering
Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs
2DST Mapppings on Languages and Related Problems
More on bisimulations for higher order π-calculus
Beyond windability: Approximability of the four-vertex model
A Short Proof of Representability of Fork Algebras
Versatile string kernels
Graph matching problems and the NP-hardness of sortedness constraints
Massively Parallel Factorizations of Polynomials With Many Non-Commuting Variables
Out-degree reducing partitions of digraphs
Fixed-orientation equilateral triangle matching of point sets
Binary distinguishability operation
Stability in L Systems
The evolutionary dynamics of soft-max policy gradient in multi-agent settings
An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences
A Speed-Up Theorem Without Tape Compression
Average complexity of Moore's and Hopcroft's algorithms
Some properties of recognizable -subsets
Well quasi-orders generated by a word-shuffle rewriting
Attractor separation and signed cycles in asynchronous Boolean networks
An Efficient Algorithm for Edge Coloring Planar Graphs with Delta Colors
A stronger Kolmogorov zero-one law for resource-bounded measure
Subclasses of Presburger Arithmetic and the Polynomial-Time Hierarchy
Disconnected matchings
I/O-efficient data structures for non-overlapping indexing
Superfast coloring in CONGEST via efficient color sampling
Influence diffusion in social networks under time window constraints
An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems
On the self-stabilization of mobile oblivious robots in uniform rings
P, NP, Co-NP and Weak Systems of Arithmetic
Two-dimensional pattern matching with rotations
Secret handshakes: Full dynamicity, deniability and lattice-based design
Beep-and-Sleep: Message and Energy Efficient Set Cover
The Densest Hemisphere Problem
Post-quantum secure compact deterministic wallets from isogeny-based signatures with rerandomized keys
An O(mn) Algorithm for Regular Set-Covering Problems
An integrated framework for the diagnosis and correction of rule-based programs
The ring design game with fair cost allocation
Detecting induced minors in AT-free graphs
Linear time online algorithms for constructing linear-size suffix trie
Multistate nested canalizing functions and their networks
Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in O(n 1+ϵ ) time
Fitness landscape of the cellular automata majority problem: View from the "Olympus"
Optimal nearest neighbor queries in sensor networks
Data stability in clustering: A closer look
Complexity of the Combinator Reduction Machine
Completeness for recursive procedures in separation logic
A randomized algorithm for two servers in cross polytope spaces
E0L Languages are not Codings of FP0L Languages
On the PLS -complexity of maximum constraint assignment
Branch and bound on the network model
Online scheduling to minimize modified total tardiness with an availability constraint
On the computational complexity of Data Flow Analysis over finite bounded meet semilattices
The concept of computability
The recognizability of sets of graphs is a robust property
Deterministic primal-dual algorithms for online k-way matching with delays
A 1/2-approximation algorithm for maximum interval multi-cover
Effective Domain Representations of H( X ), the Space of Compact Subsets
Approximating some network design problems with node costs
Characterizations for restricted graphs of NLC-width 2
Results related to threshold phenomena research in satisfiability: lower bounds
Certificate complexity of elementary symmetric Boolean functions
A sufficient condition for non-uniqueness in binary tomography with absorption
Cyclic renewal systems
Truthful algorithms for scheduling selfish tasks on parallel machines
On the Decidability of Equivalence Problem for Partially Commutative Rational Power Series
Iteration Theorems for Families of Strict Deterministic Languages
Revision by comparison as a unifying framework: Severe withdrawal, irrevocable revision and irrefutable revision
An Elementary Proof for Strassen's Degree Bound
A computable version of the Daniell-Stone theorem on integration and linear functionals
An algebraic approach to the longest path problem
The factor composition matrix of sequences
Euclidian Geometry in Terms of Automata Theory
An extension of the Burrows-Wheeler Transform
A modal proof theory for final polynomial coalgebras
Monadic Second-Order Definable Graph Transductions: A Survey
Efficient algorithms for generalized Stable Marriage and Roommates problems
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity
A Remark on a Paper by Armando B. Matos
An algebraic and algorithmic method for analysing transition systems
On compressing permutations and adaptive sorting
A Tradeoff Theorem for Space and Reversal
A coordination approach to mobile components
On the expressibility of the reconstructional color refinement
FPTASs for trimming weighted trees
Linear projections of the Vandermonde polynomial
Palindromic complexity of codings of rotations
Bisimulation relations for dynamical, control, and hybrid systems
Lower bounds for on-line single-machine scheduling
Corrigendum to "An FPTAS for the parallel two-stage flowshop problem" [Theoret. Comput. Sci. 657 (2017) 64-72]
Approximating SVP infinity to within almost-polynomial factors is NP-hard
Using MAPLE for the Analysis of Bifurcation Phenomena in Gas Combustion
Homomorphic Images of Sentential Form Languages Defined by Semi-Thue Systems
A genetically modified Hoare logic
Playing by searching: two strategies against a linearly bounded liar
Deciding stability and mortality of piecewise affine dynamical systems
Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms
Codes and Local Constraints
Recursion Equation Sets Computing Logic Programs
Fine and Wilf words for any periods II
Termination of the iterated strong-factor operator on multipartite graphs
On the 2-abelian complexity of the Thue-Morse word
Adaptive searching in succinctly encoded binary relations and tree-structured documents
Minimum cost source location problem with local 3-vertex-connectivity requirements
Submodular maximization over data streams with differential privacy noise
Computational complexity of long paths and cycles in faulty hypercubes
Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard
An Algorithm for Finding a Shortest Vector in a Two-Dimensional Modular Lattice
Circuit Size is Nonlinear in Depth
Synchronizing automata preserving a chain of partial orders
Corrigenda: Pushdown Machines for the Macro Tree Tranducer