yusuke1997/dblp-id-title huggingface dataset:
Hypothetical Analyses: Approximate Counting in the Style of Knuth, Path Length in the Style of Flajolet
Graphs with large total angular resolution
Generalized Besicovitch and Weyl spaces: Topology, patterns, and sliding block codes
On the existence of regular approximations
Completion of Recognizable Bifix Codes
Hop domination on subclasses of perfect graphs
BioAmbients: an abstraction for biological compartments
Basic analytic combinatorics of directed lattice paths
Collaborative delivery with energy-constrained mobile robots
On the degree of parallelism in membrane systems
Pricing and allocation algorithm designs in dynamic ridesharing system
Physarum-inspired multi-commodity flow dynamics
A Slight Strengthening of a Theorem of Blair and Kunen
The Poset of Infinitary Traces
Marcus t-contextual grammars and cut hierarchies and monotonicity for restarting automata
Rearrangeability of bit permutation networks
Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
A comprehensive study of an online packet scheduling algorithm
NP-completeness results for partitioning a graph into total dominating sets
Frontiers of Algorithmics
Fault tolerance in bubble-sort graph networks
The Greatest Fixed-Points and Rational Omega-Tree Languages
A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids
Online interval scheduling to maximize total satisfaction
Topology recognition and leader election in colored networks
A combinatorial approach to the analysis of bucket recursive trees
Non-Uniform Random Spanning Trees on Weighted Graphs
Undecidable problems in unreliable computations
The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
Erratum to "Reducibility classes of P-selective sets"
Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS
The cost of global broadcast in dynamic radio networks
On the complexity of the Eulerian closed walk with precedence path constraints problem
IDD-based model validation of biochemical networks
Sparse NP-complete problems over the reals with addition
Improved normal form for grammars with one-sided contexts
Sign Determination in Residue Number Systems
Complexity of Bezout's Theorem V: Polynomial Time
Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
Tissue P systems with channel states
Fully dynamic arboricity maintenance
A shrinking lemma for random forbidding context languages
2-colored point-set embeddings of partial 2-trees
Non-simple rule counting in semi-conditional grammars
A new technique for compacting ciphertext in multi-channel broadcast encryption and attribute-based encryption
Structure fault tolerance of k -ary n -cube networks
On the sensitivity complexity of bipartite graph properties
Flexible scheduling of transactional memory on trees
Constructions of 2-resilient rotation symmetric Boolean functions with odd number of variables
On the parameterized complexity of non-hereditary relaxations of clique
Polyominoes Defined by Two Vectors
On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
Improved even order magic square construction algorithms and their applications in multi-user shared electronic accounts
Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives
The permutation-path coloring problem on trees
Optimal bounds on finding fixed points of contraction mappings
Complexity analysis of P 3 -convexity problems on bounded-degree and planar graphs
Inductive inference of unbounded unions of pattern languages from positive data
Average-case complexity of the min-sum matrix product problem
A Computational Model for Metric Spaces
A First-Order Syntax for the Pi-Calculus in Isabelle/HOL using Permutations
Liar's domination in unit disk graphs
Algebraic cycles from a computational point of view
Finding the size and the diameter of a radio network using short labels
Harmonious coloring: Parameterized algorithms and upper bounds
Complete distributional problems, hard languages, and resource-bounded measure
An Answer to an Open Problem of Urquhart
Algorithms, complexity and computational models
Ordered coloring of grids and related graphs
On cherry-picking and network containment
pi-Calculus, Internal Mobility, and Agent-Passing Calculi
Three aspects of super-recursive algorithms and hypercomputation or finding black swans
Le Calcul Rapide des Melanges de Deux Mots
Notes on Smyth-completes and local Yoneda-completes
Uniform Data Encodings
Génération d'une Section des Classes de Conjugaison et Arbre des Mots de Lyndon de Longueur Bornée
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Itineraries of rigid rotations and diffeomorphisms of the circle
Stable finiteness of monoid algebras and surjunctivity
Maximal Bifix Codes
Extending algebraic operations to D-completions
Preface: Structural Information and Communication Complexity
Combined data structure for previous- and next-smaller-values
Leader-based de-anonymization of an anonymous read/write memory
On the number of frames in binary words
Compositional symbolic execution semantics
Complexity of manipulation with partial information in voting
Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Equality and Abductive Residua for Horn Clauses
Extensions of dynamic programming for multi-stage combinatorial optimization
An algebraic characterization of semirings for which the support of every recognizable series is recognizable
Maximal degenerate palindromes with gaps and mismatches
Rewriting logic: roadmap and bibliography
A general lower bound for collaborative tree exploration
Termination Proofs for Term Rewriting Systems by Lexicographic Path Orderings Imply Multiply Recursive Derivation Lengths
Off-line temporary tasks assignment
Private least absolute deviations with heavy-tailed data
Lexicographic Generation of Ordered Trees
A Hoare-Like Verification System for a Language with an Exception Handling Mechanism
Polynomial and APX-hard cases of the individual haplotyping problem
Complexity results on branching-time pushdown model checking
Grammatical characterizations of NPDAs and VPDAs with counters
Characterisations of balanced words via orderings
Compact Normalisation Trace via Lazy Rewriting
Optimal Wavelength Routing on Directed Fiber Trees
Locally consistent constraint satisfaction problems
Computational complexity of covering three-vertex multigraphs
A new algorithm for regularizing one-letter context-free grammars
Complex-demand scheduling problem with application in smart grid
Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs
On Solving Star Equations
Optimal Covering of Cacti by Vertex-Disjoint Paths
State complexity of finite partial languages
The parameterized complexity of editing graphs for bounded degeneracy
On the equality constraints tolerance of Constrained Optimization Problems
Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n 2 logn) time
Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities
Motif statistics
L Codes and Number Systems
Measuring teachability using variants of the teaching dimension
Decision problems in membrane systems with peripheral proteins, transport and evolution
An algorithm for recognition of n-collapsing words
Probabilistic model checking of biological systems with uncertain kinetic rates
On the entropy of regular languages
Verification in loosely synchronous queue-connected discrete timed automata
Non-inclusive g-extra diagnosability of interconnection networks under PMC model
Truncating abstraction of bit-vector operations for BDD-based SMT solvers
Induced disjoint paths in circular-arc graphs in linear time
Arithmetical complexity of symmetric D0L words
On the average number of regularities in a word
Bisimulations for weighted automata over an additively idempotent semiring
An optical model of computation
Computing fair and efficient allocations with few utility values
Abstraction for concurrent objects
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Online graph exploration: New results on old and new algorithms
Fault-tolerant path embedding in folded hypercubes with both node and edge faults
Worst case compromises in matroids with applications to the allocation of indivisible goods
Minimal cover-automata for finite languages
The k -power domination problem in weighted trees
Not every domain of a plain decompressor contains the domain of a prefix-free one
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Weighted simple reset pushdown automata
A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints
Prefix-free regular languages and pattern matching
Filling crosswords is very hard
Delay-insensitivity and ternary simulation
On the complexity of linear temporal logic with team semantics
Self-stabilizing indulgent zero-degrading binary consensus
Comparison of Two Graph-Rewrite Systems
The choice of the offspring population size in the (1, λ) evolutionary algorithm
Résolutions universelles pour des problèmes NP-complets
The label cut problem with respect to path length and label frequency
A note on the neighbor sum distinguishing total coloring of planar graphs
Efficiently covering complex networks with cliques of similar vertices
On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Minimization of the number of ADMs in SONET rings with maximum throughput with implications to the traffic grooming problem
On the Chomsky and Stanley's Homomorphic Characterization of Context-Free Languages
Efficient on-line repetition detection
Sur la Liaison Entre Problemes Combinatoires et Algorithmiques
Exact learning from an honest teacher that answers membership queries
Topics in the theory of DNA computing
Chosen-ciphertext secure multi-hop identity-based conditional proxy re-encryption with constant-size ciphertexts
Adding Closed World Assumptions to Well-Founded Semantics
Arc fault tolerance of Kautz digraphs
The generalization of scheduling with machine cost
An optimal algorithm for 2-bounded delay buffer management with lookahead
Three dimensional Narayana and Schröder numbers
The Equivalence in the DCP Model
On the OBDD complexity of the most significant bit of integer multiplication
A Typed Calculuc Based on a Fragment of Linear Logic
Representability of Locally Compact Regular Spaces by Domains and Formal Spaces
Combinatory Reduction Systems: Introduction and Survey
On the complexity of minimum maximal uniquely restricted matching
Approximation results on resource leveling problems
Linear time algorithms for two disjoint paths problems on directed acyclic graphs
Compressed indexes for text with wildcards
Kolmogorov entropy in the context of computability theory
Priority queues with binary priorities
Guest Editorial: Special issue on Structural Information and Communication Complexity
Syntactic control of concurrency
The conflict-free Reduction Geometry
1st International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001) - Preface
Distance-restricted firefighting on finite graphs
Universal insertion grammars of size two
An O (T log T) Reduction from RAM Computations to Satisfiability
Area-time tradeoffs for universal VLSI circuits
Buffer management of multi-queue QoS switches with class segregation
Fault containment in weakly stabilizing systems
A subquadratic certification scheme for P5-free graphs
Erratum/Correction to "On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering" [Theor. Comput. Sci. 732 (2018) 26-45]
The ARNN model relativises P=NP and P!=NP
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Nondeterministic Flowchart Programs with Recursive Procedures: Semantics and Correctness II
Weak Completeness in E and E_2
On the parameterized complexity of the acyclic matching problem
A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
How to play Thue games
Rainbow graph splitting
From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic
Discriminating code and set cover with k-bend paths
Inferring the Equivalence of Functional Programs That Mutate Data
Dispersing and grouping points on planar segments
Multidimensional cellular automata: closing property, quasi-expansivity, and (un)decidability issues
Pure Nash equilibria in a generalization of congestion games allowing resource failures
Heuristic algorithms for two machine re-entrant flow shop
A Calculus for the Random Generation of Labelled Combinatorial Structures
Data Types with Errors and Exceptions
Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
The component model for elementary landscapes and partial neighborhoods
Compressed depth sequences
Decidability and k -regular sequences
0-1 Laws by Preservation
Solving dynamic labeling problems to optimality using solution space reductions
Functional Equations Associated with Congruential Functions
Sound and complete computational interpretation of symbolic hashes in the standard model
Yet another canonical nondeterministic automaton
Repeatable Words for Substitution
The evaluation of first-order substitution is monadic second-order compatible
Two-sided context specifications in formal grammars
Tree-based picture generation
Simplifying the weft hierarchy
A Construction on Finite Automata that has Remained Hidden
Finite-state concurrent programs can be expressed in pairwise normal form
The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures
From wait-free to arbitrary concurrent solo executions in colorless distributed computing
Smoothness prior approach to explore mean structure in large-scale time series
On the scalability of biocomputing algorithms: The case of the maximum clique problem
Modularity in Noncopying Term Rewriting
General restrictions of Wythoff-like games
An inclusion hierarchy of irreversible dynamos
The Structure of Logarithmic Advice Complexity Classes
On the pi-Calculus and Linear Logic
Complexity of finite-variable fragments of propositional temporal and modal logics of computation
On Space-Bounded Synchronized Alternating Turing Machines
Robustness of temporal logic specifications for continuous-time signals
Fast Algorithms Constructing Minimal Subalgebras, Congruences, and Ideals in a Finite Algebra
Temperature aware online algorithms for scheduling equal length jobs
Contributions of Ronald V. Book to the Theory of String-Rewriting Systems
Semi-online scheduling on a single machine with unexpected breakdown
Deciding the winner in k rounds for DISJOINT ARROWS, a new combinatorial partizan game
Responsiveness in process calculi
On the Simulation of Many Storage Heads by One
Online companion caching
More effective crossover operators for the all-pairs shortest path problem
Specification and proof in membership equational logic
Erratum to "Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets"
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
A parameterized perspective of all-colors
Fine-grained polynomial functional encryption
A hierarchy of local decision
Adaptive learning of compressible strings
Rigorous approximated determinization of weighted automata
On the Petri net realization of context-free graphs
Computational ludics
The ESPRIT Basic Research Working Group COMPUGRAPH "Computing by Graph Transformation": A Survey
Correctness of concurrent executions of closed nested transactions in transactional memory systems
On d-Spaces
Co-Induction in Relational Semantics
Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos)
Modular strategies for recursive game graphs
All superlinear inverse schemes are coNP-hard
Complexity and monotonicity results for domination games
Faster leader election via mobile agents and its applications
Applications of an Infinite Square-Free CO-CFL
Fault diagnosability of data center networks
Minimum light number of lit-only sigma-game on a tree
Generic constructions for behavioral specifications
Public key encryption with equality test via hash proof system
A quantitative study of fork-join processes with non-deterministic choice: Application to the statistical exploration of the state-space
Generalized rainbow connectivity of graphs
Cluster connectivity and super cluster connectivity of half hypercube networks
A note on the paper by Murat Cenk and Ferruh Ozbudak "Multiplication of polynomials modulo x n ", Theoret. Comput. Sci. 412(2011) 3451-3462
Adequacy for a Lazy Functional Language with Recursive and Polymorphic Types
Why greed works for shortest common superstring problem
On the aperiodic avoidability of binary patterns with variables and reversals
The growth function of context-free languages
Unbounded-error quantum query complexity
Stand up indulgent gathering
A note on sparse solutions of sparse linear systems
Combinatorial properties of Farey graphs
Decidability of "Skolem Matrix Emptiness Problem" Entails Constructability of Exact Regular Expression
Complexity of modification problems for best match graphs
A note on iterated duals of certain topological spaces
Analyzing the dynamics of stigmergetic interactions through pheromone games
On a Special Monoid with a Single Defining Relation
A category of compositional domain-models for separable Stone spaces
Connectionist computations of intuitionistic reasoning
Augmenting the discrete timed automaton with other data structures
Interactive proofs with quantum finite automata
Incremental Constraint Satisfaction for Equational Logic Programming
Catalytic P systems, semilinear sets, and vector addition systems
Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs
A quantum-inspired multimodal sentiment analysis framework
Regular switching components
Cellular automata and bootstrap percolation
Maude: specification and programming in rewriting logic
Restricted default theories: Expressive power and outlier detection tasks
Extended admissibility
Deciding Bisimilarity of Normed Context-Free Processes is in Sigma^p_2
2-Coloring number revisited
Ideal regular languages and strongly connected synchronizing automata
Computing the nearest polynomial to multiple given polynomials with a given zero via l 2, q -norm minimization
Threshold counters with increments and decrements
Information Systems for Continuous Posets
Recognizing frozen variables in constraint satisfaction problems
An improved deterministic local search algorithm for 3-SAT
An axiomatic approach to structuring specifications
Canonical Positions for the Factors in Paperfolding Sequences
Special issue on ALT 2017: Guest Editors' Introduction
Implicit Language Equations: Existence and Uniqueness of Solutions
Towards characterizing the non-locality of entangled quantum states
Faster parameterized algorithms for minor containment
Sand piles: From physics to cellular automata models
Iterated uniform finite-state transducers on unary languages
On miniaturized problems in parameterized complexity theory
Process algebra for performance evaluation
Problems and algorithms for covering arrays via set covers
Algorithms for fair partitioning of convex polygons
Deterministic Analysis of Queueing Systems with Heterogeneous Servers
Tight upper and lower bounds on suffix tree breadth
Minimum vertex cover in generalized random graphs with power law degree distribution
Cost distribution of the Chang-Roberts leader election algorithm and related problems
Parameterized model checking of networks of timed automata with Boolean guards
On exact algorithms for the permutation CSP
Shift-invariant topologies for the Cantor space X ω
Infinite Trees and Automation-Definable Relations over omega-Words
Fundamental Properties of Infinite Trees
Foreword: Special Volume of TAPSOFT 1995 Papers
Combinatorics for smaller kernels: The differential of a graph
Online interval coloring with packing constraints
Filter Models for Conjunctive-Disjunctive lambda-Calculi
A Syntactic Theory of Sequential State
Direct solution of piecewise linear systems
Information systems revisited - the general continuous case
On Abelian Squares and Substitutions
Geometric Containment and Vector Dominance
Efficient High-Level Parallel Programming
Optimal oblivious routing on d-dimensional meshes
The g -component connectivity of graphs
QUBO formulations for the graph isomorphism problem and related problems
Joining Specification Statements
Proving weak properties of rewriting
On computing graph minor obstruction sets
Complete characterization for the fit-preserving data refinement of mass-action reaction networks
State complexity of pattern matching in regular languages
On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity
A timed semantics of Orc
Self-assembly of infinite structures: A survey
Restriction categories as enriched categories
Index Sets in Computable Analysis
A Deterministic Algorithm for Modular Knapsack Problems
Processes as formal power series: A coinductive approach to denotational semantics
Analog Computation via Neural Networks
The exact spanning ratio of the parallelogram Delaunay graph
Multi-Pattern Languages
Binary intersection formalized
A Graph-Based Regularity Test for Deterministic Context-free Languages
New and improved algorithms for unordered tree inclusion
Bandit online optimization over the permutahedron
Reinforcing privacy in cloud computing via adaptively secure non-zero inner product encryption and anonymous identity-based revocation in unbounded setting
On the performance of learned data structures
On boundaries of highly visible spaces and applications
Evolutionary fuzzy clustering of relational data
How hard is safe bribery?
A transition system semantics for the control-driven coordination language MANIFOLD
Retraction notice to "Optimizing Scalability and Availability of Cloud Based Software Services Using Modified Scale Rate Limiting Algorithm" [Theoretical computer science 943 (2023) 230-240]
Computational and Attribute Models of Formal Languages
Padding, Commitment and Self-Reducibility
One-way reversible multi-head finite automata
The R g -conditional diagnosability of international networks
On-line scheduling with delivery time on a single batch machine
Studies on finite Sturmian words
Shuffle operations on discrete paths
Modular Aspects of Term Graph Rewriting
Single-machine batch scheduling of linear deteriorating jobs
Bicriteria algorithms to balance coverage and cost in team formation under online model
Algorithmic aspects of homophyly of networks
Leader election in rings of ambient processes
Optimisation of electrical network configuration: Complexity and algorithms for ring topologies
Reachability for airline networks: fast algorithm for shortest path problem with time windows
Sorting permutations and binary strings by length-weighted rearrangements
Pictures of Functions and Their Acceptability by Automata
Tight results for Next Fit and Worst Fit with resource augmentation
A graph isomorphism condition and equivalence of reaction systems
Subtyping Can Have a Simple Semantics
Properties of Grammatical Codes of Trees
Petri Nets and Large Finite Sets
On Some Natural Complete Operators
The essence of ideal completion in quantitative form
Dynamics of a generic Brownian motion: Recursive aspects
Rumor spreading in social networks
Online presentations of finitely generated structures
Reachability in restricted chemical reaction networks
Improved bounds for two query adaptive bitprobe schemes storing five elements
Parallel communicating limited and uniformly limited 0L systems