yusuke1997/dblp-id-title huggingface dataset:
The anti-Oberwolfach solution: pancyclic 2-factorizations of complete graphs
The maximum resource bin packing problem
Global exponential convergence of recurrent neural networks with variable delays
Appendix B: Open problems at the 2002 Dagstuhl Seminar on Algorithmic Combinatorial Game Theory
The snap-stabilizing message forwarding algorithm on tree topologies
On the isomorphism problem for decision trees and decision lists
New Curry-Howard Terms for Full Linear Logic
Reversible Simulation of Space-Bounded Computations
Popularity of patterns over d -equivalence classes of words and permutations
Characterizations of Some Classes of Regular Events
Checking equivalence of corecursive streams: An inductive procedure
Disjoint path covers joining prescribed source and sink sets in interval graphs
Proof assistance for real-time systems using an interactive theorem prover
Grid structures and undecidable constraint theories
The moving curve ideal and the Rees algebra
Separating models of learning with faulty teachers
Alignment with non-overlapping inversions and translocations on two strings
Performance evaluation for energy efficient topologic control in ad hoc wireless networks
An Algorithm for Shifted Continued Fraction Expansions in Parallel Linear Time
On routing of wavebands for all-to-all communications in all-optical paths and cycles
An assertion concerning functionally complete algebras and NP-completeness
Special Issue: "Combinatorial Optimization: Theory of Algorithms and Complexity"
Recursively Defined Doains and their Induction Principles
DFA minimization: Double reversal versus split minimization algorithms
Stochastic biological modelling in the presence of multiple compartments
Oblivious polynomial evaluation and oblivious neural learning
A Functional LR Parser
Dynamic deterministic pattern-matching
On the Cell Probe Complexity of Polynomial Evaluation
On the rigidity of Vandermonde matrices
Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types
Succinct encoding of arbitrary graphs
Forewords: Special issue on graph searching
Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
Repetition-Free Words
Enumeration of BC-subtrees of trees
Context granulation and subjective-information quantification
A generic construction of tightly secure signatures in the multi-user setting
An Example of an Indexed Language of Intermediate Growth
Polynomial summaries of positive semidefinite kernels
A linear edge kernel for two-layer crossing minimization
Interval Queries on Object Histories
Axioms for real-time logics
Towards a real-time distributed computing model
Simulating the CRCW PRAM on Reconfigurable Networks
Range assignment of base-stations maximizing coverage area without interference
Characterization, definability and separation via saturated models
A shared-variable concurrency analysis of multi-threaded object-oriented programs
Logical foundations of CafeOBJ
Non-cryptographic primitive for pseudorandom permutation
On the Parallel Recognition of Unambiguous Context-Free Languages
Squaring transducers: an efficient procedure for deciding functionality and sequentiality
Forced color classes, intersection graphs and the strong perfect graph conjecture
Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
Expected reachability-time games
The Zooming Method: A Recursive Approach to Time-Space Efficient String-Matching
A First Order Logic of Effects
A Transformational Characterization of if-then-else
Conversation types
On the similarity metric and the distance metric
A theory of injection-based vulnerabilities in formal grammars
Finding top- k longest palindromes in substrings
Computational virtuality in biological systems
A generalization of Naundorf's fixpoint theorem
Restrictions and Representations of Vector Controlled Concurrent System Behaviours
Partial algebras, meaning categories and algebraization
Efficient sensor network design for continuous monitoring of moving objects
Observations Concerning a Public-Key Cryptosystem Based on Iterated Morphisms
Gray codes for Fibonacci q -decreasing words
Preface: Algorithmic Combinatorial Game Theory
Optimal insertion in deterministic DAWGs
A certifying and dynamic algorithm for the recognition of proper circular-arc graphs
Search for an immobile Hider in a known subset of a network
On the edge l infinitf radius of Saitou and Nei's method for phylogenetic reconstruction
Static and expanding grid coverage with ant robots: Complexity results
Semigroups and Languages of Dot-Depth Two
Resolution-Based Approach to Computability Analysis of Interacting Automata
GF(2)-operations on basic families of formal languages
From sandpiles to sand automata
Monotone runs of uniformly distributed integer random variables: A probabilistic analysis
Popular mixed matchings
On bounded linear codes and the commutative equivalence
NL-printable sets and nondeterministic Kolmogorov complexity
New permutation coding and equidistribution of set-valued statistics
The searchlight problem for road networks
Modeling spiking neural networks
Derivatives of rational expressions with multiplicity
Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
Constructing red-black spanners for mixed-charging vehicular networks
Locating a robber on a graph via distance queries
Approximate cover of strings
On t-extensions of the Hankel determinants of certain automatic sequences
Local spreading algorithms for autonomous robot systems
Merit Factors and Morse Sequences
Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves
Some structural properties of low-rank matrices related to computational complexity
Some results about the chaotic behavior of cellular automata
Two Finite Specifications of a Queue
Quiescence of self-stabilizing gossiping among mobile agents in graphs
Density results on floating-point invertible numbers
Morphism axioms
Improved hardness and approximation results for single allocation hub location problems
Geometric inhomogeneous random graphs
On the Order of Approximation in Approximative Triadic Decompositions of Tensors
Sequential and Concurrent Behaviour in Petri Net Theory
Updating the complexity status of coloring graphs without a fixed induced linear forest
Two Iteration Theorems for the LL(k) Languages
Polynomial time algorithms for three-label point labeling
Distance domains: Continuity
Real functions incrementally computable by finite automata
Erratum to "On the expressiveness of higher dimensional automata": [TCS 356 (2006) 265-290]
Determinateness of Program Equivalence over Peano Axioms
A kappa-Denotational Semantics for Map Theory in ZFC + SI
Efficient algorithms to compute compressed longest common substrings and compressed palindromes
The n-trigles, a new variant in the SameSum family
Inapproximability results for equations over infinite groups
Recursion and corecursion have the same equational logic
Generalized Knapsack Problems and Fixed Degree Separations
The swap matching problem revisited
Realizability Interpretation of Generalized Inductive Definitions
On the surface area of the (n, k)-star graph
A parameterized algorithm for subset feedback vertex set in tournaments
Team Behaviour in Eco-Grammar Systems
Sufficient conditions for k-restricted edge connected graphs
A new fast root-finder for black box polynomials
Bisimilarity on Basic Parallel Processes
Reasoning under minimal upper bounds in propositional logic
Parameterized complexity of coloring problems: Treewidth versus vertex cover
A calculus for reasoning about software composition
Multidepot capacitated vehicle routing with improved approximation guarantees
Secure identification and QKD in the bounded-quantum-storage model
Reconstructing parameterized strings from parameterized suffix and LCP arrays
A class of hierarchical graphs as topologies for interconnection networks
Decidability of infinite-state timed CCP processes and first-order LTL
On Davis-Putnam reductions for minimally unsatisfiable clause-sets
Characterising FS domains by means of power domains
Non-Interleaving Semantics for Mobile Processes
Stabilization of max-min fair networks without per-flow state
Variétés et fonctions rationnelles
Decision tree approximations of Boolean functions
Optimally reordering mobile agents on parallel rows
Enumeration and maximum number of minimal dominating sets for chordal graphs
Computing coverage kernels under restricted settings
Preface: Insightful Theory
The IO- and OI-Hierarchies
A property of random context picture grammars
A Bridge Between Constructive Logic and Computer Programming
Size Bounds for Superconcentrators
Abstract Data Type Systems
Distributional analysis of swaps in Quick Select
The diagnosability of Möbius cubes for the g -extra condition
On linear-size pseudorandom generators and hardcore functions
How to avoid the commuting conversions of IPC
Distributed broadcast in radio networks of unknown topology
Inferring strings from Lyndon factorization
Representations versus numberings: on the relationship of two computability notions
Computing queries with higher-order logics
Lower and upper bounds for long induced paths in 3-connected planar graphs
Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
Number representation using generalized (-beta)-transformation
Impossibility of gathering by a set of autonomous mobile robots
On the Limit Set of Some Universal Cellular Automata
Partial pullback complement rewriting along admissible matches
The Undecidability of Some Equivalence Problems Concerning NGSM's and Finite Substitutions
Competitive mechanisms for energy-efficient cloud computing
Irreducible reaction systems and reaction system rank
Non-local length estimators and concave functions
A Semantics for Modular General Logic Programs
Generalized acceptance, succinctness and supernondeterministic finite automata
Approximation algorithms for maximum weighted throughput on unrelated machines
An O * (3.53 3k )-time parameterized algorithm for the 3-set packing problem
Simultaneous (Poly-Time, Log-Space) Lower Bounds
Finding a maximum minimal separator: Graph classes and fixed-parameter tractability
Model checking computation tree logic over finite lattices
Some problems in distributed computational geometry
Reversible, Irreversible and Optimal lambda-Machines
On-Line Computation of Minimal and Maximal Length Paths
Accepting Conditions for Automata on omega-Languages
Quantifying communication in synchronized languages
Algorithms for parameterized maximum agreement forest problem on multiple trees
Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States
Implementing conditional term rewriting by graph rewriting
Truthful unit-demand auctions with budgets revisited
Equivalence of simple functions
Preface: Recent Developments in Domain Theory: A collection of papers in honour of Dana S. Scott
Conway's problem for three-word sets
RQL: A Query Language for Rule Discovery in Databases
Optimal Dynamic Embedding of X-Trees Into Arrays
Computable model discovery and high-level-programming approximations to algorithmic complexity
Batcher's odd-even exchange revisited: A generating functions approach
On the computational complexity of imperative programming languages
mu -Recursion and infinite limits
Largest similar copies of convex polygons in polygonal domains
Query by committee, linear separation and random walks
Complexity of the multi-service center problem
On designing truthful mechanisms for online scheduling
Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP
Normal forms for spiking neural P systems
S4 enriched multimodal categorial grammars are context-free
Data aggregation in sensor networks: Balancing communication and delay costs
Finding biclusters by random projections
An Iterative and Starvation-Free Solution for a General Class of Distributed Control Problems Based on Interaction Primitives
Phase transition of the 3-majority opinion dynamics with noisy interactions
The hardness of resilience for nested aggregation query
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
The 2-surviving rate of planar graphs without 6-cycles
On subexponentials, focusing and modalities in concurrent systems
S2-Quasicontinuous posets
Towards the Mathematics Software Bus
Deciding Whether a Finite Set of Words has Rank at Most Two
Predictive learning models for concept drift
A new linear time algorithm to compute the genomic distance via the double cut and join distance
Signatures of knowledge for Boolean circuits under standard assumptions
Economy of Description by Parsers, DPDA'S, and PDA'S
Une Généralisation des Théorème de Higman et de Simon aux Mots Infinis
Two infinite families of polyominoes that tile the plane by translation in two distinct ways
Automaton-ABC: A statistical method to estimate the probability of spatio-temporal properties for parametric Markov population models
Sahlqvist theorem for modal fixed point logic
On the Effects of Noise and Speed on Computations
Normal conditions for inference relations and injective models
MUL-tree pruning for consistency and optimal reconciliation - complexity and algorithms
On the Computational Completeness of Context-Free Parallel Communicating Grammar Systems
A linkable ring signature scheme with unconditional anonymity in the standard model
Learning erasing pattern languages with queries
Generative power of three-nonterminal scattered context grammars
Minimal Strings in a Regular Language with Respect to a Partial Order on the Alphabet
Periodicity, morphisms, and matrices
Intensional Aspects of Function Definitions
Words and special factors
PAC Learning of Concept Classes Through the Boundaries of Their Items
Computing and Combinatorics
Algebraic information theory for binary channels
A 2 k -kernelization algorithm for vertex cover based on crown decomposition
Survey: Finite-state technology in natural language processing
Dependable computing: an overview
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures
A Static Analysis Method for a Classical Linear Logic Programming Language
Analysis of Dehn's Algorithm by Critical Pairs
The self-reduction in lambda calculus
Merging of 4 or 5 Elements with n Elements
From computation to foundations via functions and application: The -calculus and its webbed models
INTEX: An FST Toolbox
An improved algorithm for online rectangle filling
Four Domains for Concurrency
A map of update constraints in inductive inference
Factorizations of Free Monoids and Unaviodable Regularities
Facilitating the design of fault tolerance in transaction level SystemC programs
Finite degree clones are undecidable
On the complexity of the edge-disjoint min-min problem in planar digraphs
On the least number of palindromes in two-dimensional words
Category theoretic structure of setoids
Approximation and complexity of multi-target graph search and the Canadian traveler problem
On the failure of fixed-point theorems for chain-complete lattices in the effective topos
A polynomial-time approximation to a minimum dominating set in a graph
On Rational Series and Rational Languages
Data Types over Multiple-Values Logics
On linear complexity of sequences over GF (2 n )
A Behavioural Theory of First-Order CML
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
Parametric Channels via Label Expressions in CCS
Homogeneous Decomposition of Stochastic Systems
Algebras with parametrized iterativity
Simultaneous encodings for range and next/previous larger/smaller value queries
Asynchrony and persistence in reaction systems
Relatively Recursive Reals and Real Functions
Independent-valued minimax: Pathological or beneficial?
A Characterization of F-Complete Type Assignments
Computing the graph-based parallel complexity of gene assembly
Minimal consistent DFA revisited
When is the Ideal Completion of Abstract Basis Algebraic
Sums of read-once formulas: How many summands are necessary?
Adding the power-set to description logics
On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings
On Sparse Hard Sets for Counting Classes
Self-adjusting population sizes for the (1, λ )-EA on monotone functions
Asymptotic medians of random permutations sampled from reversal random walks
On a monadic semantics for freshness
On the equational definition of the least prefixed point
The System F of Variable Types, Fifteen Years Later
Half-turn symmetric FPLs with rare couplings and tilings of hexagons
The ksmt calculus is a δ -complete decision procedure for non-linear constraints
Optimal Strategies Against a Liar
Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs
Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
Which Data Types have omega-complete Initial Algebra Specifications?
Routing on Networks of Optical Crossbars
Towards area requirements for drawing hierarchically planar graphs
Post-processing optimization for continuous-variable quantum key distribution
An Efficient Recognizer for the Boolean Closure of Context-Free Languages
Approximation algorithms for the partial assignment problem
A Metatheorem for Undecidable Properties of Formal Languages and its Application to LRR and LLR Grammars and Languages
VPSPACE and a transfer theorem over the complex field
Generic construction for tightly-secure signatures from discrete log
On the hardness of palletizing bins using FIFO queues
Regular binoid expressions and regular binoid languages
Variations on the Bagdomain Theme
A unified greedy approximation for several dominating set problems
A high-level modular definition of the semantics of C#
Simultaneously moving cops and robbers
A k-Structure Generalization of the Theory of 2-Structures
The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values
Polynomial-time learnability of logic programs with local variables from entailment
On the Asymptotic Complexity of Rectangular Matrix Multiplication
Exact learning of juntas from membership queries
Sturmian images of non Sturmian words and standard morphisms
Optimizing tree and character compatibility across several phylogenetic trees
Fast algorithms for computing tree LCS
Foundation of a computable solid modelling
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
A hierarchy of deterministic context-free omega-languages
Scheduling series-parallel task graphs to minimize peak memory
On the structure of categories of coalgebras
Histogram-based segmentation of quantum images
Multi-break rearrangements and chromosomal evolution
Normal forms and syntactic completeness proofs for functional independencies
Cross-bifix-free sets in two dimensions
Faster exponential-time algorithms for approximately counting independent sets
Fast payment schemes for truthful mechanisms with verification
A formula for incorporating weights into scoring rules
Explicit substitutions for pi-congruences
Improved lower bounds for non-utilitarian truthfulness
Architecture independent parallel selection with applications to parallel priority queues
Language preorder as a precongruence
An anomaly-based intrusion detection system using recursive feature elimination technique for improved attack detection
Algorithms for long paths in graphs
Linear programs in a simple reversible language
Advancements on SEFE and Partitioned Book Embedding problems
Recursive Programming with Proofs
Dynamic regular registers in systems with churn
Factors of characteristic words of irrational numbers
Structure Theory of Equal Conflict Systems
Building bridges - Honoring Nataša Jonoska on the occasion of her 60th birthday
A fast algorithm for source-wise round-trip spanners
H-coloring degree-bounded (acyclic) digraphs
Approximation algorithms for the submodular edge cover problem with submodular penalties
Molecular pattern formation on grids in the Moblot model
On Tables of Random Numbers (Reprinted from "Sankhya: The Indian Journal of Statistics", Series A, Vol. 25 Part 4, 1963)
Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy
A metalanguage for guarded iteration
Formalizing Dijkstra's Predicate Transformer wp in Weak Second-Order Logic
The chop of languages
Abstract geometrical computation 4: Small Turing universal signal machines
A principled exploration of coordination models
Functional clones and expressibility of partition functions
Characterizing geometric patterns formable by oblivious anonymous mobile robots
A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic
The structural complexity landscape of finding balance-fair shortest paths
Improvements on contours based segmentation for DNA microarray image processing
A geometric approach to leveraging weak learners
Discrete time generative-reactive probabilistic processes with different advancing speeds
Learning of event-recording automata
On the Impossibility of the Homomorphic Characterization of Context-Sensitive Languages
Algorithmic analysis of polygonal hybrid systems, part I: Reachability
Reversal-Bounded Nondeterministic Multicounter Machines and Complementation
Sample complexity of hidden subgroup problem
The hitting and cover times of random walks on finite graphs using local degree information
Lower bounds for the query complexity of equilibria in Lipschitz games
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
Paired 2-disjoint path covers of multi-dimensional torus networks with 2n - 3 faulty edges
Toward an algebraic theory of systems
State complexity of power
Conditional diagnosability of a class of matching composition networks under the comparison model
Automated compositional proofs for real-time systems
Estimation of state complexity of combined operations
Beyond pointwise submodularity: Non-monotone adaptive submodular maximization subject to knapsack and k -system constraints
On Square-Free Factorization of Multivariate Polynomials over a Finite Field
Dense edge-disjoint embedding of complete binary trees in interconnection networks
Arithmetic computation in the tile assembly model: Addition and multiplication
Complexity of pattern classes and the Lipschitz property
Combining Data Type and Recursive Process Specifications Using Projection Algebras
On k -ary n -cubes and isometric words
On the independent spanning trees of recursive circulant graphs G(cd m , d) with d>2
A Faithful Computational Model of the Real Numbers
Primality test for numbers M with a large power of 5 dividing M 4 -1
Unique permutation hashing
Set systems: Order types, continuous nondeterministic deformations, and quasi-orders
On g-extra connectivity of folded hypercubes
On Synchronizing Unambiguous Automata
Capturing Strong Reduction in Director String Calculus
Sniffing helps to meet: Deterministic rendezvous of anonymous agents in the grid
Positive Rational Sequences
Indexed Types
On the complexity of non-unique probe selection
Differential interaction nets
Approximating maximum edge 2-coloring in simple graphs via local improvement
Formal logics of discovery and hypothesis formation by machine
Efficient Scheduling of Tasks without Full Use of Processor Resources
Alternating finite automata and star-free languages
Unique normal form property of compatible term rewriting systems: a new proof of Chew's theorem
Rendezvous with constant memory
Membrane systems with carriers
Integrité des Algèbres de Séries Formelles sur un Alphabet Partiellement Commutatif
Real-time, constant-space, constant-randomness verifiers
On the completeness and decidability of duration calculus with iteration
On the Shrinkage Exponent for Read-Once Formulae
Greedy algorithm for maximization of semi-monotone non-submodular functions with applications
Modalities in the Stone age: A comparison of coalgebraic logics
Foreword: Universal Machines and Computations
Randomized algorithms for online knapsack problems