yusuke1997/dblp-id-title huggingface dataset:
On the Carathéodory number of interval and graph convexities
A Data Structure for Lattice Representation
On the number of equal-letter runs of the bijective Burrows-Wheeler transform
Time hierarchies for sublogarithmic-space quantum computation
On the Number of Factors of Sturmian Words
Learning definite Horn formulas from closure queries
Uniform distribution for Pachinko
Sparse decomposition by iterating Lipschitzian-type mappings
Parameterized complexity of fair feedback vertex set problem
Target influence maximization problem under avoiding unexpected users interruption in online social network
Graph sharing games: Complexity and connectivity
Palindromization and construction of Markoff triples
On the covering radius problem for ternary self-dual codes
A semantic equivalence for Bio-PEPA based on discretisation of continuous values
Domains, information frames, and their logic
Online scheduling of equal length jobs on a bounded parallel batch machine with restart or limited restart
Multiple channels spiking neural P systems with lateral inhibition, rules dynamic generation and removal
Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions
Kernel P systems: From modelling to verification and testing
Recursively enumerable reals and Chaitin Omega numbers
On the expressiveness of Lara: A proposal for unifying linear and relational algebra
The minimum firing time of the generalized firing squad synchronization problem for squares
A spectral algorithm with additive clustering for the recovery of overlapping communities in networks
Representation of a class of nondeterministic semiautomata by canonical words
Symmetries of decimation invariant sequences and digit sets
Agreeing within a few writes
Connections between subwords and certain matrix mappings
Learning regular omega languages
An Optimal Absorbing List Organization Strategy with Constant Memory Requirements
Remarks on hyperspaces for Priestley spaces
Extended normal form theorems for logical proofs from axioms
Representation of Functional Dependencies in Relational Databases Using Linear Graphs
Regular solutions of language inequalities and well quasi-orders
Computing branching distances with quantitative games
Experience, generations, and limits in machine learning
Tight complexity analysis of population protocols with cover times - The ZebraNet example
Polynomial characteristic sets for DFA identification
Graph bandwidth of weighted caterpillars
Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic
Quadrature using 64-bit IEEE arithmetic for integrands over [0, 1] with a singularity at 1
Algorithms for four variants of the exact satisfiability problem
Concurrent reachability games
The algebraic connectivity of graphs with given circumference
Submodular maximization subject to a knapsack constraint: Combinatorial algorithms with near-optimal adaptive complexity
Moez Alimohamed, 1967-1994
A new lower bound for the list update problem in the partial cost model
Infinite ternary square-free words concatenated from permutations of a single word
Computing closest and farthest points for a query segment
A complexity and approximation framework for the maximization scaffolding problem
On the proper orientation number of chordal graphs
Shuffled languages - Representation and recognition
Parameterized complexity of perfectly matched sets
There is no efficient reverse derivation mode for discrete derivatives
Move-optimal arbitrary pattern formation by mobile robots on rectangular grid using near-optimal spatial area
Properties and expressivity of linear geometric centralities
Consistent Subsequences and Supersequences
Tree automata with one memory set constraints and cryptographic protocols
Balance in AVL Trees and Space Cost of Brother Trees
Ordering default theories and nonmonotonic logic programs
On fixed points of rational transductions
On infinite prefix normal words
A Mezei-Wright theorem for categorical algebras
On the saturation spectrum of families of cycle subdivisions
Daisies, Kayles, and the Silbert-Conway Decomposition in Misère Octal Games
Langages Algebriques, Paires Iterantes et Transductions Rationnelles
Hardness and approximation of traffic grooming
Investigating dynamic causalities in reaction systems
The first order definability of graphs with separators via the Ehrenfeucht game
On the Solvability of Domino Snake Problems
Projections of Vector Addition System Reachability Sets are Semilinear
Hypermap Rewriting: A Combinatorial Approach
Document listing on repetitive collections with guaranteed performance
Closed Iterative Calculus
Improved exact algorithms for mildly sparse instances of Max SAT
Exhaustive generation of some lattice paths and their prefixes
Complexity issues concerning the quadruple Roman domination problem in graphs
A proof of the extended Duval's conjecture
Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes
Beyond level planarity: Cyclic, torus, and simultaneous level planarity
Injective coloring of subclasses of chordal graphs
Generalized metrics and uniquely determined logic programs
Equilogical spaces
Almost optimal algorithms for diameter-optimally augmenting trees
On Commutative DT0L Systems
The t / s -diagnosability and t / s -diagnosis algorithm of folded hypercube under the PMC/MM* model
Parallel computation in spiking neural nets
Modular soundness checking of feature model evolution plans
Neighbor-connectivity of pancake networks and burnt pancake networks
Compiling dyadic first-order specifications into map algebra
Approximation schemes for a class of subset selection problems
A survey of string orderings and their application to the Burrows-Wheeler transform
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees
Equitable improper choosability of graphs
On Branching and Looping, Part II
A simplified run time analysis of the univariate marginal distribution algorithm on LeadingOnes
A General Result on Abstract Flowchart Schemes with Applications to the Study of Accessibility, Reduction and Minimization
Average long-lived binary consensus: Quantifying the stabilizing role played by memory
Automatic generation of path conditions for concurrent timed systems
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
Forbidding ET0L grammars
Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
Parameterized edge dominating set in graphs with degree bounded by 3
The word problem for omega-terms over DA
Terminal embeddings
Object-Oriented Style Overloading for Haskell
Stratified coherence spaces: a denotational semantics for light linear logic
Sampling different kinds of acyclic automata using Markov chains
First-order interpolation derived from propositional interpolation
Böhm's theorem for Berarducci trees
Fractional matching preclusion of product networks
Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition
Checking conformance for time-constrained scenario-based specifications
Greedy+Singleton: An efficient approximation algorithm for k -submodular knapsack maximization
Token traversal in ad hoc wireless networks via implicit carrier sensing
Some Undecidability Results Concerning the Property of Preserving Regularity
Axiomatisation of Functional Dependencies in Incomplete Relations
On a Conjecture Concerning Dot-Depth Two Languages
Algorithms to Construct Minkowski Reduced an Hermite Reduced Lattice Bases
A correction to Andersson's fusion tree construction
Periodicity and the Golden Ratio
Using the Heartbeat Failure Detector for Quiescent Reliable Communication and Consensus in Partitionable Networks
The structure and number of global roundings of a graph
On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
Hydras: Directed hypergraphs and Horn formulas
Two collapsing hierarchies of subregularly tree controlled languages
Improving the Hk-bound on the price of stability in undirected Shapley network design games
Some Consequences of Non-Uniform Conditions on Uniform Classes
Interchange rearrangement: The element-cost model
Reconfiguration of colorable sets in classes of perfect graphs
Maximum weight independent sets for ( S 1, 2, 4 , triangle)-free graphs in polynomial time
Suffix tree characterization of maximal motifs in biological sequences
Algorithms for pattern matching and discovery in RNA secondary structure
On Termination of One Rule Rewrite Systems
Approximating uniform triangular meshes in polygons
CPS-translation as adjoint
Partial and constrained level planarity
Curry's Type-Rules are Complete with Respect to the F-Semantics too
SnS Can be Modally Characterized
Space-aware ambients and processes
Differential logical relations, part II increments and derivatives
On unique factorizations of primitive words
Improved algorithms for non-submodular function maximization problem
Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
Méthodes quasi-Monte-Carlo multidimensionnelles
Hardness of preorder checking for basic formalisms
Linear time analysis of properties of conflict-free and general Petri nets
Description trees and Tutte formulas
A constraint-based region inference algorithm
Counting problems over the reals
Parallel Evaluation of Arithmetic Circuits
Improved approximation algorithms for some min-max and minimum cycle cover problems
Separation of synchronous and asynchronous communication via testing
A canonical form based decision procedure and model checking approach for propositional projection temporal logic
Computational depth: Concept and applications
Jumping and escaping: Modular termination and the abstract path ordering
Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions
A linear time approximation algorithm for permutation flow shop scheduling
Predicting the labels of an unknown graph via adaptive exploration
QuickHeapsort, an efficient mix of classical sorting algorithms
WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
Quotient geometric crossovers and redundant encodings
Une Nouvelle C beta-Réduction dans la Logique Combinatoire
On the pseudo-achromatic number problem
The power of one evil secret agent
Gathering few fat mobile robots in the plane
Local majorities, coalitions and monopolies in graphs: a review
Distributed multiple-message broadcast in wireless ad hoc networks under the SINR model
Constrained synchronization and commutativity
A note on generalized matching preclusion in bipartite graphs
The Kolmogorov complexity of infinite words
Vertical representation of C ∞ -words
Fast simulations of the multi-album collector
Modelling and analysing neural networks using a hybrid process algebra
On dragon curves which have two corners just meeting
Structuring the elementary components of graphs having a perfect internal matching
Coloring octrees
Structured proportional representation
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
On the relative dominance of paging algorithms
Deciding representability of sets of words of equal length
Computability in Higher Types, P omega and the Completeness of Type Assignment
The computational power of tissue-like P systems with promoters
Erratum to "The computational power of Benenson automata" [Theoret. Comput. Sci. 344 (2005) 279-297]
An Abstract Framework for Environment Machines
Tolerance to asynchrony in algorithms for multiplication and modulo
Loosely-stabilizing leader election with polylogarithmic convergence time
Tight FPT approximation for constrained k -center and k -supplier
Model checking discounted temporal properties
New spectral lower bounds on the bisection width of graphs
Higher Order Dataflow Schemas
Enumeration of octagonal tilings
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
An FPTAS for the volume of some V-polytopes - It is hard to compute the volume of the intersection of two cross-polytopes
Using Multiset Discrimination to Solve Language Processing Problems Without Hashing
Finite Automata with Multiplication
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation
Approximate string matching using a bidirectional index
A novel parameterised approximation algorithm for minimum vertex cover
Efficient and compact representations of some non-canonical prefix-free codes
Decidable models of integer-manipulating programs with recursive parallelism
Snakes in Domineering Games
Mean isoperimetry with control on outliers: Exact and approximation algorithms
Learning Counting Functions with Queries
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Unsupervised learning in neural computation
SDD Spectral Radii and SDD Energies of Graph Operations
A note on the emptiness problem for alternating finite-memory automata
The Complexity of Logical Theories
Multidimensional segment trees can do range updates in poly-logarithmic time
Dynamic programming based algorithms for set multicover and multiset multicover problems
Lower Bounds to the Complexity of Symmetric Boolean Functions
Efficient approximation of min set cover by moderately exponential algorithms
On the Size of Binary Decision Diagrams Representing Boolean Functions
An Equational Axiomatization of Systolic Systems
Relationship between extra edge connectivity and component edge connectivity for regular graphs
An Extensional Fixed-Point Semantics for Nondeterministic Data Flow
Measuring the clustering effect of BWT via RLE
On computing the coefficients of bivariate holonomic formal series
Combinatorial optimization algorithms for radio network planning
Polymorphic Syntax Definition
ω-wide diameters of enhanced pyramid networks
Frozen development in graph coloring
On LC(0) Grammars and Languages
Algebraic Transformation of Unary Partial Algebras I: Double-Pushout Approach
Factorization forests for infinite words and applications to countable scattered linear orderings
On the descriptional complexity of finite automata with modified acceptance conditions
Rate-limited secure function evaluation
A new encryption scheme for multivariate quadratic systems
Counting distinct items over update streams
Linearity and regularity with negation normal form
Simulation distances
Quaternion-valued recurrent projection neural networks on unit quaternions
Regular Expression for a Language without Empty Word
Additive One-Dimensional Cellular Automata are Chaotic According to Devaney's Definition of Chaos
On the competitiveness of the move-to-front rule
DOL Schemes and the Periodicity of String Embeddings
Component conditional fault tolerance of hierarchical folded cubic networks
Parameterized longest previous factor
Boolean Operations, Joins, and the Extended Low Hierarchy
Edge and node searching problems on trees
Minimal characterization of O-notation in algorithm analysis
An optimal online algorithm for scheduling two machines with release times
Self-stabilizing silent disjunction in an anonymous network
Lower Bounds for the Approximative Complexity
Advice complexity of adaptive priority algorithms
On the Random Generation and Counting of Matchings in Dense Graphs
Locating factors of the infinite Fibonacci word
max-cut and containment relations in graphs
Efficient algorithms for secure outsourcing of bilinear pairings
Two faces of active learning
Maximal infinite-valued constraint languages
Number of Models and Satisfiability of Sets of Clauses
Structural parameterizations of budgeted graph coloring
Online regret bounds for Markov decision processes with deterministic transitions
Hardness and approximation of multiple sequence alignment with column score
Efficient identity-based broadcast encryption with keyword search against insider attacks for database systems
Enumeration of the perfect sequences of a chordal graph
Some Decision Problems about Controlled Rewriting Systems
Linear Programming complementation
On Machines, Universal by Extensions
Additive sparse spanners for graphs with bounded length of largest induced cycle
Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity
Multi-Valued Logic Programming Semantics: An Algebraic Approach
TCS Special Issue on Selected Papers from AlgoWin 2023
Computational ideal theory in finitely generated extension rings
A formalization of multi-tape Turing machines
Three-player partizan games
Approximation algorithms for the minimum power cover problem with submodular/linear penalties
A Communication Hierarchy of Parallel Computations
A protocol for implementing byzantine storage in churn-prone distributed systems
Unification of Infinite Sets of Terms Schematized by Primal Grammars
Securing the .NET programming model
On the hardness of network design for bottleneck routing games
Well-quasi-orders and regular omega-languages
Loosely-stabilizing leader election in a population protocol model
Geometric Optimization and the Polynomial Hierarchy
Programs over semigroups of dot-depth one
Approximation of the k-batch consolidation problem
New models of graph-bin packing
On Conflict-Free Spanning Tree: Mapping tractable and hard instances through the lenses of graph classes
Combinatorics of labelling in higher-dimensional automata
Weighted connected matchings
Delimited control in OCaml, abstractly and concretely
String Matching with Weighted Errors
String cadences
Toward a Unified Approach for the Classification of NP-Complete Optimization Problems
Measuring the probabilistic powerdomain
Inferring sequences produced by elliptic curve generators using Coppersmith's methods
Fault tolerant K-center problems
Truthful two-facility location with candidate locations
The g -good-neighbor and g -extra diagnosability of networks
Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate
Recursive and iterative approaches to generate rotation Gray codes for stamp foldings and semi-meanders
Comparative study of approximation algorithms and heuristics for SINR scheduling with power control
F-Semantics for Type Assignment Systems
Online scheduling with rejection and withdrawal
Termination of rewrite relations on λ-terms based on Girard's notion of reducibility
Finding strong bridges and strong articulation points in linear time
Polyomino Tilings, Cellular Automata and Codicity
A fascinating rainbow of computation - Honoring Gheorghe Păun on the occasion of his 70th birthday
Parameterized complexity of control and bribery for d-approval elections
An axiomatization of information flow measures
Finding a potential community in networks
Unifying Overloading and lambda-Abstraction: lambda {}
Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
Optimizing hybrid metaheuristic algorithm with cluster head to improve performance metrics on the IoT
The complexity of Kemeny elections
Determining the chromatic number of triangle-free 2P 3 -free graphs in polynomial time
GMPLS label space minimization through hypergraph layouts
A unified task recommendation strategy for realistic mobile crowdsourcing system
From multivalued to Boolean functions: Preservation of soft nested canalization
Words derivated from Sturmian words
On Stable Domains
Toward a theory of input-driven locally parsable languages
On a zeta function associated with automata and codes
Completion of partial Latin Hypercube Designs: NP-completeness and inapproximability
Data structures for categorical path counting queries
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover
Varieties of recognizable tree series over fields
A Tranformation System for Deductive Databases Modules with Perfect Model Semantics
Encoding Boolean networks into reaction systems for investigating causal dependencies in gene regulation
Network Movement Games
Combining request scheduling with web caching
Amalgamation in the semantics of CASL
Combining algebraic effects with continuations
Efficient Detection of Quasiperiodicities in Strings
On the parameterized complexity of the geodesic hull number
More Efficient Bottom-Up Multi-Pattern Matching in Trees
On Generators of Rational omega-Power Languages
Languages and models for hybrid automata: A coalgebraic perspective
Approximation schemes for scheduling and covering on unrelated machines
A Very Hard log-Space Counting Class
Exact algorithms for size constrained 2-clustering in the plane
Weak near-unanimity functions and digraph homomorphism problems
Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms
Path constraints in semistructured data
EMSO-logic and automata related to homogeneous flow event structures
Avoiding large squares in infinite binary words
An Initial Semantics for the mu-Calculus on Trees and Rabin's Complementation Lemma
Parameterized complexity of weighted target set selection
Interactive Foundations of Computing
The complexity of the matroid-greedoid partition problem
Learning regular languages using RFSAs
Smallest number of vertices in a 2-arc-strong digraph without good pairs
Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations
A 2-approximation algorithm and beyond for the minimum diameter k -Steiner forest problem
Lower bounds for graph reconstruction with maximal independent set queries
On stable cutsets in line graphs
Optimal parameters for search using a barrier tree Markov model
Further oracles separating conjectures about incompleteness in the finite domain
Separating Complexity Classes With Tally Oracles
Complexity of approximating the vertex centroid of a polyhedron
Algorithmes de calcul de la réduction de Hermite d'une matrice à coefficients polynomiaux
Inferring complete initialization of arrays
Probablistic Polynomials, AC0 Functions, and the Polynomial-Time Hierarchy
Universality and decidability of number-conserving cellular automata
Polynomial functions over finite commutative rings
Separating Complexity Classes Related to Omega-Decision Trees
Parameterized learnability of juntas
Computing with Graph Rewriting Systems with Priorities
Convexity and global optimization: a theoretical link
Complete Sets and the Polynomial-Time Hierarchy
On Words Containing all Short Subwords
Hyperbolicity of the fixed point set for the simple genetic algorithm
A simple yet time-optimal and linear-space algorithm for shortest unique substring queries
Parikh matrices and amiable words
Vulnerability of super edge-connected networks
L(3,2,1)-labeling of certain planar graphs
Parameterized graph separation problems
Universal partial words over non-binary alphabets
Approximating k -forest with resource augmentation: A primal-dual approach
Min-Sum disjoint paths on subclasses of chordal graphs
On communication protocols that compute almost privately
Differentiating-total domination: Approximation and hardness results
Efficient computation of maximal anti-exponent in palindrome-free strings
SOS rule formats for zero and unit elements
On Finding Minimal, Maximal, and Consistent Sequences over a Binary Alphabet
Polyominoes Defined by Their Vertical and Horizontal Projections
Modelling of DNA mismatch repair with a reversible process calculus
Linda-based applicative and imperative process algebras
Linear Analysis of Genetic Algorithms
On families of full trios containing counter machine languages
Relativized Topological Size of Sets of Partial Recursive Functions
Ranks of graphs: The size of acyclic orientation cover for deadlock-free packet routing
Automata-theoretic decision of timed games
Scalar aggregation in inconsistent databases
Extending partial representations of subclasses of chordal graphs
Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
On axioms for commutative regular equations without addition
Scale-invariant unconstrained online learning
Delaunay property and proximity results of the L-algorithm for digital plane probing