yusuke1997/dblp-id-title huggingface dataset:
On suffix extensions in suffix trees
The shrinking property for NP and coNP
On the Number of Arithmetical Operations for Finding Fibonacci Numbers
An Algebraic View of the Böhm-Out Technique
Negation by Default and Unstratifiable Logic Programs
Weighted restarting automata and pushdown relations
Correctness of Fixpoint Transformations
Iterative learning from positive data and counters
A Comparison of Compatible, Finite, and Inductive Graph Properties
On Almost Bad Boolean Bases
Bincoloring
State complexity of combined operations with two basic operations
Weighted monadic datalog
Optimizing stable in-place merging
Fairness of components in system computations
Improved approximation algorithms for minimum power covering problems
Approximating Sets with Equivalence Relations
On the optimality of Bellman-Ford-Moore shortest path algorithm
On the number of binary-minded individuals required to compute sqrt(1/2)
Partial Models and Logic Programming
E-CCC: Between CCC and Topos
Constrained pseudorandom functions from functional encryption
The power of adaptivity in source identification with time queries on the path
Succinct representations of languages by DFA with different levels of reliability
A simple linear time algorithm to solve the MIST problem on interval graphs
Papers from ARTS'97 - Preface
Approximate query processing over static sets and sliding windows
Complexity of counting the optimal solutions
Learning taxonomic relation by case-based reasoning
Efficient pebbling for list traversal synopses with application to program rollback
Propagation tree decompositions and linearly independent vertices
Relating direct and predicate transformer partial correctness semantics for an imperative probabilistic-nondeterministic language
Linear time approximation schemes for vehicle scheduling problems
Determination of equivalence between quantum sequential machines
Algorithms and complexity of graph convexity partizan games
Optimal fault-tolerant routing algorithm and fault-tolerant diameter in directed double-loop networks
On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems
Recombination faults in gene assembly in ciliates modeled using multimatroids
Uniform approximation of near-singular surfaces
A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets
Logarithmic Advice Classes
On Reduction of Asynchronous Systems
Non-regular unary language and parallel communicating Watson-Crick automata systems
Attacking (EC)DSA scheme with ephemeral keys sharing specific bits
Kolmogorov complexity of initial segments of sequences and arithmetical definability
Fast RNC and NC Algorithms for Maximal Path Sets
Some results on point visibility graphs
Episturmian words and some constructions of de Luca and Rauzy
The simultaneous consecutive ones problem
A parameterized perspective on protecting elections
A note on differentiable palindromes
A new algorithm for linear regular tree pattern matching
Square-free words obtained from prefixes by permutations
Precise goal-independent abstract interpretation of constraint logic programs
Cancellation-free circuits in unbounded and bounded depth
Sensor networks: From dependence analysis via matroid bases to online synthesis
Syntax checking either way
Reductions of binary trees and lattice paths induced by the register function
A Class of Boolean Functions with Linear Combinational Complexity
Approximate consistency for transformations on words and trees
Problems in between words and abelian words: k-abelian avoidability
Some New Results on Easy lambda-Terms
Approximation algorithms on consistent dynamic map labeling
Ten Years of Hoare's Logic: A Survey Part II: Nondeterminism
Forewords: Special issue on Theory and Applications of Graph Searching Problems
Autonomous mobile robots with lights
On Pebble Automata
Weighted minimum backward Fréchet distance
Learning from positive and unlabeled examples
Optimal delay for media-on-demand with pre-loading and pre-buffering
Non-cancellative Boolean circuits: A generalization of monotone boolean circuits
Chemins de Schröder et hiérarchies aléatoires
Drawing colored graphs on colored points
On hardness of several string indexing problems
On the superimposition of Christoffel words
Global types with internal delegation
Paired-domination in inflated graphs
Approximability and inapproximability of the minimum certificate dispersal problem
Reactive synthesis from interval temporal logic specifications
The "runs" conjecture
The equational theory of Kleene lattices
Querying Disjunctive Databases Through Nonmonotonic Logics
Fault-free Hamiltonian cycles passing through a linear forest in ternary n n-cubes with faulty edges
Embedded connectivity of ternary n -cubes
(Mem)brane automata
Online algorithms for page replication in rings
Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem
Group Presentations, Formal Languages and Characterizations of One-Counter Groups
Facility location games with optional preference
Complexity in Left-Associative Grammar
Families of languages defined by ciliate bio-operations
The HASCASL prologue: Categorical syntax and semantics of the partial lambda -calculus
The h -restricted connectivity of the generalized hypercubes
Super spanning connectivity on WK-recursive networks
On coresets for support vector machines
Accountable authority identity-based broadcast encryption with constant-size private keys and ciphertexts
Model checking memoryful linear-time logics over one-counter automata
A note on the price of bandit feedback for mistake-bounded online learning
Toward a classification of finite partial-monitoring games
Query-based selection of optimal candidates under the Mallows model
Safe & robust reachability analysis of hybrid systems
Distributed computing of efficient routing schemes in generalized chordal graphs
On Some Subclasses of the Class of Generable Languages
Finding good 2-partitions of digraphs I. Hereditary properties
The optimal tolerance of uniform observation error for mobile robot convergence
Orthogonal Projection Onto the Free Lie Algebra
Nondeterministic complexity in subclasses of convex languages
On covering radii and coset weight distributions of extremal binary self-dual codes of length 40
NP-hardness and fixed-parameter tractability of the minimum spanner problem
Distinguishing views in symmetric networks: A tight lower bound
Reducing the local alphabet size in tiling systems by means of 2D comma-free codes
Local heuristics and the emergence of spanning subgraphs in complex networks
Eine neue Invariante für Kontextfreie Sprachen
Blockers and antiblockers of stable matchings
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
Principles of Plasma Pattern and Alternative Structure Compilation
Stable Power Domains
Parametrised second-order complexity theory with applications to the study of interval computation
On an optimal propositional proof system and the structure of easy subsets of TAUT
Sequential vs. parallel complexity in simple gene assembly
Secret-sharing with a class of ternary codes
Inefficiency of equilibria for scheduling game with machine activation costs
Probleme de mots dans les gerbes libres
On the weak prefix-search problem
Nivat's Theorem for Pushdown Transducers
Size of OBDD representation of 2-level redundancies functions
On a Question of S. Eilenberg
Online packet scheduling under adversarial errors
On the area requirements of planar straight-line orthogonal drawings of ternary trees
Maximal Serializability of Iterated Transactions
MOCA: A Multiprocessor On-Line Competitive Algorithm for Real-Time System Scheduling
A read-once lower bound and a (1, +k)-hierarchy for branching programs
Episturmian words and episturmian morphisms
Reducibility of Synchronization Structures
UNO is hard, even for a single player
Approximability issues for unconstrained and constrained maximization of half-product related functions
Games, Automata, Logic, and Formal Verification (GandALF 2011)
An Abstract Machine for Concurrent Modular Systems: CHARM
Breaking the linear-memory barrier in MPC: Fast MIS on trees with strongly sublinear memory
Sequential Algorithms on Concrete Data Structures
Enlargement of Functional Algebras for the Lambda Calculus
Universal computation with Watson-Crick D0L systems
Decidability and complexity of Petri nets with unordered data
Set-Theoretical and Other Elementary Models of the lambda-Calculus
Boolean Layer Cakes
Code Properties and Homomorphisms of D0L Systems
A numerical elimination method for polynomial computations
Mathematical analysis of the cumulative effect of novel ternary crossover operator and mutation on probability of survival of a schema
On the construction of graphs with a planar bipartite double cover from boolean formulas and its application to counting satisfying solutions
Certifying Term Rewriting Proofs in ELAN
The $-calculus process algebra for problem solving: A paradigmatic shift in handling hard computational problems
The Undecidability of Self-Embedding for Finite Semi-Thue and Thue Systems
Computing on a partially eponymous ring
Sur l'équation de Catalan, II
Maximum matchings in scale-free networks with identical degree distribution
One-dimensional k-center on uncertain data
Hierarchically Specified Unit Disk Graphs
Angular 2-Structures
On the treewidth of Hanoi graphs
Conditional normality and finite-state dimensions revisited
Satisfiability in Many-Valued Sentential Logic is NP-Complete
Tree-shifts of finite type
Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
EDITORIAL: Selected papers of the tenth international workshop on expressiveness in concurrency (EXPRESS 2003)
An exact algorithm for the Boolean connectivity problem for k-CNF
A 4.31-approximation for the geometric unique coverage problem on unit disks
Simulation of Turing Machines by a Regular Rewrite Rule
Semantic models for information flow
The NP-Completeness of Steiner Tree and Dominating Set for Chordal Bipartite Graphs
The anarchy of scheduling without money
(Definitely not) Boring interaction abstract machines
New Methods for 3-SAT Decision and Worst-case Analysis
An efficient PMC model-based local diagnosis structure and algorithm
Information systems for continuous semi-lattices
Implicitization of curves and (hyper)surfaces using predicted support
Worst- and average-case privacy breaches in randomization mechanisms
Kolmogorov Numberings and Minimal Identification
Constructions Effectives sur les Séries Formelles d'Arbres
Approximating Markovian testing equivalence
Harmonic buffer management policy for shared memory switches
An efficient algorithm for one-sided block ordering problem under block-interchange distance
Computing reachable states for nonlinear biological models
Efficiency and equity in the multi organization scheduling problem
On the computational completeness of generalized forbidding matrix grammars
Evolutionary equilibrium in Bayesian routing games: Specialization and niche formation
Parameterized complexity of satisfactory partition problem
Referential logic of proofs
Optimal semi-online algorithms for machine covering
A sound and complete model-generation procedure for consistent and confidentiality-preserving databases
Analysis of a Simple Factorization Algorithm
Special Issue: Quantum structures in computer science: Language, semantics, retrieval
Probabilistic divide & congruence: Branching bisimilarity
Representable Markov categories and comparison of statistical experiments in categorical probability
From black-box complexity to designing new genetic algorithms
Rich, Sturmian, and trapezoidal words
PCF Extended with Real Numbers
pi-calculus in (Co)inductive-type theory
The bounded eight-vertex model
Quantum algorithms for one-sided crossing minimization
Autocorrelation Coefficient for the Graph Bipartitioning Problem
Evaluating lambda terms with traversals
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs
A Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation
Proportional response dynamics in the Fisher market
Computational expressiveness of Genetic Systems
On the exhaustive generation of plane partitions
Single and multiple device DSA problems, complexities and online algorithms
Formal Systems for Join Dependencies
On the star-height of subword counting languages and their relationship to Rees zero-matrix semigroups
The expected uncertainty of range-free localization protocols in sensor networks
The Riemann Hypothesis in computer science
A Fast Scan-Line Algorithm For Topological Filling Of Well-Nested Objects in 2.5D Digital Pictures
Optimizing flight trajectory of UAV for efficient data collection in wireless sensor networks
Special factors and the combinatorics of suffix and factor automata
Proof of Dejean's Conjecture for Alphabets with 5, 6, 7, 8, 9, 10 and 11 Letters
Parallelized maximization of nonsubmodular function subject to a cardinality constraint
An average study of hypergraphs and their minimal transversals
Networks of Watson-Crick D0L systems with communication by substrings
The complexity of uniform Nash equilibria and related regular subgraph problems
Polynomial kernels for paw-free edge modification problems
Mixed Product and Asynchronous Automata
A survey on multi-loop networks
On the number of components for some parallel communicating grammar systems
On the solution bound of two-sided scaffold filling
Sur une conjecture d'Yves Métivier
Iterated relabeling tree transducers
Schur aggregation for linear systems and determinants
On the Decidability of the Sequence Equivalence Problem for D0L-Systems
Characterizations for Functional Dependency and Boyce-CODD Normal Form Families
A better differential approximation ratio for symmetric TSP
On the fairness and complexity of generalized k-in-a-row games
On the complexity of the selective graph coloring problem in some special classes of graphs
Left-forbidding cooperating distributed grammar systems
The Discrimination Theorem Holds for Combinatory Weak Reduction
Parallel Update Transactions
Prescribing Behaviors
Applying regions
Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems
Two-agent scheduling problems with the general position-dependent processing time
On the central path problem
Parallel contextual array insertion-deletion P systems and a variant of array rewriting P systems
A near optimal scheduler for on-demand data broadcasts
Pattern matching as cut elimination
NP != co-NP and Models of Arithmetic
Ensembles Presque Periodiques k-Reconnaissables
Semisimple algebras of almost minimal rank over the reals
Regular and context-free pattern languages over small alphabets
Faster two-dimensional pattern matching with rotations
Graphs Generalizing Closed Curves with Linear Construction of the Hamiltonian Cycle - Parametrization of Discretized Curves
Variations on a theme by Akl and Taylor: Security and tradeoffs
Decreasing verification radius in local certification
On the structure and complexity of worst-case equilibria
Counting H-colorings of partial k-trees
Minimal critical exponent of quasiperiodic words
Contractions in Comparing Concurrency Semantics
S-semantics for logic programming: A retrospective look
Counting classes and the fine structure between NC 1 and L
A new geometric approach to Sturmian words
A linear kernel for planar connected dominating set
Minimizing Mean Flow Time with Release Time Constraint
Modeling adaptive behaviors in Context UNITY
Foreword: Combinatorics of the Discrete Plane and Tilings
A Unification Algorithm for Typed lambda-Calculus
Value-passing CCS with noisy channels
On the complexity of unsigned translocation distance
Periodicity in one-dimensional peg duotaire
Primality Testing and Factoring
Boundary sets of regular and context-free languages
Faster suffix sorting
Type inference for light affine logic via constraints on words
A fast algorithm for finding the positions of all squares in a run-length encoded string
On finite-state approximants for probabilistic computation tree logic
A Characterization of Distance Between 1-Bounded Compact Ultrametic Spaces Through a Universal Space
Recursion Induction Principle Revisited
Some results on digital segments and balanced words
Optimal placement of data replicas in distributed database with majority voting protocol
A general method for decomposing self-intersecting polygon to normal based on self-intersection points
Hardness of and approximate mechanism design for the bike rebalancing problem
The switch Markov chain for sampling irregular graphs and digraphs
Two-agent parallel-machine scheduling with rejection
New infinite family of regular edge-isoperimetric graphs
Effective decomposability of sequential behaviours
A fully polynomial time approximation scheme for the smallest diameter of imprecise points
The environment as a frontier of efficiency in tissue P systems with communication rules
A categorial approach to reaction systems: First steps
Yet harder knapsack problems
Relativizations of the P=?NP Question over the Reals (and other Ordered Rings)
Convex grid drawings of planar graphs with constant edge-vertex resolution
Nearly tight bounds on the price of explainability for the k -center and the maximum-spacing clustering problems
Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions
On the complexity of constrained Nash equilibria in graphical games
Secure ID-based linkable and revocable-iff-linked ring signature with constant-size construction
The energy complexity of diameter and minimum cut computation in bounded-genus networks
The Steiner tree problem on graphs: Inapproximability results
Clustering with respect to the information distance
Least-recently-used caching with dependent requests
The abc conjecture and correctly rounded reciprocal square roots
Modelization of deterministic rational relations
The intersection of 3-maximal submonoids
On the distribution of integer points on curves of genus zero
Groups and decompositions of codes
Free-algebra models for the pi -calculus
Public data structures: counters as a special case
The Černý conjecture for one-cluster automata with prime length cycle
Synchronized Tree Automata
Rational Probability Measures
Stationary Deterministic Flows: II. The Single-Server Queue
An improved kernel for Max-Bisection above tight lower bound
Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
The approximability of the weighted Hamiltonian path completion problem on a tree
Succinct Representation of Regular Languages by Boolean Automata II
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data
The k-resource problem in uniform metric spaces
Low space data structures for geometric range mode query
Structure connectivity and substructure connectivity of twisted hypercubes
Reducibilities on Real Numbers
Edge-bipancyclicity of hypercubes with faulty edges
Dispersion of mobile robots on graphs in the asynchronous model
Ninth International Conference on Concurrency Theory 1998 - Editorial
Towards a proof of the decidability of the momentary stagnation of the growth function of D 0 L systems
Improved approximation for prize-collecting red-blue median
Edge-disjoint packing of stars and cycles
Structural parameterizations of Tracking Paths problem
A Partial k -Arboretum of Graphs with Bounded Treewidth
A geometrical characterization of factors of multidimensional Billiard words and some applications
State complexity of combined operations for suffix-free regular languages
The complexity of bivariate power series arithmetic
On a problem of Fagin concerning multivalued dependencies in relational databases
Optimizing Scalability and Availability of Cloud Based Software Services Using Modified Scale Rate Limiting Algorithm
Undecidable Properties of Deterministic Top-Down Tree Transducers
Online hitting of unit balls and hypercubes in Rd using points from Zd
Sorting an array using the topological sort of a corresponding comparison graph
On codes with a finite deciphering delay: constructing uncompletable words
Two-sorted Metric Temporal Logics
Short labeling schemes for topology recognition in wireless tree networks
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
A unified approach to recognize squares of split graphs
Boltzmann samplers for v -balanced cycles
Two results on slime mold computations
On-line stream merging in a general setting
Lyapunov Operators to Study the Convergence of Extremal Automata
Efficient minus and signed domination in graphs
On convex complexity measures
Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation
On the parametric complexity of schedules to minimize tardy tasks
Finite-Valued Distance Automata
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization
A Weakest Precondition Semantics for Communicating Processes
Robust biomolecular finite automata
Reductions in Tree Replacement Systems
Trimming visibly pushdown automata
Analysis of Scheduling Behaviour using Generic Timed Automata
Oracle separations for non-adaptive collapse-free quantum computing
Additives of linear logic and normalization - Part I: a (restricted) Church-Rosser property
From hidden to visible: A unified framework for transforming behavioral theories into rewrite theories
Three Characterizations of Correlation-immune Functions over Rings Z N
On the red/blue spanning tree problem
Parallel rewriting of attributed graphs
Modelling contextuality by probabilistic programs with hypergraph semantics
Resolution and Model Building in the Infinite-Valued Calculus of Lukasiewicz
Anonymous Wireless Rings
Calculating an upper bound of the locating-chromatic number of trees
Adding pebbles to weighted automata: Easy specification & efficient evaluation
Rational power series in several noncommuting variables and the Skolem-Mahler-Lech theorem
Algebraic Structures in Categorial Grammar
On the Border of Causality: Contact and Confusion
Random sampling of colourings of sparse random graphs with a constant number of colours
Path queries on functions
Universality of sequential spiking neural P systems based on minimum spike number
The Binary Network Flow Problem is Logspace Complete for P
Randomized strategies for cardinality robustness in the knapsack problem
Monadic Logic Programs and Functional Complexity
String matching with variable length gaps
Function-dependent teams in eco-grammar systems
Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
Fast Uniform Generation of Regular Graphs
Fun with fonts: Algorithmic typography
Introducing VA UCANSON
The number of rearrangements for Clos networks - new results
Kinetic clustering of points on the line
Pre-expansivity in cellular automata
Epis need not be Dense
Optimizing n-variate (n+k)-nomials for small k
Semi-dynamic breadth-first search in digraphs
Time and energy driven online scheduling problem in EV charging
Average-case analysis for the MAX-2SAT problem
Discrete Geometry for Computer Imagery - Preface
Further analysis of the remedian algorithm
Fixpoint semantics and simulation
On the complexity of deciding bimatrix games similarity
Improved randomized results for the interval selection problem
Born and raised distributively: Fully distributed non-interactive adaptively-secure threshold signatures with short shares
h -extra r -component connectivity of interconnection networks with application to hypercubes
New exact algorithms for the 2-constraint satisfaction problem
A fault-containing self-stabilizing (3 - 2/(Delta+1))-approximation algorithm for vertex cover in anonymous networks
Priority algorithms with advice for disjoint path allocation problems
Abstract Games for Linear Logic
Main-memory triangle computations for very large (sparse (power-law)) graphs
Inclusion and Equivalence between Relational Database Schemata
Changing of the guards: Strip cover with duty cycling