yusuke1997/dblp-id-title huggingface dataset:
Foreword: Algorithms, Strings and Theoretical Approaches in the Big Data Era - Special Issue in Honor of the 60th Birthday of Professor Raffaele Giancarlo
Relating Rewriting Techniques on Monoids and Rings: Congruences on Monoids and Ideals in Monoid Rings
Axiomatizing weighted synchronization trees and weighted bisimilarity
Byzantine fault tolerant symmetric-persistent circle evacuation
Real functions computable by finite automata using affine representations
Games on interval and permutation graph representations
Approximation algorithms for digraph width parameters
Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and MM ⁎ model
Narrowing power vs efficiency in synchronous set agreement: Relationship, algorithms and lower bound
Edge-bandwidth of grids and tori
Foundations of Rule-Based Design of Modular Systems
Improved local algorithms for spanner construction
Path finding in the tile assembly model
Fast rendezvous with advice
A 5 k -vertex kernel for P 2 -packing
On the data consumption benefits of accepting increased uncertainty
Reversible Parallel Computation: An Evolving Space-Model
Computability Structure of the Sobolev Spaces and Its Applications
Rigorous results for mean field models for spin glasses
Machine semantics
The complexity of approximately counting stable matchings
On pure space vs catalytic space
Exploiting non-constant safe memory in resilient algorithms and data structures
Regulated RNA rewriting: Modelling RNA editing with guided insertion
CSP duality and trees of bounded pathwidth
A Topological Property of Rational omega-Languages
Multistage graph problems on a global budget
Revision Programming
Obtaining planarity by contracting few edges
Congruences, Infix and Cohesive Prefix Codes
Finite automata encoding geometric figures
Büchi context-free languages
Bike-assisted evacuation of robots on a line with asymmetric S/R communication
Bounding the optimal revenue of selling multiple goods
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs
Justified common knowledge
Strategy-proof approximation mechanisms for an obnoxious facility game on networks
Effects of domain characteristics on instance-based learning algorithms
Complexity of Parallel Matrix Computations
The Role of Standardising Apart in Logic Programming
Enumeration and generation with a string automata representation
On the algorithmic complexity of edge total domination
Dynamics of Positive Automata Networks
Graph orientation with splits
Clans and Regions in 2-Structures
On the descriptional complexity of Watson-Crick automata
The surviving rate of an outerplanar graph for the firefighter problem
Super-Nets and their Hierarchy
Probabilistic analysis for scheduling with conflicts
An improvement of the algorithm of Hertli for the unique 3SAT problem
Differentiable coarse graining
The Trace Invariant and Matrix Inversion
Universal recursively enumerable sets of strings
The one-visibility localization game
Transformation of Shaped Nested Graphs and Diagrams
Languages generated by iterated idempotency
A Hoare logic for dynamic networks of asynchronously communicating deterministic processes
Equivalence between model-checking flat counter systems and Presburger arithmetic
On stabilizers of infinite words
The checkpoint problem
Coalgebraic semantics of modal logics: An overview
Dichotomies for tree minor containment with structural parameters
A Theory of Compaction-Based Parallelization
Combined model checking for temporal, probabilistic, and real-time logics
"Deco" Polyominoes, Permutations and Random Generation
Vertex-pancyclicity of the ( n , k )-bubble-sort networks
Groups synchronizing a transformation of non-uniform kernel
Approximating the Pareto curve with local search for the bicriteria TSP(1, 2) problem
How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
Approximation of Nonlinear Dynamic Systems by Rational Series
A fixed-parameter algorithm for guarding 1.5D terrains
Term Graph Rewriting and Garbage Collection Using Ppfibrations
On Well Quasi Orders of Free Monoids
Set-sharing is redundant for pair-sharing
Embedding hamiltonian paths in k-ary n-cubes with conditional edge faults
Dynamic TCP acknowledgment with sliding window
On XRAM and PRAM Models, and on Data-Movement-Intensive Problems
On the Average Number of Rebalancing Operations in Weight-Balanced Trees
Dynamic construction of an antidictionary with linear complexity
On Recognizing Graph Properties from Adjacency Matrices
On generalizations of partial scenario set cover
Password generation using array generating interval timed colored Petri net (AGITCPN) for effective security
Lower Bounds on the Area Complexity of Boolean Circuits
A fast natural algorithm for searching
The Complexity of Gentzen Systems for Propositional Logic
Dynamic normal forms and dynamic characteristic polynomial
pbn-STAC: Deep reinforcement learning-based framework for cellular reprogramming
Distributed Algorithms in Synchronous Broadcasting Networks
Traced communication complexity of cellular automata
Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
On parallel complexity of analytic functions
One-Way Simple Multihead Finite Automata
Limitations of current wireless link scheduling algorithms
Anisotropic diagrams: Labelle Shewchuk approach revisited
On testing monomials in multivariate polynomials
Perfect Hashing
Petri Net Semantics of Priority Systems
On the computational complexity of 2-interval pattern matching problems
Edge-colouring of join graphs
A list of arithmetical structures complete with respect to the first-order definability
Invariant and dual subtraction games resolving the Duchêne-Rigo conjecture
Mining preserving structures in a graph sequence
Modeling and querying biomolecular interaction networks
Optimality and condensing of information flow through linear refinement
Analysis of runtime of optimization algorithms for noisy functions over discrete codomains
Tilings: recursivity and regularity
A new coding-based algorithm for finding closest pair of vectors
Verifying annotated program families using symbolic game semantics
Finite and infinite implementation of transition systems
Snapshot disjointness in temporal graphs
Minimal Path Length of Trees with Known Fringe
On alpha-0-nu-1-Products of Automata
A systematic methodology for automated theorem finding
Algebraic testing and weight distributions of codes
Reductions for non-clausal theorem proving
Fast Average-Case Pattern Matching by Multiplexing Sparse Tables
On infinite words determined by L systems
The impact of core constraints on truthful bidding in combinatorial auctions
Antipodal number of full m -ary trees
A spatial view of information
Algorithms to compute the Burrows-Wheeler Similarity Distribution
On Second Order Homogeneous Linear Differential Equations with Liouvillian Solutions
Transformations that Preserve Malignness of Universal Distributions
Compilation of the ELECTRE Reactive Language into Finite Transition Systems
Ranking and Formal Power Series
Reductions on NP and P-Selective Sets
A Fixpoint Approach to Finite Delay and Fairness
Succinct representations of planar maps
Proving Nonreachability by Modulo-Invariants
A Complete and Efficiently Computable Topological Classification of D-dimensional Linear Cellular Automata over Zm
Equational tree transformations
On computing the entropy of cellular automata
An extremal graph with given bandwidth
Towards more efficient methods for solving regular-expression heavy string constraints
An Algebraic Characterization of Observational Equivalence
Cops and invisible robbers: The cost of drunkenness
Sufficient conditions for the marked graph realisability of labelled transition systems
On factorization forests of finite height
Hard variants of stable marriage
Practical (fully) distributed signatures provably secure in the standard model
Temperature aware online algorithms for minimizing flow time
The weakest failure detector to implement a register in asynchronous systems with hybrid communication
On the one-sided crossing minimization in a bipartite graph with large degrees
A proof system for disjoint parallel quantum programs
Comparing free algebras in Topological and Classical Domain Theory
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Inherent Complexity Trade-Offs for Range Query Problems
Imbalance parameterized by twin cover revisited
Cops and robbers on graphs with a set of forbidden induced subgraphs
Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis
Space-efficient self-stabilizing counting population protocols on mobile sensor networks
Extending FeatherTrait Java with Interfaces
The complexity of reversible cellular automata
Categorical Aspects of Data Type Constructors
Popular critical matchings in the many-to-many setting
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Towards optimal packed string matching
On the Equivalence Problem of Compositions of Morphisms and Inverse Morphisms on Context-Free Languages
The computational power of Benenson automata
Comparing three semantics for Linda-like languages
Simple Termination of Rewrite Systems
Some Issues in Analysis and Specialization of Modular Ciao-Prolog Programs
Investigating topological chaos by elementary cellular automata dynamics
Symbolic Bisimulations
Erratum to: Entropy of Turing machines with moving head
A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs
An Arithmetic Model of Computation Equivalent to Threshold Circuits
Recursive Ascent Parsing: From Earley to Marcus
Legality Concepts for Three-Valued Logic Programs
A logic for Lawson compact algebraic L-domains
Preface: Algebraic and Numerical Algorithms
A lower bound for range enclosure in interval arithmetic
Random numbers as probabilities of machine behavior
Merging in Maps and in Pavings
A Linear Speed-Up Theorem for Cellular Automata
Seminormal rings (following Thierry Coquand)
Setting port numbers for fast graph exploration
On the complexity of and solutions to the minimum stopping and trapping set problems
A unified access bound on comparison-based dynamic dictionaries
Calculi for Synchrony and Asynchrony
Recursive Queries and Context-free Graph Grammars
A Propos du Lemme de Substitution
The kangaroo problem
PPAD-complete approximate pure Nash equilibria in Lipschitz games
FUN editorial
Quantitative information flow as safety and liveness hyperproperties
Query answering over inconsistent knowledge bases: A probabilistic approach
Faster balanced clusterings in high dimension
Parametric synchronizations in mobile nominal calculi
Construction d'une Famille de Codes Associes a Certains Groupes Finis
Enumeration and structure of trapezoidal words
Semiretracts--a counterexample and some results
Computing and the natural sciences at CiE 2005
On small, reduced, and fast universal accepting networks of splicing processors
NP-hard and linear variants of hypergraph partitioning
Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots
Geometry of Interaction V: Logic in the hyperfinite factor
Braided distributivity
Weighted multirecombination evolution strategies
An analysis of architecture, framework, security and challenging aspects for data aggregation and routing techniques in IoT WSNs
Complexity of bifix-free regular languages
Cutting Barnette graphs perfectly is hard
The g-good-neighbor diagnosability of (n, k)-star graphs
Ordinal maximin guarantees for group fair division
Improved algorithms for the general exact satisfiability problem
A process algebra framework for multi-scale modelling of biological systems
Quantum automata and quantum grammars
Stabilizing Time-Adaptive Protocols
A Compete Modal Proof for HAL: the Herbrand Agent Language
Linear array and ring embeddings in conditional faulty hypercubes
On Direct Products of Automaton Decidable Theories
On Sturmian substitutions closed under derivation
Deciding implication for functional dependencies in complex-value databases
A signature scheme constructed from zero knowledge argument of knowledge for the subgraph isomorphism problem
Information distance and conditional complexities
Distributed graph problems through an automata-theoretic lens
Learning bounds via sample width for classifiers on finite metric spaces
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
Garden of Eden partitions in the sand pile and related models
Correspondence and translation for heterogeneous data
Clocks in Dataflow Languages
On g-good-neighbor conditional diagnosability of (n, k)-star networks
Notations for exponentiation
Games to induce specified equilibria
Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach
Optimal Algorithms for Generalized Searching in Sorted Matrices
The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications
Récents développements et problèmes dans le domaine de la génération aléatoire
Ideal models of spaces
On the complexity of temporal arborescence reconfiguration
Proper connection number of random graphs
Additive tree O(ρlog⁡n)-spanners from tree breadth ρ
A Syntactic Theory of Sequential Control
A study of primer design with w -constacyclic shift over F4
Periodicity forcing words
A Categorical Treatment of Pre- and Post-Conditions
Brouwer's ϵ-fixed point and Sperner's lemma
Epsilon-net method for optimizations over separable states
Unambiguous Büchi automata
Complementary cooperation, minimal winning coalitions, and power indices
Dynamic Reachability in Planar Digraphs with One Source and One Sink
Parallel Interval Order Recognition and Construction of Interval Representations
On the complexity of bounded time and precision reachability for piecewise affine systems
The stable marriage problem with restricted pairs
Comparing consecutive letter counts in multiple context-free languages
Improved constructions of mixed state quantum automata
Dualization in lattices given by ordered sets of irreducibles
Online scheduling on two uniform machines subject to eligibility constraints
Subthreshold-seeking local search
Queries with Arithmetical Constraints
A fully abstract denotational model for observational precongruence
Power and size of extended Watson-Crick L systems
On composition and lookahead delegation of e -services modeled by automata ,
Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one
On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences
Query-competitive algorithms for cheapest set problems under uncertainty
Programs and Program Verifications in a General Setting
Population size matters: Rigorous runtime results for maximizing the hypervolume indicator
Improved learning of k -parities
Derivation languages and descriptional complexity measures of restricted flat splicing systems
Incremental NFA minimization
An approximation algorithm for General Energy Restricted Sweep Coverage problem
A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs
Eigenvariables, bracketing and the decidability of positive minimal predicate logic
The calculus of constructions as a framework for proof search with set variable instantiation
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Translation of Logic Programs into Functional Fixpoint Equations
Construction of cyclic DNA codes over the ring Z4[u]/〈u2-1〉 based on the deletion distance
Some first-order probability logics
Optimizing budget allocation for center and median points
A simple calculus for proteins and cells
The Space Complexity Analysis in the General Number Field Sieve Integer Factorization
Refinement of time
Sofic Shifts with Synchronizing Presentations
Exponential-Time and Subexponential-Time Sets
The road problem and homomorphisms of directed graphs
Square network on a word
New bounds on classical and quantum one-way communication complexity
The "equal last letter" predicate for words on infinite alphabets and classes of multitape automata
Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem
Online paging and file caching with expiration times
Greedy expansions and sets with deleted digits
A formalisation of nominal α -equivalence with A, C, and AC function symbols
Site-directed insertion: Language equations and decision problems
A local search approach to protocol verification
Improved algorithm for permutation testing
A Variation on the Boyer-Moore Algorithm
It is tough to be a plumber
Concurrent signature without random oracles
Parameterized and approximation complexity of Partial VC Dimension
NP-hard graph problems and boundary classes of graphs
Algebraic topology and concurrency
On the complexity of quantified linear systems
Lifelong learning in costly feature spaces
On the computability of Walsh functions
Scheduling in the dark
The Complexity of Coloring Games on Perfect Graphs
Fast two-party signature for upgrading ECDSA to two-party scenario easily
Two paths location of a tree with positive or negative weights
Membrane computing and brane calculi. Old, new, and future bridges
Adaptive initialization algorithm for ad hoc radio networks with carrier sensing
Proving properties of some greedily-defined integer recurrences via automata theory
Non-strict independence-based program parallelization using sharing and freeness information
Parameterized algorithms for multi-label periodic temporal graph realization
Topological distance games
Restrictions of Graph Partition Problems. Part I
An analytical approach to the inference of summary data of additive type
Determinacy and query rewriting for conjunctive queries and views
Special issue in honor of the 60th birthday of Amihood Amir
Algèbres associatives et calcul formel (Associative algebras and computer algebra)
A combinatorial approach to Golomb forests
Approximation of Walrasian equilibrium in single-minded auctions
Typed path polymorphism
Bulking I: An abstract theory of bulking
Sharing one secret vs. sharing many secrets
Intrinsic universality in automata networks I: Families and simulations
Comparisons of Parikh's Condition to Other Conditions for Context-free Languages
Correlation immunity and resiliency of symmetric Boolean functions
A Decidable Fragment of Predicate Calculus
An LP-based approximation algorithm for the generalized traveling salesman path problem
On Two-Symbol Complete E0L Forms
Finite-dimensional T-colorings of graphs
Morphismes Unispectraux
Robust algorithms for constructing strongly convex hulls in parallel
Program Development in Constructive Type Theory
When does randomness come from randomness?
The computational complexity of forced capture Hnefatafl
Paging mobile users in cellular networks: Optimality versus complexity and simplicity
Chebyshev polynomials over finite fields and reversibility of -automata on square grids
Quantifiers and Approximation
All-to-all broadcast problems on Cartesian product graphs
A faster cryptographer's Conspiracy Santa
Cryptographic reverse firewalls for interactive proof systems
Alternating Simple Multihead Finite Automata
Kernelization of matrix updates, when and how?
Privacy enhanced secure compact attribute-based signature from MQ problem for monotone span program
On the Walk
Searching for an axis-parallel shoreline
No six-cell neighborhood cellular automaton solves the parity problem
Minimizing distances between vertices and edges through tree t-spanners
Approximation algorithms for sorting by bounded singleton moves
Extra diagnosability and good-neighbor diagnosability of n -dimensional alternating group graph AG n under the PMC model
Non-overlapping indexing in BWT-runs bounded space
Solving structured linear systems with large displacement rank
Approximation algorithms for finding maximum containing circle and sphere
Revising threshold functions
Efficient merged longest common subsequence algorithms for similar sequences
The Random Generation of Directed Animals
Splicing in abstract families of languages
Kernels for packing and covering problems
Moving policies in cyclic assembly line scheduling
Bisimilar and logically equivalent programs in PDL with parallel operator
The NP-hardness of finding a directed acyclic graph for regular resolution
Internal Languages for Autonomous and *-Autonomous Categories
Approximation algorithms for maximum two-dimensional pattern matching
Locating reaction with 2-categories
Delta invariant for Eulerian digraphs
Type Checking with Universes
Temporal difference learning applied to game playing and the results of application to Shogi
Two Characterizations of Rational Adherences
Shortest Consistent Superstrings Computable in Polynomial Time
Algorithmic and algebraic aspects of unshuffling permutations
Process algebra for hybrid systems
Shortest Paths in Digraphs of Small Treewdith. Part II: Optimal Parallel Algorithms
The Computational Efficacy of Finite-Field Arithmetic
Upper Bounds for Sorting Integers on Random Access Machines
A Family of Universal Recurrent Networks
Lorentz gas cellular automata on graphs
Analyzing the environment structure of higher-order languages using frame strings
Strong NP-Completeness of a Matrix Similarity Problem
Learning pattern languages over groups
The asymptotic number of prefix normal words
A notion of effectiveness for subshifts on finitely generated groups
On-Line Learning of Smooth Functions of a Single Variable
Comparing Models of the Intensional Typed Lambda-Calculus
Pattern Systems
The balanced connected subgraph problem for geometric intersection graphs
A Combinatorial Property of Codes Having Finite Synchronization Delay
Neural algebra on "how does the brain think?"
Wire segmenting for buffer insertion based on RSTP-MSP
Searching for a non-adversarial, uncooperative agent on a cycle
Neural circuits for pattern recognition with small total wire length
Tractability of König edge deletion problems
On algorithmic analysis of transcriptional regulation by LTL model checking
Using bigraphs to model topological graphs embedded in orientable surfaces
Synchronization problems in automata without non-trivial cycles
The max-distance network creation game on general host graphs
Nesting of prime substructures in k-ary relations
The Complexity of Evaluating Interpolation Polynomials
Strategies for the Renyi-Ulam Game with fixed number of lies
On the complexity of independent dominating set with obligations in graphs
Extended Regular Expressions of Arbitrary Star Degrees
Efficient code-based fully dynamic group signature scheme
Frame rule for mutually recursive procedures manipulating pointers
Uniform computational complexity of the derivatives of C infinity -functions
Generating Plans in Linear Logic I. Actions as Proofs
Tractability and hardness of flood-filling games on trees
Strong normalization property for second order linear logic
Gathering fat mobile robots with slim omnidirectional cameras
Computing a metric basis of a bipartite distance-hereditary graph
A Simple Proof of a Time-Space Trade-Off for Sorting with Linear Comparisons
Hardness results, approximation and exact algorithms for liar's domination problem in graphs
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
Differential-Algebraic Decision Methods and some Applications to System Theory
A Fast Stable Sorting Algorithm with Absolutely Minimum Storage
Accurate binding-time analysis for imperative languages: flow, context, and return sensitivity
Pushdown timed automata: a binary reachability characterization and safety verification
Iterating Iterated Substitution
Cutting bamboo down to size
Topological properties of omega context-free languages
Transducers based on networks of polarized evolutionary processors
The zero-one law holds for BPP
Rational Index of Context-Free Languages in exp Theta(p root n) and n^(Theta((ln n)^(1/p)))
Termination of rewriting on reversible Boolean circuits as a free 3-category problem