yusuke1997/dblp-id-title huggingface dataset:
Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model
Concentration of rainbow k -connectivity of a multiplex random graph
Biinfinite words with maximal recurrent unbordered factors
Fixed Points in Free Process Algebras, Part I
A cache-friendly truncated FFT
On Adaptive Versus Nonadaptive Bounded Query Machines
Palindromes in circular words
Logical string rewriting
forall-Exists 5 -equational theory of context unification is undecidable
Parameterized approximation algorithms for some location problems in graphs
Maximum packing for k-connected partial k-trees in polynomial time
Probability theory for the Brier game
Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems
Fast deterministic distributed algorithms for sparse spanners
Succinct representation of labeled trees
Random generation of 2 times 2 times ... times 2 times J contingency tables
On a conjecture on bidimensional words
Repetitions in Sturmian strings
Approximation algorithm for prize-collecting sweep cover with base stations
Two undecidability results for chain code picture languages
Deterministic broadcasting time with partial knowledge of the network
On the computational complexity of infinite words
Sublinear-time reductions for big data computing
One-to-one disjoint path covers on k-ary n-cubes
A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications
Better analysis of greedy binary search tree on decomposable sequences
A Neural Compiler
Doubly adaptive zero-knowledge proofs
The relation of Connected Set Cover and Group Steiner Tree
Computational complexity of finite asynchronous cellular automata
Alphabet Indexing for Approximating Features of Symbols
Logical classification of distributed algorithms (Bakery algorithms as an example)
Automaticity of Double Sequences Generated by One-Dimensional Linear Cellular Automata
A Direct Algorithm for Checking Equivalence of LL (k) Grammars
Single pushout rewriting in comprehensive systems of graph-like structures
Using geometric rewrite rules for solving geometric problems symbolically
Combinatorial search in two and more rounds
Colored range queries and document retrieval
Learning Deterministic even Linear Languages From Positive Examples
Generalized covariances of multi-dimensional Brownian excursion local times
Decoders with Initial State Invariance for Multivalued Encodings
Unavoidable sets and circular splicing languages
The structure of a linear chip firing game and related models
Models of Lower-Bounds Proofs
The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
A Note on Realtime One-Way Synchronized Alternating One-Counter Automata
Synchronizing automata with a letter of deficiency 2
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
On the relationship between combinatorial and LP-based lower bounds for NP-hard scheduling problems
The Semantics of Incomplete Databases as an Expression of Preferences
Not all strangers are the same: The impact of tolerance in Schelling games
The g-good-neighbor diagnosability of locally twisted cubes
On a model of online analog computation in the cell with absolute functional robustness: Algebraic characterization, function compiler and error control
A circuit basis for morphogenesis
Quantum cryptography: Public key distribution and coin tossing
Evasive properties of sparse graphs and some linear equations in primes
Fully Abstract Composition Semantics for an Algebra of Logic Programs
Forum: A Multiple-Conclusion Specification Logic
On complementarily transitivity of graphs
Approximation algorithms for partially covering with edges
Dynamic orthogonal range queries in OLAP
On Automata on Infinite Trees
For the 50th anniversary of Eric Goles: A few words by Maurice Nivat
Enumerative encoding of correlation-immune Boolean functions
A representation of stably compact spaces, and patch topology
On-demand strategy annotations revisited: An improved on-demand evaluation strategy
On the Language of Primitive Words
Boolean-width of graphs
Interconvertibility of a class of set constraints and context-free-language reachability
Full abstraction for polymorphic pi-calculus
Fully dynamic algorithm for chordal graphs with O(1) query-time and O(n 2 ) update-time
Preface: This issue is dedicated to Jan Bergstra on the occasion of his sixtieth birthday
An Hadamard operation on rational relations
Gathering of robots in a ring with mobile faults
Linear reachability problems and minimal solutions to linear Diophantine equation systems
On learning embedded midbit functions
Competitive analysis of maintaining frequent items of a stream
The Largest Cartesian Closed Category of Domains
Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
An efficient alignment algorithm for masked sequences
Tractability of batch to sequential conversion
On Fast Planning of Suboptimal Paths Amidst Polygonal Obstacles in Plane
Affine connections, midpoint formation, and point reflection
Drawing Graphs in Two Layers
Complexity of Logical Theories Involving Coprimality
Sorting genomes by prefix double-cut-and-joins
Generalization of automatic sequences for numeration systems on a regular language
Languages and Scanners
Smooth words on 2-letter alphabets having same parity
Parallel Algorithms for Certain Matrix Computations
Some classes of term rewriting systems inferable from positive data
Two-machine open shop problem with agreement graph
Automatic synthesis of a subclass of schedulers in timed systems
Towards a Theory of Parallel Algorithms on Concrete Data Structures
Multiple genome rearrangement by swaps and by element duplications
Event Structures and Trace Monoids
From bidirectionality to alternation
Feasibility assessments of a dynamical approach to compartmental modelling on graphs: Scaling limits and performance analysis
Two-Dimensional Iterative Arrays: Characterizations and Applications
Towards Language-Agnostic Mobile Code
Splitting atoms safely
Differentially private high dimensional sparse covariance matrix estimation
State complexity of unique rational operations
Lazy productivity via termination
Complete Classes of Automata for the alpha-0-Product
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Optimal reachability for multi-priced timed automata
Exact and inexact search for 2d side-sharing tandems
On the Relative Sizes of Learnable Sets
Programs as Partial Graphs II: Recursion
Intractability of decision problems for finite-memory automata
Lattice-based linearly homomorphic signatures in the standard model
On families of categorial grammars of bounded value, their learnability and related complexity questions
On Equations for Regular Languages, Finite Automata, and Sequential Networks
Type 2 Computational Complexity of Functions on Cantor's Space
On the Need for a Different Backtracking Rule when Dealing with Late Evaluation
Factoring polynomials over arbitrary finite fields
Geometrical Penrose tilings are characterized by their 1-atlas
MODRED: A code-based non-interactive key exchange protocol
The dynamics of rank-maximal and popular matchings
Computing the maximum agreement of phylogenetic networks
Bilinear Mincing Rank
Investigation of Binary Spectra by Explicit Polynomial Transformations of Graphs
Computing monodromy via continuation methods on random Riemann surfaces
Extremal polyphenyl chains with respect to the Kirchhoff index
Complete submodularity characterization in the comparative independent cascade model
Unsupervised slow subspace-learning from stationary processes
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
The Covering Problem for Linear Context-Free Grammars
How to compute digraph width measures on directed co-graphs
Semi-online scheduling revisited
Solving NP-complete problems in the tile assembly model
Neural learning methods yielding functional invariance
See More Through Lenses Than Bananas
Repeated Snapshots in Distributed Systems with Synchronous Communications and their Implementation in CSP
Dynamic monopolies with randomized starting configuration
Drawing and Encoding Two-Dimensional Posets
Professor Choffrut
Deterministic solutions to QSAT and Q3SAT by spiking neural P systems with pre-computed resources
Synchronization of a bounded degree graph of cellular automata with nonuniform delays in time D floor(log m D )
On the computing powers of L-reductions of insertion languages
Connectedness properties of dimension level sets
XML queries and constraints, containment and reformulation
Matching for the lambda Calculus of Objects
FPT algorithms for domination in sparse graphs and beyond
Facility location games with ordinal preferences
A shifting algorithm for continuous tree partitioning
Pfaffian orientations for a type of bipartite graph
Chaitin Omega numbers, Solovay machines, and Gödel incompleteness
One-visibility cops and robber on trees: Optimal cop-win strategies
Infinite families of 2-isometric and not 3-isometric binary words
Algorithms for computing variants of the longest common subsequence problem
Infinite cyclic impartial games
Simplified small exponent test for batch verification
Finding dominating induced matchings in P10-free graphs in polynomial time
Reactors: A data-oriented synchronous/asynchronous programming model for distributed applications
Improved shortest path algorithms for nearly acyclic graphs
Conjectures on wirelength of hypercube into cylinder and torus
Approximating power node-deletion problems
Optimality of SVM: Novel proofs and tighter bounds
Spatial-behavioral types for concurrency and resource control in distributed systems
Une Note sur le Théorème de Caractérisation des Générateurs Algébriques
User-driven competitive influence maximization in social networks
On the 2-abelian complexity of generalized Cantor sequences
On Boolean combinations forming piecewise testable languages
A Complete System of Identities for One-Letter Rational Expressions with Multiplicities in the Tropical Semiring
Distributing hash families with few rows
On Monotone Simulations of Nonmonotone Networks
Deterministic 7/8-approximation for the metric maximum TSP
An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine
A new thesis concerning synchronised parallel computing - simplified parallel ASM thesis
Performance analysis of randomised search heuristics operating with a fixed budget
Towards optimal lower bounds for clique and chromatic number
Tight bounds for black hole search with scattered agents in synchronous rings
Generic recursive lens combinators and their calculation laws
A probabilistic approach to case-based inference
Conditional simple temporal networks with uncertainty and decisions
Finer-grained reductions in fine-grained hardness of approximation
Finite Biprefix Sets of Paths in a Graph
On the Algorithmic Complexity of Associative Algebras
The complexity of equivalence and isomorphism of systems of equations over finite groups
Dormancy-aware timed branching bisimilarity with an application to communication protocol analysis
Bilimites de Langages Reconnaissables
Algorithms for terminal Steiner trees
A unique extension of rich words
Lagois Connections - a Counterpart to Galois Connections
Faster exact solutions for some NP-hard problems
Short length Menger's theorem and reliable optical routing
Zeno machines and hypercomputation
Quantum versus deterministic counter automata
Pipelined algorithms to detect cheating in long-term grid computations
Extremal Solutions of Inequations over Lattices with Applications to Supervisory Control
Combinatorial Proofs of Hook Generating Functions for Skew Plane Partitions
Causal automata
Fibonacci Morphisms and Sturmian Words
Generalization bounds for learning weighted automata
Time separations of cyclic event rule systems with min-max timing constraints
Approximation of the Double Traveling Salesman Problem with Multiple Stacks
Cartesian closed categories of separable Scott domains
SLDNF Resolution with Non-Safe Rule and Fixpoint Semantics for General Logic Programs
Palindrome recognition using a multidimensional tape
Dominating set is fixed parameter tractable in claw-free graphs
On-line vertex-covering
Optimal three-dimensional layout of interconnection networks
A linear time algorithm for metric dimension of cactus block graphs
The relevant prefixes of coloured Motzkin walks: An average case analysis
An Algebraic Approach to Hybrid Systems
Quantum key distribution using a two-way quantum channel
Maximum independent sets in subcubic graphs: New results
Threshold changeable secret sharing schemes revisited
Computing properties of stable configurations of thermodynamic binding networks
On some questions regarding k -regular and k -context-free sequences
Optimal Estimation on the Order of Local Testability of Finite Automata
ASM refinement and generalizations of forward simulation in data refinement: a comparison
Conjunctive grammars with restricted disjunction
The impact of parametrization in memetic evolutionary algorithms
Learning languages and functions by erasing
The amortized analysis of a non-blocking chromatic tree
On partitioning the edges of 1-plane graphs
On abstract data types presented by multiequations
Sand automata as cellular automata
Two algebraic approaches to variants of the concatenation product
The discrete and mixed minimax 2-center problems
Lower bounds for invariant queries in logics with counting
Elementary differences among jump classes
Third-order Idealized Algol with iteration is decidable
Formal description and analysis of a distributed location service for mobile ad hoc networks
Scheduling linear deteriorating jobs with an availability constraint on a single machine
One-Way Simple Multihead Finite Automata are not Closed Under Concatenation
Computing phylogenetic roots with bounded degrees and errors is NP-complete
The minimum-entropy set cover problem
Subset Languages of Petri Nets Part II: Closure Properties
The Burrows-Wheeler transform of an elastic-degenerate string and its application to pattern matching
A Systematic Study of Models of Abstract Data Types
Digraphs with proper connection number two
Mechanizing Structural Induction Part I: Formal System
On the ultimate complexity of factorials
Mahler measures, short walks and log-sine integrals
The Completeness Theorem for Typing lambda-Terms
On the reversibility and the closed image property of linear cellular automata
Sorting genomes by generalized translocations
An O(n 1.75 ) algorithm for L(2, 1)-labeling of trees
Faster compression of patterns to Rectangle Rule Lists
Symmetric PMC model of diagnosis, b -matchings in graphs and fault identification in t -diagnosable systems
Time-Space Tradeoffs for Set Operations
The lion and man game on polyhedral surfaces with obstacles
Lower bounds on the run time of the Univariate Marginal Distribution Algorithm on OneMax
Preface to the special issue on GandALF 2012
On detecting environment sensitivity using slicing
Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors
Measuring the performance of asynchronous systems with PAFAS
The computational power of enzymatic numerical P systems working in the sequential mode
Convergence of the non-uniform directed Physarum model
Tree algebras and varieties of tree languages
Efficient model checking for LTL with partial order snapshots
Finite derivation type for Rees matrix semigroups
Space-efficient uniform deployment of mobile agents in asynchronous unidirectional rings
Searching for shortest and least programs
Rapid left expansivity, a commonality between Wolfram's Rule 30 and powers of p / q
The increase of the instability of networks due to Quasi-Static link capacities
On equitable Delta -coloring of graphs with low average degree
The expressiveness of DAC
Tree Transducers with External Functions
On geometric shape construction via growth operations
Infinitary Lambda Calculus
Mathematical Foundations of Programming Semantics: Papers from MFPS 14 and MFPS 16
A metric index for approximate string matching
Mixed Searching and Proper-Path-Width
Modeling and predicting all-alpha transmembrane proteins including helix-helix pairing
Coalgebras in functional programming and type theory
Approximate strong separation with application in fractional graph coloring and preemptive scheduling
Restricted ground tree transducers
A colored graph approach to perfect phylogeny with persistent characters
The multiplicative fragment of the Yanov equational theory
Maximality Preserving Bisimulation
Exact leaf powers
Concurrent Realizations of Reactive Systems
Euclidean strings
Measurable stochastics for Brane Calculus
Algebraic Proofs of Consistency and Completeness
A program logic for resources
On vertex-weighted realizations of acyclic and general graphs
Polynomial-Time Reducibilities and "Almost All" Oracle Sets
Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree
Solving 7x7 Hex with domination, fill-in, and virtual connections
Note on powers in three interval exchange transformations
The importance of being proper: (In clustered-level planarity and T-level planarity)
A Geometric Hierarchy Beyond Context-Free Languages
Random 2-SAT: results and problems
Hypervolume-based multiobjective optimization: Theoretical foundations and practical implications
Generalized ultrametric spaces in quantitative domain theory
PERT scheduling with convex cost functions
A cartesian closed category in Martin-Löf's intuitionistic type theory
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Any Iteration for Polynomial Equations Using Linear Information has Infinite Complexity
Image reducing words and subgroups of free groups
Computing halting probabilities from other halting probabilities
Abelian powers and repetitions in Sturmian words
Many-to-many disjoint path covers in k k-ary n n-cubes
Boundary classes for graph problems involving non-local properties
Church-Rosser Strategies in the Lambda Calculus
Sign-then-encrypt with security enhancement and compressed ciphertext
On the Power of Probabilistic Strategies in Inductive Inference
Alternating-time temporal logic ATL with finitely bounded semantics
The three column Bandpass problem is solvable in linear time
Social pressure in opinion dynamics
Concurrent Regular Expressions and Their Relationship to Petri Nets
Packing squares independently
New amortized cell-probe lower bounds for dynamic problems
Special issue on Foundational Methods in Systems Biology
Verification of gap-order constraint abstractions of counter systems
The Complexity of Group Algebra Computations
On the Finite-Valuedness Problem for Sequential Machines
Program Transformations and Algebraic Semantics
Exact learning via teaching assistants
Parameterized certificate dispersal and its variants
Property-preserving subnet reductions for designing manufacturing systems with shared resources
Map graphs having witnesses of large girth
Local testability from words to traces, a suitable definition
Sampling and output estimation in distributed algorithms and LCAs
Sur la symétrie et l'asymétrie des structures combinatoires
Modified binary searching for static tables
On the g -extra diagnosability of enhanced hypercubes
On the Syntax of Martin-Löf's Type Theories
Grammars, Derivation Modes and Properties of Indexed and Type-0 Languages
Pseudopalindrome closure operators in free monoids
Typing correspondence assertions for communication protocols
The firing squad problem revisited
Analysis and control of fuzzy discrete event systems using bisimulation equivalence
Long binary patterns are Abelian 2-avoidable
Size of Ordered Binary Decision Diagrams Representing Threshold Functions
A generalized approach for solving non-inclusive diagnosability of regular networks under the PMC model
Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
On the Decomposition of Datalog Program Mappings
Variations on a Game of Gale (II): Markov Strategies
Looking at the stars
The complexity of path coloring and call scheduling
Property matching and weighted matching
Embedding of meshes in Möbius cubes
Divide-and-conquer recurrences associated with generalized heaps, optimal merge, and related structures
Feasibility checking in Horn constraint systems through a reduction based approach
Item bidding for combinatorial public projects
Dominating induced matching in some subclasses of bipartite graphs
A Tableau-Like Proof Procedure for Normal Modal Logics
Computation in Artificially Evolved, Non-Uniform Cellular Automata
P automata revisited
Remarks concerning the freeness problem over morphism and matrix semigroups
Tight bounds for online class-constrained packing
Timed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions
Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing
While-Programs with Nondeterministic Assignments and the Logic Alna
Determining the Exit Time Distribution for a Closed Cyclic Network
Sturmian words and words with a critical exponent
Computing an st -Numbering
Runtime analysis of RLS and (1 + 1) EA for the dynamic weighted vertex cover problem
Dynamic connectors for concurrency
It is Decidable Whether a Regular Language is Pure Context-Free
Conditioned Rewriting Logic as a United Model of Concurrency
An analysis of chain characteristics in the cryptanalytic TMTO method
Constructible Differentially Finite Algebraic Series in Several Variables
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
An incentive compatible, efficient market for air traffic flow management
Dykstra's algorithm for constrained least-squares doubly symmetric matrix problems
Pattern avoidance by palindromes
Computing possible and certain answers over order-incomplete data
Compositional characterisations of lambda -terms using intersection types
A fast network-decomposition algorithm and its applications to constant-time distributed computation
The Hidden Subgroup Problem and MKTP
Approximation algorithms for the three-machine proportionate mixed shop scheduling
An improved algorithm for online coloring of intervals with bandwidth
Computing eternal vertex cover number of maximal outerplanar graphs in linear time
Approximability results for stable marriage problems with ties
Competitive online routing in geometric graphs
On the edge-bandwidth of graph products
On the Weighted Quartet Consensus problem
Nonuniform SINR+Voronoi diagrams are effectively uniform
Programming in Three-valued Logic
On the Hurwitz Product of Formal Power Series and Automata
Parameterized algorithms for finding highly connected solution
Quantum algorithms for learning hidden strings with applications to matroid problems
Star-Free Sets of Integers
Choosing the best among peers
On graphs of central episturmian words
Explore and repair graphs with black holes using mobile entities
Discovering characteristic expressions in literary works
Termination and derivational complexity of confluent one-rule string-rewriting systems
On a Possible Classification of Real-Time Constructed Sequences
Novel updatable identity-based hash proof system and its applications
A bound for the convergence rate of parallel tempering for sampling restricted Boltzmann machines
A computational complexity analysis of tunable type inference for Generic Universe Types
Criterion of calibration for transductive confidence machine with limited feedback
Partial words and a theorem of Fine and Wilf revisited
Longest common extensions in trees
Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Approach
The many facets of upper domination
Developments in language theory
A (1+ln2)(1+ln2)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
Lost in self-stabilization: A local process that aligns connected cells
Fault tolerance of hypercube like networks: Spanning laceability under edge faults
Complexity Results on the Conjugacy Problem for Monoids
Analysis issues in Petri nets with inhibitor arcs