yusuke1997/dblp-id-title huggingface dataset:
Extraconnectivity of k-ary n-cube networks
Logic, Language, Information and Computation (WoLLIC 2012)
Robustness: A new form of heredity motivated by dynamic networks
Towards a general methodology for formal verification on spiking neural P systems
On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs
Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge
Hardness of Minimum Barrier Shrinkage and Minimum Installation Path
A fibrational framework for possible-world semantics of Algol-like languages
On Symmetric Differences of NP-Hard Sets with Weakly P-Selective Sets
Creol: A type-safe object-oriented model for distributed concurrent systems
Is Binary Encoding Appropriate for the Problem-Language Relationship?
The equation A⊗x=B⊗y over (max, +)
Penalty cost constrained identical parallel machine scheduling problem
On uncertainty versus size in branching programs
Approximation algorithms for routing and call scheduling in all-optical chains and rings
Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
A theory for execution-time derivation in real-time programs
Definability and Fast Quantifier Elimination in Algebraically Closed Fields
On the Size of Unambiguous Context-Free Grammars
Self-stabilizing leader election in optimal space under an arbitrary scheduler
Guest editors' foreword: Process Algebra
Editorial: A Personal Journey with TCS
Complexity and algorithms for finding a subset of vectors with the longest sum
Optimal and pessimal orderings of Steiner triple systems in disk arrays
Relations of Flow Languages to Petri Net Languages
Computational task offloading algorithm based on deep reinforcement learning and multi-task dependency
Automaticity II: Descriptional Complexity in the Unary Case
On Group Codes
A Shrinking Lemma for Indexed Languages
Bounded-collusion decentralized ABE with sublinear parameters
Comments on "Tautology Testing with a Generalized Matrix Reduction Method"
On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines
Game comparison through play
The Implementation of the Hammurabi System: Indexing and Interprocess Communication
More on morphisms and almost-periodicity
The complexity of determining the rainbow vertex-connection of a graph
Maximize a monotone function with a generic submodularity ratio
A Natural Semantics for Modal Logic Over Databases
Perennial secure multi-party computation of universal Turing machine
Using well-structured transition systems to decide divergence for catalytic P systems
On the complexity of nucleolus computation for bipartite b-matching games
Re-describing an algorithm by Hopcroft
Temporal Aspects of the Modal Logic of Subset Spaces
The Name Discipline of Uniform Receptiveness
Computational study on planar dominating set problem
On the Finite Containment Problem for Petri Nets
Fixed-parameter tractable algorithms for Tracking Shortest Paths
Strong matching preclusion for augmented cubes
A geometric characterization of automatic semigroups
Simulating Probabilistic by Deterministic Algebraic Computation Trees
On probabilistic analog automata
Moments of conjugacy classes of binary words
Equational Specification of Partial Higher-Order Algebras
Corrigendum: The Power of Temporal Proofs
Proof nets and the call-by-value λ-calculus
Dynamical stability of threshold networks over undirected signed graphs
New ( k , l , m )-verifiable multi-secret sharing schemes based on XTR public key system
On NFAs where all states are final, initial, or both
On the g -good-neighbor connectivity of graphs
Reachability is Decidable in the Numbers Game
Varietes de Langages et Operations
Finite relational structure models of topological spaces and maps
Fréquences des facteurs des suites sturmiennes
Computability of analog networks
Symbolic model checking for µ-calculus requires exponential time
Star free expressions over the reals
Fine Hierarchy of Regular Omega-Languages
The learnability of exclusive-or expansions based on monotone DNF formulas
On factors of synchronized sequences
A Syntactical Proof of the Operational Equivalence of Two Lambda-Terms
Counting with range concatenation grammars
Access control in mobile ambient calculi: A comparative view
On the Carathéodory and exchange numbers of geodetic convexity in graphs
Complexity and Decidability for Chain Code Picture Languages
Simple extractors via constructions of cryptographic pseudo-random generators
On multiplier sequences
A semantic framework for the abstract model checking of tccp programs
Easiness in graph models
On the computational complexity of determining polyatomic structures by X-rays
Positive semidefinite zero forcing numbers of two classes of graphs
Nivat's processes and their synchronization
The conference call search problem in wireless networks
Order-Sorted Completion: The Many-Sorted Way
Complexity of unique list colorability
Group encryption: Full dynamicity, message filtering and code-based instantiation
Lazy regular sensing
Active influence spreading in social networks
A Global Representation of the Recursive Functions in the lambda -Calculus
Local Model Checking for Infinite State Spaces
Topological entropy for shifts of finite type over Z and trees
Resolution lower bounds for the weak functional pigeonhole principle
The Firefighter problem on graph classes
Matching Patterns in Strings Subject to Multi-Linear Transformations
Complexity of Boolean Algebras
Multi-colored spanning graphs
Conflict graphs and the SINR-capacity of the mean power scheme
A skin microbiome model with AMP interactions and analysis of quasi-stability vs stability in population dynamics
Some further results on squarefree arithmetic progressions in infinite words
Minimum width color spanning annulus
The limitedness problem on distance automata: Hashiguchi's method revisited
The worst Hanoi graphs
An improved linear kernel for complementary maximal strip recovery: Simpler and smaller
Towards 'up to context' reasoning about higher-order processes
Small size quantum automata recognizing some regular languages
Unprovability of Theorems of Complexity Theory in Weak Number Theories
Generalization from Partial Parametrization in Higher-Order Type Theory
Locating factors of a characteristic word via the generalized Zeckendorf representation of numbers
Types for access control
Complexity of a root clustering algorithm for holomorphic functions
A Gray code for fixed-density necklaces and Lyndon words in constant amortized time
Universal compressed text indexing
Stable Trace Automata vs. Full Trace Automata
Overlap-freeness in infinite partial words
Processes in space
Fast exact algorithms for the SAT problem with bounded occurrences of variables
Two beta-Equal lambda-I-Terms with no Types in Common
On the density of Lyndon roots in factors
Computing the least-core and nucleolus for threshold cardinality matching games
More results on the complexity of identifying problems in graphs
Reachability solution characterization of parametric real-time systems
Notes on the Methodology of CCS and CSP
Minimal reaction systems: Duration and blips
On the parameterized complexity of consensus clustering
Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution
A Comparison of Polynomial Time Completeness Notions
A near-optimal memoryless online algorithm for FIFO buffering two packet classes
Circuit lower bounds from learning-theoretic approaches
Generating candidate busy beaver machines (or how to build the zany zoo)
Erratum to "Polynomial-time identification of very simple grammars from positive data" [Theoret. Comput. Science 298 (2003) 179-206]
Petri Nets and Algebraic Specifications
Relating CASL with other specification languages: the institution level
Local Model Checking in the Modal mu-Calculus
Power simulation and its relation to traces and failures refinement
Unifying logic, topology and learning in Parametric logic
Spiking neural P systems with structural plasticity and anti-spikes
Various Hierarchies of omega-regular Sets
Optimal workload-based weighted wavelet synopses
Efficient scheduling strategy for mobile chargers in task-based wireless sensor networks
Cellular automata between sofic tree shifts
On the achromatic number of signed graphs
The Minimum Broadcast Time Problem for Several Processor Networks
Comparison of simple diversity mechanisms on plateau functions
The Complexity of the Satisfiability Problem for Krom Formulas
Making knowledge explicit: How hard it is
Corrigendum to "A simple and efficient Union-Find-Delete algorithm" [Theoret. Comput. Sci. 412(4-5) 487-492]
Multiple Matching of Parametrized Patterns
The nearest complex polynomial with a zero in a given complex domain
On the complexity of winner determination and strategic control in conditional approval voting
Two-dimensional online bin packing with rotation
A Note on Schnorr's Separatedness
Analytical Depoissonization and its Applications
Cuts, cats, and complete graphs
Grammar semantics, analysis and parsing by abstract interpretation
Existential type systems between Church and Curry style (type-free style)
The complexity of weighted Boolean #CSP with mixed signs
Belief-invariant and quantum equilibria in games of incomplete information
The Do-All problem with Byzantine processor failures
Online (J, K)-search problem and its competitive analysis
Revisiting a randomized algorithm for the minimum rainbow subgraph problem
Causal reversibility in nondeterministic process calculi extended with time or probabilities
Mutual visibility of luminous robots despite angular inaccuracy
Compact q-gram profiling of compressed strings
Three-pile Sharing Nim and the quadratic time winning strategy
On the average complexity of partial derivative transducers
An efficient identity-based key exchange protocol with KGS forward secrecy for low-power devices
Certificateless public key encryption: A new generic construction and two pairing-free schemes
Pancyclicity and bipancyclicity of folded hypercubes with both vertex and edge faults
An optimal tester for k -linear
A unified approach to finding good stable matchings in the hospitals/residents setting
On Finding Primitive Roots in Finite Fields
γ-clustering problems: Classical and parametrized complexity
The diagnosability of multiprocessor systems under the enhanced comparison model
On Some Dynamical Subsets of the Rauzy Fractal
Sur les Facteurs des Suites de Sturm
Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees
Bounded Queries to SAT and the Boolean Hierarchy
Generalizing the hypergraph Laplacian via a diffusion process with mediators
An example of a computable absolutely normal number
The concept of duality for automata over a changing alphabet and generation of a free group by such automata
Fractional covers of hypergraphs with bounded multi-intersection
Analysis of Gong et al.'s CCA2-secure homomorphic encryption
Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms
What is a (non-constructive) non-monotone logical system?
Fast Evaluation of Holonomic Functions
An evolutionary algorithm for automated machine learning focusing on classifier ensembles: An improved algorithm and extended results
Computational topology for isotopic surface reconstruction
A Semantic Characterisation for Faults in Replicated Systems
A deterministic worst-case message complexity optimal solution for resource discovery
Phrase Parsers from Multi-Axiom Grammars
Specification and space complexity of collaborative text editing
Absolute exponential stability of a class of recurrent neural networks with multiple and variable delays
A coinductive completeness proof for the equivalence of recursive types
Langages rationnels définis avec une concaténation non-associative
On distance constrained labeling of disk graphs
Buyer-supplier games: Optimization over the core
Determinization of transducers over finite and infinite words
Backtracking games and inflationary fixed points
Approximating the maximum clique minor and some subgraph homeomorphism problems
The problem of Π 2 -cut-introduction
On the positive semi-definite property of similarity matrices
Logical analysis of data with decomposable structures
Corrigendum: "On Brlek-Reutenauer conjecture"
A 9k kernel for nonseparating independent set in planar graphs
Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
Finding modes with equality comparisons
Concatenation-free languages
Tight bounds in the quadtree complexity theorem and the maximal number of pixels crossed by a curve of given length
Levenshtein's sequence reconstruction problem and results for larger alphabet sizes
A characterization of partial metrizability: domains are quantifiable
Computing Minimal Models by Partial Instantiation
On Determining Optimal Strategies in Pursuit Games in the Plane
On a Fast Decomposition Method in Some Models of Concurrent Computations
Merging Regular Processes by Means of Fixed-Point Theory
A Classical Linear lambda-Calculus
SEF view deletion under bounded condition
Randomized truthful algorithms for scheduling selfish tasks on parallel machines
Conjunctive query evaluation by search-tree revisited
The Sprague-Grundy Function for Wythoff's Game
Some new algorithmic results on co-secure domination in graphs
A Pragmatic Type Concept for Prolog Supporting Polymorphism, Subtyping, and Meta-Programming
Runtime performance of evolutionary algorithms for the chance-constrained makespan scheduling problem
On the complexity of finding a largest common subtree of bounded degree
Segmental partially ordered generalized patterns
Classical and Incremental Attribute Evaluation by Means of Recursive Procedures
Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges
Determinism - (Event Structure Isomorphism = Step Sequence Equivalence)
Mixed fault tolerance in server assignment: Combining reinforcement and backup
Process Algebra with Propositional Signals
Power, positive closure, and quotients on convex languages
Tree spanners on chordal graphs: complexity and algorithms
Lemmings is PSPACE-complete
Constructing an indeterminate string from its associated graph
Largest convex hulls for convex-hull disjoint clusters with bounded size
Formal Verification of a Programming Logic for a Distributed Programming Language
Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
Algorithms for automatic ranking of participants and tasks in an anonymized contest
Strong matching preclusion
Interleaving isotactics - An equivalence notion on behaviour abstractions
Proving Possibility Properties
Bounding the payment of approximate truthful mechanisms
Infinite Hypergraphs II: Systems of Recursive Equations
The structure of reflexive regular splicing languages via Schützenberger constants
Cache-oblivious index for approximate string matching
Equitable colorings of planar graphs without short cycles
Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations
A palindromization map for the free group
Approximate reasoning by similarity-based SLD resolution
A comparison of Statecharts step semantics
Compositionality of Hennessy-Milner logic by structural operational semantics
Programs over Aperiodic Monoids
Sur le Monoide Syntactique de L * Lorsque L est un Langage Fini
Systèmes Codés
Further parameterized algorithms for the F-free edge deletion problem
Video distribution under multiple constraints
On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata
Node rewriting in graphs and hypergraphs: a categorical framework
Approximation algorithms for a bi-level knapsack problem
On the Complexity of Queries in the Logical Data Model
Games for complexity of second-order call-by-name programs
Parallel execution of schedules with random dependency graph
Exact and approximation algorithms for the contiguous translocation distance problem
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
A partial order semantics approach to the clock explosion problem of timed automata
Abstract interpretation of resolution-based semantics
On the subword complexity of Thue-Morse polynomial extractions
Lambda-confluence for context rewriting systems
Algorithmic properties of ciliate sequence alignment
Learning and classifying
Improved periodic data retrieval in asynchronous rings with a faulty host
Expansive automata networks
Category theory for operational semantics
Securing data in the cloud using pairing-free inner product functional encryption with unbounded vector size
Improved lower bounds for online scheduling to minimize total stretch
Tight inefficiency bounds for perception-parameterized affine congestion games
Connectedness and Synchronization
Connectivity preserving network transformers
Multi-head finite automata: data-independent versus data-dependent computations
Modular construction of complete coalgebraic logics
Program verification using symbolic game semantics
A theory of software product line refinement
Morphic words and equidistributed sequences
Exponential transients in continuous-time Liapunov systems
Polynomial expressions for non-binomial structures
Tests de Primalite
Nearly optimal monotone drawing of trees
Theoremes de Transfert pour les Polynomes Partiellement Commutatifs
Ordering regular languages and automata: Complexity
Recent advances in unfolding technique
Real-time recognition of languages on an two-dimensional Archimedean thread
The Shuffle Algebra and its Derivations
On covering a digital disc with concentric circles in Z 2
Harmonious colourings of temporal matchings
Parallel Product of Event Structures
Parametric corecursion
Order-preserving indexing
On the price of stability of some simple graph-based hedonic games
Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model
Multihead One-Way Finite Automata
Parameterized algorithms for d-Hitting Set: The weighted case
Tackling continuous state-space explosion in a Markovian process algebra
Concerning the Semantic Consequence Relation in First-Order Temporal Logic
Small Turing machines and generalized busy beaver competition
Some permutations on Dyck words
Lyndon factorization of the Prouhet words
The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
The firefighter problem: Further steps in understanding its complexity
Improved FPT approximation scheme and approximate kernel for biclique-free max k-weight SAT: Greedy strikes back
Two-stage pricing strategy with price discount in online social networks
Attribute Exploration with Background Knowledge
Towards a Mathematical Theory of Machine Discovery from Facts
Newton's method with deflation for isolated singularities of polynomial systems
On limit cycles of monotone functions with symmetric connection graph
Optimization Problems and the Polynomial Hierarchy
Type Inference, Abstract Interpretation and Strictness Analysis
A Characterisation of Deterministic Context-Free Languages by Means of Right-Congruences
Ambiguous optimistic fair exchange: Definition and constructions
Fluid computation of passage-time distributions in large Markov models
A new self-stabilizing maximal matching algorithm
Faster algorithm for pathwidth one vertex deletion
Elimination of spatial connectives in static spatial logics
Local edge colouring of Yao-like subgraphs of Unit Disk Graphs
On testing for zero polynomials by a set of points with bounded precision
RealLife: The continuum limit of Larger than Life cellular automata
Deterministic Top-Down Tree Transducers with Iterated Lookahead
Negation can be Exponentially Powerful
Fast quantum algorithms for least squares regression and statistic leverage scores
Behaviours of Concurrent Systems
Probabilistic Estimation of the Number of Prefixes of a Trace
Towards imperative modules: Reasoning about invariants and sharing of mutable state
Formal verification of parallel prefix sum and stream compaction algorithms in CUDA
Realization and synthesis of reversible functions
Interaction Systems II: The Practice of Optimal Reductions
A thesis for interaction
Randomness and initial segment complexity for measures
Model checking for process rewrite systems and a class of action-based regular properties
Connectivity and super connectivity of the divide-and-swap cube
Multicommodity flows over time: Efficient algorithms and complexity
Spiking neural P systems with structural plasticity and mute rules
Algebraic aspects of emission tomography with absorption
Compositional semantics and behavioral equivalences for P Systems
Efficient string-matching allowing for non-overlapping inversions
Collective singleton-based consistency for qualitative constraint networks: Theory and practice
Concatenation of Inputs in a Two-Way Automaton
Fanout limitations on constraint systems
Interval iteration algorithm for MDPs and IMDPs
String inference from longest-common-prefix array
A deterministic (2-2/(k+1)) n algorithm for k-SAT based on local search
One-to-one disjoint path covers in digraphs
On Common Information
Matroid-constrained vertex cover
Minimal Complete Sets of Words
Improved algorithms for intermediate dataset storage in a cloud-based dataflow
Lower and upper bounds for deterministic convergecast with labeling schemes
An application of lattice theory to knowledge representation
Annotations for Portable Intermediate Languages
Minimization algorithms for sequential transducers
Branching bisimulation for probabilistic systems: Characteristics and decidability
Linear-time computation of prefix table for weighted strings & applications
Gap-Languages and Log-Time Complexity Classes
Markov chain analysis of evolutionary algorithms on OneMax function - From coupon collector's problem to (1 + 1) EA
Hardware security without secure hardware: How to decrypt with a password and a server
Approximation algorithms for fair k -median problem without fairness violation
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Auto-similarité dans la combinatoire des polynômes orthogonaux
The Generalized XOR Lemma
Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints
An algorithmic view of gene teams
Inequalities characterizing standard Sturmian and episturmian words
Maximum rooted connected expansion
Ergodic Theorems for Individual Random Sequences
A new design formula exploited for accelerating Zhang neural network and its application to time-varying matrix inversion
The complexity of the stamp folding problem
The Synthesis Problem for Elementary Net Systems is NP-Complete
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs
Constructible complexes and recursive division of posets
Periodic Character Sequences where Identifying two Characters Strictly Reduces the Period
The search and rescue game on a cycle
Proof of termination of the rewriting system subst on CCL
On randomised strategies in the λ -calculus
A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem
On the g -extra connectivity of augmented cubes
The assignment problem
Pursuing a fast robber on a graph
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism
Linear Logic, Coherence, and Dinaturality
Alternating Automata on Infinite Trees
Every edge lies on cycles embedding in folded hypercubes with vertex-fault-tolerant
Stable routing scheduling algorithms in multi-hop wireless networks
On the Inference of Optimal Descriptions
A graphical criterion of planarity for RNA secondary structures with pseudoknots in Rivas-Eddy class
On the size of parsers and LR(k)-grammars
Generating labeled planar graphs uniformly at random
A Complete Axiomatic Characterization of First-Order Temporal Logic of Linear Time
Addendum to "Recursively defined metric spaces without contraction" [TCS 380 (1/2) (2007) 143-163]
A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q)
Efficient enumeration of words in regular languages
Cut-Formulas in Propositional Logic
On the covariance-Hessian relation in evolution strategies