yusuke1997/dblp-id-title huggingface dataset:
Linear time and space gathering of anonymous mobile agents in asynchronous trees
Security analysis of a password-based authentication protocol proposed to IEEE 1363
Optimally learning social networks with activations and suppressions
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
Beachcombing on strips and islands
Distributed Grover's algorithm
Generating, computing and recognizing with virus machines
The full Steiner tree problem
On the NP-completeness of the perfect matching free subgraph problem
Collaborative delivery on a fixed path with homogeneous energy-constrained agents
On fractional dynamic faults with thresholds
Weighted automata and weighted logics with discounting
Semantics of Infinite Tree Logic Programming
Connection between conjunctive capacity and structural properties of graphs
Calculational design of a regular model checker by abstract interpretation
A basic algebra of stateless connectors
Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
Some Fundamental Algebraic Tools for the Semantics of Computation: Part 3: Indexed Categories
PTAS for connected vertex cover in unit disk graphs
On abstract normalisation beyond neededness
A two-stages tree-searching algorithm for finding three completely independent spanning trees
Approximating and computing behavioural distances in probabilistic transition systems
Multirate multicast switching networks
CGOOD, a Categorical Graph-Oriented Object Data Model
On the Asymptotic Average Length of a Maximum Common Subsequence for Words Over a Finite Alphabet
Applications of standard Sturmian words to elementary number theory
Pivots, determinants, and perfect matchings of graphs
Approximate Cartesian tree pattern matching
Scheduling hard sporadic tasks with regular languages and generating functions
Efficient scheduling of a mobile charger in large-scale sensor networks
Query learning of bounded-width OBDDs
Algorithmes rélatifs á la décomposition dds oolynômes
On store languages of language acceptors
On D0L power series
Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic
Appendix A: Report on the First International Clobber Tournament
The RED-BLUE SEPARATION problem on graphs
Collapsing words, permutation conditions and coherent colorings of trees
Tag systems and Collatz-like functions
Hierarchies of Primitive Recursive Wordsequence Functions: Comparisons and Decision Problems
On the Structure of Hamiltonian Cycles in Cayley Graphs of Finite Quotients of the Modular Group
On the power of threshold-based algorithms for detecting cycles in the CONGEST model
Small (purely) catalytic P systems simulating register machines
Modeling spatial networks by contact graphs of disk packings
Strong normalizability of the non-deterministic catch/throw calculi
A self-stabilizing algorithm for b -matching
Interactions between Computer Science and Biology
Exhausting Strategies, Joker Games and IMLL with Units
Distributed Loop Network with Minimum Transmission Delay
Similarity between preferential models
A probabilistic alternative to regression suites
Continuity and computability of reachable sets
LCF Considered as a Programming Language
CTS Systems and Petri Nets
Mind change speed-up for learning languages from positive data
The Operation ^ on Formal Series
On the Logic of UNITY
A framework for security analysis of mobile wireless networks
Shortest synchronizing strings for Huffman codes
The isolation game: A game of distances
Tilings of rectangles with T-tetrominoes
Real royal road functions for constant population size
Solving Łukasiewicz μ -terms
Directional dynamics for cellular automata: A sensitivity to initial condition approach
Weak-vertex-pancyclicity of (n, k)-star graphs
Energy-efficient strategies for building short chains of mobile robots locally
On the complexity of intersecting finite state automata and N L versus N P
An Upward Measure Separation Theorem
Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms
Generic models for computational effects
Inversion of 2D Cellular Automata: Some Complexity Results
Term-Rewriting Systems with Rule Priorities
Soundness of Q-resolution with dependency schemes
Finding an induced subdivision of a digraph
Canonical forms of uptimals
A Design of a Parallel Dictionary Using Skip Lists
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
Privacy-preserving file sharing on cloud storage with certificateless signcryption
The online food delivery problem on stars
The Maximum Zero-Sum Partition problem
On Logics with Two Variables
Improved hardness amplification in NP
On the parameterized complexity of multiple-interval graph problems
Arboricity, h-index, and dynamic algorithms
Sturmian Morphisms and alpha-Words
Structure of proofs and the complexity of cut elimination
Expressing Program Looping in Regular Dynamic Logic
Min-max-boundary domain decomposition
Learning and generalization with the information bottleneck
Criteria for the matrix equivalence of words
Weak normalization implies strong normalization in a class of non-dependent pure type systems
Specification of Abstract Dynamic-Data Types: A Temporal Logic Approach
The Grothendieck computability model
From Geometry to Euler Identities
Upper Bounds on Recognition of a Hierarchy of Non-Context-Free Languages
Justifying groups in multiwinner approval voting
Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts
Gathering in the plane of location-aware robots in the presence of spies
Upper bounds on the satisfiability threshold
Characterizing bipartite Toeplitz graphs
Broadcast authentication for group communication
On the max coloring problem
On external contextual grammars with subregular selection languages
Braids via term rewriting
The Linear Abstract Machine (Corrigenda)
Heaps and Heapsort on Secondary Storage
Resources, concurrency, and local reasoning
The finiteness of synchronous, tabled picture languages is decidable
Attributed Variables in XSB
Verification and refinement with fine-grained action-based concurrent objects
Mobile agents on chordal graphs: Maximum independent set and beyond
Regular component decomposition of regular languages
Strong reductions in effective randomness
Combinatory Weak Reduction in Lambda Calculus
Practical card-based implementations of Yao's millionaire protocol
The diameter of sum basic equilibria games
On the Pre-AFL of [log n] Space and Related Families of Languages
A super-stabilizing log( n )log(n)-approximation algorithm for dynamic Steiner trees
Global and Local Views of State Fairness
A second look at counting triangles in graph streams
Containers: Constructing strictly positive types
Communication complexity and intrinsic universality in cellular automata
State complexity of combined operations involving catenation and binary Boolean operations: Beyond the Brzozowski conjectures
Local periods and binary partial words: an algorithm
Gathering of robots on anonymous grids and trees without multiplicity detection
Three remarks on W graphs
On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme
On Minimal Graphs
Fast algorithms for single and multiple pattern Cartesian tree matching
Preface to the Special Issue on the 1995 Latin American Theoretical Informatics Symposium
Duality and the Completeness of the Modal mu-Calculus
Theories of life and computation: Special issue on the occasion of the 65th birthday of Professor Gabriel Ciobanu
Super-tasks, accelerating Turing machines and uncomputability
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Representation of Computations in Concurrent Automata by Dependence Orders
Downward Translations of Equality
On the independence number and Hamiltonicity of uniform random intersection graphs
Verifying parallel programs with dynamic communication structures
Power Properties of NLC Graph Grammars with a Polynomial Membership Problem
Free Upper Regular Bands
Super fault-tolerance assessment of locally twisted cubes based on the structure connectivity
Complexity and Decidability for Restricted Classes of Picture Languages
Reprint of: Generalized Lyndon factorizations of infinite words
Kleinberg's grid unchained
On a Bound for the D0L Sequence Equivalence Problem
Un Algorithme Calculant le Cardinal, Fini ou Infini, des Demi-Groupes de Matrices
The local diagnosability of directed interconnection networks
Polynomial Equivalence Among Systems LLNC, LLNC a and LLNC 0
Intruder deduction problem for locally stable theories with normal forms and inverses
On the Algebraic Complexity of Rational Iteration Procedures
Comparing incomplete sequences via longest common subsequence
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
Saving colors and Max Coloring: Some fixed-parameter tractability results
Consensus when all processes may be Byzantine for some time
Dynamic coloring on restricted graph classes
Aperiodic monotiles: From geometry to groups
On a Rational Approximation Problem in the Real Hardy Space H2
On the Representation of Rational Functions of Bounded Complexity
Approximability of minimum certificate dispersal with tree structures
Prime automata do not exist
Limiting Semantics of Numerical Programs
Entailment-Based Actions for Coordination
Total completion time minimization scheduling on two hierarchical uniform machines
Adherences of D0L Languages
Finding fair and efficient allocations of indivisible chores
A randomized encoding of the Pi-calculus with mixed choice
Complexity of hyperconcepts
Efficient computation of arbitrary control dependencies
Le Schéma de carte et ses applications
A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem
Vertex cover in conflict graphs
A categorical model for organic chemistry
An asymptotic competitive scheme for online bin packing
Learning probabilistic automata: A study in state distinguishability
Topology on words
Bounds for the generalized repetition threshold
Snowman is PSPACE-complete
Tree path majority data structures
Series-parallel languages and the bounded-width property
Tracks from hell - When finding a proof may be easier than checking it
A Class of Decidable Information Logics
A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces
Uniformly hard languages
Equational Lifting Monads
A Temporal Logic for Real-Time Partial Ordering with Named Transactions
A Result about the Power of Geometric Oracle Machines
Improved approximation bounds for edge dominating set in dense graphs
Frontiers in algorithmics
Reconstructing visibility graphs with simple robots
Completion for Unification
A declarative framework for object-oriented programming with genetic inheritance
A Logical Basis for Programming Methodology
Analysis of fully distributed splitting and naming probabilistic procedures and applications
Approximately dominating representatives
Foreword: Real Numbers and Computers
Interaction nets for linear logic
Recursion Theoretic Characterizations of Complexity Classes of Counting Functions
Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth
Algorithmic decomposition of shuffle on words
Enumeration of 4-stack polyominoes
A new routing algorithm for multirate rearrangeable Clos networks
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
Foreword: Theoretical Aspects of Coordination Languages
The unpredictable deviousness of models
Some Results on Critical (P5,H)-free Graphs
Celebrating the 60th birthday of Eric Goles
Equational theories of tropical semirings
Distributed community detection in dynamic graphs
Near-optimal radio use for wireless network synchronization
Equational Properties of Kleene Algebras of Relations with Conversion
Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1RR2 for given regular languages R1, R2
Phase Semantic Cut-Elimination and Normalization Proofs of First- and Higher-Order Linear Logic
A Framework for a Theory of Automated Learning
Functional encryption for cubic polynomials and implementation
Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Dynamically maintaining the widest k-dense corridor
Theoretical aspects of connectivity-based multi-hop positioning
Knapsack problems: A parameterized point of view
Metric Completion versus Ideal Completion
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm
Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization
Algorithmic complexity as a criterion of unsolvability
A Note on Simple Programs with Two Variables
Finding geometric representations of apex graphs is NP-hard
An external-memory depth-first search algorithm for general grid graphs
Sequential Simulation of Parallel Iterations and Applications
Simple Programming Languages and Restricted Classes of Turing Machines
Three overlapping squares: The general case characterized & applications
Discrete Parabolas and Circles on 2D Cellular Automata
Multi-stage Proof-of-Works: Properties and vulnerabilities
Membrane computing with transport and embedded proteins
Determining the Mode
An operational and denotational approach to non-context-freeness
Some complexity results for polynomial rational expressions
Simulation relations for pattern matching in directed graphs
A Note on: 'Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'
Privacy-preserving encryption scheme using DNA parentage test
Multiple facility location games with envy ratio
Admissible digit sets
Combining initial segments of lists
Complexity, Combinatorial Group Theory and the Language of Palutators
Chordal digraphs
A Representation of Trees by Languages I
A decision procedure and complete axiomatization for projection temporal logic
Principal Types of BCK-lambda-Terms
Behavioral equivalences for AbU: Verifying security and safety in distributed IoT systems
On the weight of universal insertion grammars
An Algebraic Description of System Behaviours
On the power of randomized multicounter machines
The automaticity of the set of primes
Uniqueness logic
Strategies for designing geometric transformations on quantum images
The complexity of clique graph recognition
Learning in varieties of the form V * LI from positive data
SDP-based algorithms for maximum independent set problems on hypergraphs
On rearrangeable multirate three-stage Clos networks
The perfect matching cut problem revisited
Polarized process algebra with reactive composition
A Process-Calculus-Based Abstraction for Coordinating Multi-Agent Groups
Symbolic Representation of Piecewise Linear Functions on the Unit Interval and Application to Discrepancy
The interval constrained 3-coloring problem
On a Conjecture about Slender Context-Free Languages
Acknowledged broadcasting and gossiping in ad hoc radio networks
Averages of automatic sequences
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs ,
Domain adaptation and sample bias correction theory and algorithm for regression
On Quasi Orders of Words and the Confluence Property
Zero testing of p-adic and modular polynomials
Continuous valuations of temporal logic specifications with applications to parameter optimization and robustness measures
Boolean restriction categories and taut monads
Polynomial algorithms for open plane graph and subgraph isomorphisms
An improved 2-agent kidney exchange mechanism
The modal argument for hypercomputing minds
Randomized gathering of asynchronous mobile robots
On the Complexity of Deadlock Detection in Families of Planar Nets
Nondeterministic Operations on Finite Relational Structures
Approximation algorithms for grooming in optical network design
Nested cover-free families for unbounded fault-tolerant aggregate signatures
On Varieties of Optimal Algorithms for the Computation of Bilinear Mappings I. The Isotropy Group of a Bilinear Mapping
The degree distribution of the generalized duplication model
Hardness and efficiency on minimizing maximum distances in spanning trees
Inductive definitions in logic versus programs of real-time cellular automata
Statistical mechanics methods and phase transitions in optimization problems
A Work-Time Optimal Algorithm for Computing All String Covers
A randomized algorithm for the joining protocol in dynamic distributed networks
Fault-tolerant metric dimension of circulant graphs C n (1, 2, 3)
A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus
Partition on trees with supply and demand: Kernelization and algorithms
A semantics for concurrent separation logic
The Kučera-Gács theorem revisited by Levin
Combinatorial optimization problems with uncertain costs and the OWA criterion
Improved bounds on the Weak Pigeonhole Principle and infinitely many primes from weaker axioms
Decision problems for semi-Thue systems with a few rules
A Calculus of Stochastic Systems for the Specification, Simulation, and Hidden State Estimation of Mixed Stochastic/Nonstochastic Systems
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas
An algorithm for conditional-fault local diagnosis of multiprocessor systems under the MM⁎ model
Die Berechnungskomplexität der Symbolischen Differentiation von Interpolationspolynomen
Hybrid tree automata and the yield theorem for constituent tree automata
On cardinalities of k-abelian equivalence classes
Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search
A Decidability Result for Deterministic omega -Context-Free Languages
Finiteness and Iteration Conditions for Semigroups
Hierarchy and equivalence of multi-letter quantum finite automata
Rigorous results for random (2+p)-SAT
"Almost stable" matchings in the Roommates problem with bounded preference lists
Tilings as a programming exercise
Partitioning H -free graphs of bounded diameter
Faster merging networks with a small constant period
Minimization and NP multifunctions
Strong Nondeterministic Polynomial-Time Reducibilities
Contrast-optimal k out of n secret sharing schemes in visual cryptography
Concurrency and Atomicity
String factorisations with maximum or minimum dimension
Absolute versus probabilistic classification in a logical setting
On using probabilistic Turing machines to model participants in cryptographic protocols
Performance aspects of distributed caches using TTL-based consistency
Maximum induced matchings close to maximum matchings
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
On the number of episturmian palindromes
Sum of Games Born on Days 2 and 3
On the amplitude of intervals of natural numbers whose every element has a common prime divisor with at least an extremity
Fundamental Properties of Deterministic and Nondeterministic Extensions of Datalog
The fractional (strong) matching preclusion number of complete k -partite graph
A proof-theoretic characterization of the basic feasible functionals
Special issue on Theoretical Topics in Graph Transformation
On Adaptive DLOGTIME and POLYLOGTIME Reductions
Learning of erasing primitive formal systems from positive examples
Unary PCF is Decidable
Semantics and Reasoning with Free Procedures
On Greibach Normal Form Construction
A new approximation algorithm for contig-based genomic scaffold filling
A logic for secure memory access of abstract state machines
On the game chromatic number of splitting graphs of path and cycle
Closure properties for the class of behavioral models
Interpreted systems and Kripke models for multiagent systems from a categorical perspective
The string guessing problem as a method to prove lower bounds on the advice complexity
Horn Functions and Submodular Boolean Functions
Non-planar square-orthogonal drawing with few-bend edges
Semantic foundations for generalized rewrite theories
Complexity of conflict-free colorings of graphs
Firing Squad Synchronization Problem in Reversible Cellular Automata
Marking in Combinatorial Constructions: Generating Functions and Limiting Distributions
The intractability of computing the Hamming distance
Search algorithms in type theory
On the Cost of Uniform and Nonuniform Algorithms
Periodicity and Ultimate Periodicity of D0L Systems
Applications quasi-affines et pavages du plan discret
Online knapsack problem under concave functions
Concurrent Program Schemes and Their Logics
Multiway in-place merging
Star fault tolerance of hypercube
Acyclic matching in some subclasses of graphs
A stronger LP bound for formula size lower bounds via clique constraints
Online minimization knapsack problem
An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints
On scheduling multiple two-stage flowshops
Infinite-Word Languages and Continuous Mappings
Multilist Layering: Complexity and Applications
Regular inference as vertex coloring
On the Decidability of Some Problems about Rational Subsets of Free Partially Commutative Monoids
Characterization of canonical systems with six types of coins for the change-making problem
Specifications, Models, and Implementations of Data Abstractions
On the complexity of recognizing the Hilbert basis of a linear diophantine system
Algorithmic correspondence for intuitionistic modal mu-calculus
Relationship between diagnosability and non-inclusive diagnosability of triangle-free connected graphs under the PMC model
Polynomial-time checking of generalized Sahlqvist syntactic shape
Learning tree languages from positive examples and membership queries
New online algorithm for dynamic speed scaling with sleep state
Secret sharing schemes for infinite sets of participants: A new design technique
Results on NLC Grammars with One-Letter Terminal Alphabets
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
Most General First Order Theorems are not Recursively Enumerable
String-Matching on Ordered Alphabets
Game semantics and linear CPS interpretation
Temporal logic specification mining of programs
Probabilistic rebound Turing machines
Leftmove-bounded picture languages
Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
Quantifying information leakage of randomized protocols
On the Total Correctness of Nondeterministic Programs
Analogical Program Derivation Based on Type Theory
Efficient computations of l 1 and l ∞ rearrangement distances
Static and dynamic low-congested interval routing schemes
2-Asynchronous Automata
Identity based identification from algebraic coding theory
Deterministic Soliton Automata with a Single Exterior Node
(1+epsilon)-Approximation of sorting by reversals and transpositions
Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
Statistic and Ergodic Properties of Minkowski's Diagonal Continued Fraction
Standard Automata and Semidirect Products of Transformation Semigroups
On Transformations of Concurrent-Object Programs
Base-object location problems for base-monotone regions
Euclidean TSP on two polygons
Minimum-width rectangular annulus
Finite Divergence
Strand design for biomolecular computation
The Complexity of PDL with Interleaving
On two-way communication in cellular automata with a fixed number of cells
Multicarrier continuous-variable quantum key distribution
Heterogeneous Multiprocessor Systems with Breakdowns: Performance and Optimal Repair Strategies
An operational semantics for a calculus for wireless systems
A time-space trade-off for computing the k -visibility region of a point in a polygon