yusuke1997/dblp-id-title huggingface dataset:
Dual lower bounds for approximate degree and Markov-Bernstein inequalities
Two-way unary automata versus logarithmic space
An improved approximation algorithm for the minimum common integer partition problem
Random Sampling of Random Processes: Impulse Processes
Bounded-Crossing Transducers
Derivation Structures for Strictly Context-Sensitive Grammars
The Position of Index Sets of Identifiable Sets in the Arithmetical Hierarchy
Parallel Processing Can Be Harmful: The Unusual Behavior of Interpolation Search
On the spread of influence in graphs
An Analysis of the Effect of Integral and Sigma Pulse Frequency Modulation on White Noise
A language hierarchy of binary relations
On-line Updating of Solutions to a Class of Matroid Intersection Problems
Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015)
Petri Nets Are Monoids
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
Programs for Machine Learning. Part II
A Complete Axiomatization of Finite-State ACSR Processes
Erratum: The Satisfiability Problem for a Class Consisting of Horn Sentences and Non-Horn Sentences in Proportional Logic
Cyclic Product Codes and Their Implementation
Formal Methodology of Translation. I. Semantic Preserving Translations
On Relativized Exponential and Probabilistic Complexity Classes
Strong Fairness and Full Abstraction for Communicating Processes
Learning from examples with unspecified attribute values
Two Complete Axiom Systems for a Theory of Communicating Sequential Processes
On the Computation of Capacity of Discrete Memoryless Channel
The Hierarchical Structure of Graph Searches
The Iterated Mod Problem
A Complete Rewriting System for a Monoid of Tree Transformation Classes
A Note on "Axioms" for Computational Complexity and Computation of Finite Functions
A Characterization of Parallel Thinning Algorithms
Usefulness of information and decomposability of unary regular languages
On quantifier-rank equivalence between linear orders
New Balanced-File Organization Schemes
Compact and succinct data structures for multidimensional orthogonal range searching
Early detection of temporal constraint violations
Specification patterns for reasoning about recursion through the store
The Simply-Typed Theory of Beta-Conversion has no Maximum Extension
The Kleene-Schützenberger Theorem for Formal Power Series in Partially Commuting Variables
Recent developments in theory and tool support for hybrid systems verification with HyPro
Strong normalization of the second-order symmetric lambda mu -calculus
The Constantin-Rao Construction for Binary Assymmetric Error-Correcting Codes
On the data persistency of replicated erasure codes in distributed storage systems
Logic for ω -pushdown automata
Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate
A new foundation for finitary corecursion and iterative algebras
Compact binary relation representations with rich functionality
A Note on the Entropy of Partially-Known Languages
The Capacity of the General Time-Discrete Channel with Finite Alphabet
Information Compression and Varshamov-Gilbert Bound
A Note on Error Detection in Noisy Logical Computers
Removing redundant refusals: Minimal complete test suites for failure trace semantics
Erratum: "Decoupling in a Class of Nonlinear Systems by Output Feedback"
On Parallel Integer Merging
On Encoding and Decoding with Two-Way Head Machines
NC Algorithms for Computing the Number of Perfect Matchings in K_3,3-Free Graphs and Related Problems
Entropies of Degree \beta and Lower Bounds for the Average Error Rate
Recurrence Domains: Their Unification and Application to Logic Programming
Existential second-order logic and modal logic with quantified accessibility relations
A Coordinate-Free Theory of Eingenvalue Analysis Related to the Method fo Principal Components and the Karhunen-Loève Expansion
Verifying the consistency of remote untrusted services with conflict-free operations
Stochastic Quantization for Performance Stability
Performing work with asynchronous processors: Message-delay-sensitive bounds
Three Theorems on Phrase Structure Grammars of Type 1
A Proof of Strong Normalization of F_2, F_omega and Beyond
A Symbolic Semantics for the pi-Calculus
Separable Graphs, Planar Graphs and Web Grammars
Tree exploration with advice
On Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless Channels
Cycle detection in computation tree logic
Generic Oracles, Uniform Machines, and Codes
Towards a dichotomy theorem for the counting constraint satisfaction problem
Ntyft/Ntyxt Rules Reduce to Ntree Rules
Applicability of fair simulation
Monotone Congruence Algorithms
Joint workshop on foundations of computer security and automated reasoning for security protocol analysis (FCS-ARSPA '06)
Nondeterminism and the clique problem
Simple Sentences That Are Hard to Decide
Analysis of a randomized rendezvous algorithm
Functions computable in polynomial space
On multi-partition communication complexity
A Logic Hazard Detection and Elimination Method
Faster query algorithms for the text fingerprinting problem
A characterization of free pairs of upper triangular free monoid morphisms
Attributed Tree Transducers Cannot Induce all Deterministic Bottom-Up Tree Transformations
Syntactic stochastic processes: Definitions, models, and related inference problems
Cell-like P systems with evolutional symport/antiport rules and membrane creation
Session typing and asynchronous subtyping for the higher-order π-calculus
The Synthesis of Language Learners
A Rice-style theorem for parallel automata
Topological Characterization of Families of Graphs Generated by Certain Types of Graph Grammars
On the Convergence of Error Probabilities for Signal Detection
Topological dynamics of Nondeterministic Cellular Automata
Weights of Irreducible Cyclic Codes
Reachability games with relaxed energy constraints
LTLf synthesis under environment specifications for reachability and safety properties
Design patterns in beeping algorithms: Examples, emulation, and analysis
Proofs of Partial Correctness for Attribute Grammars with Applications to Recursive Procedures and Logic Programming
A Note on Definite Stochastic Sequential Machines
Nearest neighbor representations of Boolean functions
Detecting arrays for effects of multiple interacting factors
A Type Inference Algorithm for a Stratified Polymorphic Type Discipline
Dynamic branching in qualitative constraint-based reasoning via counting local models
Objects and Classes in Algol-Like Languages
Efficient Threshold Circuits for Power Series
Unit interval editing is fixed-parameter tractable
Reasoning in a Restricted Temporal Logic
An Algorithm for Covering Polygons with Rectangles
Economy of Description for Single-Valued Transducers
Design of Generalized Double Rank and Multiple Rank Sequential Circuits
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
On the Complexity of Regulated Context-Free Rewriting
Ehrenfeucht-Fraïssé goes automatic for real addition
Inheritance-Based Subtyping
Circuit and Decision Tree Complexity of Some Number Theoretic Problems
Three-Dimensional Crossword Puzzles in Hebrew
Deciding the Word Problem in the Union of Equational Theories
A Hierarchy of Language Families Learnable by Regular Language Learning
Easy Multiplications II. Extensions of Rational Semigroups
Discrete Random Process Stabilization
Minimizing the maximum starting time on-line
Derivatives and Quotients of Prefix-Free Context-Free Languages
Quantum temporal logic and reachability problems of matrix semigroups
Amount of Deciding and Decisionary Effort
PPLite: Zero-overhead encoding of NNC polyhedra
Ordered SOS Process Languages for Branching and Eager Bisimulations
Cluster computing and the power of edge recognition
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis
Character Recognition in Context
The g-good-neighbor diagnosability of product networks under the PMC model
Preservation of probabilistic information flow under refinement
Epsilon-reducible context-free languages and characterizations of indexed languages
Context Sensitive Table Lindenmayer Languages and a Relation to the LBA Problem
A Note on the Characterization of Weak Bisimulation Congruence in CCS
Codes Over Certain Rings
The Dyck Language D'_1^* Is Not Generated by Any Matric Grammar of Finite Index
Coercive subtyping: Theory and implementation
Succinct Representations of Graphs
Synchronization Languages and Rewriting Systems
Promise Problems Complete for Complexity Classes
Skolem functions of arithmetical sentences
An Implicit Sampling Theorem for Bounded Bandlimited Functions
Corrigendum: Sequential, Continuous and Parallel Grammars
The Box Algebra = Petri Nets + Process Expressions
Muller message-passing automata and logics
Notions of bisimulation and congruence formats for SOS with data
3-Valued abstraction: More precision at less cost
On k -abelian palindromes
On Infinite Decodable Codes
An Essay in Combinatory Dynamic Logic
The Dynamics of Time-Varying Threshold Learning
A Lower Bound for the Emulation of PRAM Memories on Processor Networks
On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages
Automating the dependency pair method
Locally guided randomized elections in trees: The totally fair case
Mismatch sampling
Necessary and Sufficient Conditions on Conditional Probabilities to Maximize Entropy
On the Capacity of a Discrete, Constant Channel
Digital Simulation of A White Noise Model Formed of Uniformly Almost Periodic Functions
Complexity of Nilpotent Unification and Matching Problems
A Solution to an Open Problem by Knuth
Some Results on the Decomposition of Finite Automata
The Identification of a Set by Successive Intersections
Cellular Automata Complexity Trade-Offs
Elections in Anonymous Networks
The Efficiency of Certain Methods of Information Retrieval
Sequence Generators, Graphs, and Formal Languages
On a Method of Calculating the Capacity of a Discrete Memoryless Channel
A Trace Semantics for Petri Nets
Formal Expresions of Infinite Graphs and Their Families
Follow automata
Intensional Kleene and Rice theorems for abstract program semantics
Erasing in Context-Free AFLs
On the Complete Simulation of DOL Schemes and Locally Catenative Schemes
A Formulation of Fuzzy Decision Problems with Fuzzy Information using Probability Measures of Fuzzy Events
Busy Beaver Sets: Characterizations and Applications
On Sequential Machine Decompositions for Reducing the Number of Delay Elements
Interaction between Two Independent Recurrent Time Series
On equations and first-order theory of one-relator monoids
Introduction to clarithmetic I
Further Results on Error Correcting Binary Group Codes
Functions that preserve p-randomness
Cell Lineage System for Describing Growths of Filamentous Organisms
Satisfiability checking for Mission-time LTL (MLTL)
Fast offline partial evaluation of logic programs
Answering regular path queries in expressive Description Logics via alternating tree-automata
A study of decimal left shifters for binary numbers
Static analysis of XML security views and query rewriting
Comparing reductions to NP-complete sets
Character-Correcting Convolutional Self-Orthogonal Codes
Orienting rewrite rules with the Knuth-Bendix order
Concept analysis approach for graphs
Fast Recognition of Pushdown Automaton and Context-free Languages
Optimal Waveform Design via Control Theoretic Concepts
Characterize branching distance in terms of (eta, alpha)-bisimilarity
Special Issue of PLACES 2022
The Decidability of the Equivalence Problem for DOL-Systems
Zero-Knowledge Arguments and Public-Key Cryptography
A Direct Proof of the Equality between the Block Definition and the Process Definition of Distortion-Rate Functions for Stationary Ergodic Sources
Criteria of Language Learning
Approximate all-pairs suffix/prefix overlaps
Learning expressions and programs over monoids
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
Rational weighted tree languages with storage
The Complexity of the K n, n -Problem for Node Replacement Graph Languages
Minimal Representations of Some Classes of Dynamic Programming
On the Syntactic Structures of Unrestricted Grammars II. Automata
On the Solution of Algebraic Equations over Finite Fields
Simulating Synchronous Processors
Verification of programs with half-duplex communication
A multivariate convertible undeniable signature scheme
Analyzing anonymity attacks through noisy channels
A Lower Bound on Stability in Phase-Locked Loops
On the Unique Satisfiability Problem
A robust algorithm for geometric predicate by error-free determinant transformation
A general lock-free algorithm using compare-and-swap
Average-case intractability vs. worst-case intractability
A Property of Partially Specified Automata
A well-structured framework for analysing petri net extensions
On a Family of Linear Grammars
A Zero-One Law for Logic with a Fixed-Point Operator
Fairness and communication-based semantics for session-typed languages
Regular transducer expressions for regular transformations
A Note on the Entropy of Words in Printed English
A derivational model of discontinuous parsing
Bounding Filter: A Simple Solution to Lack of Exact a Priori Statistics
Composing bridges
Structural Similarity in Context-Free Languages
Corrigendum to "On Some Decision Problems in Programming"
Reachable Sets for Linear Dynamical Systems
Asymptotically optimal synthesis of reversible circuits
A Compositional Protocol Verification Using Relativized Bisimulation
Turing Machines with Restricted Memory Access
Optimal Error Detection Codes for Completely Asymmetric Binary Channels
Context-sensitive dependency pairs
On computing ord N (2) and its application
Popular matchings in the stable marriage problem
Compositional strategy synthesis for stochastic games with multiple objectives
On the Index of a Context-Free Grammar and Language
On Permutation-Reset Automata
Prudence and Other Conditions on Formal Language Learning
A Decomposition Theorem for Domains
Refereed delegation of computation
Effective Sampling Rates for Signal Detection; or Can the Gaussian Model be Salvaged?
A pumping lemma for regular closure of prefix-free languages
Probabilistic bisimulations for quantum processes
Undecidable equivalences for basic parallel processes
A Class of High-Rate Double-Error-Correcting Convolutional Codes
Clustering with local restrictions
The monotone theory for the PAC-model
Visual Cryptography for General Access Structures
Splitting information securely with entanglement
A Real-Time Strictness Test for Deterministic Pushdown Automata
Roadmap of post-quantum cryptography standardization: Side-channel attacks and countermeasures
G-Machines and Generable Sets
Characterization of exact two-query quantum algorithms
Unambiguous Equal Matrix Languages
Improved Fast Integer Sorting in Linear Space
The dynamic descriptive complexity of k-clique
On Fairness Notions in Distributed Systems: I. A Characterization of Implementability
Derivation Trees of Ground Term Rewriting Systems
The Satisfiability Problem for a Class Consisting of Horn Sentences and Some Non-Horn Sentences in Proportional Logic
The Non-sequential Behavior of Petri Nets
Inherent Ambiguity of Minimal Linear Grammars
On Some Operators Reducing Generalized Grammars
The Decentralized Wald Problem
Practically Useful Variants of Definitional Translations to Normal Form
Coalgebraic semantics for timed processes
A Direct Branching Algorithm for Checking Equivalence of Some Classes of Deterministic Pushdown Automata
On the Strength of "Sometimes" and "Always" in Program Verification
Mathematics, Physics, and Information (An Editorial)
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Codes With Bounded Synchronization Delay
On the Expressiveness of Temporal Logic Programming
Measure on P: Strength of the Notion
Monotonicity characterizations of regular languages
Transfinite Reductions in Orthogonal Term Rewriting Systems
Direction Independent Context-Sensitive Grammars
Model checking hyperproperties for Markov decision processes
Decomposition Phenomenon in One-Dimensional Scope-Three Tessellation Automata with Arbitrary Number of States
Graph access structures with optimal pixel expansion three
Information and Computation special issue from TACS 2001
Some Easily Decoded, Efficient, Burst Error Correcting Block Codes
One-pass and tree-shaped tableau systems for TPTL and TPTL b +Past
An information-theoretic model for steganography
Perpetual Reductions in Lambda-Calculus
Hypernormalisation in an abstract setting
A Note on Synchronization Recovery with Extended Cyclic Codes
Some Additional Quasi-Perfect Codes
On the Structure of Realizations Using Flip-Flop Memory Elements
Structural and Behavioral Equivalences of Tessellation Automata
The dual equivalence of equations and coequations for automata
Periodic generalized automata over the reals
Divide and congruence: From decomposition of modal formulas to preservation of branching and η-bisimilarity
Some Computational Problems of Cryptographic Significance Concerning Elliptic Curves over Rings
How does adiabatic quantum computation fit into quantum automata theory?
Solving games via three-valued abstraction refinement
A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions
The Definition of Random Sequences
Permutation rewriting and algorithmic verification
Two Notes on Machine "Learning"
Vertical Implementation
Pushdown and Lempel-Ziv depth
Comments on "Detection of a Coherent Signal of Known Phase" by R. A. Klemm
On the cost of unsuccessful searches in search trees with two-way comparisons
The Parallel Complexity of Propagation in Boolean Circuits
Proving Total Correctness of Recursive Procedures
Error-Correcting Codes: An Axiomatic Approach
An Optimum Solution to the Firing Squad Synchronization Problem
Two-way automata making choices only at the endmarkers
Further improvements for SAT in terms of formula length
More on Nonregular PDL: Finite Models and Fibonacci-Like Programs
Generalized BCH Codes
Some Inherently Ambiguous Context-Free Languages
Detectable Properties of Planar Figures
Spiking neural P systems with non-gated channels
Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking
A discrete and continuous study of the Max-Chain-Formation problem
Bisimulation on speed: worst-case efficiency
Algorithms for learning regular expressions from positive data
SGML and XML Document Grammars and Exceptions
Soliton automata with constant external edges
Compositional probabilistic verification through multi-objective model checking
On input-revolving deterministic and nondeterministic finite automata
Recent algorithmic advances in simple temporal networks with uncertainty: From faster controllability checking to faster execution
An Efficient Algorithm for Multiprocessor Fault Diagnosis Using the Comparison Approach
Quantum game players can have advantage without discord
Computing a Context-Free Grammar-Generating Series
Numeration Systems, Linear Recurrences, and Regular Sets
On the Existence of Minimum Asynchronous Automata and on the Equivalence Problem for Unambiguous Regular Trace Languages
Models for name-passing processes: interleaving and causal
Automatic learning from positive data and negative counterexamples
Approximate minimization of weighted tree automata
Approximate Language Identification
Symmetry breaking in distributed networks
Decision procedures for term algebras with integer constraints
Characteristic Formulae for Processes with Divergence
Causal graph dynamics
A linear time algorithm for monadic querying of indefinite data over linearly ordered domains
Algorithmic coincidence classification of mesh patterns
Oracle branching programs and Logspace versus P
A parallel algorithm for counting parse trees
Eilenberg's variety theorem without Boolean operations
Counting on CTL * : on the expressive power of monadic path logic
Complexity of round-robin allocation with potentially noisy queries
Separation in Nonlinear Time Models
Information Pattern, Learning Structure, and Optimal Decision Rule
Deciding Branching Bimiliarity of Normed Context-Free Processes Is in \Sigma^ p_2
Counting extensional differences in BC-learning
Long BCH Codes Are Bad
String Adjunct Grammars: II. Equational Representation, Null Symbols, and Linguistic Relevance
Some Optimization Problems for Convolution Systems over Finite Groups
A Search Technique for Quasi-Perfect Codes
A Kleene theorem for weighted tree automata over tree valuation monoids
Types and full abstraction for polyadic pi -calculus
Some Results on Cascade Decomposition of Automata
On a Question of Eggan
Decision Theoretic Generalizations of the PAC Model for Neural Net and Other Learning Applications
State space reduction in the Maude-NRL Protocol Analyzer
Existence of Optimal Bandlimited Controls without Convexity Condition
A Homomorphic Representation of Simple Matrix Languages
A Stochastic Treatment of a Control System with Breakdown and Repair
Axiomatizing rational power series over natural numbers
Minimal-change integrity maintenance using tuple deletions
On the Error Correcting Capacity of Finite Automata
Generating priority rewrite systems for OSOS process languages
On the Sequentiality of the Successor Function
Special issue on SR 2013
On the equivalence of Occam algorithms
Shift Register Realizations of Asynchronous Sequential Machines
Introduction to clarithmetic II
Equational Languages
On Efficient Simulations of Multicounter Machines
Invertibility of Finite Group Homomorphic Sequential Systems
Reduction of Context-Free Grammars
The Asymptotic Distributions of Estimators of the Amount of Transmitted Information
Systems of fixpoint equations: Abstraction, games, up-to techniques and local algorithms
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
Top-Down Design in the Context of Parallel Programs
Simultaneity Is Harder than Agreement
Linear forwarders
Improving the round complexity of VSS in point-to-point networks
Coequational logic for accessible functors
On the Computational Complexity of Ordinary Differential Equations
Parametric Linear Dynamic Logic
Stability Concepts of Dynamical Systems
On the isomorphism problem for Helly circular-arc graphs
Secure mechanical verification of mutually recursive procedures
Unique solutions of contractions, CCS, and their HOL formalisation
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
Monotony properties of connected visible graph searching
The Mutual Information Principle and Applications
Structural Induction and Coinduction in a Fibrational Setting
Symmetric submodular system: Contractions and Gomory-Hu tree
Algorithms for Detecting Morphic Images of a Word
Communication and mobility control in boxed ambients
A finite axiomatization of conditional independence and inclusion dependencies
A Lower Bounding Method for Channel and Source Coding Probabilities
On the height of towers of subsequences and prefixes
Computing absolutely normal numbers in nearly linear time
An iterative scheme of hybrid controller synthesis for nonlinear systems subject to safety constraints
Optimization of Information Storage Systems
Extending finite-memory determinacy to multi-player games
A Refinement of Strong Sequentiality for Term Rewriting with Constructors
The [exist]*[forall]* Part of the Theory of Ground Term Algebra Modulo an AC Symbol is Undecidable
Lower Bounds for Merging Networks
Languages, D0L-systems, sets of curves, and surface automorphisms
On Relational Homomorphisms of Automata
Functions Associated to a Partition on State Set of a Probabilistic Automaton
On Choosing between Experimenting and Thinking when Learning
Asymptotic Properties of Systems Synthesized for Maximum Reliability
Corrigendum to "The Complement of a Finite Index Matrix Language Is Context Sensitive"
Semiclassical analysis and sensitivity to initial conditions
A delayed promotion policy for parity games
Scooby: Improved multi-party homomorphic secret sharing based on FHE