yusuke1997/dblp-id-title huggingface dataset:
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
Preface: Mechanised Reasoning about Languages with Variable Binding 2001
A (1+ε)-approximation algorithm for sorting by short block-moves
Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices
Longest property-preserved common factor: A new string-processing framework
Control Machines: A New Model of Parallelism for Compositional Specifications and Their Effective Compilation
Note on the greedy parsing optimality for dictionary-based text compression
Game chromatic index of graphs with given restrictions on degrees
Incidence coloring of Mycielskians with fast algorithm
Catastrophic cascading failures in power networks
Approximation Algorithms for Weighted Matching
On the complexity of sandpile critical avalanches
Bounding Queries in the Analytic Polynomial-Time Hierarchy
Algorithmic complexity of recursive and inductive algorithms
Design Factors for Parallel Processing Benchmarks
On the parameterized complexity of associative and commutative unification
An O(nm)-time certifying algorithm for recognizing HHD-free graphs
An Answer to a Question about Finite Maximal Prefix Sets of Words
Bi-Immunity Results for Cheatable Sets
A method of batching conflict routings in shuffle-exchange networks
The expressive power of time Petri nets
Scheduling to maximize participation
Fault tolerance of composite graph based on disc-ring and folded hypercube
Conjugacy of finite biprefix codes
Natural computation and non-Turing models of computation
Time window temporal logic
Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems
Prediction-hardness of acyclic conjunctive queries
Determinism in Parallel Systems
Mutual visibility on grid by asynchronous luminous robots
Identification of biRFSA languages
Generating all permutations by context-free grammars in Chomsky normal form
Optimal Parallel Algorithms for Forest and Term Matching
On the Computational Complexity of Dynamic Graph Problems
Unique parallel decomposition in branching and weak bisimulation semantics
A quadratic construction for Zielonka automata with acyclic communication structure
On the Rational Behaviors of Concurrent Timers
On the Complementation of Büchi Automata
Characterizing the existence of one-way permutations
On Models for Propositional Dynamic Logic
Efficient computation of the characteristic polynomial of a threshold graph
Simplification of boolean verification conditions
Mining hidden links in social networks to achieve equilibrium
A fast algorithm to generate necklaces with fixed content
On the Computational Complexity of the General Discrete Fourier Transform
A novel approach to verifying context free properties of programs
Small maximal matchings in random graphs
Slowing down top trees for better worst-case compression
DyC: an expressive annotation-directed dynamic compiler for C
Global Serializability of Concurrent Programs
Distributed (Δ+1)-coloring in the physical model
Complexity and approximability of k-splittable flows
Minimal non-deletable sets and minimal non-codeletable sets in binary images
Control structures in hypothesis spaces: the influence on learning
A Nim game played on graphs
Constant-Space String-Matching in Sublinear Average Time
Periodicities on Trees
Test selection for traces refinement
Signal set tissue systems and overlapping localities
A 3.4713-approximation algorithm for the capacitated multicast tree routing problem
Reflection in conditional rewriting logic
The reliability of (n,k)-star network in terms of non-inclusive fault pattern
Sequential?
Abstract Language Design
The Equations h(w)=w-n in Binary Alphabets
An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations
Getting results from programs extracted from classical proofs
Energy and depth of threshold circuits
On the hardness of determining the irregularity strength of graphs
The definable criterion for definability in Presburger arithmetic and its applications
Paraunitary matrices, entropy, algebraic condition number and Fourier computation
Verifying time complexity of Turing machines
Fully anonymous identity-based broadcast signcryption with public verification
A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
On Infinite Words Obtained by Iterating Morphisms
Computing similarity of run-length encoded strings with affine gap penalty
Fixed-parameter tractability for the Tree Assembly problem
Mechanism design for one-facility location game with obnoxious effects on a line
Sample Size Lower Bounds in PAC Learning by Algorithmic Complexity Theory
Optimal algorithms for synchronous Byzantine k -set agreement
Nondeterministic functions and the existence of optimal proof systems
A dynamical system which must be stable whose stability cannot be proved
Results on the Propositional mu-Calculus
Optimizing regenerator cost in traffic grooming
Electronic jury voting protocols
Further hardness results on the rainbow vertex-connection number of graphs
On the expressiveness of interaction
On Randomized versus Deterministic Computation
Does snooping help?
Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases
Theorem proving graph grammars with attributes and negative application conditions
Probabilistic analysis of optimization problems on generalized random shortest path metrics
Grouped domination parameterized by vertex cover, twin cover, and beyond
Some properties of one-pebble Turing machines with sublogarithmic space
Radical theory of Scott-open filters
Semantic essence of AsmL
Strassen's theorem for quantum couplings
Local properties of query languages
Attribute Grammars and Recursive Program Schemes II
Optimal trade-off for Merkle tree traversal
The growth function of S-recognizable sets
Finding approximate and constrained motifs in graphs
An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
Logical systems for structured specifications
Counterexample-guided predicate abstraction of hybrid systems
Locality-preserving allocations problems and coloured bin packing
Irrational Speeds of Configurations Growth in Generalized Pascal Triangles
Delta-Languages for Sets and LOGSPACE Computable Graph Transformers
Overcoming probabilistic faults in disoriented linear search
On Form-Equivalence of Deterministic pure Grammar Forms
Complexity and enumeration in models of genome rearrangement
The Ehrenfeucht Conjecutre: A Compactness Claim for Finitely Generated Free Monoids
Efficient traceable signatures in the standard model
Quantum approaches to graph colouring
Patterns for multigrid equidistributed functions: Application to general parabolas and length estimation
Fault-tolerant strong Menger connectivity of modified bubble-sort graphs
nanoK: A calculus for the modeling and simulation of nano devices
PSPACE-complete problems for subgroups of free groups and inverse finite automata
A combinatorial view on string attractors
Explicit test sets for iterated morphisms in free monoids and metabelian groups
Finite Derivation Type for Semi-Direct Products of Monoids
Shortest reconfiguration of sliding tokens on subclasses of interval graphs
The Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective)
The Kolmogorov complexity of real numbers
Computing the depth distribution of a set of boxes
On collecting semantics for program analysis
Efficient and accurate computation of upper bounds of approximation errors
A framework for interoperability
Calculs sur les structures de langage dénombrable
Term satisfiability in FL ew -algebras
Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs
Tight security for the generic construction of identity-based signature (in the multi-instance setting)
A classification of plane and planar 2-trees
Reachability problems: Special issue
Algebraic constraints, automata, and regular languages
Universal algebra and hardness results for constraint satisfaction problems
Community based acceptance probability maximization for target users on social networks: Algorithms and analysis
Balance of Many-Valued Transductions and Equivalence Problems
Parameterized algorithms for Edge Biclique and related problems
Foreword: Festschrift for Mogens Nielsen's 60th birthday
Substitution of Semi-AFL'S
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101
On sum coloring and sum multi-coloring for restricted families of graphs
Broadcasting in ad hoc multiple access channels
Word Operation Definable in the Typed lambda-Calculus
Parallel Turing Machines with One-Head Control Units and Cellular Automata
An arithmetic for non-size-increasing polynomial-time computation
MinMax-profiles: A unifying view of common intervals, nested common intervals and conserved intervals of K permutations
Generalized Semigroup Semirings Which Are Zero-Divisor-Free Or Multiplicatively Left-Cancellative
On parsing LL-languages
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs
Asynchronous Byzantine reliable broadcast with a message adversary
Decidability results for primitive recursive algorithms
Rikudo is NP-complete
The Complexity of Mean Payoff Games on Graphs
Pure exploration in finitely-armed and continuous-armed bandits
On incomplete and synchronizing finite sets
Learning with continuous experts using drifting games
Inequity aversion pricing over social networks: Approximation algorithms and hardness results
Commitment under uncertainty: Two-stage stochastic matching problems
Erratum and corrections to "The h-connectivity of exchanged crossed cube" [Theoret. Comput. Sci. 696 (2017) 65-68]
Fixing improper colorings of graphs
Simpler algorithms for testing two-page book embedding of partitioned graphs
Equilibrium pricing with positive externalities
Discovery of the D-basis in binary tables based on hypergraph dualization
On the longest perpetual reductions in orthogonal expression reduction systems
How good is a two-party election game?
Optimal data placement on networks with a constant number of clients
Multi-attribute based influence maximization in social networks: Algorithms and analysis
Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
Message-passing automata are expressively equivalent to EMSO logic
Graph exploration by a finite automaton
Some Natural Structures which Fail to Possess a Sound and Decidable Hoare-Like Logic for their While-Programs
On the power of non-local boxes
Fibrations and universal view updatability
Universality of the Chip-Firing Game
Group search of the plane with faulty robots
Exchange market equilibria with Leontief's utility: Freedom of pricing leads to rationality
Theoretical aspects of computing
Approximability of the independent feedback vertex set problem for bipartite graphs
Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables
Relational separation logic
Solving difference equations whose coefficients are not transcendental
On the complexities of multipoint evaluation and interpolation
Election and rendezvous with incomparable labels
Fundamentals of reversible flowchart languages
A Fast Algorithm for the Unique Decipherability of Multivalued Encodings
Presentations of computably enumerable reals
On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks
Deciding True Concurrency Equivalences on Safe, Finite Nets
Synchronizing groups and automata
The Steiner k -eccentricity on trees
Good programming in transactional memory: Game theory meets multicore architecture
Classifying rendezvous tasks of arbitrary dimension
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+
Monotone classes beyond VNP
Proof-term synthesis on dependent-type systems via explicit substitutions
On groups whose word problem is solved by a~counter automaton
A tight bound for online colouring of disk graphs
Optimal Bounds for the Approximation of Boolean Functions and Some Applications
Improved algorithms for the k maximum-sums problems
About frequencies of letters in generalized automatic sequences
Complexity of problems concerning reset words for cyclic and Eulerian automata
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
Preface: Special Issue on the Annual International Conference on Combinatorial Optimization and Applications (COCOA)
A Relationship between Two-Dimensional Finite Automata and Three-Way Tape-Bounded Two-Dimensional Turing Machines
A Framework for Incremental Learning of Logic Programs
On a Kind of Fatou Property of Context-Free Groups
The Magnus-Derek game
Image compression for fast wavelet-based subregion retrieval
PPTL specification mining based on LNFG
Fibonacci word patterns in two-way infinite Fibonacci words
Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions
L(A)=L(B)? decidability results from complete formal systems
Points d'Orbite Dense de Certains Langages de Mots Infinis
First-Order Linear Logic without Modalities is NEXPTIME-Hard
Applications of regularized least squares to pattern classification
Minimal length test vectors for multiple-fault detection
The effect of end-markers on counter machines and commutativity
Preface: Automata, Languages and Programming
Finite generating sets for reversible gate sets under general conservation laws
Convex and isometric domination of (weak) dominating pair graphs
Uniformity and the Taylor expansion of ordinary lambda-terms
Multi-target ray searching problems
Model checking of systems with many identical timed processes
From learning in the limit to stochastic finite learning
The commutation of finite sets: a challenging problem
Arbitrary pattern formation on a continuous circle by oblivious robot swarm
Optimal Path Cover Problem on Block Graphs
Generating invariants for non-linear hybrid systems
Integer partitions and the Sperner property
Musings around the geometry of interaction, and coherence
New algorithms for Exact Satisfiability
Multidimensional Interval Routing Schemes
Non-cooperative computation: Boolean functions with correctness and exclusivity
Synchronization Trees
Embedding multidimensional grids into optimal hypercubes
Adaptive collective responses to local stimuli in anonymous dynamic networks
On membrane hierarchy in P systems
Logicality of conditional rewrite systems
The complexity of equilibria: Hardness results for economies via a correspondence with games
The entire chromatic number of graphs embedded on the torus with large maximum degree
Set-to-set disjoint paths in a folded hypercube
Balanced-flow algorithm for path network planning in hierarchical spaces
On the low-dimensional Steiner minimum tree problem in Hamming metric
Completeness of Resolution Revisited
Three results on frequency assignment in linear cellular networks
Comparing the size of NFAs with and without epsilon-transitions
A Comparison of Two Lower-Bound Methods for Communication Complexity
Interaction-aware influence maximization and iterated sandwich method
Approximating MAX SAT by moderately exponential and parameterized algorithms
On MAX-SAT with cardinality constraint
Exact fluid lumpability in Markovian process algebra
A fully abstract may testing semantics for concurrent objects
Properties of Probabilistic Pushdown Automata
Representations of Language Families by Homomorphic Equality Operations and Generalized Equality Sets
On the parallel approximability of a subclass of quadratic programming
On Simon's congruence closure of a string
Distributed chasing of network intruders
Lower bounds for wide-sense nonblocking Clos network
Leaf sector covers with applications on circle graphs
On the problem of freeness of multiplicative matrix semigroups
A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars
On the power of Ambainis lower bounds
Computability on random events and variables in a computable probability space
Tightly CCA-secure inner product functional encryption scheme
Towards a Programming Language Based on the Notion of Two-Level Grammar
A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle
Connectivity games over dynamic networks
On the connectedness of arithmetic hyperplanes
Dynamic algorithms for classes of constraint satisfaction problems
Enriched categories and models for spaces of evolving states
Gödel's system tau revisited
Some complexity results for prefix Gröbner bases in free monoid rings
Algebraic Relations and Presentations
A Useful lambda-Notation
Right-linear half-monadic term rewrite systems
A multi-scale constraint programming model of alternative splicing regulation
Rewriting of visibly pushdown languages for XML data integration
Control of discrete-event systems with modular or distributed structure
Introducing privileged words: Privileged complexity of Sturmian words
On central placements of new vertices in a planar point set
Computable classifications of continuous, transducer, and regular functions
DNA library screening, pooling design and unitary spaces
A linear algorithm for MLL proof net correctness and sequentialization
Efficient Enumeration of all Minimal Separators in a Graph
Decidability of Behavioural Equivalence in Unary PCF
A fully distributed hierarchical attribute-based encryption scheme
Massively parallel and streaming algorithms for balanced clustering
An Algebraic Semantics for Structured Transition Systems and its Applications to Logic Programs
Numerical P systems with Boolean condition
Efficient Specialisation in Prolog Using the Hand-Written Compiler Generator LOGEN
Proof-search in type-theoretic languages: an introduction
Ordered term tree languages which are polynomial time inductively inferable from positive data
Bounded Disorder: The Effect of the Index
A data structure for substring-substring LCS length queries
Cyclic Ordering is NP-Complete
On finding rainbow and colorful paths
A simple criterion for M,N-adhesivity
On generalized communicating P systems with minimal interaction rules
Palindrome pattern matching
Two discrete versions of the Inscribed Square Conjecture and some related problems
Untangling temporal graphs of bounded degree
A Myhill-Nerode theorem for register automata and symbolic trace languages
Probabilistic reachability for multi-parameter bifurcation analysis of cardiac alternans
Some permutation routing algorithms for low-dimensional hypercubes
The generalized 3-connectivity of two kinds of regular networks
How liquid is biological signalling?
Bandwidth consecutive multicolorings of graphs
Wadge hierarchy of omega context-free languages
Exhaustive generation of atomic combinatorial differential operators
Inconstancy of finite and infinite sequences
Stratified Least Fixpoint Logic
Monotonicity of non-deterministic graph searching
Hardness of RNA folding problem with four symbols
Knuth-Bendix Completion for Non-Symmetric Transitive Relations
Reconstructing permutation matrices from diagonal sums
Computing majority with triple queries
Similarity in languages and programs
The Power of Nondeterminism in Polynomial-Size Bounded-Width Branching Programs
Query-based verification of qualitative trends and oscillations in biochemical systems
An Algebraic Semantics Approach to the Effective Resolution of Type Equations
A model of random industrial SAT
Polynomials, fragments of temporal logic and the variety DA over traces
Change of order for regular chains in positive dimension
Sound generalizations in mathematical induction
Depth-two P systems can simulate Turing machines with NP oracles
On the boundary of regular languages
The Zariski spectrum as a formal geometry
Asynchronous spiking neural P systems
Single machine parallel-batch scheduling with deteriorating jobs
Periodic comparator networks
Online unit covering in Euclidean space
Converting finite width AFAs to nondeterministic and universal finite automata
Cut-elimination for a logic with definitions and induction
A note on discreteness and virtuality in analog computing
On the relationship between NLC-width and linear NLC-width
A Total AC-Compatible Ordering Based on RPO
On Domination Problems for Permutation and Other Graphs
Rudimentary Relations and Primitive Recursion: A Toolbox
Structural inclusion in the pi-calculus with replication
The nondeterministic state complexity of the site-directed deletion language operation
Accelerated proximal incremental algorithm schemes for non-strongly convex functions
Monochromatic arithmetic progressions in binary Thue-Morse-like words
Loss functions, complexities, and the Legendre transformation
Lower bounds for some decision problems over C
Efficient enumeration of maximal k -degenerate induced subgraphs of a chordal graph
Online buffer management for transmitting packets with processing cycles
Two-dimensional iterated morphisms and discrete planes
A typed lambda calculus with intersection types
A Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines
Schedulability analysis of fixed-priority systems using timed automata
The binary perfect phylogeny with persistent characters
Graph Theoretical Structures in Logic Programs and Default Theories
Fast neighbor joining
Space-time graph path planner for unsignalized intersection management with a V2V agent coordination architecture
Anonymous adversarial dynamic networks with logarithmic memory and communication
Self-adjusting grid networks to minimize expected path length
Les Boîtes
A non-Hausdorff quaternion multiplication
A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'
No-Longer-Foreign: Teaching an ML compiler to speak C "natively"
On coding labeled trees
A cyclic binary morphism avoiding Abelian fourth powers
A provably secure non-iterative hash function resisting birthday attack
Directed NLC-width
Multiphase until formulas over Markov reward models: An algebraic approach
Dynamics of Equivalence Relations in Automata Networks
Dynamical Behaviour of Coven's Aperiodic Cellular Automata
Characterization of minimum restricted arc-cuts of unidirectional hypercubes
PLC-automata: a new class of implementable real-time automata
Note on reliability of star graphs
Generalized Factorizations of Words and Their Algorithmic Properties
The correspondence between partial metrics and semivaluations
Computational complexity of computing a partial solution for the Graph Automorphism problems
Sorting with two ordered stacks in series
Reasoning about probabilistic sequential programs
Complexity and online algorithms for minimum skyline coloring of intervals
Approximation of some NP-hard optimization problems by finite machines, in probability
Invited Talk: Towards a Principled Multi-Language Infrastructure
Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes
Hardness and approximation results for Black Hole Search in arbitrary networks
An O(n2log⁡m)-time algorithm for the boxed-mesh permutation pattern matching problem
On the Convergence Rates of Genetic Algorithms
On the entropy of a hidden Markov process
Nondeterministic state complexity of nested word automata
Causal static analysis for Brane Calculi
The Monadic Second-Order Logic of Graphs X: Linear Orderings
Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL
A computational interpretation of Dolev-Yao adversaries
Two-Dimensional Cellular Automata Recognizer
Heterogeneous facility location without money
On optimal cryptographic key derivation
On universal transfer learning
On Simulation and Propagating E0L Forms
TCS B Editorial
Periodes et Repetitions des Mots du Monoide Libre
Scalable percolation search on complex networks
On Helping by Robust Oracle Machines
Partial Memoization for Obtaining Linear Time Behavior of a 2DPDA
Tight complexity analysis of the relocation problem with arbitrary release dates
Succinctness of Descriptions of SBTA-Languages
A Classification of omega-Regular Languages
Kobayashi compressibility