yusuke1997/dblp-id-title huggingface dataset:
An Upper Bound on the Entropy Series
The price of anarchy on uniformly related machines revisited
The Complexity of Finding Uniform Emulations on Paths and Ring Networks
Multireceiver Authentication Codes: Models, Bounds, Constructions, and Extensions
Expurgated Bounds, Bhattacharyya Distance, and Rate Distortion Functions
Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems
Reachability in recursive Markov decision processes
Sequential Estimation in Linear Systems with Multiple Time Delays
An automata-theoretic approach to constraint LTL
Corrigendum: A Domain Equation for Bisimulation: Volume 92 Number 2 (1991), pages 161-218
Erratum ("Mobile Objects as Mobile Processes" by M. Merro et al, Volume 177, Number 2 [2002], pages 195-241)
An efficient approach to achieve compositionality using optimized multi-version object based transactional systems
(Optimal) duplication is not elementary recursive
The Completeness of the Algebraic Specification Methods for Computable Data Types
Game semantics for dependent types
On the Bayesian Approach to Image Reconstruction
A characterization of flip-accessibility for rhombus tilings of the whole plane
Fast Fourier-Hadamard Decoding of Orthogonal Codes
Hybrid behaviour of Markov population models
An Extension of Fixpoint Logic with a Symmetry-Based Choice Construct
Measure properties of regular sets of trees
Enlarging learnable classes
On Asynchronous Stochastic Automata
Coding for Write-Efficient Memory
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games
Time-Space Efficient Algorithms for Computing Convolutions and Related Problems
New Upper Bounds for Neighbor Searching
Learning Closed Horn Expressions
Limits on the computational power of random strings
Preprocessing of Intractable Problems
Effective martingales with restricted wagers
Special issue on combining logical systems
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Optimal Canonization of All Substrings of a String
Contextual Insertions/Deletions and Computability
An Optimal Algorithm for Selection in a Min-Heap
Compact representation of graphs with bounded bandwidth or treedepth
The isomorphism problem for k-trees is complete for logspace
Synthesis of One-Dimensional Binary Cellular Automata Systems from Composite Local Maps
A Logic for the Description of Non-deterministic Programs and Their Properties
Intersection types for explicit substitutions
Detecting palindromes, patterns and borders in regular languages
The Density and Complexity of Polynomial Cores for Intractable Sets
Bisimulation and cocongruence for probabilistic systems
An Iteration Method for Calculating the Relative Capacity
Comparing Syntactic and Semantic Sction Refinement
Basic observables for a calculus for global computing
On the universal steganography of optimal rate
Incorporating Static Analysis in a Combinator-Based Compiler
The Barendregt Cube with Definitions and Generalised Reduction
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Some Remarks on the Capacity of Compound Channels in the Semicontinuous Case
Définition et Etude des Bilangages Réguliers
Decomposition of threshold functions into bounded fan-in threshold functions
Visibly pushdown modular games,
Lower Bounds and Efficient Algorithms for Multiprocessor Scheduling of Directed Acyclic Graphs with Communication Delays
An Exponential Number of Generalized Kerdock Codes
A Note on a Law of Berry and on Insistence Stress
Computing the vertex separation of unicyclic graphs
CCS Expressions, Finite State Processes, and Three Problems of Equivalence
A Note on Temporal Coding as a Mechanism in Sensory Perception
A Kleene Theorem for a Class of Planar Acyclic Graphs
Sparse reliable graph backbones
Continuous Machines
Generalized t-Designs and Majority Decoding of Linear Codes
On the Structure of Parameterized Problems in NP
Timer formulas and decidable metric temporal logic
Strategy synthesis for zero-sum neuro-symbolic concurrent stochastic games
A Characterization of the Recursiveness off an m-Adic Probabilistic Language
Type-Directed Specialization of Polymorphism
A type assignment for λ-calculus complete both for FPTIME and strong normalization
A Short Note on New Indexing Polynomials of Finite Fields
Proof Systems for Infinite Behaviours
Value iteration for simple stochastic games: Stopping criterion and learning algorithm
The Rabin index of parity games: Its complexity and approximation
Complexity of C k -coloring in hereditary classes of graphs
Slepian-Wolf-Cover Theorem for Networks of Channels
Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series
A higher-order characterization of probabilistic polynomial time
Optimal Asymmetric Error Detecting Codes
Specification in CTL+Past for Verification in CTL
A Method of Synthesis and Decomposition of Autonomous Linear Sequential Circuits
A Note on Interrupted Stochastic Control Processes
A Note on the Impulse-Function Determination of Functional Probability-Density Functions
Fuzzy Sets and Decision Theory
An Upper and Lower Bound for Clock Synchronization
Randomness for free
Reconstruction of Multidimensional Stochastic Fields from Discrete Measurements of Amplitude and Gradient
Source-tracking unification
Variable-Length Source Coding with a Cost Depending Only on the Code Word Length
An Empirical Bayes Approach to Point Estimation in Adaptive Control
Polymorphic Type Inference and Containment
Exponential Size Lower Bounds for Some Depth Three Circuits
On Specifications, Theories, and Models with Higher Types
The Undecidability of Second Order Multiplicative Linear Logic
Predictive Analog-to-Digital Conversion for Resistance to Data Outliers
The computational properties of P systems with mutative membrane structures
STL ⁎ : Extending signal temporal logic with signal-value freezing operator
Mining CSTNUDs significant for a set of traces is polynomial
Parametric Timing Analysis for Real-Time Systems
Finite identification from the viewpoint of epistemic update
Probabilistic input-driven pushdown automata
Embedding a Second Order Type System into an Intersection Type System
A Universal Context-Free Grammar
Hybrid I/O automata
General Logical Databases and Programs: Default Logic Semantics and Stratification
Parallel two dimensional witness computation
Model checking single agent behaviours by fluid approximation
The Discriminating Power of Multiplicities in the Lambda-Calculus
Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution
A new combination procedure for the word problem that generalizes fusion decidability results in modal logics
Parallel Recognitions and Decomposition of Two Terminal Series Parallel Graphs
Refinement modal logic
Constructing self-stabilizing oscillators in population protocols
Ordinal Complexity of Recursive Definitions
Stochastic Sequential Machines with Prescribed Performance Criteria
A New Look at Fault-Tolerant Network Routing
A Short Proof on the Cyclic Behaviour of Multithreshold Symmetric Automata
Telescopic Mappings in Typed Lambda Calculus
Inverse Image Analysis Generalises Strictness Analysis
Attacking (EC)DSA with partially known multiples of nonces
The Acquisition and Utilization of Information in Problem Solving and Thinking
The Automatic Construction of a Glossary
Two-state spin systems with negative interactions
Types for the Ambient Calculus
On Some Decision Problems in Programming
One-shot learning for k-SAT
On Information Rates for Finite-State Channels
The Complexity of Promise Problems with Applications to Public-Key Cryptography
Branching Programs Provide Lower Bounds on the Areas of Multilective Deterministic and Nondeterministic VLSI-Circuits
A coinductive calculus for asynchronous side-effecting processes
Special issue for the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, Budapest, Hungary
Conservation and Uniform Normalization in Lambda Calculi with Erasing Reductions
On the Rate Distortion Functions of Memoryless Sources under a Magnitude-Error Criterion
Combinatorial Properties of Dependence Graphs
Closing complexity gaps for coloring problems on H-free graphs
The ideal membership problem and polynomial identity testing
On Deciding Readiness and Failure Equivalences for Processes
A Collusion Problem and Its Solution
A congruence rule format for name-passing process calculi
Real numbers having ultimately periodic representations in abstract numeration systems
Acceptors for the Derivation Languages of Phrase-Structure Grammars
Two-dimensional hierarchies of proper languages of lexicalized FRR-automata
Ergodic theorem and algorithmic randomness (following V. V'yugin)
Negation as Instantiation
Resolution for Quantified Boolean Formulas
Real-Time Semantics for Shared-Variable Concurrency
DP lower bounds for equivalence-checking and model-checking of one-counter automata
Finding the conditional location of a median path on a tree
Two-Dimensional Alternating Turing Machines with Only Universal States
An extended coding theorem with application to quantum complexities
Type Inference with Recursive Types: Syntax and Semantics
A Trade-off between Page Number and Page Width of Book Embeddings of Graphs
Verification of scope-dependent hierarchical state machines
On Quasi-Perfect Property of Double-Error-Correcting Goppa Codes and Their Complete Decoding
The Generative Capacity of the Compound Grammars
Approximation in the Space of Information Channels
A Note on Fuzzy Sets
Using Vapnik-Chervonenkis Dimension to Analyze the Testing Complexity of Program Segments
Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement
An Elementary Proof of the MacWilliams Theorem on Equivalence of Codes
Regular Dynamic Logic Is Not Interpretable in Deterministic Context-Free Dynamic Logic
A Note on Perfect Double Error-Correcting Codes on q Symbols
Mobile Objects as Mobile Processes
On graph reasoning
Economic Processes Involving Feedback
Fast Parallel Band Matrix Arithmetic
Inheritance as Implicit Coercion
On a Class of Stochastic Integral Equations of Mixed Type
Patterns with bounded treewidth
Kleene and Büchi theorems for weighted forest languages over M-monoids
Inferring Decision Trees Using the Minimum Description Length Principle
Subcube Fault-Tolerance in Hypercubes
Comparative branching-time semantics for Markov chains
On the Progress of Communications between Two Finite State Machines
Complexity Theory of Parallel Time and Hardware
Mappings which Preserve Context Sensitive Languages
A New Measure of Presortedness
Linear-time safe-alternating DFS and SCCs
Controlling information release in the pi-calculus
Hypercodes
Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC 0
Approximation hardness of dominating set problems in bounded degree graphs
Characterization of the Structure-Generating Functions of Regular Sets and the DOL Growth Functions
Thermodynamic aspects of confidentiality
Minimum bisection is NP-hard on unit disk graphs
A Note on the Extremal Properties of the Discrete-Time Lyapunov Matric Equation
Generation of Irreducible Polynomias from Trinomials over GF(2). I
An Optimum Encoding with Minimum Longest Code and Total Number of Digits
Universal Automata with Uniform Bounds on Simulation Time
Things that can be made into themselves
Converting nondeterministic two-way automata into small deterministic linear-time machines
Some Consequences of Cryptographical Conjectures for S 1 2 and EF
Generable Sets
Reactive Turing machines
Restoring Organs in Redundant Automata
Interval-based clock synchronization with optimal precision
Band-Limited Functions and the Sampling Theorem
Model checking interval temporal logics with regular expressions
On cardinalities of Rogers semilattices for families in the Ershov hierarchy
The Seal Calculus
Linear construction of a left Lyndon tree
Competition among parallel contests
Predicting a binary sequence almost as well as the optimal biased coin
Static slicing of explicitly synchronized languages
Set semantics for asynchronous TeamLTL: Expressivity and complexity
A topological method for finding invariant sets of continuous systems
The freeness problem over matrix semigroups and bounded languages
The complexity of degree anonymization by graph contractions
Fault Tolerance and Storage Reduction in Binary Search Trees
A parametric framework for reversible π -calculi
An Optimum Nonlinear Code
Separating the Low and High Hierarchies by Oracles
The Undecidability of the First-Order Theories of One Step Rewriting in Linear Canonical Systems
Infinitary Logics and 0-1 Laws
A Generalization of Woodward's Theorem on FM Spectra
Game-theoretic semantics for ATL + with applications to model checking
On Designing Optimal Parallel Triangular Solvers
A General Class of Noncontext Free Grammars Generating Context Free Languages
A Note on Succinct Representations of Graphs
Optimum Spatial Filter and Uncertainty
Competing provers yield improved Karp-Lipton collapse results
The Characterization by Automata of Certain Classes of Languages in the Context Sensititve Area
The Generative Capacity of Transformational Grammars of Ginsburg and Partee
On Oblivious Branching Programs of Linear Length
On Dynamic Switching in One-Dimensional Iterative Logic Networks
The Logarithmic Alternation Hierarchy Collapses: A∑ 2 L = A∏ 2 L
Combining fault injection and model checking to verify fault tolerance, recoverability, and diagnosability in multi-agent systems
Syntactic Complexity
On temporal logics with data variable quantifications: Decidability and complexity
Nash equilibria in symmetric graph games with partial observation
A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack
Byzantine-Resistant Total Ordering Algorithms
Triangulating Planar Graphs while Minimizing the Maximum Degree
Well-abstracted transition systems: application to FIFO automata
A Definition of a Nonprobabilistic Entropy in the Setting of Fuzzy Sets Theory
Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
Optimal bit complexity randomised distributed MIS and maximal matching algorithms for anonymous rings
Emptiness problems for distributed automata
Non-context-Free Grammars Generating Context-Free Languages
Anharmonic Approximation and Bandlimited Signals
Linear weighted tree automata with storage and inverse linear tree homomorphisms
Semantics for Classical AUTOMATH and Related Systems
On Permuting Letters of Words in Context-Free Languages
Specification and optimal reactive synthesis of run-time enforcement shields
Cut-free Gentzen calculus for multimodal CK
Building small equality graphs for deciding equality logic with uninterpreted functions
An auxiliary logic on trees: On the tower-hardness of logics featuring reachability and submodel reasoning
Further Discussion of a Time-Continuous Gaussian Channel
On Finite Automata with a Time-Variant Structure
Rigid E-Unification: NP-Completeness and Applications to Equational Matings
Reachability problems in low-dimensional nondeterministic polynomial maps over integers
Some Characterizations of Lindenmayer Systems in Terms of Chomsky-type Grammars and Stack Machines
Regular Languages Defined with Generalized Quanifiers
Further Results on Polynomial Codes
An Algebraic Study of Group and Nongroup Error-Correcting Codes
Criteria for Optimum Effectiveness of Information Retrieval Systems
The Kolmogorov Expression Complexity of Logics
Grammars with Partial Ordering of the Rules
Optimum Control of Certain Linear Systems with Quadratic Loss. I
Rate Distortion Theory for Sources with Abstract Alphabets and Memory
Regular languages as images of local functions over small alphabets
Formal Translations and Szilard Languages
On the p-Rank of the Design Matrix of a Difference Set
Principal Types and Unification for a Simple Intersection Type System
Uniform van Lambalgen's theorem fails for computable randomness
The complexity of the asynchronous prediction of the majority automata
Sequential State Estimation with Interrupted Observation
Real-Time Least-Squares Estimation Using Successive Integrations
Mathematical Representations of Sociolinguistic Restraints on Three-Person Conversations
Phrase Structure Grammars Generating Context-Free Languages
Penny Matching Machines
Preservation of Expressive Completeness in Temporal Models
On the compressibility of finite languages and formal proofs
Rounds Versus Time for the Two Person Pebble Game
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
Context-Free Fuzzy Languages
A periodicity lemma for partial words
The Expressive Power of Stratified Logic Programs with Value Invention
2-vertex connectivity in directed graphs
Locally stratified Boolean grammars
The Caucal hierarchy: Interpretations in the (W)MSO+U logic
Unfolding semantics of graph transformation
A Note on Mutual Information in a White Gaussian Channel with Linear Feedback
Characterizing PAC-Learnability of Semilinear Sets
Relating state-based and process-based concurrency through linear logic (full-version)
On finding the Adams consensus tree
Channel Capacity of Moore Automata
The Rate Distortion Function for a Class of Sources
Finite-word hyperlanguages
On Monadic NP vs. Monadic co-NP
Modular proof systems for partial functions with Evans equality
Learning from rounded-off data
Nets of Threshold Elements
A Semantics for Static Type Inference
Multi random projection inner product encryption, applications to proximity searchable encryption for the iris biometric
The mutual exclusion scheduling problem for permutation and comparability graphs
Statistical probabilistic model checking with a focus on time-bounded properties
Fast scalable construction of ([compressed] static | minimal perfect hash) functions
Bounded game-theoretic semantics for modal mu-calculus
Language theoretic properties of regular DAG languages
On the Capacity of Channels with Gaussian and Non-Gaussian Noise
Linear Convolutional Codes for Compound Channels
Consistent and coherent learning with delta-delay
Testing the expansion of a graph
Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
A Note On a Class of Skew Distribution Functions: Analysis and Critique of a Paper by H. A. Simon
The ideal view on Rackoff's coverability technique
On the complexity of asynchronous freezing cellular automata
Some Examples of Bayesian Adaptive Programming
Distributional formal semantics
Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality
Arithmetic Meyer sets and finite automata
Counting branches in trees using games
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices
Regular languages and partial commutations
Some Restrictive Devices for Context-Free Grammars
Enumeration of Strongly Connected Sequential Machines
A logic of behaviour in context
Proving Properties of Dynamic Process Networks
Compositionality in Dataflow Synchronous Languages: Specification and Distributed Code Generation
A Note on the Succinctness of Descriptions of Deterministic Languages
On Ladner's result for a class of real machines with restricted use of constants
Synchronization of Bernoulli sequences on shared letters
Decidability of operation problems for T0L languages and subclasses
Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths
Preface to special issue MFCS 2023
Stable String Languages of Lindenmayer Systems
Compound Hypothesis Testing with Finite Memory
The role of evolutionary operations in accepting hybrid networks of evolutionary processors
Handling infinitely branching well-structured transition systems
A Fully Abstract Semantics for Concurrent Constraint Programming
Modification problems toward proper (Helly) circular-arc graphs
Length-Frequency Statistics for Written English
Sur les Codes D'Inclusion
Parametrized Data Types Do Not Need Highly Constrained Parameters
Optimal Boundary Control for a Linear Stochastic Distributed Parameter System Using Functional Analysis
Iterated Boolean games
Extracting models from clause sets saturated under semantic refinements of the resolution rule
Quantitative temporal logics over the reals: PSpace and below
Operations in a Fuzzy-Valued Logic
Optimal Control of Stochastic Dynamical Systems
Fast computation of a longest increasing subsequence and application
On Measure Theoretical Structure of Multivariate Information Among Random Variables
No double discount: Condition-based simultaneity yields limited gain
Correlation Properties of Sets of Sequences Derived from Irreducible Cyclic Codes
Erratum: "Cascade Synthesis of Finite-State Machines"
Bounded Nesting in Macro Grammars
On the complexity of sequential rectangle placement in IEEE 802.16/WiMAX systems
One-Sided Error Probabilistic Inductive Inference and Reliable Frequency Identification
The world's shortest correct exact real arithmetic program?
A Mathematical Model of Transformational Grammars
Four Fundamental Parameters of a Code and Their Combinatorial Significance
On Complements of Some Bounded Context-Sensitive Languages
Categorical Combinators
On the Interconnection Structure of Cellular Networks
On an Optimality Property of Ternary Trees
A Theory of Cascade Decomposition of Group Functions
On an Alternative Representation for a Wide Class of Binary Relations
Reasoning about Procedures as Parameters in the Language L4
Double Horn Functions
Context-free timed formalisms: Robust automata and linear temporal logics
Identification of Pattern Languages from Examples and Queries
Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions
Channels Which Transmit Letters of Unequal Duration
Homomorphisms That Preserve Star Height
A generalization of Spira's theorem and circuits with small segregators or separators
On the expressiveness and decidability of higher-order process calculi
A New Fault-Tolerance Algorithm for Clock Synchronization
Programs for Machine Learning. Part I
The role of polymorphism in the characterisation of complexity by soft types
Efficient Checkers for Number-Theoretic Computations
Timed hyperproperties
Alternation Bounded Auxiliary Pushdown Automata
The Calculus of Constructions
State complexity of basic language operations combined with reversal
Some Remarks on Derivations in General Rewriting Systems
Comparison of the Power between Reversal-Bounded ATMs and Reversal-Bounded NTMs
Tight Complexity Bounds for Term Matching Problems
Modeling and verifying ad hoc routing protocols
An Approach for Generating Different Types of Gray Codes
Rule synchronization for tissue P systems
Some Results in Decoding of Certain Maximal-distance and BCH Codes
On Embeddings in Cycles
Dynamic input/output automata: A formal and compositional model for dynamic systems
State complexity of transforming graph-walking automata to halting, returning and reversible
Classes of Languages and Linear-Bounded Automata
A Theory of Communicating Processes with Value Passing
A Theory of Modal Control
Extensions of MSO and the monadic counting hierarchy
On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation
Sequential Coding for Channels with Feedback
Creating Order in Sequence Spaces with Simple Machines
On labeled birooted tree languages: Algebras, automata and logic
Quantitative and Qualitative Information in Computations
A Calculus of Mobile Processes, I
Encoding inductive invariants as barrier certificates: Synthesis via difference-of-convex programming
On the functions generated by the general purpose analog computer
Comparison of algorithms for simple stochastic games
Inverting onto functions
Integral Sequential Word Functions and Growth Equivalence of Lindenmayer Systems
The language intersection problem for non-recursive context-free grammars
Sequential, Continuous and Parallel Grammars
A Computer Processing Queueing System with Feedback
Error Codes Constructed in Residue Number Systems with Non-Pairwise-Prime Moduli
Proper Learning Algorithm for Functions of k Terms under Smooth Distributions