yusuke1997/dblp-id-title huggingface dataset:
The perfectly synchronized round-based model of distributed computing
Allocating contiguous blocks of indivisible chores fairly
A Note on Computing Time for Recognition of Languages Generated by Linear Grammars
On Non-Preemptive Scheduling of Recurring Tasks Using Inserted Idle Times
Theories with self-application and computational complexity
The efficiency of identifying timed automata and the power of clocks
Tile Formats for Located and Mobile Systems
A Stochastic Model of Bin-Packing
On Using Deterministic Functions to Reduce Randomness in Probabilistic Algorithms
Approximating the directed path partition problem
Homomorphism Preserving Algebraic Specifications Require Hidden Sorts
Minimal session types for the π-calculus
A Note on Least-Squares Estimates from Likelihood Ratios
Variable-length codes independent or closed with respect to edit relations
Continuous-Time Probabilistic Automata
Some remarks on the orbit of closure-involution operations on languages
Communication Complexity of Sum-Type Functions Invariant under Translation
Decompositions of Group Functions with Applications to Two-Rail Cascades
Nonlinear Codes Defined by Quadratic Forms over GF(2)
On the complexity of the two-variable guarded fragment with transitive guards
Finite-state strategies in delay games
Toward a Mathematical Theory of Inductive Inference
The Upper Bound of K in K-Lossless Sequential Machines
Optimal Linear Fixed-Interval Smoothing for Colored Noise
A maximal entropy stochastic process for a timed automaton
A Construction for Convolutional Codes Using Block Codes
A Causal Operational Semantics of Action Refinement
Lower Bounds on Learning Decision Lists and Trees
Stochastic Hybrid Automata with delayed transitions to model biochemical systems with delays
Modules and PQ-trees in Robinson spaces
Extending CL-reducibility on array noncomputable degrees
Quantum and classical complexity classes: Separations, collapses, and closure properties
Scheduling Chain-Structured Tasks to Minimize Makespan and Mean Flow Time
On the quantifier-free dynamic complexity of Reachability
Games, automata, logics and formal verification (GandALF 2016)
Exponential Observers for Nonlinear Dynamic Systems
Rigid tree automata and applications
Limitations of lower bound methods for deterministic nested word automata
Communication and location discovery in geometric ring networks
Synthesis of One-Dimensional Binary Scope-2 Flexible Cellular Systems from Initial Final Configuration Pairs
Characterization of Bandlimited Functions and Processes
Transducer-based analysis of cryptographic protocols
Context-sensitive fusion grammars and fusion grammars with forbidden context are universal
Bideterministic weighted automata
Recursive Domain Equations for Concrete Data Structures
A Note on "Very Noisy" Channels
A compressed dynamic self-index for highly repetitive text collections
Isomorphism of regular trees and words
The complexity of higher-order queries
Process Expressions and Hoare's Logic: Showing an Irreconcilability of Context-Free Recursion with Scott's Induction Rule
Quantitative reductions and vertex-ranked infinite games
Can Message Buffers Be Axiomatized in Linear Temporal Logic?
A logic with revocable and refinable strategies
Proving pointer programs in higher-order logic
Incomplete operational transition complexity of regular languages
Graph Theoretic Prefix Codes and Their Synchronizing Properties
Delayed Information and Action in On-Line Algorithms
On linear languages recognized by deterministic biautomata
On Extensions of ALGOL-Like Languages
Faster FPTASes for counting and random generation of Knapsack solutions
Power Domains and Iterated Function Systems
Probabilistic Grammars and Automata
Preface to special issue: EXPRESS/SOS 2019 and EXPRESS/SOS 2020
A simpler and faster 1.5-approximation algorithm for sorting by transpositions
A Posteriori Distributions and Detection Theory
Succinctness issues for LTL and safety and cosafety fragments of LTL
Trace and Testing Equivalence on Asynchronous Processes
Topological properties of concept spaces (full version)
A Boolean Proof of Richardson's Theorem on Graph Theory
Realizing Complex Boolean Functions with Simple Groups
Equational properties of iterative monads
Think globally, act locally: On the optimal seeding for nonsubmodular influence maximization
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Special issue of SSS 2020
On a Question of McNaughton and Papert
Resolution Approximation of First-Order Logics
A Machine Realization of the Linear Context-Free Languages
Immunity of Complete Problems
On the transformation of two-way finite automata to unambiguous finite automata
General Formulation of Sequential Machines
Extended Controlled Table L-Arrays
The fault tolerance of NP-hard problems
All Pairs Shortest Distances for Graphs with Small Integer Length Edges
Relational Queries Computable in Polynomial Time
Temporal Proof Methodologies for Timed Transition Systems
On the Relation between Ambiguity and Nondeterminism in Finite Automata
Approximation algorithms for the maximum path cover problem using long paths
The Infinite 2-Star Height Hierarchy of Extended Regular Languages of Star Degree at Most Two
An Improved Bound for Weight-Balanced Tree
Finding all solutions of equations in free groups and monoids with involution
On tree automata that certify termination of left-linear term rewriting systems
Using Tableaux to Automate the Lambek and Other Categorial Calculi
Basic Concepts of Multiple-Discrete Valued Logic and Decision Theory
Properties of Deterministic Top-Down Grammars
On the Least Redundancy Problem of the Queries of Order Two in Combinatorial Filing Scheme
Nonlinear Lower Bounds on the Number of Processors of Circuits with Sublinear Separators
Applications of Reproducing Kernel Hilbert Spaces-Bandlimited Signal Models
Sentences over Integral Domains and Their Computational Complexities
Milking the Aanderaa Argument
On Homomorphic Images of Rational Stochastic Languages
Alternating space is closed under complement and other simulations for sublogarithmic space
A new pumping lemma for indexed languages, with an application to infinite words
Sampling Series Approximation of Continuous Weak Sense Stationary Processes
A new class of string transformations for compressed text indexing
On Shortened Finite Geometry Codes
Computational completeness of sequential spiking neural P systems with inhibitory rules
A Simplified Proof of DDL < DL
Combinatory categorial grammars as generators of weighted forests
Representability of Nonregular Languages in Finite Probabilistic Automata
The complexity of approximating bounded-degree Boolean #CSP
Functionality of compositions of top-down tree transducers is decidable
Minimal Machines with Several Initial States are Not Unique
Derivation Languages and Syntactical Categories
The 18th International Symposium on Fundamentals of Computation Theory
Algorithmically independent sequences
Parameterized algorithms for the Module Motif problem
Some Algebraic Properties of Sets of Stochastic Matrices
Second Order Isomorphic Types: A Proof Theoretic Study on Second Order lambda-Calculus with Surjective Paring and Terminal Object
Polynomial threshold functions and Boolean threshold circuits
A Note on Mutual Information in White Gaussian Channels with Nonlinear Feedback
On a Generalization of the Pless Symmetry Codes
Real-Time Properties of Indirect Recursive Procedures
On the relative expressiveness of higher-order session processes
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
A Note on a New Class of Codes
Simple strategies for Banach-Mazur games and sets of probability 1
Quantum Markov chains: Description of hybrid systems, decidability of equivalence, and model checking linear-time properties
Symbolic protocol analysis for monoidal equational theories
A 1.488 approximation algorithm for the uncapacitated facility location problem
The Extended Calculus of Constructions (ECC) with Inductive Types
Exponentiated Gradient Versus Gradient Descent for Linear Predictors
A framework for compositional verification of multi-valued systems via abstraction-refinement
A Large Class of Cyclic and Shortened Cyclic Binary Codes for Multiple Error Correction
Brudno's theorem for Z d (or ) subshifts
A topological approach to non-uniform complexity
Vertex cover in graphs with locally few colors
The number of runs in a string
Computable one-way functions on the reals
A strengthened eCK secure identity based authenticated key agreement protocol based on the standard CDH assumption
Abstract interpretation based verification of temporal properties for BioAmbients
Universal Homogeneous Event Structures and Domains
Termination of System F-bounded: A Complete Proof
Intersection and Union Types: Syntax and Semantics
Constant-time sorting
Ogden's lemma, multiple context-free grammars, and the control language hierarchy
Semantics and expressiveness of ordered SOS
Cancer hybrid automata: Model, beliefs and therapy
A theory of Stochastic systems. Part II: Process algebra
Enumerative Counting Is Hard
On the Power of Higher-Order Algebraic Specification Methods
Finding the Minimum Bandwidth of an Interval Graphs
Bus Automata and Immediate Languages
Predictive mining of multi-temporal relations
On Certain Formal Properties of Grammars
Hybrid semantics for Bio-PEPA
Reductions among Number Theoretic Problems
A Note on the Summability of the Entropy Series
Sate-Identification Experiments in Finite Automata
An Analysis Technique for Biological Shape. I
A Markovian Extension of Valiant's Learning Model
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Lower Bounds on the Complexity of 0-1-Valued Recursive Functions
Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic)
A Metric Space of Discrete Probability Distributions
Pure Grammars
Automaton Automorphisms
The Maximum Invariant Set of an Automaton System
Upwards closed dependencies in team semantics
Analysing the implicit complexity of programs
Toward a Theory of Dense Orbital Behavior in a Class of Autonomous One-Dimensional Nonlinear Discrete-Time Systems
Pebble, a Kernel Language for Modules and Abstract Data Types
Degrees of Finite-State Transformability
The Capacity Region of the Two-Way Channel Can Exceed the Inner Bound
Larger lower bounds on the OBDD complexity of integer multiplication
Tight upper and lower bounds for leakage-resilient, locally decodable and updatable non-malleable codes
On Simple Programs with Primitive Conditional Statements
Monotonous betting strategies in warped casinos
An approach to innocent strategies as graphs
Unambiguous finite automata over a unary alphabet
Deterministic Context-Sensitive Languages: Part II
Compositional Semantics for Real-Time Distributed Computing
Monoidal computer I: Basic computability by string diagrams
CNF and DNF succinct graph encodings
The Utility of Independent Subgoals in Theorem Proving
Approximate periodicity
Probabilistic and Weighted Grammars
Probabilistic bisimilarity as testing equivalence
How to Reuse a "Write-Once" Memory
Mismatch Robustness of Linear Prediction and Its Relationship to Coding
Simple and fast approximate counting and leader election in populations
Computing with infinitely many processes
Codes over Z_m, Revisited
The Power of Multiobjects
Strong normalisation in the pi -calculus
Commutative Grammars: The Complexity of Uniform Word Problems
Functional encryption for cascade automata
Semantics of Inhibitor Nets
On abstract interpretation of Mobile Ambients
Maximal Derivations for Probabilistic Strings in Stochastic Languages
Simple Matrix Languages
Weighted parsing for grammar-based language models over multioperator monoids
Optimal Axiomatizations of Finitely Valued Logics
One-Unambiguous Regular Languages
Formal Methodology of Translation. II. Capabilities and Limitations
8th Conference on Real Numbers and Computers
Memory Increases Capacity
Correctness and Efficiency of the Pattern Matching Algorithms
Complexity Theory and Genetics: The Computational Power of Crossing Over
A Class of Convolution Codes
Grammar Enumeration and Inference
On m-Adic Stochastic Languages
Constructing differential categories and deconstructing categories of games
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
Modular Construction of a Byzantine Agreement Protocol with Optimal Message Bit Complexity
Search by a metamorphic robotic system in a finite 2D square Grid
Learning families of algebraic structures from informant
Rich Classes Inferable from Positive Data: Length-Bounded Elementary Formal Systems
A Guide for New Referees in Theoretical Computer Science
Some Closure Properties of the Family of Stochastic Languages
A Loss Bound Model for On-Line Stochastic Prediction Algorithms
Optimal Parallel Two Dimensional Text Searching on a CREW PRAM
Function Field Sieve Method for Discrete Logarithms over Finite Fields
A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs
Generalized OM-Bisimulation
Typing access control and secure information flow in sessions
Are bundles good deals for first-order modal logic?
Note on the Boolean Properties of Context Free Languages
A Theory of Relevance for Automatic Document Classification
Determinization and Memoryless Winning Strategies
Reachability analysis of quantum Markov decision processes
mrNISC from LWE with polynomial modulus
On the Measure of Fuzziness and Negation. II. Lattices
Tasks in modular proofs of concurrent algorithms
Automata in General Algebras
Probabilistic coherence spaces as a model of higher-order probabilistic computation
Sample Sizes for Threshold Networks with Equivalences
On Terminating Lemma Speculations
Robustness of Probabilistic Computational Complexity Classes under Definitional Perturbations
Classes with easily learnable subclasses
A Note on Rank and Nullity in Coding Theory
A Characterization of Divergence with Applications to Questionnaire Information
Type Inference for Pure Type Systems
Retraction Map Categories and Their Applications to the Construction of Lambda Calculus Models
Trigonometric Interpolation of Function and Derivative Data
Standard ML-NJ Weak Polymorphism and Imperative Constructs
Continuous-time stochastic games with time-bounded reachability
An Equational Axiomatization for Multi-Exit Iteration
On the Undecidability of Second-Order Unification
Checking determinism of regular expressions with counting
Maintaining Multiple Representations of Dynamic Data Structures
Modified Concepts of Logic, Probability, and Information Based on Generalized Continuous Characteristic Function
Universal extensions to simulate specifications
Comment on a Comment on an Algorithm that Generates Fuzzy Prime Implicants by Lee and Chang
The Bounded Arithmetic Hierarchy
A Decoding Algorithm for Some Convolutional Codes Constructed from Block Codes
Inductive Counting for Width-Restricted Branching Programs
Ho's Algorithm, Commutative Diagrams, and the Uniqueness of Minimal Linear Systems
A Family of Languages Having Only Finite-Index Grammars
The Matrix Minimum Principle
On-line weighted pattern matching
A Characterization of Parenthesis Languages
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
Complexity Characterizations of Attribute Grammar Languages
Waiting Time Distribution in a Computer Processing Queuing System
Symmetric graph properties have independent edges
Bases for parametrized iterativity
Time and space optimal implementations of atomic multi-writer register
Infinite-Alphabet Channels and the Method of Codes of a Fixed Composition
Weighted automata on infinite words in the context of Attacker-Defender games
Some Inequalities Satisfied by the Quantities of Information of Fisher and Shannon
On Two-State Isolated Probabilistic Automata
Pushdown and one-counter automata: Constant and non-constant memory usage
Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable
On parallelisms of PG(3,4) with automorphisms of order 2
The treewidth of proofs
Compound and Serial Grammars
Weighted automata and logics for infinite nested words
Every Sequence Is Reducible to a Random One
Basic Theory of F-Bounded Quantification
Computations on Nondeterministic Cellular Automata
Minimal Polynomials for the Conjunction of Functions on Disjoint Variables Can Be Very Simple
Parameterized problems complete for nondeterministic FPT time and logarithmic space
Simplicity, Immunity, Relativizations and Nondeterminism
Periodic Representation of Equal Matrix Grammars
Closure Properties of Deterministic Indexed Languages
Efficient inclusion checking for deterministic tree automata and XML Schemas
Equational Formulae with Membership Constraints
Deciding Emptiness for Stack Automata on Infinite Trees
Turn-Bounded Grammars and Their Relation to Ultralinear Languages
Extracting Kolmogorov complexity with applications to dimension zero-one laws
Model-checking games for fixpoint logics with partial order models
Quantificational logic
On the Uniqueness Resp. Nonexistence of Certain codes Meeting the Griesmer Bound
Reasoning about group responsibility for exceeding risk threshold in one-shot games
Modules over monads and initial semantics
A Note on Burst Detecting Sum Codes
Unambiguous Auxiliary Pushdown Automata and Semi-unbounded Fan-in Circuits
Aperiodic propagation criteria for Boolean functions
A generic type system for higher-order Ψ-calculi
Functional interpretations of linear and intuitionistic logic
Comments on Universal and Left Universal Grammars, Context-Sensitive Languages, and Context-Free Grammar Forms
A Generalized Firing Squad Problem
f-Entropies, probability of Error, and Feature Selection
Fuzzy Algorithms
Remark on the Paper by Bellman and Kalaba
The Hypersphere in Pattern Recognition
Kolmogorov Complexity and Degrees of Tally Sets
File Organization Schemes Based on Finite Geometries
Expressiveness and complexity of graph logic
Axiomatic System for Phrase Structure Grammars. I
A Construction of Nonlinear Codes Which Betters or Equals Known Results for Certain Parameters
One-Sided and Two-Sided Context in Formal Grammars
A Term Model for Synchronous Processes
A Syntactic Approach to Type Soundness
Identifiability of Slowly Varying Systems
Uniform Interpretations of L Forms
Closure and Completeness of Wiener's Orthogonal Set \G_n\ in the Class L^2(Omega, B, \mu) and Its Application to Stochastic Heriditary Differential Systems
Lower Bounds for Depth-Restricted Branching Programs
Some Further Notes on a Class of Skew Distribution Functions
Two-Criteria LQG Decision Problems with One-Step Delay Observation Sharing Pattern
Classifying recognizable infinitary trace languages using word automata
Set Constraints and Automata
Fast LLL-type lattice reduction
An Axiomatic Theory for Partial Functions
Domain Theoretic Models of Polymorphism
Dynamical Systems, Measures and Fractals via Domain Theory
On XOR lemmas for the weight of polynomial threshold functions
A universal algorithm for Krull's theorem
Some Decidability Results on Grammatical Inference and Complexity
The Online Graph Bandwidth Problem
Perspective on complexity measures targeting read-once branching programs
Syntacticness, Cycle-Syntacticness, and Shallow Theories
Rate Distortion Functions of Countably Infinite Alphabet Memoryless Sources
The Automatic Design of Fractional Factorial Experiments for Adaptive Process Optimization
Bounds on Algebraic Code Capacities for Noisy Channels. I
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems
Static Analysis for the pi-Calculus with Applications to Security
An Algorithm for thek-Error Linear Complexity of Sequences over GF(p m ) with Period p n , pa Prime
Proof of A Conjecture by A. W. Burks and H. Want: Some Relations between Net Cycles and States Cycles
Symbolic Model Checking for Real-Time Systems
A structured view on weighted counting with relations to counting, quantum computation and applications
Consistent query answering in multi-relation databases
Fundamentals of session types
Computing ML Equality Kinds Using Abstract Interpretation
On a Reducing Operator for Combinatorial Systems
On Characterizing the Shannon Entropy without Assuming Symmetry
Semantics of Communicating Processes
Exponential time improvement for min-wise based algorithms
Where join preservation fails in the bounded Turing degrees of c.e. sets
Lambda-Calculi for (Strict) Parallel Functions
Adaptive Computers
Boolean Expression Diagrams
On the Nonexistence of Perfect 2- and 3-Hamming-Error-Correcting Codes of GF(q)
Finite-state relative dimension, dimensions of A. P. subsequences and a finite-state van Lambalgen's theorem
Finite-State Probabilistic Languages
Automatic Pattern Recognition by a Gestalt Method
Exponential Distributions in Markov Chain Models for Communication Channels
Notes on a General Strong Converse
Advances on the Extended Stochastic Rayleigh Quotient Estimation Theory
Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
The Decomposition of Stochastic Automata
On the Essential Quadratic Nature of LQC Control-Performance Measure Cumulants
21st Workshop on Logic, Language, Information and Computation - WoLLIC 2014
Preface to the Special Issue on SR 2014
Deterministic size discovery and topology recognition in radio networks with short labels
Dyadic Calculus and Sampling Theorems for Functions with Multidimensional Domain. I: General Theory
On Certainty Equivalence in Linear-Quadratic Control Problems with Nonlinear Measurements
Randomness below complete theories of arithmetic
Special Issue - Selected Papers from the 26th International Symposium on Temporal Representation and Reasoning
Synthesis of positive logic programs for checking a class of definitions with infinite quantification
Lost in abstraction: Monotonicity in multi-threaded programs
Featherweight Jigsaw - Replacing inheritance by composition in Java-like languages
Decidability of the Finiteness of Ranges of Tree Transductions
One-variable fragments of intermediate logics over linear frames
The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs
On the Structure of Anagrammatic Encodings
Gathering of oblivious robots on infinite grids with minimum traveled distance
Sequential Machines Realized by Group Representations
Clustering categorical data: Soft rounding k -modes
Decision problems for convex languages
Non-closure under complementation for unambiguous linear grammars
Optimum Block Codes for Noiseless Input Restricted Channels
Lattice Matrices
Some Results in the Theory of Arithmetic Codes
The Optimal Burst-Error Correction Capability of the Codes Generated by f(X) = (X^p+1)(X^q+1)/(X+1)
Detecting causality in the presence of Byzantine processes: The case of synchronous systems
Limited automata and unary languages
Nondeterministic right one-way jumping finite automata
Online algorithms with advice: The tape model
The synthesis of Petri nets from path-automatic specifications
Random Sampling of Random Processes: Stationary Point Processes
On Complexity of Easy Predictable Sequences
Improved Parallel Integer Sorting without Concurrent Writing
The Nonapproximability of OBDD Minimization
A Model of Concurrency with Fair Merge and Full Recursion
Pebble Games and Subroutines in Least Fixed Point Logic
Minimality in template-guided recombination
Improved Deterministic Parallel Integer Sorting
A Note on Alphabet Codes and Fields of Computation
The bang calculus revisited
On Weak Regular Probabilistic Languages
Tape Bounds for Some Subclasses of Deterministic Context-Free Languages
Reasoning about Termination of Pure Prolog Programs
Canonization for disjoint unions of theories
Efficiency of the symmetry bias in grammar acquisition
Threshold Nets and Cell-Assemblies
Exploring inconsistency measurement in Disjunctive Temporal Problems
Optimal prefix codes with fewer distinct codeword lengths are faster to construct
On regular trees defined from unfoldings and coverings
Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source
Capacity for a Class of Unknown Channels
Abstract deduction and inferential models for type theory
Edge minimization in de Bruijn graphs