yusuke1997/dblp-id-title huggingface dataset:
Iterative Algebras
On the Size of Classes with Weak Membership Properties
Multilevel transitive and intransitive non-interference, causally
Monadic Partition Logics and Finite Automata
Algebraic methods proving Sauer's bound for teaching complexity
Some Simplified NP-Complete Graph Problems
Extracting a data flow analyser in constructive logic
Generalized Automata on Infinite Trees and Muller-McNaughton's Theorem
Improved algorithms for bandit with graph feedback via regret decomposition
Discrete applied problems, cellular automata and lattices: florilegium for E. Goles
The complexity of Solitaire
Approximating the revenue maximization problem with sharp demands
Algebraic Construction of Compliers
Preface: Theory and applications of models of computation
Formalism and method
Better bounds for online k-frame throughput maximization in network switches
Cryptanalysis of the RSA variant based on cubic Pell equation
Local checkability, no strings attached: (A)cyclicity, reachability, loop free updates in SDNs
Adaptive star grammars and their languages
Complete axiomatization and decidability of Alternating-time temporal logic
Vector team automata
Rush Hour is PSPACE-complete, or "Why you should generously tip parking lot attendants"
Deciding atomicity of subword-closed languages
Computing LOGCFL certificates
Shortest Curves in Planar Regions with Curved Boundary
The Comparison of a CPO-based Semantics with a CMS-based semantics for CSP
An algebraic method to fidelity-based model checking over quantum Markov chains
New algorithms for fair k-center problem with outliers and capacity constraints
Performance analysis of the simultaneous perturbation stochastic approximation algorithm on the noisy sphere model
The guarding game is E-complete
Uniform multi-hop all-to-all optical routings in rings
Generating square-free words efficiently
On the Computational Complexity of Prolog Programs
Inductively Inferring Valid Logical Models of Continuous-State Dynamical Systems
Translating Xd-C programs to MSVL programs
Verifiable multi-secret sharing based on LFSR sequences
On the Notion of Expressiveness and the Rule of Adaption
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
System Modelling with High-Level Petri Nets
An inexact-suffix-tree-based algorithm for detecting extensible patterns
On Reversal Bounded Alternating Turing Machines
Stratified negation in temporal logic programming and the cycle-sum test
Designing Equivalent Semantic Models for Process Creation
Approximation algorithm for the balanced 2-connected k-partition problem
2 mm: A new technique for sorting data
Proper 2-coloring game on some trees
Reductions and functors from problems to word problems
A logic of separating modalities
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Power of uninitialized qubits in shallow quantum circuits
Canonical Forms for Interval Functions
Throttling processes equivalent to full throttling on trees
DPDA's in 'Atomic Normal Form' and Applications to Equivalence Problems
Univariate Polynomial Factorization Over Finite Fields
Andrei P. Ershov 1931-1988
Almost linear time algorithms for minsum k -sink problems on dynamic flow path networks
A Coalgebraic Foundation for Linear Time Semantics
Convexity and logical analysis of data
On the Number of Databases and Closure Operations
Optimization techniques for propositional intuitionistic logic and their implementation
Online scheduling of incompatible unit-length job families with lookahead
Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity
Bounding memory for Mastermind might not make it harder
Generalized sweeping line spanners
Frequency of symbol occurrences in bicomponent stochastic models
The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic
On ground tree transformations and congruences induced by tree automata
Typed event structures and the linear pi-calculus
Ordinal Recursive Bounds for Higman's Theorem
Error-tolerant nonadaptive interval group testing with density-based tests
Equivalence-Preserving First-Order Unfold/Fold Transformation Systems
Prime algebraicity
Updatable searchable symmetric encryption: Definitions and constructions
Graph Theoretic Models
A space lower bound for st-connectivity on node-named JAGs
Lower bounds for the sum of small-size algebraic branching programs
Monadic second-order logic on tree-like structures
Reversible Simulation of One-Dimensional Irreversible Cellular Automata
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
Linear deterministic multi bottom-up tree transducers
A new dynamic programming algorithm for the simplified partial digest problem
Query-monotonic Turing reductions
On the inapproximability of independent domination in 2P 3 -free perfect graphs
An axiom system for sequence-based specification
How many triangles and quadrilaterals are there in an n -dimensional augmented cube?
Approximating the max-edge-coloring problem
On Bounded Interpretations of Grammar Forms
On compatible triangulations with a minimum number of Steiner points
A Simple Proof for the Completeness of Floyd's Method
On Maximal Stable Functions
A survey on interval routing
Theory of Symbolic Expressions, I
Extraction and Verification of Programs by Analysis of Formal Proofs
Category theory of symbolic dynamics
A Short, Elementary and Easy WZ Proof of the Askey-Gasper Inequality That was Used by de Branges in his Proof of the Bieberbach Conjecture
On Nondeterminism in Parallel Computation
On the axiomatisability of priority III: Priority strikes again
Growth of bilinear maps III: decidability
A class of cubic Rauzy fractals
On the n-permutation Post Correspondence Problem
Uniform continuity of relations and nondeterministic cellular automata
Special Issue on the International Conference on Algorithmic Aspects in Information and Management 2019 (AAIM'19)
Detection of subtle variations as consensus motifs
Machine-based methods in parameterized complexity theory
Model-checking graded computation-tree logic with finite path semantics
Optimal Advice
Game theory analysis of biometric systems market: Users choice VS service providers revenue
Comprehensive characterization of the behaviors of estimation of distribution algorithms
Complete Restrictions of the Intersection Type Discipline
Analysis and design of molecular machines
The Nielsen Reduction and P-Complete Problems in Free Groups
Some Remarks on Non-Algebraic Adherences
An Algebraic Definition for Control Structures
The Algorithmic Analysis of Hybrid Systems
Differential δ -uniformity and non-linearity of permutations over Zn
The Complexity of Computing the Permanent
Edge-clique covers of the tensor product
Power and limits of distributed computing shared memory models
Some formal tools for analyzing quantum automata
Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register
Task group allocation for multi-load agent pickup and delivery problem
Prefac
Spiking neurons and the induction of finite state machines
On a Small Class of Boolean Sums
On the complexity of a problem related to set cover
Sharp thresholds for Hamiltonicity in random intersection graphs
Universal augmentation schemes for network navigability
Computing the nearest singular univariate polynomials with given root multiplicities
Efficient exhaustive listings of reversible one dimensional cellular automata
A descriptive complexity approach to the linear hierarchy
The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
The generalized measure of edge fault tolerance in exchanged crossed cube
Theory versus practice in annealing-based quantum computing
Minimizing machine assignment costs over Δ-approximate solutions of the scheduling problem P || C max
Derivation lengths and order types of Knuth-Bendix orders
Graph searching with advice
Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
Tutorial on separation results in process calculi via leader election problems
A Three-Word Code Which is Not Prefix-Suffix Composed
Kernel bounds for path and cycle problems
General linear relations between different types of predictive complexity
Embedding of tori and grids into twisted cubes
Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: Semantics and automated reasoning with theorem proving
Deciding whether four perfect matchings can cover the edges of a snark is NP-complete
A second step towards complexity-theoretic analogs of Rice's Theorem
Perfect Roman domination in graphs
Gathering in dynamic rings
Learning approximately optimal contracts
Complexity of clique coloring and related problems
An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence
(Eternal) vertex cover numbers of infinite and finite grid graphs
Finitely Generated Sofic Systems
Counting lattice paths taking steps in infinitely many directions under special access restrictions
A Representation of Trees by Languages II
Efficient live exploration of a dynamic ring with mobile robots
Online facility location with mobile facilities
Modelling concurrent interactions
Finding Transversals for Sets of Simple Geometric Figures
Visualizing differentially private mechanisms with physical cards
Verifying Identical Communicating Processes is Undecidable
Data gathering and personalized broadcasting in radio grids with interference
Randomised broadcasting: Memory vs. randomness
An improved electromagnetism-like algorithm for numerical optimization
Some Nonstandard Ramsey Like Applications
Inverse-limit and topological aspects of abstract interpretation
The g-good-neighbor conditional diagnosability of star graphs under the PMC and MM* model
Pricing commodities
Quantum and classical query complexities for generalized Simon's problem
Input-driven pushdown automata for edit distance neighborhood
Polyomino coloring and complex numbers
Topological Transformations as a Tool in the Design of Systolic Networks
Learning languages from positive data and a limited number of short counterexamples
Two-dimensional pattern matching against local and regular-like picture languages
On theta-palindromic richness
Mechanizing Structural Induction Part II: Strategies
Realization problems for nonuniform cellular automata
A Polynomial-Bisimilar Normalization for Reset Petri Nets
Formalising and implementing Boost POSIX regular expression matching
Multiple context-free tree grammars: Lexicalization and characterization
A best possible on-line algorithm for scheduling on uniform parallel-batch machines
Inapproximability results for graph convexity parameters
Learning elementary formal systems with queries
When an optimal dominating set with given constraints exists
One-reversal counter machines and multihead automata: Revisited
Sensitivity, affine transforms and quantum communication complexity
On weak odd domination and graph-based quantum secret sharing
Strings from linear recurrences and permutations: A Gray code
A syntactic correspondence between context-sensitive calculi and abstract machines
Walks confined in a quadrant are not always D-finite
Optimal Binary Search Trees
Dyck tableaux
The P(n)/n-function for bi-infinite words
Do stronger definitions of randomness exist?
Single machine scheduling with scenarios
Hamiltonian path in permutation graphs
Palindrome complexity
Fast rebalanced RSA signature scheme with typical prime generation
Parallel learning of automatic classes of languages
Algebraic and context-free subsets of subgroups
Digital lines with irrational slopes
Hard and easy instances of L-tromino tilings
NP-Completeness of st-orientations for plane graphs
On the Hopcroft's minimization technique for DFA and DFCA
Optimal placement of base stations in border surveillance using limited capacity drones
The Beachcombers' Problem: Walking and searching with mobile robots
The number and degree distribution of spanning trees in the Tower of Hanoi graph
On Generalized Newton Algorithms: Quadratic Convergence, Path-Following and Error Analysis
Hackenforb the chameleon: A game capable of mimicking (practically) any misère game
What does it mean to say that a physical system implements a computation?
Computing large matchings in planar graphs with fixed minimum degree
Can large fanin circuits perform reliable computations in the presence of faults?
Dipole codes attractively encode glue functions
Asymptotic normality for the size of graph tries built from M-ary tree labelings
Objects and their lambda calculus
The Qu-Prolog Unification Algorithm: Formalisation and Correctness
The switch operators and push-the-button games: A sequential compound over rulesets
Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
Self-stabilizing synchronous unison in directed networks
Minimum leaf out-branching and related problems
Application of Lempel-Ziv factorization to the approximation of grammar-based compression
Forbidden subgraphs in connected graphs
Orders, Reduction Graphs and Spectra
Asynchronous Automata Versus Asynchronous Cellular Automata
Firefighting on trees
Compatibility of convergence algorithms for autonomous mobile robots
Foundations of logic programming in hybrid logics with user-defined sharing
Optimal algorithms for online scheduling with bounded rearrangement at the end
On the algebraic models of lambda calculus
Learning classes of approximations to non-recursive function
Stochastic Independence, Algebraic Independence and Abstract Connectedness
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
Structural diagnosability of hypercubes under the PMC and MM* models
A topological perspective on distributed network algorithms
Analytical aspects of tie breaking
On the Probability of Occurrence of Labelled Subtrees of a Randomly Labelled Tree
Homotopy in Two-Dimensional Digital Images
Preface to the special issue on Graph Searching: Theory and Applications
Séries indicatrices et q-séries
A Denotational Semantics and Dataflow Construction for Logic Programs
Testing against a non-controllable stream X-machine using state counting
Space-efficient algorithms for computing minimal/shortest unique substrings
Some Relationships Between Logics of Programs and Complexity Theory
Improved simulation of nondeterministic Turing machines
Bisimulation-invariant PTIME and higher-dimensional µ-calculus
One-Way Functions and the Isomorphism Conjecture
Complexity theory for splicing systems
The Ciao Modular, Standalone Compiler and Its Generic Program Processing Library
The worst parallel Hanoi graphs
Source reversal and chip firing on graphs
From Computer Science to Biology and Back
A new dimension sensitive property for cellular automata
Infinite labeled trees: From rational to Sturmian trees
Faster deterministic sorting through better sampling
The Asynchronous Bounded-Cycle model
Equations on palindromes and circular words
Envy-free relaxations for goods, chores, and mixed items
Fair Petri Nets and Structural Induction for Rings of Processes
Recommending links through influence maximization
Decompositions of Nondeterministic Reductions
The Fourth Moment in Luby's Distribution
Locally-iterative (Δ + 1)-coloring in sublinear (in Δ) rounds
Generalized finite automata over real and complex numbers
Enumeration of subtrees and BC-subtrees with maximum degree no more than k in trees
Precise interprocedural dependence analysis of parallel programs
Sublinear message bounds of authenticated implicit Byzantine agreement
Small asynchronous P systems with inhibitors defining non-semilinear sets
Algebraic Processing of Programming Languages
On the commutative equivalence of bounded context-free and regular languages: The semi-linear case
Parameterized verification of time-sensitive models of ad hoc network protocols
How to construct physical zero-knowledge proofs for puzzles with a "single loop" condition
Hybrid commitments and their applications to zero-knowledge proof systems
Nonlinear spiking neural P systems with multiple channels
A compositional natural semantics and Hoare logic for low-level languages
Reasoning about block-based cloud storage systems via separation logic
An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
Super solutions of random (3 + p )-SAT
Open and closed scopes for constrained genericity
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees
A framework for linear authorization logics
One-sided random context grammars with a limited number of right random context rules
The connected greedy coloring game
A bijection between directed column-convex polyominoes and ordered trees of height at most three
Speeding up the detection of tandem repeats over the edit distance
Generation of various classes of trivalent graphs
Optimal algorithms for the online time series search problem
Sandpile models and lattices: a comprehensive survey
Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
Dynamic FTSS in asynchronous systems: The case of unison
Formalization of fractional order PD control systems in HOL4
Efficient random sampling of binary and unary-binary trees via holonomic equations
Following a curve with the discrete Fréchet distance
Inverse min-max spanning tree problem under the Weighted sum-type Hamming distance
Complexity and approximation of the Constrained Forest problem
Some Complexity Bounds for Subtype Inequalities
Backward type inference for XML queries
Near optimal colourability on hereditary graph families
Hypertree-depth and minors in hypergraphs
Optimal gathering in radio grids with interference
Almost envy-freeness for groups: Improved bounds via discrepancy theory
Holographic algorithms: The power of dimensionality resolved
String indexing for top- k close consecutive occurrences
Variants of iterative learning
Subversion-resilient signatures: Definitions, constructions and applications
On Infinite Words Obtained by Selective Substitution Grammars
The nearest colored node in a tree
DOAMI: A distributed on-line algorithm to minimize interference for routing in wireless sensor networks
Enumerating minimal connected dominating sets in graphs of bounded chordality
New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs
On the complexity of deciding degeneracy in a bimatrix game with sparse payoff matrix
Semi-Metrics, Closure Spaces and Digital Topology
Processor Optimization for Flow Graphs
The probabilistic powerdomain for stably compact spaces
Blocking total dominating sets via edge contractions
Resolute control: Forbidding candidates from winning an election is hard
Type Inference in Prolog: A New Approach
Swarm intelligence theory: A snapshot of the state of the art
Solution of some conjectures about topological properties of linear cellular automata
The principles of informational genomics
Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements
On the Complexity of Regular Resolution and the Davis-Putnam Procedure
Width versus size in resolution proofs
Local event boundary detection with unreliable sensors: Analysis of the majority vote scheme
From semantics to types: The case of the imperative λ -calculus
Tiling of toroidal arrays with pictures: Uniqueness, shift-equivalence and undecidability
A graph theoretic approach for generating T-shaped floor plans
Scheduling Task-Trees with Additive Scales on Parallel/Distributed Machines
Constant-round linear-broadcast secure computation with penalties
Realizability models for BLL-like languages
A fully abstract denotational semantics for the pi-calculus
A Relational Approach to Logic Programming: The Extended Alexander Method
A temporal logic for micro- and macro-step-based real-time systems: Foundations and applications
Extreme state aggregation beyond Markov decision processes
One Way Finite Visit Automata
On deterministic finite automata and syntactic monoid size
Finite and infinite pseudorandom binary words
Summarizing a set of time series by averaging: From Steiner sequence to compact multiple alignment
A Weaker Sufficient Condition for the Equivalence of a Pair of DPDA's to be Decidable
The Equality Problem for Vector Addition Systems is Undecidable
Extension of the decidability of the marked PCP to instances with unique blocks
A note on quantum sequential machines
About the Implementability and the Power of Equationally Defined Data Abstractions
Partial combinatory algebra and generalized numberings
A tighter relation between sensitivity complexity and certificate complexity
Single source shortest paths in H-minor free graphs
Confluence of extensional and non-extensional lambda-calculi with explicit substitutions
Tuning evaluation functions by maximizing concordance
Forward analysis and model checking for trace bounded WSTS
Optimizing deletion cost for secure multicast key management
Specifying coalgebras with modal logic
Efficient search of combinatorial maps using signatures
Cryptographic hardness under projections for time-bounded Kolmogorov complexity
Horn axiomatizations for sequential data
On interreduction of semi-complete term rewriting systems
Event-Clock Automata: A Determinizable Class of Timed Automata
Automata theory based on quantum logic: Reversibilities and pushdown automata
On the parameterized complexity of [1, j ]-domination problems
Approximating the number of Double Cut-and-Join scenarios
Invariance under stuttering in a temporal logic of actions
The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete
Corrigendum to "A study of primer design with w-constacyclic shift over F4" [Theor. Comp. Sci. 960 (2023) 113925]
On the Centers of a Language
The complexity of learning concept classes with polynomial general dimension
On Small Generators
Parallel and Sequential Computation on Boolean Networks
A Halfliar's game
On a modular domination game
The Faulty Satnav (GPS) Problem: Search for home in networks with unreliable directions
Query automata over finite trees
On the Herbrand-Kleene Universe for Nondeterministic Computations
FUN with Algorithms - Foreword
Bounded Query Machines: On NP and PSPACE
Language-Theoretical Representations of omega-Languages
Optimal coloring for data collection in tree-based wireless sensor networks
Reducibility Classes of P-Selective Sets
On the complexity of connection games
How real is incomputability in physics?
On principal types of combinators
Modelling dynamic web data
Towards optimal range medians
Narrowing vs. SLD-Resolution
Classifying subset feedback vertex set for H-free graphs
Semantics and logic of object calculi
On the approximability and hardness of the minimum connected dominating set with routing cost constraint
Finding and enumerating Hamilton cycles in 4-regular graphs
Characterizing weighted MSO for trees by branching transitive closure logics
{2, 3}-Restricted connectivity of locally twisted cubes
Deterministic M2M multicast in radio networks
Global total k -domination: Approximation and hardness results
Physical constraints on hypercomputation
Nondeterministic regular expressions as solutions of equational systems
Joint bidding in ad auctions
On the conditional diagnosability of matching composition networks
Optimal linear secret sharing schemes for graph access structures on six participants
Observations on determinization of Büchi automata
Predecessor existence problems for finite discrete dynamical systems
Priority evacuation from a disk: The case of n = 1, 2, 3
Nontriviality for exponential time w.r.t. weak reducibilities
Finding maximum sum segments in sequences with uncertainty
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
Dijkstra and Hoare monads in monadic computation
Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs: With an application to the six degrees of separation games
Leader election in SINR model with arbitrary power control
Connected surveillance game
Left Termination Turned into Termination