yusuke1997/dblp-id-title huggingface dataset:
Tree-automatic scattered linear orders
A new characteristic property of rich words
Cell-like P systems with polarizations and minimal rules
Characterization of some binary words with few squares
Scale-free aggregation in sensor networks
Approximating the 2-interval pattern problem
Local and global cyclicity in free semigroups
Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
On a question of Leiss regarding the Hanoi Tower problem
A synthetic axiomatization of Map Theory
Penelope's Graph: A Hard Minimum Cost Tension Instance
The *-operator and invariant subtraction games
Theory and Applications of Models of Computation 2011
Finding approximate repetitions under Hamming distance
Nearly optimal strategies for special cases of on-line capital investment
Reliability of the round matching composition networks based on g-extra conditional fault
Amalgamating sessions and methods in object-oriented languages with generics
An exact algorithm for minimum distortion embedding
A fast deterministic detection of small pattern graphs in graphs without large cliques
The generalized Weil pairing and the discrete logarithm problem on elliptic curves
On the detection of local and global amoebas: Theoretical insights and practical algorithms
Böhm theorem and Böhm trees for the λμ-calculus
Synchronized E0L Forms
Computational complexity of some problems involving congruences on algebras
Domains and stochastic processes
Average complexity of the Jiang-Wang-Zhang pairwise tree alignment algorithm and of a RNA secondary structure alignment algorithm
On the Hardness of Allocating Frequences for Hybrid Networks
Illustration of fairness in evolutionary multi-objective optimization
Approximate nearest neighbor search for ℓ p -spaces (2<p<∞)
Updatable timed automata
On the structure of minimum broadcast digraphs
Several methods of analysis for cardinality constrained bin packing
Weak morphisms of higher dimensional automata
Chromar, a language of parameterised agents
RULE2001 - Foreword
Strong order-preserving renaming in the synchronous message passing model
Continuation Semantics for Flowgraph Equations
Hausdorff dimension and oracle constructions
Computing farthest neighbors on a convex polytope
The obnoxious facility location game with dichotomous preferences
The Complexity of Presburger Arithmetic with Bounded Quantifier Alternation Depth
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Shortest Common Superstrings and Scheduling with Coordinated Starting Times
HasCasl: Integrated higher-order specification and program development
Using Cost to Control Instrumentation Overhead
New approximation algorithms for the minimum cycle cover problem
Group coloring is π 2 P -complete
A generalized greedy routing algorithm for 2-connected graphs
System Presentation: An Analyser of Rewriting Systems Complexity
Cyclic proofs and size-change termination
Clustering with partial information
Fiat-Shamir for highly sound protocols is instantiable
Teleportation with an imperfect state
Infinite Behaviour of Petri Nets
Complexity of learning in artificial neural networks
An efficient conditionally anonymous ring signature in the random oracle model
Primitive sets of words
Codes and equations on trees
Quantitative Analysis of the Leakage of Confidential Data
A scalable approach to computing representative lowest common ancestor in directed acyclic graphs
Degrees of non-monotonicity for restarting automata
In-place algorithms for exact and approximate shortest unique substring problems
Multiplication, Division and Shift Instructions in Parallel Random Access Machines
Paths, cycles and circular colorings in digraphs
A width parameter useful for chordal and co-comparability graphs
Testing for the Church-Rosser Property
On the support size of stable strategies in random games
The differential lambdamu-calculus
Hotelling games in fault-prone settings
A parametric worst-case approach to fairness in cooperative games with transferable utility
Broadcasting in weighted trees under the postal model
Finding the edges in optimal Hamiltonian cycles based on frequency quadrilaterals
Many hard examples in exact phase transitions
Computability on continuous, lower semi-continuous and upper semi-continuous real functions
Simulating Alternating Tree Automata by Nondeterministic Automata: New Results and New Proofs of the Theorems of Rabin, McNaughton and Safra
Semantic and logical foundations of global computing: Papers from the EU-FET global computing initiative (2001-2005)
Deterministic geoleader election in disoriented anonymous systems
Counting spanning trees using modular decomposition
An output-sensitive algorithm to compute the normal vector of a digital plane
Swapping colored tokens on graphs
New selectors and locally thin families with applications to multi-access channels supporting simultaneous transmissions
A new logic for electronic commerce protocols
A new quantum random number generator certified by value indefiniteness
Generating and characterizing the perfect elimination orderings of a chordal graph
A generalization of diagonal flips in a convex polygon
The planar k-means problem is NP-hard
A hierarchy result for read-once branching programs with restricted parity nondeterminism
Observation routes and external watchman routes
On the Notion of Infinite Pseudorandom Sequences
A single exponential-time FPT algorithm for cactus contraction
Defining Conditional Independence Using Collapses
On approximation algorithm for the edge metric dimension problem
A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs
Learning juntas in the presence of noise
An alternating hierarchy for finite automata
Fast profile matching algorithms - A survey
A Transformation System for Generating Description Languages of Chain Code Pictures
Combinatorics on partial word borders
Maximal universal width of an AFA is NP-hard
Efficient model-checking of dense-time systems with time-convexity analysis
Reasoning with power defaults
A Tutorial on EMPA: A Theory of Concurrent Processes with Nondeterminism, Priorities, Probabilities and Time
Algebraic properties and transformations of monographs
Sobriety for equilogical spaces
Causality in physics and computation
Relation between powers of factors and the recurrence function characterizing Sturmian words
Rewriting systems, plain groups, and geodetic graphs
Type 2 Recursion Theory
An Optimal Parallel Algorithm for Digital Curve Segmentation
Online removable knapsack problem under convex function
Universal relations and #P-completeness
Mutual dimension and random sequences
Submodule Construction as Equation Solving in CCS
TCS SNC Preface
Comparisons between Linear Functions can Help
The enumerability of P collapses P to NC
On Brlek-Reutenauer conjecture
The hub number of co-comparability graphs
Self-stabilizing 2-minimal dominating set algorithms based on loop composition
Helly-gap of a graph and vertex eccentricities
Events in context
Stationary Deterministic Flows in Discrete Systems I
Local limit laws for symbol statistics in bicomponent rational models
Length of Prime Implicants and Number of Solutions of Random CNF Formulae
The Complexity of Optimizing Finite-State Transducers
A Theory for the Derivation of Combinational C-MOS Circuit Designs
Interval semantics for Petri nets with inhibitor arcs
Erratum to "NFA reduction algorithms by means of regular inequalities" [TCS 327 (2004) 241-253]
An improved upper bound for SAT
Regret bounds for restless Markov bandits
An efficient design for reversible Wallace unsigned multiplier
On the Variance of a Class of Inductive Valuations of Data Structures for Digital Search
Prescribed learning of r.e. classes
Online matching on a line
L (2, 1)L(2, 1)-labelings on the modular product of two graphs
Formalized meta-theory of sequent calculi for linear logics
Fitting a graph to one-dimensional data
Structure and behavior preservation by Petri-net-based refinements in system design
Structure connectivity and substructure connectivity of wheel networks
On liveness and boundedness of asymmetric choice nets
Optimal patrolling of high priority segments while visiting the unit interval with a set of mobile robots
On the Structure of Free Finite State Machines
The within-strip discrete unit disk cover problem
Maximum independent set formation on a finite grid by myopic robots
The complexity of blocking (semi)total dominating sets with edge contractions
The complexity of C bomega -words of the form w×w
Threshold data structures and coding theory
Equivalences and Transformations of Regular Systems-Applications to Recursive Program Schemes and Grammars
On the complexity of data disjunctions
Semiretracts of a Free Monoid
Continuity Spaces: Reconciling Domains and Metric Spaces
Reliability of ( n , k )-star network based on g -extra conditional fault
Subtyping dependent types
On bireversible Mealy automata and the Burnside problem
On beta-skeleton as a subgraph of the minimum weight triangulation
The generative capacity of block-synchronized context-free grammars
On the Dynamical Behavior of Chaotic Cellular Automata
Logical and Semantic Frameworks with Applications
Independent domination in finitely defined classes of graphs
Connectionist modal logic: Representing modalities in neural networks
The general position avoidance game and hardness of general position games
Primitives for authentication in process algebras
Recognizing 3-collapsing words over a binary alphabet
Further Results on Digital Search Trees
Relational Graph Rewritings
Decidability Problems in Grammar Systems
A simple routing algorithm based on Schnyder coordinates
Random expansions of trees with bounded height
Resolution for Some First-Order Modal Systems
On the number of nonterminals in linear conjunctive grammars
Additive approximation algorithm for geodesic centers in δ-hyperbolic graphs
Bounds on the Variety Generated by Completely Regular Syntactic Monoids from Finite Prefix Codes
A link between multioperator and tree valuation automata and logics
Sequences of linear arithmetical complexity
Multiple points of tilings associated with Pisot numeration systems
Unprovability results for clause set cycles
State complexity of combined operations
Regulated nondeterminism in pushdown automata
Constant-Only Multiplicative Linear Logic is NP-Complete
Nondeterministic polynomial time factoring in the tile assembly model
Using Powerdomains to Generalize Relational Databases
Randomized counter-based algorithms for frequency estimation over data streams in O(log⁡log⁡N) space
Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm
Experimenting with Process Equivalence
Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms
On bases of identities for the omega-variety generated by locally testable semigroups
Quasi-automatic semigroups
Fully abstract models and refinements as tools to compare agents in timed coordination languages
Local certification of graphs on surfaces
A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
Large triangles in the d -dimensional unit cube
Maximum scan statistics and channel assignment problems in homogeneous wireless networks
In memory of Jérôme Monnot
Compressed range minimum queries
The Frobenius problem for homomorphic embeddings of languages into the integers
Fine hierarchies and m-reducibilities in theoretical computer science
Random reals à la Chaitin with or without prefix-freeness
Selected Papers of the Workshop on Deductive Database Theory, Illiers-Combray, France, 1989, Forword
Abstract geometrical computation 11: Slanted firing squad synchronisation on signal machines
An efficient method to evaluate intersections on big data sets
Specification and verification of concurrent systems by causality and realizability
Complete Semi-Thue Systems for Abelian Groups
Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata
A simple optimal binary representation of mosaic floorplans and Baxter permutations
A calculus for four-valued sequential logic
Produit dans le Cône Rationnel Engendré par D
Computational complexity of solving polynomial differential equations over unbounded domains
Proofs as computations in linear logic
New algorithms for a simple measure of network partitioning
Parsing with a finite dictionary
Solving 3-SAT in distributed P systems with string objects
New results on edge partitions of 1-plane graphs
A distance between populations for one-point crossover in genetic algorithms
A Relation Division Operator: The Conjugate Kernel
Partitioning Point Sets in Arbitrary Dimension
Biometric-based two-factor authentication scheme under database leakage
Hoare's Logic and Peano's Arithmetic
A Survey of Strategies in Program Transformation Systems
The cell probe complexity of succinct data structures
Time-minimal paths amidst moving obstacles in three dimensions
Fan-type condition for two completely independent spanning trees
Trust in event structures
Partitioning vertices of 1-tough graphs into paths
A New Planarity Test
Time Lower Bounds do not Exist for CRCW PRAMs
A calculus of coroutines
On the trace subshifts of fractional multiplication automata
On-line String Matching with Feedback
Quantifier rank for parity of embedded finite models
Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
Adequacy Properties of Path Programs
Characterization and Complexity of Uniformly Non Primitive Labeled 2-Structures
A Note on Non-Singular Deterministic Pushdown Automata
Quasi-universal k -regular sequences
Topological Invariants of Classification Problems
Revisiting the categorical interpretation of dependent type theory
A novel algorithm to embed a multi-dimensional torus into a locally twisted cube
Recent Advances of Grammatical Inference
Minimum-width double-strip and parallelogram annulus
A Counterexample to Shyamasundar's Characterization of Pushdown Permuters
Parameterized complexity of fair many-to-one matchings
Criteria to disprove context freeness of collage languages
Gate elimination: Circuit size lower bounds and #SAT upper bounds
Improved characters distance sampling for online and offline text searching
A Data Structure Useful for Finding Hamiltonian Cycles
Approximate algorithms for neural-Bayesian approaches
Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules
Disjoint path covers in recursive circulants G(2 m , 4) with faulty elements
Aperiodic pseudorandom number generators based on infinite words
Self-stabilizing gathering with strong multiplicity detection
Parallel computation of the Burrows Wheeler Transform in compact space
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al
Local abstraction refinement for probabilistic timed programs
Consistency of discrete Bayesian learning
Expressive completeness of separation logic in block-based cloud storage systems
Meta-Resolution: An Algorithmic Formalisation
Suffix-connected languages
Inferring reaction systems from ordinary differential equations
On the decidability of the termination problem of active database systems
Finitely Generated bi-omega-Languages
Fast solution of single-machine scheduling problem with embedded jobs
Recurrence and transience for finite probabilistic tables
Editorial: Complexity and Approximation: In Honor of Ker-I Ko
Equilibria of graphical games with symmetries
On a biobjective search problem in a line: Formulations and algorithms
An Overview of the Tecton Proof System
Temporal graph realization from fastest paths
Algorithms for (n, 3)-MAXSAT and parameterization above the all-true assignment
The mixed page number of graphs
Closure operations for digital topology
On abelian saturated infinite words
Preface to Special Issue on Algorithms and Complexity
Dynamic location problems with limited look-ahead
Simplicial powers of graphs
Efficient data mappings for parity-declustered data layouts
On-line generalized Steiner problem
Process Algebra with Language Matching
Recovering the long-range links in augmented graphs
Bounded-connect noncanonical discriminating-reverse parsers
Note on the Generalization of Calculations
Towards a Theory of Local and Global in Computation
Testing permutation properties through subpermutations
Full-grained proxy re-encryption for all circuits
A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours
Efficient algorithms for center problems in cactus networks
Strictness, totality, and non-standard-type inference
A linear algorithm for a perfect matching in polyomino graphs
Elimination of Parameters in the Polynomial Hierarchy
On time optimal solutions of the firing squad synchronization problem for two-dimensional paths
Parameterized complexity and approximation issues for the colorful components problems
Worst-Case Analysis of the Set-Union Problem with Extended Backtracking
Anti-unification and the theory of semirings
A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families
Entropy rates and finite-state dimension
Deterministic metric 1-median selection with very few queries
Algorithmic aspects of semitotal domination in graphs
A note on abelian returns in rotation words
Population size versus runtime of a simple evolutionary algorithm
Communication in the two-way listen-in vertex-disjoint paths mode
Even linear simple matrix languages: formal language properties and grammatical inference
Performance driven distributed scheduling of parallel hybrid computations
An Introduction to Fifo Nets-Monogeneous Nets: A Subclass of Fifo Nets
On the independence of equations in three variables
Reversal complexity revisited
Mathematical analyses of two-compartment model of human cholesterol circulatory transport in application to high blood cholesterol prevention, diagnosis and treatment
A Hierarchy of Temporal Logics with Past
Graph grammars with string-regulated rewriting
Succinctness and tractability of closure operator representations
Stagnation detection meets fast mutation
Two-dimensional comma-free and cylindric codes
A Linear Algorithm for Renaming a Set of Clauses as a Horn Set
Adaptively secure non-interactive threshold cryptosystems
The left-right-imbalance of binary search trees
Quality-aware online task assignment mechanisms using latent topic model
On an interpretation of safe recursion in light affine logic
Exact real arithmetic for interval number systems
A silent self-stabilizing algorithm for the generalized minimal k -dominating set problem
On Sets Polynomially Enumerable by Iteration
Abstract Commands: a Uniform Notation for Specification and Implementation
The polynomial hierarchy of functions and its levels
g-Good-neighbor conditional diagnosability measures for 3-ary n-cube networks
Faster algorithms for 1-mappability of a sequence
Models for Concurrency: Towards a Classification
Cross-monotonic cost sharing methods for connected facility location games
Generalized Lyndon factorizations of infinite words
Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
Mobile ambients
On a conjecture related to geometric routing
A brief history of process algebra
Budget-constrained multi-battle contests: A new perspective and analysis
Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length
Multimodal Logic Programming Using Equational and Order-Sorted Logic
Algorithms for Jumbled Indexing, Jumbled Border and Jumbled Square on run-length encoded strings
On the algorithmic inversion of the discrete Radon transform
Some Congruence Properties for Pi-Calculus Bisimilarities
Petri Nets and Bisimulation
Fast size approximation of a radio network in beeping model
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
Stability versus speed in a computable algebraic model
The Recursion-Theoretic Structure of Complexity Classes
Tight lower bound of sparse covariance matrix estimation in the local differential privacy model
A quick tour on suffix arrays and compressed suffix arrays
Dependency graphs and mass conservation in reaction systems
A model learning based testing approach for spiking neural P systems
An algorithm approach to bounding aggregations of multidimensional Markov chains
Self-organizing flows in social networks
The minimum positional error incurred by any connectivity-based positioning algorithm for mobile wireless systems
The Suffix Tree of a Tree and Minimizing Sequential Transducers
Complexity Results for 1-Safe Nets
Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT
Polynomial algorithm for equivalence problem of deterministic multitape finite automata
Triggering cascades on strongly connected directed graphs
On approximate learning by multi-layered feedforward circuits
Regularity of Relations: A Measure of Uniformity
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
Average Case Optimality for Linear Problems
Coalgebra-to-Algebra Morphisms
Belnap's logic and conditional composition
Average complexity of exact and approximate multiple string matching
Recursively defined metric spaces without contraction
Partial learning of recursively enumerable languages
Weighted proper orientations of trees and graphs of bounded treewidth
The Definition of Extended ML: A Gentle Introduction
Two dimensional range minimum queries and Fibonacci lattices
Partial sums on the ultra-wide word RAM
Deterministic monotone algorithms for scheduling on related machines
On the power of Las Vegas II: Two-way finite automata
Inductive inference of approximations for recursive concepts
Smaller representation of finite state automata
On Structural Conditions for Weak Persistency and Semilinearity of Petri Nets
PAC learning of probability distributions over a discrete domain
Homogeneously Orderable Graphs
New Formally Undecidable Propositions: Non-Trivial Lower Bounds on Proof Complexity and Related Theorems
Stochastic minority on graphs
A truthful constant approximation for maximizing the minimum load on related machines
Solution to a conjecture on words that are bad and 2-isometric
Dynamic Maintenance of Directed Hypergraphs
Categorical proof theory of classical propositional calculus
Taming the knight's tour: Minimizing turns and crossings
A lattice-based group signature scheme with verifier-local revocation
Pattern Growth in Elementary Cellular Automata
Constructing light spanners deterministically in near-linear time
Final Algebras, Cosemicomputable Algebras and Degrees of Unsolvability
Exact algorithms for Kayles
Une Note sur le Cylindre des Langages Déterministes
Twin-distance-hereditary digraphs
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
Proposition de Semantique Denotationelle pour des Reseaux de Processus avec Operateur de Melange Equitable
Distributed half-integral matching and beyond
Possible Forms of Evaluation or Reduction in Martin-Löf Type Theory
Qualitative analysis of gene regulatory networks by temporal logic
Bounded Delay L Codes
TCS Special Issue on Computational Self-Assembly
On the hardness of minimizing space for all-shortest-path interval routing schemes
Algorithms for finding the weight-constrained k longest paths in a tree and the length-constrained k maximum-sum segments of a sequence
The monadic theory of toric words
Techniques for Parallel Manipulation of Sparse Matrices
Lowness and logical depth
An improved parameterized algorithm for the independent feedback vertex set problem
Sparse interpolation of multivariate rational functions
Unbounded Hardware is Equivalent to Deterministic Turing Machines
Finding common structured patterns in linear graphs
Discrete Watson-Crick dynamical systems
On Reduction-Based Process Semantics
Fault-tolerant computation of distributed regular path queries
On the cost of uniform protocols whose memory consumption is adaptive to interval contention