yusuke1997/dblp-id-title huggingface dataset:
Approximation of set multi-cover via hypergraph matching
Frugal bribery in voting
More on the Magnus-Derek game
LTL over integer periodicity constraints
Non-reducible descriptions for conditional Kolmogorov complexity
On a Complexity of the Formula ( A vee B ) ===> C
The super connectivity of the pancake graphs and the super laceability of the star graphs
Puzzle and Dragons is hard
Efficient dynamic dictionary matching with DAWGs and AC-automata
Nonprimitive recursive complexity and undecidability for Petri net equivalences
Strip tiling and regular grammars
Numerical P systems with production thresholds
An Event Structure Semantics for General Petri Nets
Semantics of Order-Sorted Specifications
Public vs. private randomness in simultaneous multi-party communication complexity
Extensional concepts in intensional type theory, revisited
The sum of digits functions of the Zeckendorf and the base phi expansions
Entropy of Contact Circuits and Lower Bounds on Their Complexity
A defect theorem for bi-infinite words
Streaming adaptive submodular maximization
Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
Bounds on the bisection width for random d -regular graphs
On list update and work function algorithms
"A la Burstall" Intermittent Assertions Induction Principles for Proving Inevitable Ability Properties of Programs
On Quasilinear-Time Complexity Theory
The heart of intersection type assignment: Normalisation proofs revisited
Categories of Chain-Complete Posets
Approximation of event probabilities in noisy cellular processes
Maximum bipartite flow in networks with adaptive channel width
Resolution of Hartmanis' conjecture for NL-hard sparse sets
Simulation of Spatial P system models
Designing and implementing algorithms for the closest string problem
A Completeness Result for Allowed Semi-Strict Programs with Respect to Well-Behaved and Allowed Query Clauses
Metrics for weighted transition systems: Axiomatization and complexity
Team assembling problem for asynchronous heterogeneous mobile robots
Learning a subclass of regular patterns in polynomial time
Preface to special issue on Theory and Applications of Graph Searching
Complexity analysis of balloon drawing for rooted trees
Towards zero knowledge argument for double discrete logarithm with constant cost
Balance problems for integer circuits
Positive Relativizations for Log Space Computability
Graph isomorphism restricted by lists
Parallel addition in non-standard numeration systems
Compositional semantics and behavioural equivalences for reaction systems with restriction
sigma-Automata and Chebyshev-Polynomials
On mixed linear layouts of series-parallel graphs
Repetition avoidance in products of factors
Sorting via shuffles with a cut after the longest increasing prefix
State complexity of prefix distance
On Kleene Algebras
Proving Partial Order Properties
Shuffle factorization is unique
On the power of lookahead in on-line server routing problems
Distributivity of categories of coalgebras
Bounds on the max and min bisection of random cubic and random 4-regular graphs
De la logique aux pavages
Approximation algorithms for fuzzy C -means problem based on seeding method
Characterizing attributed tree translations in terms of macro tree transducers
Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography
Parallel and Distributed Derivations in the Single-Pushout Approach
The parameterized complexity landscape of finding 2-partitions of digraphs
Classifying regular languages by a split game
Learning algebraic structures with the help of Borel equivalence relations
Document retrieval with one wildcard
Eccentricity queries and beyond using hub labels
Generalized and geometric Ramsey numbers for cycles
Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
The zero-visibility cops and robber game on graph products
Grey-box steganography
Constructing two completely independent spanning trees in hypercube-variant networks
Foreword in honor of Glynn Winskel
The complexity of functions on lattices
On quasi-open bisimulation
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
Exact symbolic-numeric computation of planar algebraic curves
Complexity and bounds for disjunctive total bondage
Probabilistic diagnosis of clustered faults for hypercube-based multiprocessor system
Lattices of local two-dimensional languages
Additive symmetries: the non-negative case
Chosen ciphertext attacks on lattice-based public key encryption and modern (non-quantum) cryptography in a quantum environment
Bialgebras for structural operational semantics: An introduction
Recognizable Picture Languages and Domino Tiling
Languages with mismatches
Descriptional Complexity of Formal Systems
Abelian-square-rich words
P systems with minimal parallelism
On weight function methods in Chooser-Picker games
Intersection Type Assignment Systems
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
Structural operational semantics for non-deterministic processes with quantitative aspects
Pseudorandom generators against advised context-free languages
Aperiodic tilings and entropy
A General Conservative Extension Theorem in Process Algebras with Inequalities
On the Parallel Complexity of Loops
Whom to befriend to influence people
An alternative proof for the equivalence of ∞-searcher and 2-searcher
On Horn Spectra
Nonsymmetric *-Autonomous Categories
Distributed approximation for f-matching
Window-games between TCP flows
On Bounded Query Machines
Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus
Underspecification for a simple process algebra of recursive processes
Categorical Fixed Point Semantics
Computable Identities in the Algebra of Formal Matrices
Column subset selection via sparse approximation of SVD
Expanders and time-restricted branching programs
CASL: the Common Algebraic Specification Language
A Characterization of Power-Free Morphisms
CSP-CASL - A new integration of process algebra and algebraic specification
Algebraic Myhill-Nerode Theorems
Treewidth and minimum fill-in on permutation graphs in linear time
The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited
Two new identity-based threshold ring signature schemes
The Equational Logic of Fixed Points (Tutorial)
Cancellation in Context-Free Languages: Enrichment by Reduction
Minimum color spanning circle of imprecise points
On the directional dynamics of additive cellular automata
How to whack moles
Graph Properties for Normal Logic Programs
Some Observations on the Connection Between Counting an Recursion
A Necessary Condition for the Rationality of the Zeta Function of a Regular Language
Comprehension Categories and the Semantics of Type Dependency
Complete Problems for Monotone NP
On Multiplication in Algebraic Extension Fields
Graph clustering via generalized colorings
Variants of derivation modes for which purely catalytic P systems are computationally complete
Approximate counting with m counters: A detailed analysis
Disjunctive sums of quasi-nimbers
Construction of strongly connected dominating sets in asymmetric multihop wireless networks
Revocable hierarchical identity-based encryption
Disposability in square-free words
On an extension of the Sort & Search method with application to scheduling theory
Lower Bounds for the Size of Expressions for Certain Functions in d -Ary Logic
Probabilistic approach to the Satisfiability Problem
New upper bounds to the limitedness of distance automata
The maximum edge-disjoint paths problem in complete graphs
Independent dominating set problem revisited
Set graphs. II. Complexity of set graph recognition and similar problems
A gap property of deterministic tree languages
Fast radio broadcasting with advice
Neighbor sum distinguishing total coloring of planar graphs without 5-cycles
A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in P-omega
Repeatedly matching items to agents fairly and efficiently
Recursive Construction of Periodic Steady State for Neural Networks
On the Classifiability of Cellular Automata
On Time-Space Classes and their Relation to the Theory of Real Addition
M p UFLP: Universal facility location problem in the p -th power of metric space
The weighted k -center problem in trees for fixed k
Alternation in two-way finite automata
Computational aspects of mining maximal frequent patterns
Embedding rectilinear Steiner trees with length restrictions
Range partitioning within sublinear time: Algorithms and lower bounds
On the complexity of constructing minimum changeover cost arborescences
Lattice Boltzmann Computations and Applications to Physics
Proving Program Inclusion Using Hoare's Logic
On a Sequence of Rational Functions
Linear Dynamic Kahn Networks are Deterministic
A Combinatory Logic Approach to Higher-Order E-Unification
Learning power and language expressiveness
Local Languages and the Berry-Sethi Algorithm
Approximating the online set multicover problems via randomized winnowing
Novel geometric approach for virtual coiling
Amortized efficiency of generating planar paths in convex position
Parallel Reduction in Type Free lambda/mu-Calculus
Using bisimulation proof techniques for the analysis of distributed abstract machines
Simulations between Cellular Automata on Cayley Graphs
All-pairs nearly 2-approximate shortest paths in I time
Functorial Polymorphism
Optimal deterministic group testing algorithms to estimate the number of defectives
Hierarchies of total functionals over the reals
TACAS 2003 Special Issue - Preface
An Efficient Decision Procedure for the Theory of Rational Order
Principal Component Analysis in the local differential privacy model
Gray code generation of binary trees encoded in left-child sequences
PSPACE-completeness of majority automata networks
Constraint Markov Chains
On the simplification of infinite morphic words
Walks on tilings of polygons
Modelling evolution of communication platforms and scenarios based on transformations of high-level nets and processes
The monad on strong quasi-metric spaces
Quasi-injective Reductions
Approximation and hardness results for the Max k -Uncut problem
Algebraic-coalgebraic recursion theory of history-dependent dynamical system models
Toward Grünbaum's conjecture bounding vertices of degree 4
P-complete Problems in Data Compression
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete
Algebraic data retrieval algorithms for multi-channel wireless data broadcast
Minimizing the total completion time for a class of semi-online single machine scheduling problems
A faster algorithm for independent cut
Sublogarithmic ambiguity
Characterizations of non-associative ordered semigroups by their fuzzy bi-ideals
Approximation algorithms for channel assignment with constraints
Switching Functions Whose Monotone Complexity is Nearly Quadratic
Conditional diagnosability of optical multi-mesh hypercube networks under the comparison diagnosis model
Doubly spatial encryption from DBDH
Synthesizing noise-tolerant language learners
Left Ideals and Reachability in Machines
Conjunctive query containment revisited
On concurrent behaviors and focusing in linear logic
Towards reasoning about Petri nets: A Propositional Dynamic Logic based approach
Foundational aspects of multiscale digitization
On the sensitivity of additive cellular automata in Besicovitch topologies
A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets
A compactness property of the k -abelian monoids
Faster gossiping on butterfly networks
Configuration structures, event structures and Petri nets
Skew and infinitary formal power series
On temporal logic versus datalog
Kripke semantics for higher-order type theory applied to constraint logic programming languages
The combinatorics of hidden diversity
On infinite transition graphs having a decidable monadic theory
Uncertainty representation in dynamical systems using rough set theory
Bounded budget betweenness centrality game for strategic network formations
Polynomial kernels for hitting forbidden minors under structural parameterizations
Multiplication of polynomials modulo x n
Efficient iteration in admissible combinatorial classes
Minor embedding in broken chimera and derived graphs is NP-complete
The counting complexity of group-definable languages
Scheduling for weighted flow time and energy with rejection penalty
On Pure, Terminal Invariant and Nonterminal Invariant Interpretations of E0L Forms
Parallel Parsing on a One-Way Linear Array of Finite-State Machines
Past pushdown timed automata and safety verification
Improved algorithms for the farthest colored Voronoi diagram of segments
Faster algorithms for vertex partitioning problems parameterized by clique-width
Minimal non-convex words
Call-by-name, Call-by-value, Call-by-need and the Linear lambda Calculus
Unfolding state variables improves model checking performance
Fair Termination Revisited-With Delay
Actor Languages Their Syntax, Semantics, Translation, and Equivalence
The Undecidability of the Unrestricted Modified Edit Distance
Nondeterministic communication complexity with help and graph functions
Deterministic versus Nondeterministic Space in Terms of Synchronized Alternating Machines
Quantum automata for some multiperiodic languages
A computational proof of complexity of some restricted counting problems
A Linear Algorithm to Tile the Trapezes with h_m and v_n
Conflict-free chromatic index of trees
Directed hypergraphs: Introduction and fundamental algorithms - A survey
Computing Boolean functions from multiple faulty copies of input bits
Feedback vertex sets in mesh-based networks
n-Level Rewriting Systems
The Autonomous Data Language - Concepts, design and formal verification
Moves and displacements of particular elements in Quicksort
Equilibria in Doodle polls under three tie-breaking rules
Graph automata
Removing Ramsey Theory: Lower Bounds With Smaller Domain Size
Computing isolated roots of sparse polynomial systems in affine space
On model checking for the µ-calculus and its fragments
Fast approximation algorithms for job scheduling with processing set restrictions
Max NP-completeness Made Easy
Increasing the minimum degree of a graph by contractions
The diameter of rectangular twisted torus
Synchronization of musical words
On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code
Loop checks for logic programs with functions
Continuous monitoring in the dynamic sensor field model
The Möbius Function of Factor Order
A timed calculus for wireless systems
Stable matching with uncertain pairwise preferences
Randomized algorithm for the sum selection problem
A Unified Theory of Interconnection Network Structure
Joint realizability of monotone Boolean functions
Distance graph on Z n with norm
Duality for Modal mu-Logics
Reversibility of elementary cellular automata with fully asynchronous updating: An analysis of the rules with partial recurrence
Whither semantics?
Closest substring problems for regular languages
Posets and permutations in the duplication-loss model: Minimal permutations with d descents
A public key cryptosystem based on three new provable problems
Towards a Computation System Based on Set Theory
Gathering on a circle with limited visibility by anonymous oblivious robots
Finding the most vital node of a shortest path
Circumscribing DATALOG: Expressive Power and Complexity
Coherence for sharing proof-nets
Intrinsic universality in automata networks III: On symmetry versus asynchrony
Offline variants of the "lion and man" problem: - Some problems and techniques for measuring crowdedness and for safe path planning -
Deleting string rewriting systems preserve regularity
Frontiers of Computability, Randomness, and Complexity (dedicated to the 70th birthday of Professor Cristian Calude)
Computing with Truly Asynchronous Threshold Logic Networks
Predictable semiautomata
On congruences of automata defined by directed graphs
Symmetric Discrete Universal Neural Networks
On demand string sorting over unbounded alphabets
Paracategories I: internal paracategories and saturated partial algebras
A linear time algorithm for the r -gathering problem on the line
Constructing a Third-Order Linear Differential Equation
Object grammars and bijections
Logic Program Synthesis from First-Order Logic Specifications
A formal framework for specifying sequent calculus proof systems
A Corrected 5NF Definition for Relational Database Design
A Unifying View for Logic Programming with Non-Monotonic Reasoning
Relations between adjacency trees
On the Complexity of Parallel Parsing of General Context-Free Languages
On the usability of process algebra: An architectural view
Approximation algorithms for minimum ply covering of points with unit squares and unit disks
Exponential Upper and Lower Bounds for the Order of a Regular Language
Strong completeness of a narrowing calculus for conditional rewrite systems with extra variables
A powerful abelian square-free substitution over 4 letters
On Combinatory Algebras and their Expansions
Locally complete sets and finite decomposable codes
Pushdown Cellular Automata
Two important parameters of HPMC model
Kolmogorov complexity and non-determinism
Probabilistic event structures and domains
An Analysis of Böhm's Theorem
An approximate cost recovery scheme for the k-product facility location game with penalties
A short solution for the HDT0L sequence equivalence problem
A Complete Equational Axiomatization for MPA with String Iteration
Towards composable computations by RNA co-transcriptional folding: A proof-of-concept demonstration of nested loops in oritatami
Makanin's Algorithm is not Primitive Recursive
A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
Finite-Memory Automata
Regular frequency computations
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Order based algorithms for the core maintenance problem on edge-weighted graphs
Categorial dependency grammars
Deterministic catalytic systems are not universal
Repairing time-determinism in the process algebra for hybrid systems ACP hs srt
Estimating the subsystem reliability of bubblesort networks
Preface: STRATEGIES 2001
On Computational Complexity and Honest Polynomial Degrees
Kadanoff sand pile model. Avalanche structure and wave shape
Deciding the feasibility of a given throughput rate in 2-cyclic robotic scheduling
Inferring a level-1 phylogenetic network from a dense set of rooted triplets
A competitive strategy for distance-aware online shape allocation
A non-topological view of dcpos as convergence spaces
Verifiable Crowd Computing: Coping with bounded rationality
Algorithms for Shortest Path Tour Problem
Generalized predecessor existence problems for Boolean finite dynamical systems on directed graphs
Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools
The Complexity of Finding Minimum-Length Generator Sequences
Online hierarchical scheduling: An approach using mathematical programming
Predictors for flat membrane systems
A contour integral approach to the computation of invariant pairs
Undecidable questions related to Church-Rosser Thue systems
A fully abstract denotational semantics for the calculus of higher-order communicating systems
Fault-diagnosis of grid structures
Evaluation Strategies for Functional Logic Programming
Natural Termination
Improving the average delay of sorting
One Head Machines from a symbolic approach
A trajectory-based strict semantics for program slicing
On z-factorization and c-factorization of standard episturmian words
Quasi-rocking real-time pushdown automata
Separation of Complexity Classes in Koiran's Weak Model
Jumping robbers in digraphs
Linear Indexed Languages
On the polynomial depth of various sets of random strings
Efficient Sampling Strategies for Relational Database Operations
Approximation Properties of Abstract Data Types
On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality
From finite state grammars to natural computing - In memory of Solomon Marcus
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties
Distributed transformations of Hamiltonian shapes based on line moves
Programming in Metric Temporal Logic
A formalization of parallel data exchange algorithms used by numerical methods for solving partial differential equations
Properties of right one-way jumping finite automata
Circular right-angle crossing drawings in linear time
Saving Comparisons in the Crochemore-Perrin String-Matching Algorithm
Approximating Max k -Uncut via LP-rounding plus greed, with applications to Densest k -Subgraph
Competitive profit maximization in social networks
Marvellous Interpretations Differ Little but Decisively from Ordinary Interpretations of EOL Forms
Reprint of: ω -Lyndon words
Chess endgames: 6-man data and strategy
Fuzzy reasoning spiking neural P systems revisited: A formalization
Efficient Algorithms for a Mixed k -Partition Problem of Graphs Without Specifying Bases
The genus of regular languages and directed graph emulators
The quantum query complexity of the abelian hidden subgroup problem
On parsing and condensing substrings of LR languages in linear time
On the largest Cartesian closed category of stable domains
Constructing Process Categories
Complementing unary nondeterministic automata
Space-time trade-offs for finding shortest unique substrings and maximal unique matches
A random algorithm for profit maximization in online social networks
Parametricity as Isomorphism
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
On the Complexity of Theories of Permutations
Arbitrage opportunities across sponsored search markets
On the existence of a cherry-picking sequence
Transcendence of Formal Power Series with Rational Coefficients
Reliability evaluation of half hypercube networks
Computational efficiency and universality of timed P systems with active membranes
Optimal strategies for maintaining a chain of relays between an explorer and a base camp
Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers
Coded equivalence of one-sided topological Markov shifts
Edge-independent spanning trees in folded crossed cubes
Constructing a Realtime Deterministic Pushdown Automaton from a Grammar
Probabilistic analysis of algorithms for the Dutch national flag problem
Embedding problems for paths with direction constrained edges
Jump complexity of finite automata with translucent letters
On knot-free vertex deletion: Fine-grained parameterized complexity analysis of a deadlock resolution graph problem
Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem
A better approximation for constructing virtual backbone in 3D wireless ad-hoc networks
Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
Online circle and sphere packing
Estimation-of-distribution algorithms for multi-valued decision variables
Deciding sequentiability of finite-state transducers by finite-state pattern-matching
The complexity of the characterization of networks supporting shortest-path interval routing
A proof system for unified temporal logic
On a structural property in the state complexity of projected regular languages
Complexity and algorithms for recognizing polar and monopolar graphs
Bottom-Up Evaluation and Query Optimization of Well-Founded Models
Valentin M. Antimirov (1961-1995)
Replicated multistage interconnection networks: QoS evaluation for parallel and distributed computing
An algorithm for random signed 3-SAT with intervals
Greedy algorithms, H-colourings and a complexity-theoretic dichotomy
Periodicity, repetitions, and orbits of an automatic sequence
The cycle-structure connectivity of crossed cubes
On the state complexity of reversals of regular languages