yusuke1997/dblp-id-title huggingface dataset:
Parameterized complexity in multiple-interval graphs: Domination, partition, separation, irredundancy
Connectivity and super connectivity of the exchanged 3-ary n -cube
Slender 0L Languages
A Classification of Complexity Core Lattices
Parameterized complexity of team formation in social networks
Coppo-Dezani Types do not Correspond to Propositional Logic
Tau laws for pi calculus
Foreword: Pattern Discovery in the Post Genome
Deciding the isomorphism problem in classes of unary automatic structures
Edge-isoperimetric problems for cartesian powers of regular graphs
Domain-theoretical models of parametric polymorphism
On the weak computability of a four dimensional orthogonal packing and time scheduling problem
Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances
Simple real-time constant-space string matching
Analysis of an iterated local search algorithm for vertex cover in sparse random graphs
Equivalence of two fixed-point semantics for definitional higher-order logic programs
On the Equivalence Problem for Regular Thue Systems
Succinct certification of monotone circuits
Logic, Language, Information and Computation
Lattices and multi-dimensional words
Gathering robots in graphs: The central role of synchronicity
The quantitative linear-time-branching-time spectrum
On inter-deriving small-step and big-step semantics: A case study for storeless call-by-need evaluation
Tree-width and the monadic quantifier hierarchy
Finding a tree structure in a resolution proof is NP-complete
A tighter proof for CCA secure inner product functional encryption: Genericity meets efficiency
The Theory of (N, +, Vk, V1) is Undecidable
Entropy as a fixed point
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
A functorial semantics for multi-algebras and partial algebras, with applications to syntax
Formal study of functional orbits in finite domains
Self-masking for hardening inversions
Combinatorics and algorithms for low-discrepancy roundings of a real sequence
Coordination mechanisms
Polynat in PER models
A Sound and Complete Axiomatization of Embedded Cross Dependencies
The one-round multi-player discrete Voronoi game on grids and trees
Channel allocation revisited through 1-extendability of graphs
Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
DAQV: Distributed Array Query and Visualization Framework
Over Testable Languages
Factor versus palindromic complexity of uniformly recurrent infinite words
Well-behaved principles alternative to bounded induction
Primitive 2-structures with the (n-2)-Property
Mathematical characterizations and computational complexity of anti-slide puzzles
Makespan minimization on unrelated parallel machines with a few bags
Next-preserving branching bisimulation
Partitioned factors in Christoffel and Sturmian words
Survivable network activation problems
Representation of a Discretely Controlled Continuous System in Tense Arithmetic
On average sequence complexity
A Hierarchy of Propositional Horn Formulas
Composition sequences for functions over a finite domain
Reoptimization of Steiner trees: Changing the terminal set
A Note on Guarded Theories
Finite DOL Languages and Codes
On the complexity of computation maximal exponent of periodicity of word equations and expressible relations (note)
Diffusion operator and spectral analysis for directed hypergraph Laplacian
The Ciao Module System: A New Module System for Prolog
The limits of fixed-order computation
Linear-Time String-Matching Using only a Fixed Number of Local Storage Locations
Three-dimensional convex hull as a fruitful source of diagrams
Proof-labeling schemes: Broadcast, unicast and in between
Scattered packings of cycles
Kleene Chain Completeness and Fixedpoint Properties
Séparateurs dans les mots infinis engendrés par morphismes
Formal metatheory of the Lambda calculus using Stoughton's substitution
Arborescences and shortest path trees when colors matter
Voronoi diagrams on piecewise flat surfaces and an application to biological growth
On the Power of Recursive Optimizers
Policy analysis for Administrative Role-Based Access Control
Revocable hierarchical identity-based encryption via history-free approach
The parameterized complexity and kernelization of resilience for database queries
Computing with quanta - impacts of quantum theory on computation
Planar drawings of fixed-mobile bigraphs
Solution of David Gale's lion and man problem
A Quadtree Algorithm for Template Matching on a Pyramid Computer
The total run length of a word
Complexity of the bisection method
On the proper orientation number of bipartite graphs
The signature of rational languages
A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints
Language not Recognizable in Real Time by One-Way Cellular Automata
Realizability and verification of MSC graphs
Parameterized coloring problems on chordal graphs
Discrete rotations and symbolic dynamics
Computer science and the fine structure of Borel sets
An excursion in reaction systems: From computer science to biology
Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Equitable and equitable list colorings of graphs
Recognizable Languages in Concurrency Monoids
Properties of Gomory-Hu co-cycle bases
Remarques sur les Langages de Parenthèses
A P-Complete Graph Partition Problem
Lifting in Z
Avoiding square-free words on free groups
The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM ⁎ model
Pairs of SAT-assignments in random Boolean formulæ
Geometric search for Hadamard matrices
Coalgebras and monads in the semantics of Java
Guest editorial: Structural Information and Communication Complexity
Ensuring completeness of symbolic verification methods for infinite-state systems
Addition in log 2 n + O(1) Steps on Average: A Simple Analysis
Complexity of the Hamiltonian Cycle in Regular Graph Problem
Numeration systems on a regular language: arithmetic operations, recognizability and formal power series
On the minimum gap between sums of square roots of small integers
Avoiding 2-binomial squares and cubes
Maximum reachability preserved graph cut
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-offs
Recurrent Words and Simultaneous Growth in T0L Systems
Upper bounds and algorithms for parallel knock-out numbers
On the (n, t)-antipodal Gray codes
Actor theories in rewriting logic
Finitary formal topologies and Stone's representation theorem
Coordinating oligopolistic players in unrelated machine scheduling
Computability on Subsets of Euclidean Space I: Closed and Compact Subsets
On local transformation of polygons with visibility properties
Automaton semigroups: New constructions results and examples of non-automaton semigroups
On Unambiguous Reductions of Monoids of Unambiguous Relations
Algorithm and hardness results in double Roman domination of graphs
Paging More than One Page
Restricted CRCW PRAM
Decompositions for the edge colouring of reduced indifference graphs
Nonexistence of uniformly most reliable two-terminal graphs
Weighted and locally bounded list-colorings in split graphs, cographs, and partial k -trees
Hardness of computing width parameters based on branch decompositions over the vertex set
Transitive Closure and Related Semiring Properties via Eliminants
Deterministic Optimal and Expedient Move-to-Rear List Organizing Strategies
On the complexity of the reflected logic of proofs
Deciding Observational Congruence of Finite-State CCS Expressions by Rewriting
Standard Sturmian words and automata minimization algorithms
Compositional analysis of contract-signing protocols
La Reconnaissance des Facteurs d'un Mot dans un Texte
Dealing with undependable workers in decentralized network supercomputing
A decidable class of planar linear hybrid systems
An approximate A* algorithm and its application to the SCS problem
The Alamo Execution Monitor Architecture
Generateurs Algebriques et Systemes de Paires Iterantes
Complexity of Gröbner basis detection and border basis detection
Complexity of proper prefix-convex regular languages
Learning and extending sublanguages
New results on maximum induced matchings in bipartite graphs and beyond
Combination of constraint systems II: Rational amalgamation
Subset sum "cubes" and the complexity of primality testing
The Three Subfamilies of Rational omega-Languages Closed under omega-Transduction
Profit maximization in social networks and non-monotone DR-submodular maximization
An analysis for strength improvement of an MCTS-based program playing Chinese dark chess
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Quality gain analysis of the weighted recombination evolution strategy on general convex quadratic functions
Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns
General suffix automaton construction algorithm and space bounds
Using abstract interpretation to add type checking for interfaces in Java bytecode verification
On the number of infinite sequences with trivial initial segment complexity
The Turing closure of an Archimedean field
Approximate Inference of Functional Dependencies from Relations
The intersection of algebra and coalgebra
Constructions of dynamic and non-dynamic threshold public-key encryption schemes with decryption consistency
Maximum regular induced subgraphs in 2 P 3 -free graphs
Partial order semantics and read arcs
Trace inclusion for one-counter nets revisited
Strongly full-hiding inner product encryption
On languages generated by asynchronous spiking neural P systems
Infinite lambda-Calculus and Types
Time-free solution to SAT problem using P systems with active membranes
On approximation algorithms of k-connected m-dominating sets in disk graphs
Extending Parikh matrices
Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
On solving the 7, 7, 5-game and the 8, 8, 5-game
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I
Move-optimal partial gathering of mobile agents in asynchronous trees
Verifying chemical reaction network implementations: A bisimulation approach
Domain and event structure semantics for Petri nets with read and inhibitor arcs
Late and Early Semantics Coincide for Testing
An irregularfilter model
Quantum implicit computational complexity
A Logical Characterization of Observation Equivalence
Minimisation of Acyclic Deterministic Automata in Linear Time
Lower bounds of shortest vector lengths in random NTRU lattices
Inferences for Numerical Dependencies
New results on edge-bandwidth
Fixed-parameter algorithms for Kemeny rankings
Least adaptive optimal search with unreliable tests
Automata for solid codes
The impact of dynamic events on the number of errors in networks
Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
On images of D0L and DT0L power series
Accurate solution of near-colliding Prony systems via decimation and homotopy continuation
The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets
Parallel String Matching with k Mismatches
Efficient algorithms for enumerating maximal common subsequences of two strings
Constructing de Bruijn sequences by concatenating smaller universal cycles
Path Integrals, Bayesian Vision, and Is Gaussian Quadrature Really Good?
On the robustness of interconnections in random graphs: a symbolic approach
Making the use of maximal ideals constructive
Deviation Theorems for Solutions of Differential Equations and Applications to Lower Bounds on Parallel Complexity of Sigmoids
Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint
Graphs determined by polynomial invariants
Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks
The Euclidean Traveling Salesman Problem is NP-Complete
Generalized satisfiability problems: minimal elements and phase transitions
Covarieties and complete covarieties
Synchronisation déterministe des automates à délai borné
Color-Families are Dense
Analytical description of digital intersections: Minimal parameters and multiscale representation
Local consistency for extended CSPs
Bernstein-Bezoutian matrices
Decomposing polynomial sets into simple sets over finite fields: The positive-dimensional case
Discrete evacuation in graphs with multiple exits
A sublinear-time approximation scheme for bin packing
Partial Evaluation and omega-Completeness of Algebraic Specifications
An Omega(n-4/3) Lower Bound on the Monotone Network Complexity of the n-th Degree Convolution
State-complexity hierarchies of uniform languages of alphabet-size length
Fully bordered words
Interactive observability in Ludics: The geometry of tests
On the support of graph Lie algebras
Ternary directed acyclic word graphs
Two-dimensional on-line bin packing problem with rotatable items
Theory of tailor automata
Posets having continuous intervals
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations
On the computational power of BlenX
Generation matrix: An embeddable matrix representation for hierarchical trees
Apartness, compactness and nearness
Two-stage non-submodular maximization
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements
A constrained two-stage submodular maximization
Infinite Arrays and Controlled Deterministic Table 0L Array Systems
A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient
Succinct data structure for dynamic trees with faster queries
A Compositional Semantics for Logic Programs
NP problems are tractable in the space of cellular automata in the hyperbolic plane
On the hardness of optimization in power-law graphs
The Mal'cev Lemma and rewriting on semirings
A note on the geodetic number and the Steiner number of AT-free graphs
Sokoban: improving the search with relevance cuts
Lower Bounds for the Complexity of Polynomials
Circuit principles and weak pigeonhole variants
All for one and one for all: An O(1)-musketeers generic transformation for rotating robots
Eliciting truthful reports with partial signals in repeated games
Finite-Model Theory - A Personal Perspective
A Relationship between ET0L and EDT0L Languages
The complexity of ferromagnetic 2-spin systems on bounded degree graphs
Mathematical logic and quantum finite state automata
Simulation limitations of affine cellular automata
The complexity of counting edge colorings for simple graphs
Quantum Büchi automata
Strong triadic closure in cographs and graphs of low maximum degree
A Domain-Theoretic Approach to Computability on the Real Line
Realization problems on reachability sequences
Complexity of finding maximum regular induced subgraphs with prescribed degree
A Contribution to the Theory of Program Testing
Approximate string matching using compressed suffix arrays
Polygonal Radix Representations of Complex Numbers
Local fairness in hedonic games via individual threshold coalitions
Multi-cut alpha-beta-pruning in game-tree search
Disjunctive Decomposition of Languages
A Logic for Category Theory
Counting and sampling SCJ small parsimony solutions
Real Functions and Numbers Defined by Turing Machines
Connected searching of weighted trees
HTN-like solutions for classical planning problems: An application to BDI agent systems
A new proof for exact relationship between extra connectivity and extra diagnosability of regular connected graphs under MM* model
Primitivity is Hereditary for 2-Structures
Naor-Yung paradigm with shared randomness and applications
On the Topological Size of p-m-Complete Degrees
Parameterized complexity of vertex deletion into perfect graph classes
On extensions of the deterministic online model for bipartite matching and max-sat
Computability on the Probability Measureson the Borel Sets of the Unit Interval
Visibly linear dynamic logic
Automatic synthesis of switching controllers for linear hybrid systems: Safety control
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Voronoi game on graphs
Energy efficient scheduling of parallelizable jobs
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
Complexity-theoretic models of phase transitions in search problems
A practical algorithm for making filled graphs minimal
Special Issue on Selected Papers from the 11th International Conference and Workshops on Algorithms and Computation (WALCOM 2017)
Erratum to "New upper bounds to the limitedness of distance automata"
Backup 2-center on interval graphs
The projector algorithm: A simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
Generalized submodular cover problems and applications
More properties of the Fibonacci word on an infinite alphabet
Improved approximation algorithms for constrained fault-tolerant resource allocation
A Continuous Semantics for Unbounded Nondeterminism
On the Ordering of Sparse Linear Systems
Correlation clustering in general weighted graphs
Rational Languages and the Burnside Problem
The alternating greedy expansion and applications to computing digit expansions from left-to-right in cryptography
Adjunction of Semifunctors: Categorical Structures in Nonextensional Lambda Calculus
The Complexity of Pursuit on a Graph
Critical Classes for the alpha_0-Product
On the parameterized complexity of s-club cluster deletion problems
Tightly secure signature schemes from the LWE and subset sum assumptions
On-Line Algorithms for Orders
The minimal polynomial of a sequence obtained from the componentwise linear transformation of a linear recurring sequence
Some Decision Problems for Parallel Communicating Grammar Systems
Algebraic foundations for qualitative calculi and networks
A Proof on Simon's Theorem on Piecewise Testable Languages
Completeness in approximation classes beyond APX
Functions with local state: Regularity and undecidability
Fixed points and attractors of reactantless and inhibitorless reaction systems
Automatic synthesis of schedulers in timed systems
On the complexity of coordinated display of multimedia objects
Corrigendum: Fast Recognition of Deterministic CFL's with a Smaller Number of Processors
Competitive routing over time
Optimal algorithms for online single machine scheduling with deteriorating jobs
On the power of parallel communicating Watson-Crick automata systems
Upward separations and weaker hypotheses in resource-bounded measure
Probabilistic Modeling of Data Structures on Words: A Reply to Professor Andersson's Letter
Efficient computation of the oriented chromatic number of recursively defined digraphs
Deadline guaranteed packet scheduling for overloaded traffic in input-queued switches
A quantitative extension of interval temporal logic over infinite words
Equational Unification, Word Unification, and 2nd-Order Equational Unification
(r, p)-centroid problems on paths and trees
A Fundamental Effect in Computations on Real Numbers
Hypercomputation by definition
A loop-free shortest-path routing algorithm for dynamic networks
Quasiperiodicity and String Covering
A Note on a Problem in the Theory of Grammatical Complexity
Improved bounds for the CF algorithm
Alternating Automata, the Weak Monadic Theory of Trees and its Complexity
Steps toward a homogenization procedure for spiking neural P systems
A probabilistic study of generalized solution concepts in satisfiability testing and constraint programming
A new construction of odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity
Topological Characterizations of Infinite Tree Languages
Identity-based matchmaking encryption with stronger security and instantiation on lattices
Detecting equivalence of modular specifications with categorical diagrams
Rumor correction maximization problem in social networks
An Efficient Strategy for Non-Horn Deductive Databases
Block sensitivity of weakly symmetric functions
Simulation of one-way cellular automata by boolean circuits
List matrix partitions of chordal graphs
On Algebraic Generalized Zeta Functions of Formal Power Series
Research on a novel construction of probabilistic visual cryptography scheme ( k , n , 0, 1, 1)-PVCS for threshold access structures
Historical Introduction to "Concrete Domains" by G. Kahn and Gordon D. Plotkin
There is no Local Characterization of Separating and Thin Objects in Z³
Modeling and simulation of cardiac tissue using hybrid I/O automata
Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency
Elementarily computable functions over the real numbers and R-sub-recursive functions
Iterative compression and exact algorithms
Universal automata and NFA learning
Stochastic submodular probing with state-dependent costs
Checkpointing with mutable checkpoints
The Meaning of Specifications I: Domains and Initial Models
Ockham's razor, empirical complexity, and truth-finding efficiency
Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets
Incremental single-source shortest paths in digraphs with arbitrary positive arc weights
Solving shortest paths efficiently on nearly acyclic directed graphs
Lower bounds for restricted read-once parity branching programs
On-Line Load Balancing
Topological separations in inductive inference
Special issue on Computing and Combinatorics Conference
Computability in linear algebra
Partial pushout semantics of generics in DOL
Bayesian networks: The minimal triangulations of a graph
Objects, Interference, and the Yoneda Embedding
The role of information in the cop-robber game
On Equivalence of Grammars Through Transformation Trees
Flow analysis of lazy higher-order functional programs
On the design of efficient ATM routing schemes
A Non-Ground Realization of the Stable and Well-Founded Semantics
Leading strategies in competitive on-line prediction
On properties of bond-free DNA languages
Constructible graphs and pursuit
Deletion along trajectories
An approach to strategies in concurrent systems
On the minimum clique partitioning problem on weighted chordal graphs
A causal semantics for time Petri nets
Dynamic Euclidean bottleneck matching
Maximal unbordered factors of random strings
Dynamically equivalent disjunctive networks
Hyper-optimization for deterministic tree automata
Lower Bounds on Communication Overlap of Networks
Bounded Capacity Priority Queues
Generating well-shaped d-dimensional Delaunay Meshes
Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights
Maximum likelihood analysis of algorithms and data structures
The equivalence between Galois and Fibonacci NFSRs
Optimal computation with non-unitary quantum walks
From key predistribution to key redistribution
Deterministic risk control for cost-effective network connections
Duality Beyond Sober Spaces: Topological Spaces and Observation Frames
Information systems in modeling interactive computations on granules
A strongly polynomial time algorithm for the maximum supply rate problem on trees
Two Distributed Problems Involving Byzantine Processes
Promise problems solved by quantum and classical finite automata
Computing the longest topological common subsequence of a symbol-wise totally ordered directed acyclic graph and a sequence
Confident and consistent partial learning of recursive functions
Complexity of approximating bounded variants of optimization problems
Avoidable Patterns on Two Letters
On a class of covering problems with variable capacities in wireless networks
Building Exact Computation Sequences
Sofic-Dyck shifts
Split clique graph complexity
Matrix insertion-deletion systems
Modelling biochemical pathways through enhanced pi-calculus
Communication Complexity Hierarchy
Using acceptors as transducers
On 1-factorizations of bipartite Kneser graphs
An observationally complete program logic for imperative higher-order functions
Provably secure certificate-based encryption with leakage resilience
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound