yusuke1997/dblp-id-title huggingface dataset:
A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
Incremental list coloring of graphs, parameterized by conservation
Functorial semantics for Petri nets under the individual token philosophy
Speedup for natural problems and noncomputability
Sur les Series Associees a Certains Systemes de Lindenmayer
Profit maximization for competitive social advertising
Determinacy and optimal strategies in infinite-state stochastic reachability games
Evolving schemas for streaming XML
CTL * model checking for time Petri nets
A substructure based lower bound for eternal vertex cover number
Universality results for P systems based on brane calculi operations
On the complexity of finding common approximate substrings
Efficient and Optimal Query Answering on Independent Schemes
Characterizations of locally testable linear- and affine-invariant families
Improving time bounds on maximum generalised flow computations by contracting the network
Petri net languages revisited
No easy puzzles: Hardness results for jigsaw puzzles
Components as coalgebras: The refinement dimension
Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
Pascal in LCF: Semantics and Examples of Proof
On approximating string selection problems with outliers
The recognition of triangle graphs
Improved algorithms for the range next value problem and applications
Continuity of operators on continuous and discrete time streams
Recognition of directed acyclic graphs by spanning tree automata
Viability in Hybrid Systems
Sur la Combinatoire des Codes à Deux Mots
Design of fault-tolerant on-board networks with variable switch sizes
Using interval arithmetic to prove that a set is path-connected
The complexity of counting locally maximal satisfying assignments of Boolean CSPs
Thin discrete triangular meshes
An induction principle for pure type systems
An Intensional Characterization of the Largest Bisimulation
Shuffle languages are in P
Fault-tolerant mutual visibility without any axis agreement in presence of mobility failure
All-to-all personalized exchange in generalized shuffle-exchange networks
Expressiveness of concurrent intensionality
Membrane systems with proteins embedded in membranes
Traveling salesmen in the presence of competition
Bases and Ambiguity of Number Systems
The category of H-posets
On the closure properties of linear conjunctive languages
Computational complexity of jumping block puzzles
Finding patterns and periods in Cartesian tree matching
Parameterized algorithms and kernels for almost induced matching
On the Yoneda completion of a quasi-metric space
Parameterized algorithms for minimum sum vertex cover
Massively Parallel Approximation of Irregular Triangular Meshes of Arbitrary Topology with Smooth Parametric Surfaces
Matching a Set of Strings with Variable Length don't Cares
Standard and ordered zoom structures
Effective Properties of Sets and Functions in Metric Spaces with Computability Structure
Semi-online scheduling with known partial information about job sizes on two identical machines
Complete proof systems for weighted modal logic
A proof outline logic for object-oriented programming
Alternative proof of the Lyndon-Schützenberger Theorem
Mediating for reduction (on minimizing alternating Büchi automata)
Smoothed heights of tries and patricia tries
A QPTAS for the base of the number of crossing-free structures on a planar point set
Curves and surfaces represented by polynomial support functions
The directed 2-linkage problem with length constraints
Vectorial languages and linear temporal logic
Randomized approximation of the stable marriage problem
Constant-Round Perfect Zero-Knowledge Computationally Convincing Protocols
On the complexity of basic abstractions to implement consensus
A truly concurrent semantics for a process algebra using resource pomsets
Probabilistic Termination Versus Fair Termination
Lyndon Trees
Shortest path and maximum flow problems in networks with additive losses and gains
Zero-freeness and approximation of real Boolean Holant problems
Generalized domino-shuffling
Recognizable Formal Power Series on Trees
Genetic algorithms for the imitation of genomic styles in protein backtranslation
Closure properties of locally finite omega-languages
Exact algorithms for computing the tree edit distance between unordered trees
Approximation algorithm and mechanism design for bisubmodular welfare maximization problem
Complexity, appeal and challenges of combinatorial games
F4-invariant algorithm for computing SAGBI-Gröbner bases
Conversation protocols: a formalism for specification and verification of reactive electronic services
Unary Watson-Crick automata
The Generalized Packet Routing Problem
Word problems recognisable by deterministic blind monoid automata
Numerical spiking neural P systems with production functions on synapses
Upper Dominating Set: Tight algorithms for pathwidth and sub-exponential approximation
Decidability of trajectory-based equations
Deterministic recurrent communication in restricted Sensor Networks
Pushdown dimension
A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
Codes defined by multiple sets of trajectories
A Class of Programs for which SLDNF Resolution and NAF Rule are Complete
On Two-Way Sequential Transductions of Full Semi-AFL's
Self-stabilizing labeling and ranking in ordered trees
Hyper star fault tolerance of bubble sort networks
A polynomial-time algorithm to compute generalized Hermite normal forms of matrices over Z[x]
Dynamic matrix rank
Using minimal absent words to build phylogeny
The (Generalized) Post Correspondence Problem with Lists Consisting of two Words is Decidable
Extending Regular Expressions with Iterated Shuffle
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties
Additivity obstructions for integral matrices and pyramids
Self-stabilizing multivalued consensus in asynchronous crash-prone systems
On context-free parallel communicating grammar systems: synchronization, communication, and normal forms
Directed acyclic graphs with the unique dipath property
MSOL restricted contractibility to planar graphs
Analytic Models and Ambiguity of Context-Free Languages
Range queries on uncertain data
Synthesising elementary net systems with localities
Weighted tree automata and weighted logics
Verification of Reactive Systems Using Temporal Logic with Clocks
Optimal paths in weighted timed automata
Data Compression with Factor Automata
A complexity analysis of functional interpretations
A program for Progressive chess
Improved competitive algorithms for online scheduling with partial job values
Optimal Evaluations of Graph-Like Expressions
Limitations of self-assembly at temperature 1
On the computational and descriptional complexity of multi-pattern languages
Algebraic Transformation of Unary Partial Algebras II: Single-Pushout Approach
Weak Completeness of Type Assignment in lambda-Calculus Models: A Generalization of Hindley's Result
Abelian-primitive partial words
On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes
Enumeration approach to computing chemical equilibria
Quasi-linear transformations and discrete tilings
Wide-sense nonblocking for symmetric or asymmetric 3-stage Clos networks under various routing strategies
Finite Semigroup Varieties Defined by Programs
Intersection Type Assignment Systems with Higher-Order Algebraic Rewriting
The discrete Green Theorem and some applications in discrete geometry
On the Lie complexity of Sturmian words
A probabilistic analysis of randomly generated binary constraint satisfaction problems
Kernelization complexity of possible winner and coalitional manipulation problems in voting
Intervals of balanced binary trees in the Tamari lattice
A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
Quasi-automatic groups are asynchronously automatic
Edge degeneracy: Algorithmic and structural results
Influence of data dimensionality on the quality of forecasts given by a multilayer perceptron
Checking experiments for stream X-machines
Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism
On Some Decision Questions Concerning Pushdown Machines
Approximating sparse quadratic programs
The diagnosability of triangle-free graphs
Substitutions et beta-systèmes de numération
Mim-width III. Graph powers and generalized distance domination problems
Declarative Debugging of Functional Logic Programs
Divisibility problem for one relator monoids
From Gödel to Einstein: Computability between logic and physics at CiE 2006
Throughput maximization in multiprocessor speed-scaling
Polymorphic Rewriting Conserves Algebraic Strong Normalization
Reoptimization of maximum weight induced hereditary subgraph problems
Two homogeneous facility location games with a minimum distance requirement on a circle
A PTAS for weight constrained Steiner trees in series-parallel graphs
Price of asynchrony in mobile agents computing
An approximation algorithm to the k-Steiner Forest problem
Minimality considerations for ordinal computers modeling constructibility
Recursive Characterization of Computable Real-Valued Functions and Relations
New bounds for single-machine time-dependent scheduling with uniform deterioration
The grammar of mammalian brain capacity
Domain theory for concurrency
On computing the minimum 3-path vertex cover and dissociation number of graphs
Attributed graph transformation with inheritance: Efficient conflict detection and local confluence analysis using abstract critical pairs
Ten human needs that education should take into account
Bayesian network semantics for Petri nets
Invertible Terms in the Lambda Calculus
Algebraic recognizability of regular tree languages
On Log-Tape Isomorphisms of Complete Sets
Nimbers are inevitable
Lie complexity of words
Simple permutations mix well
Prediction algorithms and confidence measures based on algorithmic randomness theory
Quasi-distinct parsing and optimal compression methods
On the structure of one-tape nondeterministic turing machine time hierarchy
Resource efficient stabilization for local tasks despite unknown capacity links
Characterization of omega-Regular Languages by Monadic Second-Order Formulas
Cryptographic Copyright Protection for Digital Images Based on Watermarking Techniques
Context-Specific Synchronization for Atomic Data Types in Object-Based Databases
Semantic Analysis of Inductive Reasoning
On the Power of Circuits with Gates of Low L 1 Norms
Perfectly quilted rectangular snake tilings
Quantified conjunctive queries on partially ordered sets
The role of planarity in connectivity problems parameterized by treewidth
Acyclic edge coloring through the Lovász Local Lemma
Finite transducers for divisibility monoids
Foreword to the Special Issue on Parallelism
Randomized oblivious integral routing for minimizing power cost
Infiniteness of Proof(alpha) is Polynomial-Space Complete
Automata and Languages Generalized to omega-Continuous Semirings
Wegner's Conjecture on 2-distance coloring for planar graphs
Weak bisimulation for Probabilistic Timed Automata
Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata
On computing the Hamiltonian index of graphs
Safe functional systems through integrity types and verified assembly
Student admissions and faculty recruitment
Pairwise cooperations in selfish ring routing for minimax linear latency
On a vertex-capturing game
On Branching and Looping, Part I
Set-constrained delivery broadcast: A communication abstraction for read/write implementable distributed objects
On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology
Approximate pattern matching on elastic-degenerate text
Characterizations and Computational Complexity of Systolic Trellis Automata
Combinatorial Optimization and Applications
Corrigendum to "Improved Algorithm for Permutation Testing" [Theoretical Computer Science 986 (2024) 114316]
On the decidability and complexity of problems for restricted hierarchical hybrid systems
A comparison of identification criteria for inductive inference of recursive real-valued functions
Select and permute: An improved online framework for scheduling to minimize weighted completion time
Single machine controllable scheduling with bounded makespan
Range assignment for energy efficient broadcasting in linear radio networks
Optimal routing in double loop networks
On the complexity of the correctness problem for non-zeroness test instruction sequences
On the (im)possibility of non-interactive correlation distillation
String attractors of episturmian sequences
The Largest Tree in a Random Graph
On computable numbers, with an application to the Druckproblem
Dualization in lattices given by implicational bases
Maximal sensitivity of Boolean nested canalizing functions
On the descriptional complexity of scattered context grammars
The Interchange or Pump (Di)Lemmas for Context-Free Languages
On the maximum cardinality cut problem in proper interval graphs and related graph classes
On structure and representations of cyclic automata
Rational elements of summation semirings
Speeding up Dynamic Programming with Applications to Molecular Biology
A combinatoric interpretation of dual variables for weighted matching and f-factors
Extending the notion of rationality of selfish agents: Second Order Nash equilibria
A logical characterization of extensive games with short sight
Path auctions with multiple edge ownership
Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
Minimax number of strata for online stratified sampling: The case of noisy samples
k-Means++ under approximation stability
Generalized Galois Theory and its Application to Complexity
A generalization of Cobham's theorem to automata over real numbers
Locating and repairing faults in a network with mobile agents
Parameter Free Induction and Provably Total Computable Functions
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice
Near-linear time approximation schemes for geometric maximum coverage
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing
Computing real witness points of positive dimensional polynomial systems
Peg-solitaire, string rewriting systems and finite automata
Domino tilings and related models: space of configurations of domains with holes
kNN-P: A kNN classifier optimized by P systems
Optimal eviction policies for stochastic address traces
A time-optimal solution for the path cover problem on cographs
A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets
Fusion Trees can be Implemented with AC 0 Instructions Only
Matching and Weighted P 2 -Packing: Algorithms and Kernels
The one-cop-moves game on graphs with some special structures
On the recognition of search trees generated by BFS and DFS
Computations in APS
On Flowchart Theories: Part II. The Nondeterministic Case
A Unified Constructive Network Model for Problem-Solving
Idempotent and co-idempotent stack filters and min-max operators
Covariant Types
Secrecy types for asymmetric communication
Maximal common subsequence algorithms
Analysis of a cellular automaton model for car traffic with a junction
Sequential computation of linear Boolean mappings
Diagonal of pseudoinverse of graph Laplacian: Fast estimation and exact results
Star-critical Ramsey number of large cycle and book of different orders
On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems
Matrices of 3-iet preserving morphisms
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability
On recursive tiling of some mathematical objects
Majority-based reversible logic gates
A new heap game
The Voting algorithm is robust to various noise models
The frequent items problem, under polynomial decay, in the streaming model
Decomposition orders another generalisation of the fundamental theorem of arithmetic
A survey on the state of the art of complexity problems for covering arrays
Fluid approximation of broadcasting systems
A generic framework for heap and value analyses of object-oriented programming languages
Some classes of graphs that are not PCGs
Weighted automata and weighted logics
Loop detection in term rewriting using the eliminating unfoldings
Testing piecewise functions
Automata over continuous time
Paths and trails in edge-colored weighted graphs
Automatic semigroups
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294]
Substitution Revisited
A New Approach to Recursion Removal
Adaptive metric dimensionality reduction
The influence of maximum ( s , t )-cuts on the competitiveness of deterministic strategies for the Canadian Traveller Problem
Online independent sets
On generic context lemmas for higher-order calculi with sharing
Gray coding cubic planar maps
Locality and Interleaving Semantics in Calculi for Mobile Processes
Recognizing Different Types of Beta-Cycles in a Database Scheme
Recognition of Graphs by Automata
Online packet scheduling with bounded delay and lookahead
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Algorithms and Methods in Differential Algebra
Fixing Zeno gaps
On Priority in Cosy
Quantitative mu-calculus and CTL defined over constraint semirings
Cook Versus Karp-Levin: Separating Completeness Notions if NP is not Small
Accepting networks of splicing processors: Complexity results
Information integration using logical views
A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete
On time-travel planning in dynamic graphs
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
Efficient Parallel Algorithms for Doubly Convex-Bipartite Graphs
Algorithmic networks: Central time to trigger expected emergent open-endedness
Structure of squares and efficient domination in graph classes
Fast Parallel Language Recognition by Cellular Automata
The class constrained bin packing problem with applications to video-on-demand
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
Regular closed sets of permutations
Hierarchical Verification of Asynchronous Circuits Using Temporal Logic
Packing internally disjoint Steiner paths of modified bubble-sort networks
New results for finding common neighborhoods in massive graphs in the data stream model
Complex patterns in networks of hyperexcitable neurons
Deriving Algorithms on Reconfigurable Networks Based on Function Decomposition
When ambients cannot be opened
Obtaining simulation extractable NIZKs in the updatable CRS model generically
Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
Performance evaluation on hybrid fault diagnosability of regular networks
Neutral and tree sets of arbitrary characteristic
Constructing Compact Rectilinear Planar Layouts Using Canonical Representation of Planar Graphs
On maximin share allocations in matroids
Solving min ones 2-sat as fast as vertex cover
Non-contextual chocolate balls versus value indefinite quantum cryptography
A Declarative Semantics of Flat Guarded Horn Clauses for Programs with Perpetual Processes
On Formal Power Series Defined by Infinite Linear Systems
On the parameterized complexity of separating certain sources from the target
Small normalized circuits for semi-disjoint bilinear forms require logarithmic and-depth
Obituary for Sheng Yu
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Cooperation in Context-Free Grammars
A probabilistic algorithm for updating files over a communication link
Neighbor-locating colorings in graphs
Mixed languages
Abstractions for fault-tolerant global computing
Natural models for evolution on networks
The pessimistic diagnosabilities of some general regular graphs
Generating irregular partitionable data structures
Strongly Menger-edge-connectedness of DCell networks
Unique Fixed Points Vs. Least Fixed Points
On some FPT problems without polynomial Turing compressions
Permuting machines and priority queues
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles
Algorithm on rainbow connection for maximal outerplanar graphs
Non-Finite Specifiability of Projections of Functional Dependency Families
Reducing rank-maximal to maximum weight matching
Structure connectivity and substructure connectivity of hypercubes
Lower Bounds on the Competitive Ratio for Mobile User Tracking and Distributed Job Scheduling
Combinatorial properties of smooth infinite words
A Fast Algorithm for Constructing a Tree Automaton Recognizing a Congruential Tree Language
A Logical Characterization of Well Branching Event Structures
On generalized computable universal priors and their convergence
Accelerated approximation of the complex roots and factors of a univariate polynomial
Computational processes, observers and Turing incompleteness
A note on preservation of strong normalisation in the λ-calculus
Cascade products and Wheeler automata
Paired many-to-many disjoint path covers in faulty hypercubes
A Two-Person Game on Graphs Where Each Player Tries to Encircle his Opponent's Men
Decoding interleaved Reed-Solomon codes over noisy channels
A More Complete Model of Communicating Processes
Finite automata for compact representation of tuple dictionaries
Three-dimensional weak visibility: Complexity and applications
Improved algorithms for latency minimization in wireless networks
On the Computational Complexity of Satisfiability in Propositional Logics of Programs
A Feature Constraint System for Logic Programming with Entailment
A Foundation for Modular Reasoning About Safety and Progress Properties of State-Based Concurrent Programs
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs
Nine test tubes generate any RE language
Streaming algorithms for language recognition problems
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
A representation of L-domains by information systems
Generalising automaticity to modal properties of finite structures
GA performance distributions and randomly generated binary constraint satisfaction problems
Realizability models for a linear dependent PCF
Periodicity and local complexity
The extra local diagnosability and diagnosis algorithm of networks under the PMC model
Complexity in the case against accuracy estimation
Symmetric Space-Bounded Computation
On Noncounting Regular Classes
Parameterized algorithms for conflict-free colorings of graphs
The Equational Theory of Pomsets
Rewriting rule chains modeling DNA rearrangement pathways
Complexity of Selection in X + Y
An edge deletion model for complex networks
Semantique Asynchrone et Comportements Infinis en CSP
On the complexity of finding emerging patterns
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
A concise functional neural network computing the largest modulus eigenvalues and their corresponding eigenvectors of a real skew matrix
Triangulating a convex polygon with fewer number of non-standard bars
Poset-valued sets or how to build models for linear logics
Compositional analysis for verification of parameterized systems
Testing for Grammatical Coverings
Strong cocycle triviality for Z2 subshifts
NFA reduction algorithms by means of regular inequalities
Complexity of question/answer games
Ancestors, descendants, and gardens of Eden in reaction systems
Approximation for the minimum cost doubly resolving set problem
A revisit of the scheme for computing treewidth and minimum fill-in
A selected tour of the theory of identification matrices
Periodic D0L Languages
Further parameterized results on weak Grundy coloring
Effective metric spaces and representations of the reals