yusuke1997/dblp-id-title huggingface dataset:
On algorithmic applications of sim-width and mim-width of ( H 1 , H 2 )-free graphs
Simple Operational and Denotational Semantics for Prolog with Cut
On the sizes of BDDs and ZDDs representing matroids
A pearl on SAT and SMT solving in Prolog
Top-Down Tree Transducers with Two-Way Tree Walking Look-Ahead
An interval temporal logic characterization of extended ω -regular languages
New geometric algorithms for fully connected staged self-assembly
Competitive self-stabilizing k-clustering
Improved constructions of quantum automata
Core algebra revisited
Malware visual resemblance analysis with minimum losses using Siamese neural networks
Complexity of path discovery game problems
Nivats's Processing Systems: Decision Problems Related to Protection and Synchronization
A theoretical foundation for program transformations to reduce cache thrashing due to true data sharing
Interval Logics and Their Decision Procedures. Part II: A Real-Time Interval Logic
Multiplicities of covers for sofic shifts
Optimal wireless charger placement with individual energy requirement
Stable normal forms for polynomial system solving
Iterative Belief Revision in Extended Logic Programming
Relating randomized right-hand sides to communicating rewriting rules
On conservative and monotone one-dimensional cellular automata and their particle representation
Online parallel scheduling of non-uniform tasks: Trading failures for energy
Computable subcontinua of semicomputable chainable Hausdorff continua
A kappa-Denotational Semantics for Map Theory in ZFC+SI
Some Decision Problems for Polynomial Mappings
Observational program calculi and the correctness of translations
Query Evaluation in Probabilistic Relational Databases
Algorithms and Discrete Mathematics - celebrating the silver jubilee of IITG Guwahati
Codes of central Sturmian words
On primitive recursive algorithms and the greatest common divisor function
A Constraint Logic Programming Framwork in Java
Polynomial-time approximation algorithms for anchor-free TDoA localization
Resource management and scalability of the XCSF learning classifier system
Optimizing resource allocation: An active learning approach to iterative combinatorial auctions
A model of guarded recursion via generalised equilogical spaces
A Unified Approach to Type Theory Through a Refined lambda-Calculus
On-line parallel heuristics, processor scheduling and robot searching under the competitive framework
Minimizing the makespan on a single parallel batching machine
Enumerating all connected maximal common subgraphs in two graphs
Linearizing well quasi-orders and bounding the length of bad sequences
Multiple factorizations of words and defect effect
Intersection of finitely generated congruences over term algebra
On some coloring problems in grids
The extra connectivity of bubble-sort star graphs
The Go polynomials of a graph
How many runs can a string contain?
A proof of the leftmost reduction theorem for λβη -calculus
An optimal online algorithm for single-processor scheduling problem with learning effect
Optimal Off-Line Detection of Repetitions in a String
An attention-driven nonlinear optimization method for CS-based hyperspectral image reconstruction
Descriptive complexity of computable sequences
World-set decompositions: Expressiveness and efficient algorithms
Computing a minimum-width square annulus in arbitrary orientation
Hierarchies of probabilistic and team FIN-learning
An FPTAS for the hardcore model on random regular bipartite graphs
Approximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
A New Proof of two Theorems about Rational Transductions
A Survey of Space Complexity
Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm
Weighted restrained domination in subclasses of planar graphs
On testing urgency through laziness over processes with durational actions
Uncomputably large integral points on algebraic plane curves?
Structure and computability of preimages in the Game of Life
Sequential Compounds of Combinatorial Games
The parallel composition of uniform processes with data
Fan-crossing free graphs and their relationship to other beyond-planar graphs
Conditional diagnosability of arrangement graphs under the PMC model
Worst-case fair guarantees when spending a common budget
A finite state intersection approach to propositional satisfiability
Convergence and approximation in potential games
Approximation algorithms for orthogonal packing problems for hypercubes
Codes Circulaires, Automates Locaux et Entropie
On the Relative Merits of Path Dissolution and the Method of Analytic Tableaux
Reconstruction of graphs based on random walks
Analytic functors between presheaf categories over groupoids
Multiplication is the Easiest Nontrivial Arithmetic Function
Language Equations Over a One-Letter Alphabet with Union, Concatenation and Star: A Complete Solution
Open bisimulation, revisited
On-Line Algorithms for Satisfiability Problems with Uncertainty
Morphic words, Beatty sequences and integer images of the Fibonacci language
Fast query structures in anisotropic media
Foreword : Coalgebraic Methods in Computer Science 1998
An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
Enhanced A* Algorithms for Multiple Alignments: Optimal Alignments for Several Sequences and k -Opt Approximate Alignments for Large Cases
Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht
Algorithms for multi-level graph planarity testing and layout
On Purely Morphic Characterizations of Context-Free Languages
New lower bounds for certain classes of bin packing algorithms
On the approximability of the link building problem
On the submodular matrix representation of a digraph
The Monadic Second-Order Logic of Graphs IX: Machines and their Behaviours
A note on Sturmian words
Structure-preserving public-key encryption with leakage-resilient CCA security
Intrinsic reasoning about functional programs II: unipolar induction and primitive-recursion
The tree equivalence of linear recursion schemes
Substitutions and interval exchange transformations of rotation class
Learning in the limit with lattice-structured hypothesis spaces
Palindromic length of words and morphisms in class P
Compatible topologies on graphs: An application to graph isomorphism problem complexity
On domain-partitioning induction criteria: worst-case bounds for the worst-case based
On cool congruence formats for weak bisimulations
Number-conserving cellular automata I: decidability
Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability
On-line scheduling with monotone subsequence constraints
Semi-online scheduling with bounded job sizes on two uniform machines
An efficient algorithm for sequence comparison with block reversals
Exact Solutions for Networks of Queues with Blocking-After-Service
Adaptive playouts for online learning of policies during Monte Carlo Tree Search
An infinite hierarchy of languages defined by dP systems
Combinatorial voter control in elections
On the universality of Post and splicing systems
(n-3)-edge-fault-tolerant weak-pancyclicity of (n, k)-star graphs
Energy optimal schedules for jobs with multiple active intervals
Context-free insertion-deletion systems
Computability of recurrence equations
Generic subset ranking using binary classifiers
Learning efficiency of very simple grammars from positive data
Turing Machines with Linear Alternation, Theories of Bounded Concatenation and the Decision Problem of First Order Theories
Modelling the navigation potential of a web page
On ordinal VC-dimension and some notions of complexity
Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket
Abstract Fairness and Semantics
Subtractive logic
Optimally Edge-Colouring Outerplanar Graphs is in NC
Negative selection algorithms on strings with efficient training and linear-time classification
Discovering and certifying lower bounds for the online bin stretching problem
An improved model-based method to test circuit faults
Pull and PushPull are PSPACE-complete
Minimal counterexamples for linear-time probabilistic verification
Premonoidal categories as categories with algebraic structure
Measuring with jugs
Enumerations including laconic enumerators
Parameterized complexity of k-Chinese Postman Problem
Bounding the bandwidths for graphs
Reliability assessment of the divide-and-swap cube in terms of generalized connectivity
High probability analysis of the condition number of sparse polynomial systems
Nondeterministic state complexity of star-free languages
On one-sided testing affine subspaces
On computing discretized Ricci curvatures of graphs: Local algorithms and (localized) fine-grained reductions
A general architecture of oritatami systems for simulating arbitrary finite automata
Indeterminate strings, prefix arrays & undirected graphs
Approximation algorithm for the minimum weight connected k-subgraph cover problem
A Relation Between Space, Return and Dual Return Complexities
A linear-space data structure for range-LCP queries in poly-logarithmic time
Near-optimal clustering in the k -machine model
Paperfolding morphisms, planefilling curves, and fractal tiles
Name-passing in an ambient-like calculus and its proof using spatial logic
A survey on tree edit distance and related problems
Approximation of minimum weight spanners for sparse graphs
Conjunction on processes: Full abstraction via ready-tree semantics
Some results on approximate 1-median selection in metric spaces
A Proper Hierarchy of Propositional Sequent Calculi
Optimal run problem for weighted register automata
Internal structure of addition chains: Well-ordering
Applications of an expressive statistical model checking approach to the analysis of genetic circuits
Non-mitotic sets
A uniformization-based algorithm for continuous-time stochastic games model checking
The Mixed Powerdomain
Deque automata, languages, and planar graph representations
Improved approximation algorithm for universal facility location problem with linear penalties
A note on the complexity of C ∞ -words
Finite and infinite closed-rich words
Finding binary words with a given number of subsequences
Compressed matching for feature vectors
Joint string complexity for Markov sources: Small data matters
Structural similarity within and among languages
FPT approximation for capacitated clustering with outliers
Borel hierarchy and omega context free languages
Parsing by matrix multiplication generalized to Boolean grammars
On the rate of convergence of error estimates for the partitioning classification rule
Real-time reversible iterative arrays
Constructing edge-disjoint spanning trees in locally twisted cubes
Multi-matching nested relations
Gravitational wave signal templates, pattern recognition, and reciprocal Eulerian gamma functions
Flexible Queries in Relational Databases - The Example of the Division Operator
Recursively Enumerable Subsets of R q in Two Computing Models: Blum-Shub-Smale Machine and Turing Machine
Approximating Markov processes through filtration
Point enclosure problem for homothetic polygons
Finding Paths between graph colourings: PSPACE-completeness and superpolynomial distances
A collective interpretation semantics for reversing Petri nets
An Extended Direct Branching Algorithm for Checking Equivalence of Deterministic Pushdown Automata
Least and greatest solutions of equations over sets of integers
Algebraic proof systems over formulas
Partial pullback complement rewriting
Average-Case Analysis on Simple Families of Trees Using a Balanced Probability Model
Abstract interpretation and types for systems biology
Complete Divisibility Problems for Slowly Utilized Oracles
Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks
Homotopies for Solving Polynomial Systems Within a Bounded Domain
Fast factorization of Cartesian products of (directed) hypergraphs
Operational semantics for Petri net components
A two-valued recurrent double sequence that is not automatic
On computing the maximum-volume bichromatic separating box
Hajós Factorizations and Completion of Codes
On Winning Strategies in Ehrenfeucht-Fraïssé Games
Fixed-point forms of the parallel symmetric sandpile model
Kolmogorov structure functions for automatic complexity
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi
Periodic Sets of Integers
On Optimal Solutions to the Firing Squad Synchronization Problem
Distributed representation of knowledge graphs with subgraph-aware proximity
Sequential reprogramming of biological network fate
Protocol insecurity with a finite number of sessions, composed keys is NP-complete
Context-dependent nondeterminism for pushdown automata
When a genetic algorithm outperforms hill-climbing
Inferring a DNA Sequence from Erroneous Copies
Graph encoding of 2 D -gon tilings
A note on the average number of RSA fixed points
Some remarks about stabilizers
Colonies with limited activation of components
Philippe Flajolet, the Father of Analytic Combinatorics
Heterogeneous and asynchronous networks of timed systems
The power of duples (in self-assembly): It's not so hip to be square
The Variance of the height of binary search trees
Closest periodic vectors in L p spaces
Approximate sorting and its applications in I/O model
Allocation of Arguments and Evidence Theory
Performance guarantees for a scheduling problem with common stepwise job payoffs
On the stability of Sand Piles Model
The Relationship Between Stable, Supported, Default and Autoepistemic Semantics for General Logic Programs
On the complexity of matching cut for graphs of bounded radius and H -free graphs
Games and total Datalog¬ queries
Real-reward testing for probabilistic processes
Delay-constrained minimum shortest path trees and related problems
Formalizing the trading theorem in Coq
Fast arithmetic with general Gauß periods
Rabin's theorem in the concurrency setting: A conjecture
The minimum k-storage problem on directed graphs
Graph Theoretic Characterization of G-Schemes and TL-Schemes
A second look at counting triangles in graph streams (corrected)
Some Undecidable Termination Problems for Semi-Thue Systems
Minimizing the cost of batch calibrations
On-line load balancing of temporary tasks revisited
A Distributed Selection Algorithm and its Expected Communication Complexity
On the Implementation of Concurrent Calculi in Net Calculi: Two Case Studies
One complexity theorist's view of quantum computing
Specification of real-time and hybrid systems in rewriting logic
PC grammar systems with five context-free components generate all recursively enumerable languages
Complexity of the traveling tournament problem
Necessary conditions for subclasses of random context languages
Synthesis and infeasibility analysis for stochastic models of biochemical systems using statistical model checking and abstraction refinement
A non-topological proof for the impossibility of k-set agreement
Decidability of performance equivalence for basic parallel processes
Linear Time Parsers for Classes of Non Context Free Languages
Distribution and Synchronized Automata
Chain Properties in P omega
Could any graph be turned into a small-world?
Block insertion and deletion on trajectories
Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience
Transformations of probability distributions
The regular viewpoint on PA-processes
Petri nets are less expressive than state-extended PA
The complexity of rerouting shortest paths
K-balanced biclique partition: Kernelization and efficient algorithms
Return time complexity of Sturmian sequences
Using Fast Matrix Multiplication to Find Basic Solutions
The analysis of Range Quickselect and related problems
On the average-case complexity of parameterized clique
Constrained routing between non-visible vertices
Real polynomial root-finding by means of matrix and polynomial iterations
TCS special issue: Combinatorics on Words - WORDS 2021
Recognizable Closures and Submonoids of Free Partially Commutative Monoids
Attribute Grammars and Recursive Program Schemes I
On bounded additivity in discrete tomography
Burn and win
Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
A Semantic Characterization of the Well-Typed Formulae of gamma-Calculus
The existence of universally agreed fairest semi-matchings in any given bipartite graph
On the complexity of fixed parameter clique and dominating set
The rectangle complexity of functions on two-dimensional lattices
Fast algorithms for computing the constrained LCS of run-length encoded strings
Independence of certain quantities indicating subword occurrences
Searching for Zimin patterns
Relativized depth
Infinite Regular Thue Systems
Heuristic average-case analysis of the backtrack resolution of random 3-satisfiability instances
Supervised learning and Co-training
A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs
Integrated regulatory networks (IRNs): Spatially organized biochemical modules
Computational complexity of k -block conjugacy
The component hierarchy of chain-free cooperating distributed regular tree grammars
Anonymous registered attribute-based signature for circuits
Transforming semantics by abstract interpretation
Designing aperture 22k hexagonal grids and their indexing as factor rings of Eisenstein integers
On reducibility and symmetry of disjoint NP pairs
Sur les Codes ZigZag et Leur Décidabilité
Signed genome rearrangement by reversals and transpositions: models and approximations
Shuffle on positive varieties of languages
Extended thermography for multiple kos in Go
A constrained edit distance algorithm between semi-ordered trees
Confluence for Graph Transformations
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis
Hybrid fragments of Halpern-Shoham logic and their expressive power
Grouped partial ET0L systems and parallel multiple context-free grammars
Parallel-machine scheduling with time dependent processing times
Better bounds for incremental frequency allocation in bipartite graphs
On the cover complexity of finite languages
A note on the number of squares in a word
Matching preclusion for balanced hypercubes
Topological adjacency relations on Zn
Probabilistic and Prioritized Models of Timed CSP
Continuation-based transformations for coordination languages
Series-parallel languages on scattered and countable posets
The Smallest Networks on Which the Ford-Fulkerson Maximum Flow Procedure may Fail to Terminate
Learning boolean halfspaces with small weights from membership queries
Functorial Theory of Parameterized Specifications in a General Specification Framework
Time sensitive sweep coverage with minimum UAVs
On balanced sequences and their critical exponent
Finding disjoint dense clubs in a social network
Ensembles Code-Compatibles et une Généralisation du Théorème de Sardinas-Patterson
Measure and probability for concurrency theorists
Composable security against collective attacks of a modified BB84 QKD protocol with information only in one basis
DAG-width is PSPACE-complete
Closure properties and complexity of rational sets of regular languages
On minimum average stretch spanning trees in polygonal 2-trees
Minimax regret 1-sink location problem in dynamic path networks
Local search is a PTAS for feedback vertex set in minor-free graphs
Enumeration of Generalized Young Tableaux With Bounded Height
Online graph exploration on a restricted graph class: Optimal solutions for tadpole graphs
Extraction and recoding of input-ε-cycles in finite state transducers
Power and exponential sums for generalized coding systems by a measure theoretic approach
On finding short resolution refutations and small unsatisfiable subsets
A Unified Framework for Disambiguating Finite Transductions
Fault tolerance and diagnosability of burnt pancake networks under the comparison model
Hardness results for covering arrays avoiding forbidden edges and error-locating arrays
The growth ratio of synchronous rational relations is unique
On selecting a maximum volume sub-matrix of a matrix and related problems
Image reflection on process graphs of 1-free regular expressions modulo bisimilarity
Normalization of ternary generalized pseudostandard words
Glueing and orthogonality for models of linear logic
Randomized priority algorithms
Coordinating team players within a noisy Iterated Prisoner's Dilemma tournament
Composition is Almost (but not Quite) as Good as s-1-1
On the size of the inverse neighborhoods for one-dimensional reversible cellular automata
On the Approximation of Protein Threading
Roots of quaternion polynomials: Theory and computation
Tipsy cop and tipsy robber: Collisions of biased random walks on graphs
On the Randomized Construction of the Delaunay Tree
Foreword: Special issue in honor of the 60th birthday of Prof. Maxime Crochemore
Certification of an exact worst-case self-stabilization time
Approximate sequencing for variable length tasks
Slicing techniques for verification re-use
Folding and tiling
Online scheduling on m uniform machines to minimize total (weighted) completion time
From truth to computability II
Maximal pattern complexity of two-dimensional words
Order-preserving pattern matching with k mismatches
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry
Transition System Specifications with Negative Premises
A topological treatment of early-deciding set-agreement
On complexity functions of infinite words associated with generalized Dyck languages
Comparing Hagino's Categorical Programming Language and Typed lambda-Calculi
Modelling co-transcriptional cleavage in the synthesis of yeast pre-rRNA
Efficient meta-data structure in top- k queries of combinations and multi-item procurement auctions
Distances between languages and reflexivity of relations
Proving properties of the Chord protocol using the ASM formalism
Refutable language learning with a neighbor system
Prefix-suffix square reduction
Single-Valuedness of Tree Transducers is Decidable in Polynomial Time
On Weyl Sums and Skew Products over Irrational Rotations
Linear-space recognition for grammars with contexts
Minimal Pairs of Polynomial Degrees with Subexponential Complexity
Defending hash tables from algorithmic complexity attacks with resource burning
Algebraic structures of automata
Derived Linear Systems of Context-Free Grammars
Affine Scheduling on Bounded Convex Polyhedric Domains is Asymptotically Optimal
Selected papers from COCOON 1998 - Foreword
The Knowledge Complexity of Quadratic Residuosity Languages
Multidimenstional Sigma-Automata, Pi-Polynomials and Generalised S-Matrices
Recursive Programs and Denotational Semantics in Absolute Logics of Programs
Combining test case generation and runtime verification
Self-stabilizing spanner topology control solutions in wireless ad hoc networks
Obtaining shorter regular expressions from finite-state automata
Optimal Dimension-Exchange Token Distribution on Complete Binary Trees
An algebraic theory of interface automata
Spiking neural P systems: An improved normal form
Branching time and orthogonal bisimulation equivalence
Simultaneous FPQ-ordering and hybrid planarity testing
Normalisation for higher-order calculi with explicit substitutions
On a quasi-ordering on Boolean functions
Component identification in biochemical pathways
Martingale families and dimension in P
More on deterministic and nondeterministic finite cover automata
On the Complexity of Quadratic Programming in Real Number Models of Computation
Observational logic, constructor-based logic, and their duality
Seeing the trees and their branches in the network is hard
Space efficient search for maximal repetitions
Corrigendum: Computing an st -Numbering. TCS 2(1976):339-344
Effective dimensions and relative frequencies
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
Depth of Proofs, Depth of Cut-Formulas and Complexity of Cut Formulas
Models of Approximation in Databases
Predicting nearly as well as the best pruning of a planar decision graph
Tighter PAC-Bayes bounds through distribution-dependent priors