yusuke1997/dblp-id-title huggingface dataset:
Intrinsic universality in automata networks II: Glueing and gadgets
On the open problem of Ginsburg concerning semilinear sets and related problems
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs
The category-theoretic solution of recursive metric-space equations
From object grammars to ECO systems
The chromatic and clique numbers of random scaled sector graphs
Monitoring networks through multiparty session types
Approximation of sets based on partial covering
Secure distributed storage and retrieval
A state-based model of sensor protocols
Soundness and Completeness of the Birkhoff Equational Calculus for Many-Sorted Algebras with Possibly Empty Carrier Sets
Graph traversal and graph transformation
State complexity of operations on two-way finite automata over a unary alphabet
Interplay between (im)perfectness, synchrony and connectivity: The case of reliable message transmission
A simple linear-space data structure for constant-time range minimum query
A discrete linear order with non-dense punctual degrees
Language generating alphabetic flat splicing P systems
Equations in free semigroups with involution and their relation to equations in free groups
An improved lower bound on the sensitivity complexity of graph properties
Error-repair parsing schemata
Algorithms for visualizing phylogenetic networks
Diagonalizations over Polynomial Time Computable Sets
On Finite Automaton Public-Key Cryptosystem
Streams and strings in formal proofs
Nivat's conjecture and pattern complexity in algebraic subshifts
Best-order streaming model
Attribute-based encryption schemes with constant-size ciphertexts
Reconstructing (h, v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections
Spy game: FPT-algorithm, hardness and graph products
More efficient periodic traversal in anonymous undirected graphs
Physical ZKP protocols for Nurimisaki and Kurodoko
Individual codewords
Reducing space for index implementation
Algorithms for subsequence combinatorics
Forbidden directed minors and Kelly-width
Chess is hard even for a single player
EFX allocations for indivisible chores: Matching-based approach
Synchronizing generalized monotonic automata
Global and local sequence alignment with a bounded number of gaps
A Fast Implementation of a Multidimensional Storage Into a Tree Storage
Helios: A Modeling Language for Global Optimization and its Implementation in Newton
The Ehrenfeucht Conjecture: An Algebra-Framework for Its Proof
On the status sequences of trees
Reducing NFAs by invariant equivalences
Online multi-dimensional generalized assignment problem with predictions
Computable Banach Spaces via Domain Theory
Random Generation of Trees and Other Combinatorial Objects
An efficient self-stabilizing distance-2 coloring algorithm
Structural measures for games and process control in the branch learning model
An approximation algorithm for the k -prize-collecting multicut on a tree problem
LCSk: A refined similarity measure
Parameterisation for abstract structured specifications
Counting and sampling minimum (s, t)-cuts in weighted planar graphs in polynomial time
Divergence of F< Type Checking
The agreement power of disagreement
Combinatorics of minimal absent words for a sliding window
Quadratic truncated rotation symmetric Boolean functions
Modelling of oppositional Aquila Optimizer with machine learning enabled secure access control in Internet of drones environment
Randomness in secret sharing and visual cryptography schemes
Adding Global Forbidding Context to Context-Free Grammars
New types of automata to solve fixed point problems
Game tree algorithms and solution trees
On Goles' universal machines: A computational point of view
Efficient SAT-based bounded model checking for software verification
Scale free interval graphs
Emergence of random selections in evolution of biological populations
Non-recursive trade-offs between two-dimensional automata and grammars
Toggling operators in computability logic
New algorithms for approximate Nash equilibria in bimatrix games
On unique graph 3-colorability and parsimonious reductions in the plane
A simple and efficient Union-Find-Delete algorithm
Optimally restricted edge connected elementary Harary graphs
Decomposition and factorisation of transients in functional graphs
On the number of inductively minimal geometries
On the Weisfeiler algorithm of depth-1 stabilization
On an Approximation Measure Founded on the Links Between Optimization and Polynomial Approximation Theory
CPO semantics of timed interactive actor networks
Logical operations and Kolmogorov complexity
An algorithm for a super-stable roommates problem
Cayley continuants
Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
A class of Recursive Permutations which is Primitive Recursive complete
Distributive Semantics for Nondeterministic Typed lambda-Calculi
Reduction rules for the maximum parsimony distance on phylogenetic trees
A semantically secure public key cryptoscheme using bit-pair shadows
Inheritance of workflows: an approach to tackling problems related to change
Infinite Normal Forms for Non-Linear Term Rewritting Systems
Complexity Study for the Robust Stable Marriage Problem
Maximal pattern complexity, dual system and pattern recognition
A subdivision method for computing nearest gcd with certification
Semi-Commutations and Petri Nets
Formal systems for gene assembly in ciliates
Algorithms for the thief orienteering problem on directed acyclic graphs
Beyond pairwise comparisons in social choice: A setwise Kemeny aggregation problem
Observational purity and encapsulation
An Algorithm for Generating Shift-Register Cycles
Internal quasiperiod queries
Transducers for the bidirectional decoding of prefix codes
Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets
Competition-based generalized self-profit maximization in dual-attribute network
Distance restricted manipulation in voting
A note on the circuit complexity of PP
A full continuous model of polymorphism
Efficient algorithms for ridesharing of personal vehicles
The best expert versus the smartest algorithm
Vacillatory and BC learning on noisy data
Bounded Query Machines: On NP( ) and NPQERY( )
A variant of inductive counting
Causality versus true-concurrency
A Linear-Time Recognition Algorithm for P4-Reducible Graphs
On partitioning a graph into two connected subgraphs
Parametric metric interval temporal logic
Watermelon uniform random generation with applications
On the expressivity and complexity of quantitative branching-time temporal logics
On maximum independent set of categorical product and ultimate categorical ratios of graphs
Identifying codes in some subgraphs of the square lattice
A Theory of Sequentiality
CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN
On Independent Random Oracles
Fast two-robot disk evacuation with wireless communication
On simple back-off in unreliable radio networks
Routing schemes for hybrid communication networks
Commutative monoids have complete presentations by free (non-commutative) monoids
Agreement in synchronous networks with ubiquitous faults
Tell me who you are friends with and I will tell you who you are: Unique neighborhoods in random graphs
Some Questions about Expressiveness and Relative Completeness in Hoare's Logic
On the Error Correcting Power of Pluralism in BC-Type Inductive Inference
On the difference set of two transductions
Simulations Among Multidimensional Turing Machines
Extending a partial evaluator which supports separate compilation
Logical optimality of groundness analysis
Analyzing fractional Horn constraint systems
Random Walks, Gaussian Processes and List Structures
Extended dynamic subgraph statistics using h-index parameterized data structures
A Logical Approach of Petri Net Languages
The Power of Synchronizing Operations on Strings
General Information Dispersal Algorithms
A 3/4 differential approximation algorithm for traveling salesman problem
A mathematical model for the TCP Tragedy of the Commons
Weighted forward looking adaptive coding
Time-space trade-offs for Lempel-Ziv compressed indexing
A note on the submodular vertex cover problem with submodular penalties
How to Prove Equivalence of Term Rewriting Systems Without Induction
Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
A characterization of eventual periodicity
On the Existence of Free Models in Abstract Algebraic Institutuons
Scalable wake-up of multi-channel single-hop radio networks
Towards strong regret minimization sets: Balancing freshness and diversity in data selection
Complexity, Convexity and Combinations of Theories
MELL in the calculus of structures
Efficient public-key encryption with equality test from lattices
Caractérisation des N -écritures et application à l'étude des suites de complexité ultimement n + c ste
An algorithm to generate exactly once every tiling with lozenges of a domain
Polynomial-time algorithms for computing distances of fuzzy transition systems
Complexity of barrier coverage with relocatable sensors in the plane
Simple gene assembly as a rewriting of directed overlap-inclusion graphs
Moving a Food Trolley Around a Corner
A language for configuring multi-level specifications
Executability of scenarios in Petri nets
Distributed coloring and the local structure of unit-disk graphs
An improved algorithm for learning sparse parities in the presence of noise
Exact learning of multivalued dependency formulas
Min-energy scheduling for aligned jobs in accelerate model
FM-index of alignment with gaps
An Axiomatization of the Algebra of Petri Net Concatenable Processes
A small final coalgebra theorem
On the Theoretical Efficiency of Various Network Flow Algorithms
Size-constrained tree partitioning: Approximating the multicast k-tree routing problem
Presenting de Groot duality of stably compact spaces
Sparse topologies with small spectrum size
Some Uniformly Erasable Families of Languages
Möbius Functions and Confluent Semi-Commutations
Secret, verifiable auctions from elections
Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs
Closure properties of cellular automata
A cost optimal parallel algorithm for computing force field in N-body simulations on a CREW PRAM
Selected papers from ALT 1997 - Foreword
Two notes on APCol systems
Hybrid fault diagnosis capability analysis of triangle-free graphs
Approximate GCDs of polynomials and sparse SOS relaxations
Surface Tree Languages and Parallel Derivation Trees
The Advantages of a New Approach to Defining the Communication Complexity for VLSI
Degree distribution of the FKP network model
Sequentialization and procedural complexity in automata networks
The automated proof of a trace transformation for a bitonic sort
A linear time algorithm for embedding hypercube into cylinder and torus
Coping with Known Patterns of Lies in a Search Game
Parameterized regular expressions and their languages
One-variable logic meets Presburger arithmetic
From complementation to certification
Srl Yantra Geometry
An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
Generating Hamiltonian Circuits without Backtracking from Errors
A Nearly Optimal Parallel Algorithm for Constructing Maximal Independent Set in Planar Graphs
Inferences of Multivalued Dependencies in Fixed and Undetermined Universes
Improved approximate pattern matching on hypertext
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks
Neural computation, social networks, and topological spectra
Theoretical foundations of dynamic program slicing
A Geometrical Approach to Multiset Orderings
Linear solving for sign determination
On the undecidability of the limit behavior of Cellular Automata
Institutions for navigational logics for graphical structures
Optimal wavelength assignment in the implementation of parallel algorithms with ternary n-cube communication pattern on mesh optical network
Spring algorithms and symmetry
Generating Plans in Linear Logic I. A Geometry of Conjunctive Actions
Extended Regular Expressions of Star Degree at Most Two
Relating continuous and discrete PEPA models of signalling pathways
Martin's game: a lower bound for the number of sets
Efficient reallocation under additive and responsive preferences
Linear connectivity problems in directed hypergraphs
Edge coloring of bipartite graphs with constraints
Drawing slicing graphs with face areas
Theory of Representations
Structural Operational Semantics for Weak Bisimulations
Model checking mobile stochastic logic
On omega context free languages which are Borel sets of infinite rank
Learning Boolean functions in AC 0 on attribute and classification noise - Estimating an upper bound on attribute and classification noise
Planar Graph Coloring is not Self-Reducible, Assuming P != NP
Superlinear Period Lengths in Some Subtraction Games
Flat maximal parallelism in P systems with promoters
Generalized filter models
Farey graphs as models for complex networks
Domain theory, testing and simulation for labelled Markov processes
An identity for kernel ridge regression
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
Efficient stabilization of cooperative matching games
Query minimization under stochastic uncertainty
Approximation algorithms for variable voltage processors: Min energy, max throughput and online heuristics
On block pumpable languages
MAX3SAT is exponentially hard to approximate if NP has positive dimension
NP NP-hardness of pure Nash equilibrium in Scheduling and Network Design Games
Preemptive multiprocessor scheduling with rejection
Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e
An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
Pattern statistics and Vandermonde matrices
Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
Fast edge searching and fast searching on graphs
A Simple Proof of a Theorem of Statman
A game-theoretic perspective of deep neural networks
The complexity of the bootstraping percolation and other problems
Color visual cryptography schemes for black and white secret images
Canonicity and normalization for dependent type theory
Bounded privacy-utility monotonicity indicating bounded tradeoff of differential privacy mechanisms
Finding the largest separating rectangle among two point sets
A structural property of regular frequency computations
The Power of the "Always" Operator in First-Order Temporal Logic
Drawing subcubic planar graphs with four slopes and optimal angular resolution
Average case analysis for tree labelling schemes
Equational and implicational classes of coalgebras
A graph-based framework for the analysis of access control policies
On the Additive Complexity of Polynomials
Towards a practical snapshot algorithm
A Metric for Positional Games
On Functions Preserving Levels of Approximation: A Refined Model Construction for Various lambda Calculi
A Space-Optimal Solution of General Region Location
Canonical finite state machines for distributed systems
On the computational complexity of membrane systems
Synchronizing monotonic automata
The complexity of shortest path and dilation bounded interval routing
More on Advice on Structuring Compilers and Proving them Correct
A logical and graphical framework for reaction systems
On the geodetic hull number of P k -free graphs
A theory of bisimulation for a fragment of concurrent ML with local names
A Simple Sequent Calculus for Partial Functions
A comparison of performance measures via online search
Quantum weakly nondeterministic communication complexity
Occam's Razor applied to the Petri net coverability problem
On the hull number of some graph classes
The expressive power of snap-stabilization
Improved lower bounds for the radio number of trees
Tractability of Cut-free Gentzen-type propositional calculus with permutation inference II
Direct and dual laws for automata with multiplicities
Budget-feasible Sybil-proof mechanisms for crowdsensing
Kolmogorov complexities K max , K min on computable partially ordered sets
Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete
Picture languages: Tiling systems versus tile rewriting grammars
Logarithmic price of buffer downscaling on line metrics
Recurrence and periodicity in infinite words from local periods
The localization capture time of a graph
Reversible computing and cellular automata - A survey
Decidable verification for reducible timed automata specified in a first order logic with time
An assertion-based proof system for multithreaded Java
Arbitrary pattern formation by asynchronous opaque robots with lights
Selfish unsplittable flows
On continuous one-way functions
Succinct indexes for reporting discriminating and generic words
Deeper model endgame analysis
Variétés d'Automates Descendants d'Arbres Infinis
Space-Filling Curves and Their Use in the Design of Geometric Data Structures
From regulated rewriting to computing with membranes: collapsing hierarchies
Context-freeness of the power of context-free languages is undecidable
The Timed Failures-Stability Model for CSP
Periodic graphs and connectivity of the rational digital hyperplanes
A sufficient condition for a planar graph to be class 1
Intensional computation with higher-order functions
The cost of concurrent, low-contention Read&Modify&Write
Proof rules for the correctness of quantum programs
Categorical foundations for randomly timed automata
On a simple hard variant of Not-All-Equal 3-Sat
Evolutionary computation and Wright's equation
On the positional determinacy of edge-labeled games
A 5/4-approximation algorithm for scheduling identical malleable tasks
Computations over Finite Monoids and their Test Complexity
Complexity of distance paired-domination problem in graphs
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs
Bertrand Numeration Systems and Recognizability
Distributed probabilistic input/output automata: Expressiveness, (un)decidability and algorithms
Forbidding-enforcing systems
Proofs of conservation inequalities for Levin's notion of mutual information of 1974
Regular lossy functions and their applications in leakage-resilient cryptography
On learning of functions refutably
Two-machine open shop problem with a single server and set-up time considerations
System design of stochastic models using robustness of temporal properties
Fault tolerability analysis of folded crossed cubes based on g -component and g -good neighbor fault pattern
Parking problem by oblivious mobile robots in infinite grids
The "Magic" Rule Spaces of Neural-Like Elementary Cellular Automata
A universal cellular automaton in the hyperbolic plane
Finding Optimal Subgraphs by Local Search
Linearizable Read/Write Objects
Integer Programs for Logic Constraint Satisfaction
Optimal facility location problem on polyhedral terrains using descending paths
The approximate period problem for DNA alphabet
Breaking DES using P systems
New support 5-designs from lifted linear codes
Periodicity algorithms and a conjecture on overlaps in partial words
Families of locally testable languages
An Introduction to Randomization in Computational Geometry
How the Character Comparison Order Shapes the Shift Function of On-Line Pattern Matching Algorithms
Normal forms for algebras of connection
The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases
Note on the Cyclic Towers of Hanoi
To satisfy impatient Web surfers is hard
A note on symmetries in the Rauzy graph and factor frequencies
Morphismes et Bimorphismes d'Arbres
Alternating states for dual nondeterminism in imperative programming
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Decidability of the theory of the natural integers with the cantor pairing function and the successor
Data center interconnection networks are not hyperbolic
Copower functors
Avoiding large squares in partial words
Quantum circuit oracles for Abstract Machine computations
On graphs that are not PCGs
On the relationship between compact regularity and Gentzen's cut rule
Longest repeats with a block of k don't cares
Combinatory Differential Fields
Completeness, approximability and exponential time results for counting problems with easy decision version
Storage-to-tree transducers with look-ahead
Algorithms for dominating clique problems
On the advice complexity of the online dominating set problem
Computational completeness of spiking neural P systems with inhibitory rules for generating string languages
Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata
Selected Papers from PEPM'97 - Foreword
Game theory-based optimization of distributed idle computing resources in cloud environments
Beating the generator-enumeration bound for p-group isomorphism
RVCCC: A new variational network of cube-connected cycles and its topological properties
Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers
Bases de Lyndon des algèbres de Lie libres partiellement commutatives
Minimum connected transversals in graphs: New hardness results and tractable cases using the price of connectivity
The Variety of Kleene Algebras with Conversion is not Finitely Based
A Polynomial-Time Computable Curve whose Interior has a Nonrecursive Measure
An efficient algorithm to generate binary sequences for cryptographic purposes
Adaptivity in the stochastic blackjack knapsack problem
The Maximum Colorful Arborescence problem: How (computationally) hard can it be?
Monochromatic arithmetic progressions in the Fibonacci, Thue-Morse, and Rudin-Shapiro words
Abelian properties of Parry words
Rough sets and fuzzy sets in natural computing
Presheaf models for CCS-like languages
Editors' preface
Fast inversion of triangular Toeplitz matrices
A Fixpoint Semantics of Horn Sentences Based on Substitution Sets
Revisiting the Prefer-same and Prefer-opposite de Bruijn sequence constructions
On a Conjecture of Bergstra and Tucker
The Congruence of two Programming Language Definitions
The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups
An arithmetic for polynomial-time computation
Typing and Computational Properties of Lambda Expressions
Finding good 2-partitions of digraphs II. Enumerable properties
MARLEDA: Effective distribution estimation through Markov random fields
On prefix palindromic length of automatic words
New results for the k -secretary problem
Graphical condensation of plane graphs: A combinatorial approach
Submodular participatory budgeting
Hamiltonian paths passing through prescribed edges in balanced hypercubes
Geometrical semantics for linear logic (multiplicative fragment)
Refinement of Events in the Development of Real-Time Distributed Systems
Shorter arithmetization of nondeterministic computations
Asymptotic Optimal HEAPSORT Algorithm
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
Block sensitivity of minterm-transitive functions
On computational environments of topological spaces
La Representation Ergodique d'un Automate fini
Quasi-Deterministic 0L Systems and Their Representation
Weighted group search on a line & implications to the priority evacuation problem
1-Fan-bundle-planar drawings of graphs
Average Cost of Duval's Algorithm for Generating Lyndon Words
Language equations with complementation: Decision problems
Verified bytecode verifiers
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
On the semantics of regular expression parsing in the wild
On the complexity of bandwidth allocation in radio networks
Schranken für Balanced Trees bei ausgewogenen Verteilungen
T-structures, T-functions, and texts
Acyclic automata and small expressions using multi-tilde-bar operators
Efficient gossip and robust distributed computation
Recoloring subgraphs of K 2 n for sports scheduling