yusuke1997/dblp-id-title huggingface dataset:
The complexity of Boolean matrix root computation
An algebraic characterization of deterministic regular languages over infinite alphabets
L(3, 2, 1)-Labeling of the square of cycles
An order-preserving property of additive invariants for Takesue-type reversible cellular automata
Automatizing Termination Proofs of Recursively Defined Functions
Constant time parallel computations in lambda-calculus
Approximate evaluations of characteristic polynomials of Boolean functions
A graph theoretic approach to automata minimality
Approximation algorithms for NMR spectral peak assignment
Satisfiability Problems on Intervals and Unit Intervals
Embedding Metric Spaces Into CPO's
Converting two-way nondeterministic unary automata into simpler automata
Bideterministic automata and minimal representations of regular languages
The Modal µ-Calculus Alternation Hierarchy is Strict
Streaming ranked-tree-to-string transducers
Second-Price Ad Auctions with Binary Bids and markets with good competition
Partial Derivatives of Regular Expressions and Finite Automaton Constructions
Computation of distances for regular and context-free probabilistic languages
Entanglement and the complexity of directed graphs
FLUID: A common model for semantic structural graph summaries based on equivalence relations
New up-to techniques for weak bisimulation
Continuous monoids and semirings
The Kolmogorov Expressive Power of Boolean Query Languages
Varieties of contextuality based on probability and structural nonembeddability
Characterization of State-Independent Automata
Total variation discrepancy of deterministic random walks for ergodic Markov chains
Some Chip Transfer Games
Mellin Transforms and Asymptotics: Harmonic Sums
An algebraic approach to the reconstruction of uniform hypergraphs from their degree sequence
Lambda Terms Definable as Combinators
Pattern Decomposition for Tessellation Automata
A variant of the tandem duplication - random loss model of genome rearrangement
Differential Approximation Algorithms for Some Combinatorial Optimization Problems
Revisiting maximum satisfiability and related problems in data streams
m-Balanced words: A generalization of balanced words
On the existence of EFX (and Pareto-optimal) allocations for binary chores
The black-box complexity of nearest-neighbor search
A lower bound on the competitivity of memoryless algorithms for a generalization of the CNN problem
Minimal cost reconfiguration of data placement in a storage area network
On the Modularity of Termination of Term Rewriting Systems
Basic process algebra with deadlocking states
Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
A Kleene-Schützenberger theorem for weighted timed automata
A 5+epsilon-approximation algorithm for minimum weighted dominating set in unit disk graph
Ramsey numbers for tournaments
On layered area-proportional rectangle contact representations
PC trees and circular-ones arrangements
Upper and lower bounds on approximating weighted mixed domination
Balances for fixed points of primitive substitutions
Online bin covering: Expectations vs. guarantees
Scheduling in Synchronous Networks and the Greedy Algorithm
Remembering without memory: Tree exploration by asynchronous oblivious robots
The ordinal generated by an ordinal grammar is computable
The chords' problem
Left-handed completeness
Hyperedge Channels are Abelian
Identity-based encryption with leakage-amplified chosen-ciphertext attacks security
Strong planning under uncertainty in domains with numerous but identical elements (a generic approach)
Morphically primitive words
Cancellation and periodicity properties of iterated morphisms
A fast Hermite transform
Hybrid encryption in correlated randomness model and KEM combiners
An (18/11)n upper bound for sorting by prefix reversals
A PTAS for the budgeted power maximum coverage problem
Conditional matching preclusion for hypercube-like interconnection networks
ICALP, EATCS and Maurice Nivat
Semi-online scheduling problems on two identical machines with inexact partial information
Improved bounds and schemes for the declustering problem
On 1-planar graphs with bounded cop-number
Special issue - Implementation and Application of Automata (CIAA 2017)
An Inherently Iterative Computation of Ackermanns's Function
Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints
A loopless algorithm for generating the permutations of a multiset
Answering Queries from Context-Sensitive Probabilistic Knowledge Bases
Palindromic closures using multiple antimorphisms
Discontinuities in pattern inference
On invariance and linear convergence of evolution strategies with augmented Lagrangian constraint handling
Hardness of Entropic Module-LWE
A formal model of real-time program compilation
Entropy sensitivity of languages defined by infinite automata, via Markov chains with forbidden transitions
Minimality and separation results on asynchronous mobile processes - representability theorems by concurrent combinators
An Efficient Parallel Algorithm for Updating Minimum Spanning Trees
Sur les facteurs des mots automatiques
Compatibility of unrooted phylogenetic trees is FPT
Labelled Domains and Automata with Concurrency
Energy-efficient multiprocessor scheduling for flow time and makespan
The optimal All-Partial-Sums algorithm in commutative semigroups and its applications for image thresholding segmentation
When privacy fails, a formula describes an attack: A complete and compositional verification method for the applied π -calculus
P-immune sets with holes lack self-reducibility properties
An Easy Priority-Free Proof of a Theorem of Friedberg
On the Information Rate of Secret Sharing Schemes
Non-overlapping matrices
AbU: A calculus for distributed event-driven programming with attribute-based interaction
On the Distributional Complexity of Disjointness
Transforming Normal Logic Programs to Constraint Logic Programs
On a class of infinite words with affine factor complexity
On the separability of sparse context-free languages and of bounded rational relations
Realizability of high-level message sequence charts: closing the gaps
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
Stationary algorithmic probability
Normal Petri Nets
Essence of Generalized Partial Computation
Efficient CRCW-PRAM Algorithms for Universal Substring Searching
An information-theoretic framework for the lossy compression of link streams
On counting propositional logic and Wagner's hierarchy
A novel characterization of the complexity class ϴ P k based on counting and comparison
On the Verifiability of Two-Party Algebraic Protocols
More on the Power of Chain Rules in Context-Free Grammars
Spectral concepts in genome informational analysis
Implementing Term Rewrite Languages in Dactl
Eliminating Partially Dead Code in Explicitly Parallel Programs
Pseudo-solutions of word equations
Deciding path size of nondeterministic (and input-driven) pushdown automata
Approximating decision trees with priority hypotheses
Improved algorithms for quantum identification of Boolean oracles
Nondeterministic Circuits, Space Complexity and Quasigroups
One-dimensional approximate point set pattern matching with L p -norm
New results for Domineering from combinatorial game theory endgame databases
On the role of 3s for the 1-2-3 Conjecture
Linear logic by levels and bounded time complexity
Denotational semantics of membrane systems by using complete metric spaces
Sorting by prefix block-interchanges
Order Dependency in the Relational Model
Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
Parameterized Circuit Complexity and the W Hierarchy
Interface theories for concurrency and data
Special Issue on "Theory and Applications of Graph Searching Problems"
A graph-theoretical basis of stochastic-cascading network influence: Characterizations of influence-based centrality
Four states are enough!
New algorithms on wavelet trees and applications to information retrieval
Weighted Systems of Equations
Generalized Beimel-Chor Schemes for Broadcast Encryption and Interactive Key Distribution
On the reconstruction of binary and permutation matrices under (binary) tomographic constraints
The Polynomial-Time Hierarchy
Optimal lower bounds for rank and select indexes
A note on the complexity of locating-total domination in graphs
Algebraic Implementation of Abstract Data Types
Exact algorithms for weighted and unweighted Borda manipulation problems
Two short notes on the on-line travelling salesman: handling times and lookahead
Modelling and verification of weighted spiking neural systems
Bribery in elections with randomly selected voters: Hardness and algorithm
Parametric random generation of deterministic tree automata
Recognising k-Connected Hypergraphs in Cubic Time
On structuring proof search for first order linear logic
Approximate core allocations and integrality gap for the bin packing game
Generalized satisfiability for the description logic ALC
Competitive exploration of rectilinear polygons
Reachability problems for sequential dynamical systems with threshold functions
Complexity and algorithms for constant diameter augmentation problems
The complexity of dominating set reconfiguration
Trust-aware peer sampling: Performance and privacy tradeoffs
On Completing Tables to Satisfy Functional Dependencies
Algorithms for 2-club cluster deletion problems using automated generation of branching rules
Anomalous Learning Helps Succinctness
Lower bounds and new constructions on secure group communication schemes
Metrics for labelled Markov processes
Convergence of binomial-based derivative estimation for C 2 noisy discretized curves
Some Combinatorial Aspects of Congruence Lattice Representations
Near-optimal PAC bounds for discounted MDPs
Computing the Behaviour of Asynchronous Processes
Explicit Substitution On the Edge of Strong Normalization
Correctness of linear logic proof structures is NL-complete
A strip-like tiling algorithm
A Characterization of Plotkin's Order in Powerdomains, and Some of its Properties
Simple and efficient fully-functional succinct trees
The degree of word-expansion of lexicalized RRWW-automata - A new measure for the degree of nondeterminism of (context-free) languages
Mutilated chessboard problem is exponentially hard for resolution
Early nested word automata for XPath query answering on XML streams
Pushout-Complements and Basic Concepts of Grammars in Toposes
Arbitrary pattern formation on infinite regular tessellation graphs
Proof by computation in the Coq system
Proper connection number and connected dominating sets
Exploring an unknown dangerous graph using tokens
Comparing reactions in reaction systems
Determinacy - (Observation Equivalence = Trace Equivalence)
Strong normalization from an unusual point of view
Continuous consensus with ambiguous failures
A Process Algebra of Communicating Shared Resources with Dense Time and Priorities
Threshold Dominating Sets and an Improved Characterization of W [2]
Compiling Mercury to the .NET Common Language Runtime
Acyclic edge coloring of planar graphs with large girth
Path and cycle fault tolerance of bubble-sort graph networks
A Notation for Lambda Terms: A Generalization of Environments
A new approximation algorithm for the unbalanced Min s-t Cut problem
Leader election in plane cellular automata, only with left-right global convention
Satisfiability of acyclic and almost acyclic CNF formulas
Experiments and Stability in Group Automata
Connecting guards with minimum Steiner points inside simple polygons
Revisiting the PAXOS algorithm
Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem
On doubly symmetric Dyck words
Exponentiation Using Canonical Recoding
Echanges de trois intervalles et suites minimales
Algebraic aspects of families of fuzzy languages
Unsupervised learning of invariant representations
Adapting parallel algorithms to the W-Stream model, with applications to graph problems
Languages with membership determined by single letter factors
On generalized Lyndon words
Approximation algorithms for facility location problems with a special class of subadditive cost functions
Offline and online algorithms for single-minded selling problem
Log Space Machines with Multiple Oracle Tapes
Synchronizing delay for binary uniform morphisms
A new framework for addressing temporal range queries and some preliminary results
Improved game play by multiple computer hint
Additive Cellular Automata and Algebraic Series
Remarks on the effective Jordan decomposition
A local characterization for perfect plane near-triangulations
Special Issue: First International Conference on Database Theory, Rome, September 1986, Forword
Applying clique-decomposition for computing Gromov hyperbolicity
Negative Boolean Constraints
Asymptotic analysis of a leader election algorithm
Non-expandable non-overlapping sets of pictures
Automatic Average-Case Analysis of Algorithm
Root finding with threshold circuits
An operational quantum information framework for experimental studies on color perception
Splitting and nonsplitting in the Σ 2 0 enumeration degrees
On the complexity of the traveling umpire problem
A unifying theory of control dependence and its application to arbitrary program structures
DNA duplex cage structures with icosahedral symmetry
The Hamiltonian properties of supergrid graphs
Topological morphing of planar graphs
Two-Level Semantics and Code Generation
A code-based signature scheme from the Lyubashevsky framework
On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
Pseudoknot-generating operation
Tractability and approximability of maximal strip recovery
Towards "dynamic domains": Totally continuous cocomplete Q -categories
Tabular parsing and algebraic transformations
Adjoining to Wythoff's Game its P -Positions as Moves
Online scheduling of equal-processing-time task systems
Adaptive oblivious transfer with access control from lattice assumptions
Unification with Extended Patterns
On approximability of optimization problems related to Red/Blue-split graphs
An efficient approach for abstraction-refinement in model checking
An Optimization Problem in Virtual Endoscopy
Threshold sampling
The complexity of multiple sequence alignment with SP-score that is a metric
Analyzing ultimate positivity for solvable systems
A graph theoretic approach to general Euler diagram drawing
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
Edge-independent spanning trees in augmented cubes
Observations on non-silent self-stabilizing algorithms in sensor networks with probabilistically intermittent link failures
A Syntactic Congruence for Rational omega-Language
Radio aggregation scheduling
On approximating partial scenario set cover
Schedulers and finishers: On generating and filtering the behaviours of an event structure
Many-to-Many Routings on Trees via Matchings
Comparing First-Fit and Next-Fit for online edge coloring
Linear-time superbubble identification algorithm for genome assembly
Pebble Games for Studying Storage Sharing
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
Attractor computation using interconnected Boolean networks: Testing growth rate models in E. Coli
The N U System as a Development System for Concurrent Programs: delta N U
Move-optimal partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
Unique perfect phylogeny is intractable
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph
Asymptotic subword complexity of fixed points of group substitutions
Approximation algorithms for the partition vertex cover problem
On-line scheduling mesh jobs with dependencies
Reconstruction and verification of chordal graphs with a distance oracle
Machine learning advised algorithms for the ski rental problem with a discount
Satgraphs and independent domination. Part 1
Temporal matching
Factorisation in the semiring of finite dynamical systems
A Linear Time Solution to the Single Function Coarsest Partition Problem
Program logic and equivalence in the presence of garbage collection
A linear ordering of a multi-parameter universe is usually nonsense
A manifesto for the computational method
Program Schemata vs. Automata for Decidability of Program Logics
Quantitatively fair scheduling
The computational complexity of distance functions of two-dimensional domains
Unresolved systems of language equations: Expressive power and decision problems
An Inherently Iterative Algorithm for the Grzegorczyk Hierarchy
Applying adversarial planning techniques to Go
Bounded time-stamping in message-passing systems
Aspects of complexity of probabilistic learning under monotonicity constraints
Identity-based authenticated encryption with identity confidentiality
Growth of repetition-free words -- a review
On state-alternating context-free grammars
On the parameterized complexity of diverse SAT
Online scheduling with deterioration and unexpected processor breakdown
Topology, monitorable properties and runtime verification
On the computational complexity of a game of cops and robbers
A fixed point theorem for non-monotonic functions
Monad as Modality
Non-Recursiveness of the Operations on Real Numbers
Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial, Part I: The Algeabra G[u] / < Q(u)^l >, l > 1
Parameterization of rational translational surfaces
Some Studies on the (p, q)-Type Sequences
Identical parallel machine scheduling with time-dependent processing times
Some Applications of the McCreight-Meyer Algorithm in Abstract Complexity Theory
Perpetual torus exploration by myopic luminous robots
Composition inverses of the variations of the Baum-Sweet sequence
On Lindenmayerian Algebraic Sequences
Fewest repetitions versus maximal-exponent powers in infinite binary words
Near-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ 1
Succinct representation of dynamic trees
Reconfigurable routing in data center networks
Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable Markov network
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Approximate string matching with stuck address bits
A linear-time algorithm for paired-domination on circular-arc graphs
Comparator networks for binary heap construction
Continously Generated Fixed Points
On the Inference of Approximate Programs
Minsum k -sink problem on path networks
Playing the perfect Kriegspiel endgame
Canonical derivatives, partial derivatives and finite automaton constructions
Nondeterministic Moore automata and Brzozowski's minimization algorithm
Mixed sessions
A fully dynamic algorithm for the recognition of P 4 -sparse graphs
Preface: Orders, Algorithms and Applications
Editorial: Implicit Computational Complexity
On Context-Free Trees
Analysis of key reuse security for Aigis.KEM
TCS in the 21st century
Generating clause sequences of a CNF formula
Fano colourings of cubic graphs and the Fulkerson Conjecture
Mean-payoff games with partial observation
Reduction de la non-linearite des morphismes d'arbres Recognizable tree-languages and non-linear morphisms
There are Infinitely Many Complete Prefix Codes of Constant Length l (l greater than 3)
Tight rank lower bounds for the Sherali-Adams proof system
On Depth in Edtol Languages
Diagrammatic calculus and generalized associativity for higher-arity tensor operations
Polynomial time multiplication and normal forms in free bands
Component connectivity of augmented cubes
Asynchronous cellular automata for pomsets
On Regular Trace Languages
List edge and list total colorings of planar graphs without 4-cycles
Confluent Linear Numeration Systems
Online request server matching
An O ( n 2 )O(n2)-time algorithm for the minimal interval completion problem
Cube packing
Corrected upper bounds for free-cut elimination
Effective Subdirect Decomposition: A Case Study
Combining overlap and containment for gene assembly in ciliates
Bisimulation relations for weighted automata
The language equivalence problem for HD0L systems having D0L growths
Parsing Boolean grammars over a one-letter alphabet using online convolution
Rationality of the Möbius function of a composition poset
Metaphors and heuristic-driven theory projection (HDTP)
How long it takes for an ordinary node with an ordinary id to output?
Sorting the Sums (xi+yj) in O(n2) Comparisons
Finding fixed point free elements and small bases in permutation groups
On periodicity of two-dimensional words
Reporting consecutive substring occurrences under bounded gap constraints
On dynamic threshold graphs and related classes
Asymptotic analysis of weighted fair division
An Algorithm to Decide Whether a Rational Subset of N^k is Recognizable
Compact suffix automata representations for searching long patterns
On probabilistic and quantum reaction systems
Generalized limited packings of some graphs with a limited number of P4-partners
Every Countable Poset is Embeddable in the Poset of Unsolvable Terms
On the emergence of regularities on one-dimensional decreasing sandpiles
Rectangular polyomino set weak (1, 2)-achievement games
A Compositional Framework for Fault Tolerance by Specification Transformation
On a class of languages with holonomic generating functions
The weighted 2-server problem
A Sturmian sequence related to the uniqueness conjecture for Markoff numbers
Propositional Dynamic Logic is Weaker without Tests
Minimal schedulability interval for real-time systems of periodic tasks with offsets
Testing Eulerianity and connectivity in directed sparse graphs
Two-Way Deterministic Multi-Weak-Counter Machines
Functorial semantics of first-order views
A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata
On the time and the bit complexity of distributed randomised anonymous ring colouring
Experimental evaluation of algorithms for computing quasiperiods
Locally searching for large induced matchings
Efficient probability amplification in two-way quantum finite automata
Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries
The cyclic diagnosability of balanced hypercubes under the PMC and MM⁎ model
Lower bound for balanced sets
On the solvability of a class of diophantine equations and applications
APX-hardness and approximation for the k -burning number problem
Cleaning a network with brushes
String-matching with OBDDs
On the automaticity of the Hankel determinants of a family of automatic sequences
Adaptively secure distributed public-key systems
CPO'S of Measures for Nondeterminism
On a graph calculus for modalities
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays
Deterministic 3-server on a circle and the limitation of canonical potentials
Causal set topology
Projection Lemmas for omega-Languages
Commutation Preperties and Generating Sets Characterize Slices of Various Synchronization Primitives
Minimizing average flow-time under knapsack constraint
Two-way deterministic automata with jumping mode
Quasiperiodic Sturmian words and morphisms
w-Regular languages are testable with a constant number of queries
Locating two facilities on a square with a minimum distance requirement
Reconstructing polygons from scanner data
Rectangle packing with additional restrictions
Etude Syntaxique de Certains Langages Solutions d'Equations avec Operateurs
Spiking neural P systems with target indications
The universe of propositional approximations
Exploring an unknown dangerous graph with a constant number of tokens
Puncturable identity-based and attribute-based encryption from lattices
Dominance constraints with Boolean connectives: a model-eliminative treatment
Anti-magic labelling of Cartesian product of graphs
Trichotomy for the reconfiguration problem of integer linear systems
Distribution results for low-weight binary representations for pairs of integers
Computing vertex-surjective homomorphisms to partially reflexive trees