yusuke1997/dblp-id-title huggingface dataset:
Cost Constrained Fixed Job Scheduling
The compositional construction of Markov processes
Hierarchical Decompositions of Dihypergraphs
On the Number of Equal-Letter Runs of the Bijective Burrows-Wheeler Transform
Towards Parametric Causal Semantics in pi-calculus
Pushdown Automata Accepting in Constant Height: Decidability and Height Bounds - Extended Abstract
Recent Results on Strategy Logic with Imperfect Information
Intersection Types for the Computational lambda-Calculus
On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets (short paper)
Limited Automata: Power and Complexity (text not included)
An efficient algorithm for generating symmetric ice piles
Improved Protocols for Luminous Asynchronous Robots
Quantum Annealing: an Introduction
Timed process calculi: from durationless actions to durational ones
Models and Algorithms for Election Control through Influence Maximization
Time Series Checking with Fuzzy Interval Temporal Logics
DALI: A Multi Agent System Framework for the Web, Cognitive Robotic and Complex Event Processing
Semantics in Skel and Necro
A Typed Semantics of Higher-Order Store and Subtyping
Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages
(Not So) Boring Abstract Machines
Introducing Fuzzy Quantification in OWL 2 Ontologies
On Mining Distances in Large-Scale Dynamic Graphs
Interacting Hopf Algebras: the Theory of Linear Systems (text not included)
Distributed Programming of Smart Systems with Event-Condition-Action Rules
On the Approximability of Dense Steiner Tree Problems
A New Directly Accessible Compression Scheme
Additional Winning Strategies in Two-Player Games
Subtyping Object and Recursive Types Logically
Deterministic recognizability of picture languages by Wang automata
Merging Frequent Summaries
A New Combinatorial Approach to Sequence Comparison
Proving the Range Property for Lambda Theories and Models
Uniform Circle Formation for Fully Semi-, and Asynchronous Opaque Robots with Lights
On Compressing Collections of Substring Samples
The random generation of derangements
ModalFP-Growth: Efficient Extraction of Modal Association Rules from Non-Tabular Data
Hyperset Individualisation Algorithms
Simple and Practically Efficient Fault-tolerant 2-hop Cover Labelings
The Satisfiability Problem for Boolean Set Theory with a Rational Choice Correspondence
Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections
Inference From Non-Horn Clauses With Partial Predicates
Insights into the Complexity of Disentangling Temporal Graphs
An idealized coinductive type system for imperative object-oriented programs
Faster Deterministic Wakeup in Multiple Access Channels
Clairvoyance and Laziness for on Line Travelling Agents
A Note on the Cooperation in Rewriting Systems with Context-Dependency Checking
(t, r)-Broadcast Domination in Networks
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters
Threshold-Bounded Dominating Set with Incentives
On Synchronous and Asynchronous Communication Paradigms
A Calculus for Subjective Communication
A Comparison Between Similarity Measures Based on Minimal Absent Words: An Experimental Approach
A Potential-Based Variant of the Bellman-Ford Algorithm
L(2, 1)-Edge Labeling of Infinite Triangular Grid
Nondeterministically Selecting Positive Instances of Context-Free Languages
Generation of Skew Convex Polyominoes
Nash Social Welfare in Selfish and Online Load Balancing
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set
Two algorithms issues from a teacher's perspective
The Price of Anarchy of Affine Congestion Games with Similar Strategies
Enhancing Characters Distance Text Sampling by Condensed Alphabets
Proving the Existence of Stable Assignments in Democratic Forking Using Isabelle/HOL
Filter Models and Easy Terms
Gathering of Robots in a Ring with Mobile Faults
Flexible Coinduction for Infinite Behaviour
A Two Player Asynchronous Game With Privacy Constraints on Petri Nets (short paper)
Schelling Games with Continuous Types (short paper)
Structural Parameterizations of Tracking Paths Problem
Incremental Inference of Partial Types
An Abstract Distributed Middleware for Transactions over Heterogeneous Stores
A Taxonomy of Program Analyses
On Petri Net semantics for Process Calculi
A Polymerase Based Algorithm for SAT
Algorithmic View on Circular String Attractors
Extreme Nash Equilibria
Checking Risky Events Is Enough for Local Policies
Corecursive Featherweight Java Revisited
Session Centered Calculi for Service Oriented Computing
The Quantum Cyclic Rotation Gate
Type disciplines for systems biology
Forward proof-search and Countermodel Construction in Intuitionistic Propositional Logic
Sorting streamed multisets
Quantum Algorithms for a Set of Group Theoretic Problems
Hedonic Games with Social Context
Strong exception-safety for Java-like languages
Fair Division is Hard even for Amicable Agents
Logical Semantics for the First Order varsigma-Calculus
Channel Assignment in Honeycomb Networks
On the Clustered Shortest-Path Tree Problem
Some Structural Properties of Associative Language Descriptions
Towards Algebraic Analysis of Probabilistic Programs
Confluence of Untyped Lambda Calculus via Simple Types
On Counting L-Convex Polyominoes
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
Graphs of edge-intersecting and non-splitting paths
Reasoning about Self and Others: Communicating Agents in a Model Action Logic
Mobile Agents Computing: Security Issues and Algorithmic Solutions
Watching Systems with Bounded Probes
On Clausal Equivalence and Hull Inclusion
A Calculus for Dynamic Linking
Proceedings of the 26th Italian Conference on Theoretical Computer Science, Pescara, Italy, September 10-12, 2025
Refined Effects for Unanticipated Object Re-classification: Fickle 3
Realizability Models and Complexity Classes
The Language chi: Circuits, Computations and Classical Logic
LOGI: A Didactic Tool for a Beginners' Course in Logic (System Description)
Graph Expression Complexities and Simultaneous Linear Recurrences
Weak Markovian Bisimilarity: Abstracting from Prioritized/Weighted Internal Immediate Actions
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages
Linear Realisability Over Nets and Second Order Quantification (short paper)
Deque Languages, Automata and Planar Graphs (text not included)
On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games
Tropical Mathematics and the Lambda-Calculus (short paper) (text not included)
Can a Proper Lambda-Model have an R.E. Equational Theory?
The L(2, 1)-Labeling Problem on Oriented Regular Grids
Interval Temporal Logic Model Checking Based on Track Bisimilarity and Prefix Sampling
Proceedings of the 24th Italian Conference on Theoretical Computer Science, Palermo, Italy, September 13-15, 2023
Graph drawing beyond planarity: some results and open problems
Linear Temporal Logics for Structured Context-Free Languages
Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error
Novel Paradigm for the design of Obviously Strategyproof Mechanisms
Exponentially Decreasing Number of Operations in Balanced Trees
Novel XBWT-based Distance Measures for Labeled Trees
Customizable composition operators for Java-like classes
From Decidability to Undecidability by Considering Regular Sets of Instances
Satisfaction of Polynomial Constraints over Finite Domains using Function Values
Languages defined by consensual computations
Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automata
Non-obvious Manipulability in Hedonic Games with Friends Appreciation Preferences
Constructing Finite Maximal Codes from Schützenberger Conjecture
Effectful Applicative Similarity for Call-by-Name Lambda Calculi
Formalizing Program Equivalences in Dependent Type Theory
On the Semantic Equivalence of Language Syntax Formalisms
Semantic Subtyping: Challenges, Perspectives, and Open Problems
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
A Filter Model for the State Monad
A C++ Reasoner for the Description Logic DL-4X(D)
When Input Integers are Given in the Unary Numeral Representation
Model Checking Strategic Abilities of Agents Under Incomplete Information
On the Properties of Partial Completeness in Abstract Interpretation
Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences
Counter-queue Automata with an Application to a Meaningful Extension of Omega-regular Languages
Properties of a Computational Lambda Calculus for Higher-Order Relational Queries
Bisimilarity Via Unique-Solution Techniques
A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics
Closing the Gap of Control Complexity in Borda Elections: Solving ten open cases
A Theoretical Analysis of Alignment and Edit Problems for Trees
Generalized Distance Polymatrix Games (short paper)
Efficient channel assignment for cellular networks modeled as honeycomb grid
Proving a Conjecture on 8-Distance Coloring of the Infinite Hexagonal Grid
Decidability Properties of Recursive Types
An algebraic characterization of unary two-way transducers
On the Generating Functions of Languages Accepted by Deterministic One-reversal Counter Machines
Metric Right Propositional Neighborhood Logic with an Equivalence Relation
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions
Preliminary Results on the Modeling of System Level Diagnosis Problems with Abstract Argumentation
Low-Space Quantum Algorithms for Estimate-Mark-Amplify Tasks
On Exchange-Robust and Subst-Robust Primitive Partial Words
OB-GRAG: LLM Assisted Graph Creation and Querying via Domain Specific Ontology
Shape-Preserving Pattern Matching
Size-constrained 2-clustering in the plane with Manhattan distance
Fast Classical and Quantum Algorithms for Online k-server Problem on Trees
A Locally Connected Spanning Tree Can Be Found in Polynomial Time on Simple Clique 3-Trees
Trace complexity
String Attractors and Combinatorics on Words
The Measure Hypothesis and Efficiency of Polynomial Time Approximation Schemes
A Calculus and Complexity Bound for Minimal Conditional Logic
A Process Calculus Approach to Correctness Enforcement of PLCs
Upper Bounds on the Size of One-Way Quantum Finite Automata
Minimal models for rational closure in SHIQ
From Distributed Computing to Natural Algorithms and Beyond (text not included)
An Information-Theoretic Approach to the Access Control Problem
On the Expressive Power of Light Affine Logic
A Linear-size Cascade Decomposition for Wheeler Automata
Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory
A Unifying Four-State Labelling Semantics for Bridging Abstract Argumentation Frameworks and Belief Revision
Ordering Regular Languages: a Danger Zone
Equality of Corecursive Streams Defined by Finitary Equational Systems
General Opinion Formation Games with Social Group Membership
Temporal Logic for Operator Precedence Words (text not included)
Attribute-Based Precedence Relations for Free-Form Grammars
Finite State Verifiers with Both Private and Public Coins
Extending Backward Compatibility of Probabilistic Testing via Coherent Resolutions
Proceedings of the 21st Italian Conference on Theoretical Computer Science, Ischia, Italy, September 14-16, 2020
Assembling Coherent Network Topologies Using Round-Trip Graphs (short paper)
Complexity Results for Some Fragments of Set Theory Involving the Unordered Cartesian Product Operator
Multi-robot Task Allocation Problem: Current Trends and New Ideas
On Graphs that are not Star-k-PCGs (short paper)
On Programming Models for Mobility
Breaking Symmetries on Tessellation Graphs via Asynchronous Robots
Proceedings of the 17th Italian Conference on Theoretical Computer Science, Lecce, Italy, September 7-9, 2016
Online Firefighting on Grids
Definable sets in weak Presburger arithmetic
Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks
Monad Transformations as Parametric Distributive Laws (text not included)
Cerny-like problems for finite sets of words
Experimental Evaluation of Blum's Maximum Matching Algorithm in General Graphs
Error Mining for Regular Expression Patterns
Strategy Repair for Reachability Games (short paper)
L(3, 2, 1)-Labeling of Certain Planar Graphs
Graph Theoretic Detection of Inefficiencies in Network Models
The Obnoxious Facility Location Game with Dichotomous Preferences
Saddle Point Method in the analysis of pattern statistics for regular languages
Reachability Analysis in Boxed Ambients
Proceedings of the 19th Italian Conference on Theoretical Computer Science, Urbino, Italy, September 18-20, 2018
A Process Algebraic Framework for Multi-Agent Dynamic Epistemic Systems
Differential Logical Relations Part II: Increments and Derivatives
Computing Minimum Directed Feedback Vertex Set in O(1.9977 n )
When a Dollar in a Fully Clustered Word Makes a BWT
Symmetries in Foundations
The Fixed Point Problem for General and for Linear SRL Programs is Undecidable
Informative Labeling Schemes for the Least Common Ancestor Problem
On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
Certification of Memory Usage
Towards Relaxing Metric Information in Linear Temporal Logic
A Temporal, Deontic, Conditional Logic with Typicality: a Preliminary Report
Finite Guarding of Weakly Visible Segments via LineAspect Ratio in Simple Polygons
Algebraic Theories for Contextual Pre-nets
Instantaneous Actions vs. Full Asynchronicity : Controlling and Coordinating a Set of Autonomous Mobile Robots
Implementation of a Tableau-based Satisfiability Checker for HS3
The Complexity of Boolean Failure Identification
Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets (11)
On the Domination Number of t-Constrained de Bruijn Graphs
Distributed Beta-assignment on Graphs
Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings
On the Weak Continuation of Reverse Bisimilarity vs. Forward Bisimilarity
E-unifiability via Narrowing
A Java-Like Calculus with User-Defined Coeffects
On Randomised Strategies in the λ-calculus
Cybersecurity's Way Forward: to get Beautiful or Invisible
Iterated Transduction on Unary Languages
Towards A Practical Model of Reactive Communication-Centric Software
Relating some Logics for True Concurrency
Time-Based Similar Trajectories on Graphs
Step-by-step Robustness for Biochemical Networks
The Complexity of Checking Consistency of Pedigree Information and Related Problems
A Mechanism Design Approach for Allocation of Commodities
Towards a Logic Programming Tool for Cancer Analysis
Relating threshold tolerance graphs to other graph classes
Host-Core Calculi for Non-classical Computations: A First Insight
Distance Constrained Labeling of Precolored Trees
Deadlock Analysis with Behavioral Types for Actors
Combine Model Checking and Runtime Verification in Multi-Agent Systems
Pruned BNDM: Extending the Bit-Parallel Suffix Automata to Large Strings
On the Complexity of Opinion Consensus under Majority Dynamics
Proceedings of the 20th Italian Conference on Theoretical Computer Science, ICTCS 2019, Como, Italy, September 9-11, 2019
Why Proof-Theory Matters in Specification-Based Testing
On the (Im)Possibility of Estimating Various Notions of Differential Privacy (short paper)
Proceedings of the 15th Italian Conference on Theoretical Computer Science, Perugia, Italy, September 17-19, 2014
Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs
A Semantics for Disciplined Concurrency in COP
A Deterministic Event Calculus for Effective Runtime Verification
Density of Ham- and Lee- non-isometric k-ary Words
Modeling Fuzzy Behaviours in Concurrent Systems
Enhanced Regular Corecursion for Data Streams
Anonymous Group Communication in Mobile Networks
Simpson's Proof Systems for Process Verification: A Fine-tuning (short paper)
Reducing the Local Alphabet Size in Tiling Systems for Picture Languages
Move vs Copy: Towards a Formal Comparison of Ambients and Higher-Order Process Calculi
An Agda Implementation of the Modal Logic S4.2: First Investigations
Toward Grünbaum's Conjecture Bounding Vertices of Degree 4
An Effective Translation of Fickle into Java
Graded CTL* over Finite Paths
A metamodeling level transformation from UML sequence diagrams to Coq
Theoretical Computer Science, 10th Italian Conference, ICTCS 2007, Rome, Italy, October 3-5, 2007, Proceedings
Wheelerness and Complementation
A Coalgebraic Description of Web Interactions
Orthomodular algebraic lattices related to combinatorial posets
Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings
Software Transactional Memory with Interactions
Dichotomy Results for Fixed Point Counting in Boolean Dynamical Systems
On the Parametrized Complexity of the s-Club Cluster Edge Deletion Problem
A Decidable Theory Treating Addition of Differentiable Real Functions
Towards a Smart Compilation Manager for Java
Analyzing Non-Interference with respect to Classes
Safe Object Composition in the Presence of Subtyping
An Unifying Framework for Compacting Petri Nets Behaviors
A Congruence Relation for Restructuring Classical Terms
A Typed Assembly Language for Non-interference
Iterated Fixpoint Well-Founded Semantics for Hybrid Knowledge Bases
An algorithm for proving identities with Riordan transformations
On the Stackelberg fuel pricing problem
Families of Constant-Depth Quantum Circuits for Rotations and Permutations
Large Deviation Properties for Pattern Statistics in Primitive Rational Models
Compositional Verification of Secure Streamed Data: A Case Study with EMSS
Connected Facility Leasing Problems
P Systems with Gemmation of Mobile Membranes
Utility-Sharing Games: How to Improve the Efficiency with Limited Subsidies
Iterated Uniform Finite-State Transducers
Adding two equivalence relations to the interval temporal logic AB
A Modular Proof of Semantic Completeness for Normal Systems beyond the Modal Cube, Formalised in HOLMS
Finite Horizon Analysis of Stochastic Systems with the Mur varphi Verifier
A Heuristic for the P-time Reconstruction of Unique 3-Uniform Hypergraphs from their Degree Sequences
A method to evaluate the computational complexity of the theorems from functional analysis
Complexity of Scorpion Solitaire and applications to Klondike
Neural Cryptanalysis of Classical Ciphers
Theoretical Computer Science, 11th Italian Conference, ICTCS 2009, Cremona, Italy, September 28-30, 2009, Proceedings
Power (Set) ALC
Non-Atomic One-Round Walks in Polynomial Congestion Games
Online Advertising: Secure E-coupons
On multiple learning schemata in conflict driven solvers
A Simple Optimal Contention Resolution Scheme for Uniform Matroids
Word- and Tree-based Temporal Logics for Operator Precedence Languages
On the Axiomatizability of Priority III: The Return of Sequential Composition
Laxity Helps in Broadcast Scheduling
Type inference for polymorphic methods in Java-like languages
Omission Failures in Choreographic Programming
The Burrows-Wheeler Transform of an Elastic-Degenerate String
On String Attractors
Reasoning about connectivity without paths
A Model Checker for Interval Temporal Logic over Finite Structures
Improving Sampled Matching through Character Context Sampling
A graph-easy class of mute lambda-terms
Testing Wheelerness of Regular Languages (short paper) (text not included)
A formal framework for compositional compilation
Binary 3-compressible automata
A Shape Calculus for Biological Processes
Influence Maximization in the Independent Cascade Model
When theory meets practice: improving a Peer-To-Peer framework by means of a real DHT algorithm
On the Expressiveness of Polyadicity in Higher-Order Process Calculi
Algorithms for biological graphs: analysis and enumeration
Datastream computation of graph biconnectivity: Articulation Points, Bridges, and Biconnected Components
An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality
Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), Naples, Italy, September 26-28, 2017
Typed Reductions of CLS
Incremental NFA Minimization
A Variant of Turing Machines with no Control States and its Connection to Bounded Temporal Memory
On the Distribution of a Key Distribution Center
Deciding Spatial and behavioral properties in the pi-calculus
Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
Runtime Checks as Nominal Types
On the Price of Anarchy of Restricted Job Scheduling Games
The Graph Rewriting Calculus: Confluence and Expressiveness
Programmable enforcement framework of information flow policies
The Cost of Securing IoT Communications
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
Reasoning about Complex Actions with Incomplete Knowledge: A Modal Approach
Compositional Modeling of Biological Systems in CospanSpan(Graph)
Automata and Logic on p-adic numbers
Quantum Circuit Based Longest Common Substring
Reversible Semantics in Session-based Concurrency
Biological Systems as Reactive Systems
Efficient Algorithms for Detecting Regular Point Configurations
Synthesis of Mechanisms with Strategy Logic
RAT-OWL: Reasoning with Rational Closure in Description Logics of Typicality
On the Emergent Behavior of the 2-Choices Dynamics
A Java visual Simulator of Turing Machines
Types for Immutability and Aliasing Control
Computing Eternal Vertex Cover Number on Maximal Outerplanar Graphs in Linear Time
Weak pattern matching in colored graphs: Minimizing the number of connected components
On Defining Proofs of Knowledge in the Bare Public Key Model
Call-by-Value Separability and Computability
The Grothendieck Computability Model
Resilience Analysis of Time-varying Networks with Addition and Deletion of Nodes
Towards a Model Checking Tool for Strategy Logic with Simple Goals
Undecidability of Future Timeline-based Planning over Dense Temporal Domains?
Extendibility of Choquet rational preferences on generalized lotteries
Maximum Letter-Duplicated Subsequence (short paper)
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
On the Multi-interval Ulam-Rényi game: For 3 Lies 4 Intervals Suffice
Coinductive Techniques for Higher-order Languages with Algebraic Effect (text not included)
Synthesis from Temporal Specifications Using Preferred Answer Set Programming
On Counting Propositional Logic and Wagner's Hierarchy
Deciding Weak Weighted Bisimulation
Bridging Qualitative and Quantitative Modeling with FuzzX
Conjunctive Query Answering via a Fragment of Set Theory
Logical Description of Structured and XML Languages
A Generalized LR(1) Parser or Extended Context-Free Grammars
Towards a Tool for LTL Synthesis with Bounded-Energy Constraints
From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory
On the Computational Complexity of the L (2, 1) -Labeling Problem for Regular Graphs
Proceedings of the 16th Italian Conference on Theoretical Computer Science, ICTCS 2015, Firenze, Italy, September 9-11, 2015
Communications: Duality, chi-Boundedness and Order Density of Homomorphisms of Ordered Graphs
On the Reactive Nature of Financial Networks
Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings
Setting the Path to the Combinatorial Characterization of Prime Double Square Polyominoes
Relating Paths in Transition Systems: the Fall of the Modal mu-Calculus
Tracing and Preventing Sharing and Mutation
Finding an Optimal Label-Splitting to Make a Transition System Petri Net Implementable: a Complete Complexity Characterization
A Substructure based Lower Bound for Eternal Vertex Cover Number
The Black-and-White Coloring Problem on Tree-Structured Hypergraphs
A Logic for Contracts
Displayed Universal Algebra in UniMath: Basic Definitions and Results