yusuke1997/dblp-id-title huggingface dataset:
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes
On a Multiplexing Scheme for Threshold Logical Elements
Hitting forbidden induced subgraphs on bounded treewidth graphs
Improved bounds for reduction to depth 4 and depth 3
Connectivity vs. Reachability
Contextual Petri Nets, Asymmetric Event Structures, and Processes
Complexity of Identification and Dualization of Positive Boolean Functions
A combination framework for complexity
A new look at the automatic synthesis of linear ranking functions
Intersection and Singleton Type Assignment Characterizing Finite Böhm-Trees
9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
A Parametrization Scheme for Classifying Models of PAC Learnability
Non-Well-Founded Sets Modeled as Ideal Fixed Points
On the Relations Between the Value of a Game and Its Information Structure
Finding connected k-subgraphs with high density
The IO and OI hierarchies revisited
Regular languages with variables on graphs
Decomposition of a Synchronous Machine into an Asynchronous Submachine driving a Synchronous One
The upsilon-Calculus as an Assertion-Language for Fairness Arguments
Stability Criteria for a Class of Nonlinear Systems
On the list update problem with advice
Reflective Relational Machines
A Fresh Look at Free Choice Nets
Slicing techniques for temporal aggregation in spanning event streams
Self-stabilizing leader election in polynomial steps
Some aspects of Probabilistic Automata
Isomorphism testing of Boolean functions computable by constant-depth circuits
Fast approximate probabilistically checkable proofs
An Infinite Hierarchy of Linear Local Adjunct Languages
An ID-based multi-signer universal designated multi-verifier signature scheme
On Generalized Reed-Muller Codes and Their Relatives
On the Minimal Redundancy of Binary Error-Correcting Codes
All Nearly Perfect Codes are Known
Undecidable Equivalences for Basic Process Algebra
On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata
Unprovability of the logical characterization of bisimulation
Rauzy complexity and block entropy
The Subtyping Problem for Second-Order Types Is Undecidable
On Storage Meda with Aftereffects
A practical succinct dynamic graph representation
Cyclic operator precedence grammars for parallel parsing
Characteristic and Ultrarealtime Languages
The dimensions of individual strings and sequences
Fast Triangulation of the Plane with Respect to Simple Polygons
Primitive Trinomials Whose Degree is a Mersenne Exponent
Fully Abstract Denotational Models for Nonuniform Concurrent Languages
Fault-induced dynamics of oblivious robots on a line
Probabilistic Automata
A Combinatorial Approach to the Theory of omega-Automata
Reply to Dr. Mandelbrot's Post Scriptum
On the Speed of Addition and Multiplication on One-Tape, Off-Line Turing Machines
Very Special Languages and Representations of Recursively Enumerable Languages via Computation Histories
Optimal Control System Synthesis for Cost Functionals Involving Convex Single Valued Functions of the State and Control Variables
Axiomatizing Prefix Iteration with Silent Steps
A Note on Sequential Decision Approach to Pattern Recognition and Machine Learning
A nice labelling for tree-like event structures of degree 3
An Algebra of Discrete Channels That Involve Combinations of Three Basic Error Types
Decidability of bounded second order unification
Efficient Perfectly Secure Message Transmission in Synchronous Networks
Asymptotics of the number of 2-threshold functions
A sketch of a dynamic epistemic semiring
The Spectral Analysis of Impulse Processes
Decidability for Left-Linear Growing Term Rewriting Systems
Array Grammar Normal Forms
Categorical Models of Polymorphism
Faster asynchronous systems
On Equal Matrix Languages
Optimal vertex ranking of block graphs
On computational complexity of set automata
On Optimal Linear Smoothing Theory
Consistency checking of STNs with decisions: Managing temporal and access-control constraints in a seamless way
LTL falsification in infinite-state systems
Polynomial kernels for Proper Interval Completion and related problems
The emptiness problem for valence automata over graph monoids
The Source as a Tool in Automata
On bounded languages and reversal-bounded automata
Complexity of DNF minimization and isomorphism testing for monotone formulas
Maximal diameter of integral circulant graphs
Transformers of Markov Chains
Fast collaborative graph exploration
Hardest languages for conjunctive and Boolean grammars
A Symmetric Lambda Calculus for Classical Program Extraction
Automatic Proofs by Induction in Theories without Constructors
Coding Strategies in Language
On the mortality problem: From multiplicative matrix equations to linear recurrence sequences and beyond
Incremental and Decremental Evaluation of Transitive Closure by First-Order Queries
De Bakker-Zucker processes revisited
Faster exponential-time algorithms in graphs of bounded average degree
Equivalence and Normal Forms for the Restricted and Bounded Fixpoint in the Nested Algebra
Practical Algorithms for Deciding Path Ordering Constraint Satisfaction
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
Computable Kripke Models and Intermediate Logics
Rank-Non-Increasing Transformations on Transition Graphs
A generic security API for symmetric key management on cryptographic devices
Sharp lower bounds on the extractable randomness from non-uniform sources
Optimal Placement of Identical Resources in a Tree
On the Synthesis of Two-Dimensional Arrays with Desirable Correlation Properties
Automatic learning of subclasses of pattern languages
Iterated Function Systems and Control Languages
Autonomous Sequence Generation
Simulating Fair Dice with Biased Coins
An Information System Interpretation of Martin-Löf's Partial Type Theory with Universes
An Adaptive Optimal Controller for Discrete-Time Markov Environments
Reducibility of Types in Typed Lambda Calculus: Comment on a Paper by Richard Statman
The Decidability of Equivalence for a Family of Linear Grammars
On Group Theoretic Transforms and the Automorphism Groups
Posets with interfaces as a model for concurrency
Cutting plane and Frege proofs
Self-Dual Codes Over GF(q) Satisfy a Modified Varshamov-Gilbert Bound
Default logic and bounded treewidth
Circuit Lower Bounds à la Kolmogorov
Logical characterization of branching metrics for nondeterministic probabilistic transition systems
Self-Monitoring Machines and an omega omega Hierarchy of Loops
Self-Stabilizing Ring-Orientation Using Constant Space
The epsilon-Capacity of Classes of Unknown Channels
Completeness of Kozen's Axiomatisation of the Propositional µ-Calculus
Special issue: CONCUR 2006
On the amount of nonconstructivity in learning formal languages from text
Quasi-Bayes Averaging of Stochastic Approximation Estimators
Greibach Normal Form Transformation Revisited
Curry-Howard for incomplete first-order logic derivations using one-and-a-half level terms
Bisimulation through Probabilistic Testing
On parametric timed automata and one-counter machines
A theory of regular MSC languages
Optimal Orientations of Cells in Slicing Floorplan Designs
Special issue - Developments in implicit computational complexity, 2014 and 2015
Synthesis of Linear Sequential Machines
A Note on Enumerable Grammars
An Optimally Data Efficient Isomorphism Inference Algorithm
On Group-Theoretic Codes for Assymmetric Channels
Finding Minimal Convex Nested Polygons
Structural induction in institutions
Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane
Interactive communication with unknown noise rate
On an algorithm determining direct superclasses in Java and similar languages with inner classes - Its correctness, completeness and uniqueness of solutions
A type-based complexity analysis of Object Oriented programs
Une Propriété de Certaines Parties d'un Monoïde Libre
A Note on a Decomposition Theorem for Simple Deterministic Languages
Bivariate m-Interval Classifiers with Application to Edge Detection
Uniform-distribution attribute noise learnability
Finite-State Unification Automata and Relational Languages
Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
Some Properties of Fuzzy Sets of Type 2
A Modal Logic for Cyclic Repeating
Strategy construction for parity games with imperfect information
Prices matter for the parameterized complexity of shift bribery
Power of counting by nonuniform families of polynomial-size finite automata
Structure of Parallel Multipliers for a Class of Fields GF(2^m)
Necessary and Sufficient Conditions for the Existence of the \epsilon-Property (A.E.P.)
Sequentiality in an Extensional Framework
On Synchronizing Prefix Codes
On Channels and Codes for the Lee Metric
On the completeness of order-theoretic models of the lambda-calculus
Universal Forecasting Algorithms
Linear Probabilistic Sequential Machines
Erratum: "Quasi-Bayes Averaging of Stochastic Approximation Estimators"
Noncommutativity makes determinants hard
Two-Way Sequential Transductions and Stack Automata
Constructing and indexing the bijective and extended Burrows-Wheeler transform
Weakly complete axiomatization of exogenous quantum propositional logic
Boolean Circuits Versus Arithmetic Circuits
Computing the edit distance of a regular language
Formal languages over GF(2)
A general mathematics of names
Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs
Existential and universal width of alternating finite automata
Preface: Selected papers from SSS'2019, the 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems
Topological mixing notions on Turing machine dynamical systems
Functional Behvior of Nondeterministic and Concurrent Programs
A Consistent Extension of the Lambda-Calculus as a Base for Functional Programming Languages
Concatenable Structures for Decomposable Problems
A Note on the Index of a Context-Free Language
Strong Stability Problems for Probabilistic Sequential Machines
Modelling environments in call-by-value programming languages
Efficient recognition of trace languages defined by repeat-until loops
Distributed-Parameter Systems with Time-Delay
User-friendly temporal queries on historical knowledge bases
Partial Algorithm Problems for Context Free Languages
A Note on the Upper Bound for the Difference between Two Entropies
Data-complexity of the two-variable fragment with counting quantifiers
Lower Bounds to Error Probability for Coding on Discrete Memorylless Channels. I
An Informational Measure of Correlation
Saving the Phenomena: Requirements that Inductive Inference Machines Not Contradict Known Data
Situations in LTL as strings
The Girard-Reynolds isomorphism
Complexity thresholds in inclusion logic
SENDAI: A framework for joint reasoning about sensor data acquisition and sensor data analytics
A Note on the Formation of Concept and of Association by Information-Theoretical Correlation Analysis
A Characterization of Weakly Church-Rosser Abstract Reduction Systems That Are Not Church-Rosser
Faster repetition-aware compressed suffix trees based on Block Trees
Mathematical Optimization and the Synchronizing Properties of Encodings
A Geometric Test-Synthesis Procedure for a Threshold Device
Preservation of Languages by Transducers
Approximate Algorithms for the Knapsack Problem on Parallel Computers
A Note on a Result in the Theory of Code Construction
Quantitative analysis of probabilistic lossy channel systems
Block interpolation: A framework for tight exponential-time counting complexity
Developmental Systems with Interaction and Fragmentation
Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic
On LL(k) Parsing
A logical duality for underspecified probabilistic systems
Inapproximability results for constrained approximate Nash equilibria
Communication Protocols for Secure Distributed Computation of Binary Functions
Functorial Models for Petri Nets
Why Gödel Didn't Have Church's Thesis
Resource-bounded martingales and computable Dowd-type generic sets
The Loss of Information due to Clipping a Waveform
Approximating the termination value of one-counter MDPs and stochastic games
On decidability of monadic logic of order over the naturals extended by monadic predicates
The opacity of backbones
On Estimating the Entropy of Random Fields
A Generalization of Kleene's Theorem and Nondeterministic Structured Programming
Simple Matrix Languages with a Leftmost Restriction
The parameterized complexity of k-edge induced subgraphs
The Rate-Distortion Function for Source Coding with Side Information at the Decoder-II. General Sources
Complexity of deciding bisimilarity between normed BPA and normed BPP
Propositional Lax Logic
Large-scale clique cover of real-world networks
Uniform Representations of Structured Patterns and an Algorithm for the Induction of Contingency-Response Rules
Automata on Infinite Objects and Their Applications to Logic and Programming
Turing Machines with a Schedule to Keep
Relations between equation automata and follow automata
Automata and fixed point logic: A coalgebraic perspective
Searching in the Plane
The submatrices character count problem: an efficient solution using separable values
The Worst Case Complexity of McDiarmid and Reed's Variant of BOTTOM-UP HEAPSORT is less than nlog n + 1.1n
More about Maximal (n,r)-Sets
Using Information Systems to Solve Recursive Domain Equations
Computing Circumscriptive Databases: I. Theory and Algorithms
Discontinuity and Asymmetry in Phrase Structure Grammars
Mediating secure information flow policies
Descriptional and computational complexity of finite automata - A survey
Linear Time and the Power of One First-Order Universal Quantifier
A universal pair of 1/2-betting strategies
Finite Memory Algorithms for Testing Bernoulli Random Variables
Total conditional complexity of certain objects
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy
Introducing article numbering to Information and Computation
Efficient Learning of Typical Finite Automata from Random Walks
A Note on Perfect Decimal AN Codes
Constant-time dynamic weight approximation for minimum spanning forest
On the Size of the Set of All Reducible Stochastic Sequential Machines
The Undecidability of the Ambiguity Problem for Minimal Linear Grammars
The State Complexity of Turing Machines
Minimal Linear Realizations of Autonomous Automata
Parallel Approximation Algorithms for Bin Packing
Abstract processes and conflicts in place/transition systems
On Decisions and Information Concerning an Unknown Parameter
Computing Short Generator Sequences
On the equivalence of uniform key agreement and sequential composition insecurity
On the intrinsic complexity of learning recursive functions
Codes for Unsupervised Learning of Source and Binary Channel Probabilities
Optimal Control-Limit Policies for a Zero-Memory Replacement Problem
Coding with Permutations
Unbounded-error quantum computation with small space bounds
Reachability, confluence, and termination analysis with state-compatible automata
Reconfigurable Cellular Computers
Dynamic Rectangular Point Location, with an Application to the Closest Pair Problem
Semantic-Syntax-Directed Translation
A Calculus for Cryptographic Protocols: The spi Calculus
Syntactic complexity of suffix-free languages
Minimal Samples of Positive Examples Identifying k-CNF Boolean Functions
Prime languages
On Schematological Equivalence of Dataflow Networks
Statman's 1-Section Theorem
Fast mixing via polymers for random graphs with unbounded degree
Control on Kolam Arrays
Polynomial interrupt timed automata: Verification and expressiveness
Information theory in property testing and monotonicity testing in higher dimension
Scalable Secure Storage When Half the System Is Faulty
Inductive Synthesis of Recursive Processes from Logical Properties
Programs with Minimal Goto Statements
Content-Related Interval Queries on Object Histories
Mind change optimal learning of Bayes net structure from dependency and independency data
Logics of communication and change
Robust, expressive, and quantitative linear temporal logics: Pick any two for free
Determining temporal agreements in cross-organizational business processes
On a Characterization of Some Class of M-Dependent Channels with Finite Memory and Finite Anticipation
Planar Acyclic Computation
Multi-player games with LDL goals over finite traces
Generalized Transition Matrix of a Sequential Machine and Its Applications
Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
Computable One-to-One Enumerations of Effective Domains
Growth and irreducibility in path-incompressible trees
Skeletal Structural Descriptions
A Note on Universal Grammars
Bin packing with controllable item sizes
A Lattice for Abstract Interpretation of Dynamic (LISP-Like) Structures
Complexity classification of the six-vertex model
Finite State Languages
Pattern matching with variables: A multivariate complexity analysis
Group Functions and Multi-Valued Cellular Cascades
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Automatic presentations for semigroups
Algebraic Properties of Operator Precedence Languages
An Analysis of Errors in Finite Automata
Pattern Synchronization in Two-Dimensional Cellular Spaces
Erratum: "Periodic Representation of Equal Matrix Grammars"
Machine Recognition of Hand Printing
Optimal Computation of Finitely Oriented Convex Hulls
Reasoning about common knowledge with infinitely many agents
Bounded memory Dolev-Yao adversaries in collaborative systems
The Parallelism Principle: Speeding Up the Cellular Automata Synchronization
Bounds on Shared Memory for Mutual Exclusion
The Structure Generating Function and Entropy of Tuple Languages
An efficient time-free solution to QSAT problem using P systems with proteins on membranes
A rewriting approach to satisfiability procedures
Regular Languages Accepted by Quantum Automata
Corrigendum: The Complexity of Cubical Graphs
Complexity of exclusive nondeterministic finite automata
Forward-Error Correction with Decision Feedback
On Probabilistic Context-Free Grammars that Achieve Capacity
Bisimulation congruence of chi calculus
On the Problem of Finding Minimal Programs for Tables
Recursive Data Types in Algebraically omega-Complete Categories
Randomness and uniform distribution modulo one
Representation for Measures of Information with the Branching Property
Automata for unordered trees
Chained time lock puzzle with small puzzle size
A decomposition theorem and two algorithms for reticulation-visible networks
The expressive power of CHR with priorities
A Short Note on Bandyopadhyay's Proof of the Decipherability Criterion of Sardinas and Patterson
Note on "A Spectrum Factorization Method for the Calculation of Nonlinear Filters of the Volterra Type" of Katzenelson and Gould
A Theory of Observables for Logic Programs
An Isomorphism of Complete Degrees of Finite-State Transformability
An Intermediate Value Theorem for Sequential Analog to Digital Converters without Sample-Hold
Deciding game invariance
Identifying an Unknown Process by Utilizing Randomly Chosen Inputs
Extension of the Berlekamp-Massey Algorithm to N Dimensions
Efficient approximation of optimal control for continuous-time Markov games
Games, Automata, Logics and Formal Verification (GandALF 2014) - Preface
Design of a New Balanced File Organization Scheme With the Least Redundancy
The three-color and two-color Tantrix TM rotation puzzle problems are NP-complete via parsimonious reductions
A Calculus of Mobile Processes, II
Costs and rewards in priced timed automata
Some Filtering Results in Riemann Manifolds
McCarthy-Kleene fuzzy automata and MSO logics
On Relations Between Detection and Estimation of Discrete Time Processes
Multiple Matching of Rectangular Patterns
Some natural conditions on incremental learning
Further results on the Hunters and Rabbit game through monotonicity
Szilard Languages of IO-Grammars
On Harmonizable Stochastic Processes
A spatial logic for concurrency (part I)
Neural-symbolic temporal decision trees for multivariate time series classification
The Role of Boundedness in Characterizing Shannon Entropy
Trade-Off among Parameters Effecting Inductive Inference
Sequential operators in computability logic
Formal security proofs with minimal fuss: Implicit computational complexity at work
Network-formation games with regular objectives
Lower Bounds for the Addition-Subtraction Operations in Orthogonal Range Queries and Related Problems
New Results in Graph Routing
Uniform Characterizations of Non-Uniform Complexity Measures
The query complexity of order-finding
Treewidth computations I. Upper bounds
Symbol-Relation Grammars: A Formalism for Graphical Languages
Picture Languages with Array Rewriting Rules
Model checking Markov population models by stochastic approximations
Macro Tree Transducers, Attribute Grammars, and MSO Definable Tree Translations
A Note on Assymmetry in Phrase Structure Grammars
Discrete Sequential Search
On the External Probability Structure of Finite-State Channels
On the Termination of Program Schemas
Applications of infinitary lambda calculus
A Characterization Theorem for Certain Bounded Deterministic Context-Free Languages
A New Approach to Clustering
Magic numbers in the state hierarchy of finite automata
A Short Note on Some Tractable Cases of the Satisfiability Problem
On the impact of link faults on Byzantine agreement
Regular ω -languages with an informative right congruence
On Number Systems with Finite Degree of Ambiguity
On the Weisfeiler-Leman dimension of fractional packing
Fixed-Point Smoothing in Hilbert Spaces
A Note on a General Expansion of Functions of Binary Variables
Mobility control via passports
Space-efficient construction of Lempel-Ziv compressed text indexes
Addendum to 'Exponential time improvement for min-wise based algorithms' [Information and Computation 209 (2011) 737-747]
A Temporal Logic for Proving Properties of Topologically General Executions
Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
A Semantic Approach to Program Modularity
Automata, Boolean Matrices, and Ultimate Periodicity
On Performance Congruences for Process Algebras
A theory of monitors
What's decidable about weighted automata?
Abstract model repair for probabilistic systems
Normality and two-way automata
Estimation of Feature-Dependent Markov Process Transition Probability Matrices
Approximate Matching for Two Families of Trees
Approximate Parallel Scheduling. II. Applications to Logarithmic-Time Optimal Parallel Graph Algorithms
Improved State Estimation for Systems with Interrupted Observations
A tale of two diagnoses in probabilistic systems
On Stochastic Languages
A computable and compositional semantics for hybrid systems
An improved combinatorial algorithm for Boolean matrix multiplication
Parametric parameter passing Lambda-calculus
Linear-time list recovery of high-rate expander codes
The reactive simulatability (RSIM) framework for asynchronous systems
On Some Stationary Transmissionary Invariant Properties and Information Stability
A Characterisation of Lambda Definable Tree Operations
The number of spanning trees for Sierpiński graphs and data center networks
Bisimulation of Automata
Non Deterministic Extensions of Untyped Lambda-Calculus
Proving Algorithms by Tail Functions
A Note on Syntactic Symmetry and the Manipulation of Formal Systems by Machine
Primal-dual approximation algorithms for Node-Weighted Steiner Forest on planar graphs
Symbolic model checking for probabilistic timed automata
Observable Behaviors and Equivalences of Logic Programs
The Star Problem and the Finite Power Property in Trace Monoids: Reductions beyond C4
Local matching dynamics in social networks
Qualitative reachability in stochastic BPA games
Diagonalization, Uniformity, and Fixed-Point Theorems
Computer Recognition of Figures through Decomposition
Unique Normal Forms for Lambda Calculus with Surjective Pairing
Searching and on-line recognition of star-shaped polygons
An Upper Bound on Minimum Distance for a k-ary Code
Special Issue: Seventh Workshop on Coalgebraic Methods in Computer Science 2004