yusuke1997/dblp-id-title huggingface dataset:
Active Oberon for .NET: An Exercise in Object Model Mapping
Two-process synchronization
Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
Constructing Competitive Tours from Local Information
A complete proof system for propositional projection temporal logic
Restriction on cut rule in cyclic-proof system for symbolic heaps
Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs
Local approximation of the Maximum Cut in regular graphs
A Logico-Algebraic Approach to the Model Theory of Knowledge
Reconfiguration of connected graph partitions via recombination
Pavage des figures planes sans trous par des dominos: Fondement graphique de l'algorithme de Thurston, parallélisation, unicité et décomposition
On the Nature of Events: Another Perspective in Concurrency
A Definition of Surfaces of Z: A new 3D Discrete Jordan Theorem
The firing squad synchronization problem on CA with multiple updating cycles
Finding hidden independent sets in interval graphs
No feasible monotone interpolation for simple combinatorial reasoning
On Language Equations with Invertible Operations
Synchronized shuffles
On trace languages generated by (small) spiking neural P systems
Closed Ziv-Lempel factorization of the m -bonacci words
One-Way Functions and the Nonisomorphism of NP-Complete Sets
A General Theory of Sharing Graphs
Reset Words for Commutative and Solvable Automata
From Regular Expressions to Deterministic Automata
When hypermutations and ageing enable artificial immune systems to outperform evolutionary algorithms
A Short Biography of Arto Salomaa
Conjugacy and episturmian morphisms
On the computational strength of pure ambient calculi
Semigroup automata with rational initial and terminal sets
Social exchange networks with distant bargaining
State complexity of unambiguous operations on finite automata
The computable kernel of Abstract State Machines
On submodular prophet inequalities and correlation gap
The height of a binary search tree: the limiting distribution perspective
Delaying Unification Algorithms for Lambda Calculi
Local algorithms for edge colorings in UDGs
Clustering for Petri nets
Compressed cliques graphs, clique coverings and positive zero forcing
Congruence Lattices 101
Itemset frequency satisfiability: Complexity and axiomatization
Clustering under a knapsack constraint: Parameterized approximation for the knapsack median problem
Circular convex bipartite graphs: Feedback vertex sets
Partial derivatives of regular expressions over alphabet-invariant and user-defined labels
Path partitions of phylogenetic networks
On the least exponential growth admitting uncountably many closed permutation classes
On the analysis of the (1+1) evolutionary algorithm
Efficient computation of the iteration of functions
A Trace-Based Compositional Proof Theory for Fault Tolerant Distributed Systems
Forest alignment with affine gaps and anchors, applied in RNA structure comparison
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2 m , 4)
Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
The binary identification problem for weighted trees
Cyclic Automata
Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59]
A general technique to establish the asymptotic conditional diagnosability of interconnection networks
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting
Steiner trees for hereditary graph classes: A treewidth perspective
Reliable Computations on Faulty EREW PRAM
Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
Fractional powers in Sturmian words
Improved parameterized and exact algorithms for cut problems on trees
ProveEasy: helping people learn to do proofs
Multiple birds with one stone: Beating 1/2 for EFX and GMMS via envy cycle elimination
Relativized codes
Bases of primitive nonpowerful sign patterns
Meadows and the equational specification of division
Sequential algorithms and strongly stable functions
The complexity of power-index comparison
Isomorphism, Form Equivalence and Sequence Equivalence of PD0L Forms
Pattern-matching algorithms based on term rewrite systems
Complexity of Tile Rotation Problems
Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series
Diffusion without false rumors: on propagating updates in a Byzantine environment
On the expressive power of KLAIM-based calculi
Several Applications of Analytic Functors to Theoretical Computer Science
The topology of wireless communication on a line
Optimal Lower Bounds for Some Distributed Algorithms for a Complete Network of Processors
The Church-Rosser Property and Special Thue Systems
Sturmian words and the Stern sequence
A Note on Real-Time One-Way Alternating Multicounter Machines
Algebraic Simplification in Computer Algebra: An Analysis of Bottom-up Algorithms
Extended Automata-Like Regular Expressions of Star Degree At Most (2, 1)
Testing timed automata
Ultraproducts and possible worlds semantics in institutions
On the number of higher order Delaunay triangulations
Three concepts of decidability for general subsets of uncountable spaces
Loopless algorithms to generate maximum length gray cycles wrt. k -character substitutions
Visibility testing and counting for uncertain segments
Compositions of tree series transformations
Decidability and complexity of simultaneous rigid E-unification with one variable and related results
A New Subsumption Method in the Connection Graph Proof Procedure
Resource bounded symmetry of information revisited
Partial multicuts in trees
Automatic semigroups and categories
Weak-order extensions of an order
From Hopfield nets to recursive networks to graph machines: Numerical machine learning for structured data
Fault diagnosability of Bicube networks under the PMC diagnostic model
Universal knowledge-seeking agents
Dimension 1 sequences are close to randoms
About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems
On-Line Scheduling of Jobs with Fixed Start and End Times
Core words and Parikh matrices
Axiomatizations for probabilistic finite-state behaviors
Algorithms and insights for RaceTrack
From prima quadraginta octant to lattice sphere through primitive integer operations
Accelerated execution of P systems with active membranes to solve the N-queens problem
Preface - Workshop on Verification of Logic Programs
Temporal Logics Need Their Clocks
Burning number of graph products
Dynamically consistent reduction of logical regulatory graphs
Online two-way trading: Randomization and advice
Reducibilities among equivalence relations induced by recursively enumerable structures
Acyclic networks maximizing the printing complexity
Bisimulation quantifiers and uniform interpolation for guarded first order logic
Quantum communication and complexity
Computation as an unbounded process
A formal abstract framework for modelling and testing complex software systems
Closedness properties in ex-identification
Wait-free approximate agreement on graphs
Probabilistic learnability of context-free grammars with basic distributional properties from positive examples
Semantic subtyping for the pi-calculus
Reliability measure of the n -th cartesian product of complete graph K 4 on h -extra edge-connectivity
CoverPpreserving Embeddings of Bipartite Orders Into Boolean Lattices
Structural Information and Communication Complexity
Non-unique probe selection and group testing
On protein structure alignment under distance constraint
Several semi-online scheduling problems on two identical machines with combined information
Minimizing roundoff errors of prefix sums via dynamic construction of Huffman trees
An Improved Algorithm for Solving the Banded Cyclic String-to-String Correction Problem
Equivalences for a biological process algebra
Process languages and nets
The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
Two fast constructions of compact representations of binary words with given set of periods
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms
A characterization of fine words over a finite alphabet
Observation Equivalence as a Testing Equivalence
A simple undecidable problem for free groups
A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem
Alternation and omega-Type Turing Acceptors
A simple optimal representation for balanced parentheses
Injective coloring of planar graphs
Soundness of data refinement for a higher-order imperative language
Independent triangles covering given vertices of a graph
Foreword: Non-standard Logics and Logical Aspects of Computer Science
Hardness of (M)LWE with semi-uniform seeds
A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
QANIZK for adversary-dependent languages and their applications
Synergistic knowledge
A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model
Constructive metrisability in point-free topology
A space-efficient algorithm for sequence alignment with inversions and reversals
Proof Systems for Structured Specifications with Observability Operators
The rewriting logic semantics project
Set cover, hitting set, and independent set problems for some restricted classes of geometric objects
New applications of the incompressibility method: Part II
Conditional Equational Theories and Complete Sets of Transformations
Strict bounds for pattern avoidance
New Families of Non Real Time DPDA's and their Decidability Results
Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata
Generation of amalgamated free products of cyclic groups by finite automata over minimal alphabet
Multigames and strategies, coalgebraically
Asymptotically optimal amplifiers for the Moran process
Comparison of machine learning algorithms for classification of Big Data sets
Names of the -calculus agents handled locally
Synchronized Rational Relations of Finite and Infinite Words
Fuzzy-rough nearest neighbour classification and prediction
Protocols with constant local storage and unreliable communication
The Verus language: representing time efficiently with BDDs
On the average state and transition complexity of finite languages
Avant Propos
Categorical properties of M-indiscernibility spaces
Extensional proofs in a propositional logic modulo isomorphisms
A complete refinement procedure for regular separability of context-free languages
On the cover time and mixing time of random geometric graphs
Economic models for cloud service markets: Pricing and Capacity planning
A mechanism design approach for multi-party machine learning
Symmetric blocking
Stable Families of Behavioural Equivalences
On-line digit set conversion in real base
A note on the Lie complexity and beyond
Embedding mutually edge-disjoint cycles into locally twisted cubes
The fewest clues problem
Online scheduling with rearrangement on two related machines
The complexity of dependency detection and discovery in relational databases
On 3D visibility representations of graphs with few crossings per edge
Functional stepped surfaces, flips, and generalized substitutions
Solution of a problem in DNA computing
Elements of Generalized Ultrametric Domain Theory
Complexity Models for Incremental Computation
A solution to the Angel Problem
Computing subset transversals in H -free graphs
Some APX-completeness results for cubic graphs
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Congestion games with priority-based scheduling
Some operations preserving primitivity of words
Robust optimization of graph partitioning involving interval uncertainty
On Counting Problems and the Polynomial-Time Hierarchy
Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
On the bottleneck counting argument
Polynomial time in untyped elementary linear logic
Axiomatizing weak simulation semantics over BCCSP
On positive influence dominating sets in social networks
A domain-theoretic semantics of lax generic functions
A Theory of Implementation and Refinement in Timed Petri Nets
Stable Neighbourboods
On Fault Tolerance of Syntax
Tail call elimination on the Java Virtual Machine
A generic causal model for place latency
3D discrete rotations using hinge angles
Processes of membrane systems with promoters and inhibitors
A study on splay trees
Contractivity of linear fractional transformations
From Axiomatics to Intrinsic Characterization: Some Open Problems in Computable Analysis
Determinization of conditional term rewriting systems
A complexity analysis of bisimilarity for value-passing processes
Embedded connectivity of recursive networks
Query-point visibility constrained shortest paths in simple polygons
The size of SPP
The conformon-P system: a molecular and cell biology-inspired computability model
A computer-verified monadic functional implementation of the integral
Improved deterministic algorithms for weighted matching and packing problems
Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
Membrane fission versus cell division: When membrane proliferation is not enough
On the benefits and risks of using fitness sharing for multimodal optimisation
Some minimum merging networks
Card-based protocols for secure ranking computations
A class of bounded functions, a database language and an extended lambda calculus
Ergodicity, transitivity, and regularity for linear cellular automata over Z m
Partial Commutations and Faithful Rational Transductions
Online scheduling with equal processing times and machine eligibility constraints
Minimal forbidden factors of circular words
Decidability results for Watson-Crick D0L systems with nonregular triggers
Optimistic fair exchange in the enhanced chosen-key model
Set Containment Inference and Syllogisms
Reversible iterative graph processes
Bio-PEPAd: A non-Markovian extension of Bio-PEPA
State complexity of union and intersection of star on k regular languages
Additive and multiplicative properties of point sets based on beta-integers
A constructive algorithm for finding the exact roots of polynomials with computable real coefficients
A polynomial space construction of tree-like models for logics with local chains of modal connectives
Computability on subsets of metric spaces
On parameterized exponential time complexity
Reversible Christoffel factorizations
General parameterised refinement and recursion for the M-net calculus
The NP-completeness of a tomographical problem on bicolored domino tilings
Probabilistic model checking of complex biological pathways
Better bounds for incremental medians
The homomorphism problem for trace monoids
Principality and type inference for intersection types using expansion variables
Sparse and limited wavelength conversion in all-optical tree networks
Parallelism and Concurrency of Graph Manipulations
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference
Energy efficient sorting, selection and searching
Categorical Abstract Machines for Higher-Order Typed lambda-Calculi
A self-stabilizing transformer for population protocols with covering
Concurrent linearizable nearest neighbour search in LockFree-kD-tree
Image quality assessment using BSIF, CLBP, LCP, and LPQ operators
A Theory of Bipolar Synchronization Schemes
Construction de Codes Factorisants
Intersection types and lambda models
Monotonic and Dual Monotonic Language Learning
An algebraic characterization of the set of succession rules
Games with winning conditions of high Borel complexity
Solving Optimization Problems with Variable-Constraint by an Extended Cohen-Grossberg Model
Directed virtual path layouts in ATM networks
How many ants does it take to find the food?
Separable equilibrium state probabilities via time reversal in Markovian process algebra
A formal semantics for protocol narrations
On ordering of β -description trees
Avoidance bases for formulas with reversal
Unconditional competitive auctions with copy and budget constraints
The impact of information on broadcasting time in linear radio networks
Quelques procédés engendrant des suites infinies
Accurate program analyses for successful specialization of legacy system software
On the independence number of graphs with maximum degree 3
Spin systems on k-regular graphs with complex edge functions
Expressive power of SQL
The Semantics and Proof Theory of Linear Logic
Log-space constructible universal traversal sequences for cycles of length O(n 4.03 )
Relaxed models for rewriting logic
On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields
Efficient Algorithms for Acyclic Colorings of Graphs
Decision on block size in blockchain systems by evolutionary equilibrium analysis
Approximating the minimum cycle mean
On positionality of trigger strategies Nash equilibria in SCAR
On the size complexity of hybrid networks of evolutionary processors
A comparison of simulated annealing with a simple evolutionary algorithm on pseudo-boolean functions of unitation
Rotating-Table Games and Derivatives of Words
The identity type weak factorisation system
Optimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraint
Shallow Grates
A factor-(1.408 + ε) approximation for sorting unsigned genomes by reciprocal translocations
Fast and compact regular expression matching
Reconstructing a string from its Lyndon arrays
A cylinder computation model for many-core parallel computing
The Convex Set Forming Game
Characterizations of one-way general quantum finite automata
Axiomatizing the identities of binoid languages
Generic weakest precondition semantics from monads enriched with order
Standard Sturmian Morphisms
A note on the ϵ-indicator subset selection
Boolean Neural Nets are Observable
Rapid Constructions of Algebraic Axioms From Samples
Abstract Grammars Based on Transductions
Dynamic mechanism design
About the p-Paperfolding Words
Hyperopic Cops and Robbers
Decidability of involution hypercodes
Parameter synthesis for probabilistic timed automata using stochastic game abstractions
The degree distribution of random k-trees
On the complexity of deciding avoidability of sets of partial words
Speeding up the detection of evolutive tandem repeats
On Termination and Confluence Properties of Disjoint and Constructor-Sharing Conditional Rewrite Systems
On pairwise compatibility graphs having Dilworth number k
Computing majority via multiple queries
Nondeterministic operational complexity in subregular languages
Edge motion and the distinguishing index
Graph editing problems with extended regularity constraints
Using evaluation functions in Monte-Carlo Tree Search
Decidability of the Restriction Equational Theory in the Partial Lambda Calculus
Probabilistic Mobile Ambients
Theories of Types and Proofs 1997 - Preface
Load balancing of temporary tasks in the l p norm
The complexity of the Hajós calculus for planar graphs
Multiple Sequence Comparison - A Peptide Matching Approach
Freeness of partial words
An abstraction theory for qualitative models of biological systems
On the approximability of the range assignment problem on radio networks in presence of selfish agents
Parallel Ear Decomposition Search (EDS) and st-Numbering in Graphs
Edge-bipancyclicity of star graphs with faulty elements
A mechanism of function calls in MSVL
On Optimal Parallel Computations for Sequences of Brackets
On the complexity of resource-bounded logics
Dynamic resource allocation games
Distributed CONGESTBC constant approximation of MDS in bounded genus graphs
On scheduling inclined jobs on multiple two-stage flowshops
Deterministic bottom-up tree transducers and ground term rewrite systems
Geometric covering using random fields
Algebraic and model-theoretic properties of tilings
Tight bounds for the multiplicative complexity of symmetric functions
Computational power of dynamic threshold neural P systems for generating string languages
Continuous-time computation with restricted integration capabilities
Compact factors of countable state Markov shifts
A First Step Towards Implementing Dynamic Algebraic Dependences
Complexity results for rainbow matchings
On the semantics of durational actions
A divergence formula for randomness and dimension
Incremental Closure for Systems of Two Variables Per Inequality
Polynomial equation solving by lifting procedures for ramified fibers
Block LU factors of generalized companion matrix pencils
Complexity and approximation for Traveling Salesman Problems with profits
On the learnability of recursively enumerable languages from good examples
A complete axiom system for propositional projection temporal logic with cylinder computation model
k-Capture in multiagent pursuit evasion, or the lion and the hyenas
Diagnosability of multigraph composition networks
Graph Layout for Applications in Compiler Construction
The Complementation Problem for Büchi Automata with Appplications to Temporal Logic
Characterizing strong normalization in the Curien-Herbelin symmetric lambda calculus: Extending the Coppo-Dezani heritage
Pedagogical second-order lambda-calculus
Invulnerability of planar two-tree networks
Model-checking process equivalences
Data-Movement-Intensive Problems: Two Folk Theorems in Parallel Computation Revisited
On fast and robust information spreading in the Vertex-Congest model
Extending Horn Clause Logic with Implication Goals
On the decision problem for MELL
Monitoring churn in wireless networks
Negation-limited formulas
Cops and Robbers from a distance
Improving small private exponent attack on the Murru-Saettone cryptosystem
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy
When does a planar bipartite framework admit a continuous deformation?
A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions
On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
Advanced elementary formal systems
Computing unsatisfiable k-SAT instances with few occurrences per variable
The Problem of Defining the Singular Points of Quasi-Linear Differential-Algebraic Systems
A Proof of Choffrut's Theorem on Subsequential Functions
Principal Type Schemes for an Extended Type Theory
Propositional default logics made easier: computational complexity of model checking
Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
Buffer minimization with conflicts on a line
Variable length local decoding and alignment-free sequence comparison
Exploring networks with traceroute-like probes: Theory and simulations
About local configurations in arithmetic planes
Construction of algorithms for parallel addition in expanding bases via Extending Window Method
Restrictions on NLC Graph Grammars
Wildcarded identity-based encryption from lattices
The set of parameterized k-covers problem
Graph colourings and partitions
Almost-certain eventualities and abstract probabilities in the quantitative temporal logic qTL
Fast rendezvous on a cycle by agents with different speeds
Exploring a dynamic ring without landmark
A Shared-Memory Implementation of the Hierarchical Radiosity Method
Turing Tumble is Turing-Complete
Streamable regular transductions
Every Schnyder drawing is a greedy embedding
Base modules for parametrized iterativity
Fast algorithms for computing Jones polynomials of certain links
Expander properties and the cover time of random intersection graphs
A Universal Cellular Automaton in Quasi-Linear Time and its S-m-n Form
Polyline drawings with topological constraints
The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games
On modelling mobility
On the satisfiability threshold and clustering of solutions of random 3-SAT formulas
Branching time controllers for discrete event systems
Loops and overloops for Tree-Walking Automata
On-line scheduling with tight deadlines
Strategies for combining decision procedures
Impartial coloring games