yusuke1997/dblp-id-title huggingface dataset:
Randomised distributed MIS and colouring algorithms for rings with oriented edges in O(√(log n)) bit rounds
Execution monitoring enforcement under memory-limitation constraints
Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity
Recasting MLF
Learning Mealy machines with one timer
Evaluation of Likelihood Functions
Finite Automata Having Cost Functions: Nondeterministic Models
Derivation of a Class of Entropies Including Those of Degree β
The Basic Algebraic Structures in Categories of Derivations
True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures
Singular Control of Bilinear Discrete Systems
Aliasing Models for Mobile Objects
Schützenberger automata for HNN-extensions of inverse monoids and their use in algorithmic questions
Erratum: On Storage Media with Aftereffects
Approximate strip packing: Revisited
On identification secret sharing schemes
Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability
Connections Between Two Theories of Concurrency: Metric Spaces and Synchronization Trees
Decidability of Finite Probablistic Propositional Dynamic Logics
Teaching randomized learners with feedback
On Parallel Computations with Banded Matrices
Floating-point arithmetic in the Coq system
Generic density and small span theorem
Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
Passes and Paths of Attributive Grammars
A Representation of SFP
Detection Theory and Quantum Mechanics (II)
A Model for Interaction of Two Renewal Processes with Threshold Level
On the complexity of the stability problem of binary freezing totalistic cellular automata
On the completeness of bounded model checking for threshold-based distributed algorithms: Reachability
Nondeterminism is essential in small two-way finite automata with few reversals
Towards Optimal Parallel Bucket Sorting
Succinct description of regular languages by weak restarting automata
A synchronous pi-calculus
Distinguishing pattern languages with membership examples
Reasoning About Infinite Computations
A modular order-sorted equational generalization algorithm
Parikh one-counter automata
Optimal Mistake Bound Learning is Hard
Bad news on decision problems for patterns
A Class of Optimum Nonlinear Double-Error-Correcting Codes
Infinitary Logic and Inductive Definability over Finite Structures
Algebraic Theory of Flip-Flop Sequence Generators
Weights of Cyclic Codes
Partial Feedback for Two-Way and Broadcast Channels
Preemptive scheduling on a small number of hierarchical machines
Numerical constraints on XML data
Preface to Special Issue for DCC 2020
Convolutional Codes III. Sequential Decoding
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic
On the Role of Procrastination in Machine Learning
Connected graph searching
Sensitivity of string compressors and repetitiveness measures
The rewriting logic semantics project: A progress report
Task automata: Schedulability, decidability and undecidability
The Noncomputability of the Channel Capacity of Context-Senstitive Languages
Enumeration of Finite Automata
A Game Theoretic Approach to Robust Filtering
On a Characterization of Directed Divergence
On the Decidability of the OL-DOL Equivalence Problem
A Note on Error Detection Codes for Asymmetric Channels
The Uniform Conjugacy Problem for Finite Church-Rosser Thue Systems is NP-Complete
Succinct data structure for path graphs
Time-abstracted Bisimulation: Implicit Specifications and Decidability
Learning with the Knowledge of an Upper Bound on Program Size
Optimal language learning from positive data
When not losing is better than winning: Abstraction and refinement for the full mu-calculus
Truthful and privacy-preserving generalized linear models
22nd International Symposium on Temporal Representation and Reasoning (TIME 2015)
Nth-Order Autocorrelations in Pattern Recognition
A Coding Theorem and Rényi's Entropy
Weighted two-way transducers
Effective Entropies and Data Compression
Generalized Superposition
On two DES implementations secure against differential power analysis in smart-cards
A Characterization of Strictly Locally Testable Languages and Its Applications to Subsemigroups of a Free Semigroup
Feedback and Generalized Logic
Space-efficient scheduling of stochastically generated tasks
A Formal Theory of Inductive Inference. Part II
Best Exponential Upper Bounds to Error Probability Obtainable by Random Coding for Binary Symmetric Channels
Priority and abstraction in process algebra
Assumptions of randomness in cosmology models
A Necessary and Sufficient Condition in Order That a Herbrand Interpretation Be Expressive Relative to Recursive Programs
Distributed computability: Relating k -immediate snapshot and x -set agreement
On Relative Completeness of Hoare Logics
New Foundations for Fixpoint Computations: FIX-Hyperdoctrines and the FIX-Logic
Solving modular cubic equations with Coppersmith's method
Counterexamples and Bounds for Graphs Solvable with Finite Delay
Optimal State Estimation in High Noise
Deciding expressive description logics in the framework of resolution
Mistake bounds on the noise-free multi-armed bandit game
Certain Results in Coding Theory for Noisy Channels
Stable States of Probabilisti Cellular Automata
Decidability of Split Equivalence
New Binary Codes from a Generalization of Zinoviev's Technique
Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms
Optimum Wiener Bounding Filters in the Presence of Uncertainties
On the theory of Binary Asymmetric Error Correcting Codes
Aeolus: A component model for the cloud
Corrigendum to "On the undecidability of implications between embedded multivalued database dependencies" [Inform. and Comput. 122(1995) 221-235]
Exponential Bounds for Error and Equivocation Based on Markov Chain Observations
Erasable Context-Free Languages
Decision problem for shuffled genes
Alternation with Restrictions on Looping
The Billaud Conjecture for alphabet size 4
Multi-Tape and Multi-Head Pushdown Automata
On an Asymptotic Optimization Problem in Finite, Directed, Weighted Graphs
Tree compression with top trees
File Organization: Consecutive Storage of Relevant Records on Drum-Type Storage
Recovery of Randomly Sampled Signals by Simple Interpolators
Categories of Partial Maps
Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL
Mind change efficient learning
c-trie++: A dynamic trie tailored for fast prefix searches
The Undecidability of the Semi-unification Problem
Surfaces in Three-Dimensional Digital Images
An n^3/2 Lower Bound on the Monotone Network Complexity of the Boolean Convolution
On the Existence of Garden-of-Eden Configurations
Finding Recursions for Multidimensional Arrays
RTA 2005
Efficient and exact quantum compression
Safe dependency atoms and possibility operators in team semantics
Two Fast Parallel Prime Number Sieves
Bivariate Markov Processes of Intervals
Narrowing the speedup factor gap of partitioned EDF
Synthesis of memory-efficient, clock-memory free, and non-Zeno safety controllers for timed systems
Comparing communication primitives via their relative expressive power
Probabilistic Analysis of a Network Resource Allocation Algorithm
Fast reversible language recognition using cellular automata
Decoding beyond the Designed Distance for Certain Algebraic Codes
Occam's Razor, Partially Specified Boolean Functions, String Matching, and Independent Sets
Power Moment Identities on Weight Distributions in Error Correcting Codes
A Kripke logical relation for effect-based program transformations
Specifications in an Arbitrary Institution
Can LCF be Topped? Flat Lattice Models of Typed lambda-Calculus
An Arithmetical Hierarchy in Propositional Dynamic Logic
On the Complexity of the General Coloring Problem
Finite-time safety and reach-avoid verification of stochastic discrete-time systems
Errata: "Transformational Classes of Grammars"
Completeness and Non-Completeness Results with Respect to Read-Once Projections
Parallel Complexity of the Regular Code Problem
Special Issue: Selected papers of the 11th International Conference on Language and Automata Theory and Applications, LATA 2017
An Effective Axiomatization for Real Time ACP
Church-Rosser Controller Rewriting Systems and Equivalence problems for Deterministic Context-Free Languages
Stack size analysis for interrupt-driven programs
Efficient instance retrieval with standard and relational path indexing
Propagating Chain-Free Normal Forms for EOL Systems
Typechecking top-down XML transformations: Fixed input or output schemas
Asynchronous Automata and Asychronous Languages
Optimal Pebble Motion on a Tree
Retrograde Codes and Bounded Synchronization Delay
Least upper bounds for probability measures and their applications to abstractions
Diagonally non-computable functions and fireworks
Beyond the worst-case analysis of random priority: Smoothed and average-case approximation ratios in mechanism design
The Design of Nonlinear Filters and Control Systems. Part II
On Stochastic Observability and Controllability for Nonlinear Distributed Parameter Systems
Incremental recomputation in local languages
Syntactic analysis of eta-expansions in Pure Type Systems
Higher-Order Substitutions
Logic, language, information and computation
Efficient assignment of identities in anonymous populations
Changing induced subgraph isomorphisms under extended reconfiguration rules
Split and ST Bisimulation Semantics
Automata That Recognize Intersections of Free Submonoids
On the Loop-Free Decomposition of Stochastic Finite-State Systems
Deux Familles de Langages Incomparables
The Reconstruction of Mutilated English Texts
A Method for Inferring Context-free Grammars
On the classification of recursive languages
Helping and the Meet of Pairs of Honest Subrecursive Classes
Improved model checking of hierarchical systems
Symmetrical One-Dimensional Cellular Spaces
Periodically Time-Variant Context-Free Grammars
From Jinja bytecode to term rewriting: A complexity reflecting transformation
The R-Norm Information Measure
A Study of Integral Pulse Frequency Modulation of a Random Carrier
Identity based proxy blind signature scheme using NTRU lattices
Location automata for regular expressions with shuffle and intersection
Normalization and Axiomatization for Numerical Dependencies
Finitely Stratified Polymorphism
On the Representation and Enumeration of Fuzzy Switching Functions
Cellular Graph Automata. II. Graph and Subgraph Isomorphism, Graph Structure Recognition
On the Algebraic Structure of Certain Partially Observable Finite-State Markov Processes
Symmetric electoral systems for ambient calculi
On model-checking timed automata with stopwatch observers
An Area-Maximum Edge Length Trade-off for VLSI Layout
Bin packing problems with rejection penalties and their dual problems
An improved FPT algorithm for the flip distance problem
Channels with Arbitrarily Varying Channel Probability Functions
A Modification of the Constructive Asymptotically Good Codes of Justesen for Low Rates
Results on Learnability and the Vapnik-Chervonenkis Dimension
Hierarchical combination of intruder theories
Complexity classification of the eight-vertex model
Distance-Dependent Distributed Directories
On the Elimination of Endmarkers
Outlier Resistent Filtering and Smoothing
A Topological Study of Phrase-Structure Languages
On the expressive power of schemes
All Structured Programs have Small Tree-Width and Good Register Allocation
Effective notions of weak convergence of measures on the real line
Characterizing polynomial and exponential complexity classes in elementary lambda-calculus
Fast approximate PCPs for multidimensional bin-packing problems
Finding maximal 2-dimensional palindromes
Event-based functional decomposition
Constructing perfect steganographic systems
On a Generalized Recursivity and Entropies of Degree \alpha
Real Functions, Contraction Mappings and P-Completeness
Global Renaming Operators in Concrete Process Algebra
Light types for polynomial time computation in lambda calculus
Some results on the number of periodic factors in words
On Some Schützenberger Conjectures
Inclusion problems for patterns with a bounded number of variables
Fast Parallel Space Allocation, Estimation and Integer Sorting
Achieving sequenced SQL with log-segmented timestamps
An abstract approach to stratification in linear logic
Generalizing DPLL and satisfiability for equalities
Descriptional complexity of bounded context-free languages
Strongly non-U-shaped language learning results by general techniques
Efficient algorithms for the conditional covering problem
Resolution of Composite Fuzzy Relation Equations
A Regularity Test for Pushdown Machines
On regular drawn symbolic picture languages
Detecting regularities on grammar-compressed strings
An Analysis of Grammars by Their Derivation Sets
Diagram Techniques for Confluence
Polynomial Turing compressions for some graph problems parameterized by modular-width
A "Law" of Occurrences for Words of Low Frequency
The role of randomness in the broadcast congested clique model
On Restricting the Base Component of Transformational Grammars
On the complexity of approximately matching a string to a directed graph
Parallel Reductions in lambda-Calculus
Using Self-Reducibilities to Characterize Polynomial Time
Efficient general AGH-unification
Loss in Information Transmission through Two-Way Channels
Model checking timed recursive CTL
On Control Systems with Time Lags
Modeling, analyzing and slicing periodic distributed computations
Two Sequential Nonparametric Detection Procedures
Uniform Generation of NP-Witnesses Using an NP-Oracle
On the Recursive Depth of Special Tree Traversal Algorithms
Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility
Tracking smooth trajectories in linear hybrid systems
Special Issue: Selected papers of the 10th International Conference on Language and Automata Theory and Applications, LATA 2016
On learning monotone DNF under product distributions
Modular Properties of Conditional Term Rewriting Systems
On a Uniqueness Theorem and its Application to a Neurophysiological Control Mechanism
Piecemeal Graph Exploration by a Mobile Robot
Abstract Hilbertian deductive systems, infon logic, and Datalog
A Note on the Number of Queries Needed to Identify Regular Languages
Parallel Random Access Machines with both Multiplication and Shifts
Equality Languages and Fixed Point Languages
Remarque sur une variante des systèmes réguliers (ou bilinéaires)
First and Second Covering Problems on Quasi Stochastic Systems
A modular approach to defining and characterising notions of simulation
On the computational power of probabilistic and quantum branching program
Effect algebras, presheaves, non-locality and contextuality
Diamond Formulas: A Fragment of Dynamic Logic with Recursively Enumerable Validity Problem
Lyapunov Functions for Nonlinear Time-Varying Systems
Combinatorial Pattern Matching (CPM 2010)
A refined complexity analysis of degree anonymization in graphs
The longest subsequence-duplicated subsequence and related problems
On Fairness Notions in Distributed Systems: II. Equivalence-Completions and Their Hierarchies
Inferring Control Structures from the Behaviour of a Production System
Solution to the Hashing Problem for Code Length 3
A simplicial complex model for dynamic epistemic logic to study distributed task computability
On hierarchically developing reactive systems
Full Abstraction and Expressive Completeness for FP
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
A rewriting logic approach to operational semantics
Deterministic Context Free Languages
Relational Phrase Structure Grammar and Its Tentative Applications
How Inductive Inference Strategies Discover Their Errors
Learning half-spaces on general infinite spaces equipped with a distance function
Sets Constructed by Acceptors
Noncyclic Generalizations of BCH and Srivastava Codes
Tyrolean termination tool: Techniques and features
A Directed-Divergence Function of Type β
A new bound for 3-satisfiable MaxSat and its algorithmic application
Structural Aspects of Local Adjunct Languages
A Note on the Two-Armed Bandit Problem with Finite Memory
A Note on Perimeter and Diameter in Digital Pictures
The Combinator S
On Equations for Union-Free Regular Languages
About randomised distributed graph colouring and graph partition algorithms
Characterization and measure of infinite two-dimensional strong prefix codes
Operational union-complexity
Computationally sound implementations of equational theories against passive adversaries
A Process Algebra for Timed Systems
Introducing variables in the evolution rules of P systems
Synchronization of Cyclic Codes in the Presence of Burst Errors
On algorithms based on finitely many homomorphism counts
Synchronization of a Class of Codes Derived from Cyclic Codes
Inductive Definitions Over Finite Structures
Linear Filtering in Multiplicative
An extension of context-free grammars with one-sided context specifications
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses
On Sliding Block Coding for Transmission of a Source over a Stationary Nonanticipatory Channel
3rd International Conference on Language and Automata Theory and Applications (LATA 2009)
A Note on Extended Quaternary Quadratic Residue Codes and Their Binary Images
Subject-oriented spatial logic
An Alternate Proof of the Composite Lower Bounds
Pictures of complete positivity in arbitrary dimension
Linear programming in the semi-streaming model with application to the maximum matching problem
Deterministic quantum search with adjustable parameters: Implementations and applications
Context-dependent Tree Automata
Continual Pattern Replication
Polynomial time decision algorithms for probabilistic automata
The computational power of monodirectional tissue P systems with symport rules
A Paradox Concerning Rate of Information
Machines for Attribute Grammars
Finite Graph-Acceptors and Regular Graph-Languages
Undecidability of domino games and hhp-bisimilarity
Syntax and Semantics: A Categorical View
One-Way Functions and Circuit Complexity
Uniform Closures: Order-Theoretically Reconstructing Logic Program Semantics and Abstract Domain Refinements
Better abstractions for timed automata
Counting hypergraph matchings up to uniqueness threshold
Complete sets of cooperations
Automating approximation analysis for Nash equilibria algorithms in two-player games
Permutative rewriting and unification
A Simplified Lower Bound for Context-Free-Language Recognition
The Uniform Halting Problem for Generalized One-State Turing Machines
Optimal Initial Data and Control for a Class of Linear Hereditary Systems
Is observational congruence on µ-expressions axiomatisable in equational Horn logic?
Free Recall of Self-Embedded English Sentences
Propositional games with explicit strategies
An 8-state Minimal Time Solution to the Firing Squad Synchronization Problem
The Degarbler-A Program for Correcting Machine-Read Morse Code
Subsequential transducers: a coalgebraic perspective
On hardest languages for one-dimensional cellular automata
Tape versus Queue and Stacks: The Lower Bounds
On the call-by-value CPS transform and its semantics
Distance labeling schemes for K 4 -free bridged graphs
An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic
Well-founded semantics for Boolean grammars
On the Spectra of Universal Relational Sentences
Language equivalence of probabilistic pushdown automata
Deterministic pushdown automata with translucent input letters
Axiomatisation and decidability of multi-dimensional Duration Calculus
Nonlinear Feedback Systems and Weakly Stationary Stochastic Processes
Rethinking specificity in defeasible reasoning and its effect in argument reinstatement
Identification of Stochastic Finite-State Systems
Controllability of Seqential Machines
A linear exponential comonad in s-finite transition kernels and probabilistic coherent spaces
Null Inclusion Dependencies in Relational Databases
The parameterised complexity of list problems on graphs of bounded treewidth
Optimal Amortized Distributed Consensus
A Distributed Shortest Path Algorithm for a Planar Network
Objects in the pi-Calculus
Controlling the data space of tree structured computations
Binary Sequences of Period 2m-1 with Large Linear Complexity
Automata can show PSpace results for description logics
Light logics and optimal reduction: Completeness and complexity
Quantitative Kleene coalgebras
Some Lower Bounds on the Number of Code Points in a Minimum Distance Binary Code. I
Erratum: "Efficient Inference of Object Types" Volume123, Number 2 (1995), pages 198-209
A Note on Stationary of Some Random Processes
Comments on Comments by Lee-Author's Reply
Randomness and imprecision: From supermartingales to randomness tests
Terse, Superterse, and Verbose Sets
Optimum Soft Decision Decoding With Graceful Degradation
Model theory of XPath on data trees. Part II: Binary bisimulation and definability
Fixed Point Equations with Parameters in the Projective Model
Parallel Graph Algorithms That Are Efficient on Average
Nontrivial Definability by Flow-Chart Programs
On the complexity of decision problems for some classes of machines and applications
Complexity of Some Problems from the Theory of Automata
Improved bounds for randomized preemptive online matching
Uniform strategies, rational relations and jumping automata
Absolute versus Relative Time in Process Algebras
On Weighted vs Unweighted Versions of Combinatorial Optimization Problems
L p and Orlicz Stability of a Class of Nonlinear Timevarying Feedback Control Systems
On Split Realizations of Response Maps over Rings
Special Issue: Selected papers of the 15th International Conference on Language and Automata Theory and Applications, LATA 2021
On the Entropy of Context-Free Languages
Intersection-types à la Church
Representation of Random Processes Using the Finite Karhunen-Loève Expansion
Further Results on Convolutional Codes Derived from Block Codes
Reasoning about graded strategy quantifiers
Monomial Boolean functions with large high-order nonlinearities
18th International Conference on Concurrency Theory
Compact representations of spatial hierarchical structures with support for topological queries
Integrated encryption in dynamic arithmetic compression
Logical Definability of NP Optimization Problems
Suprema of Open and Closed Formulas and Their Application to Resolution
Worst-case optimal exploration of terrains with obstacles
Hilbert Function and Complexity Lower Bounds for Symmetric Boolean Functions
Efficient algorithms for the block edit problems
2nd International Conference on Language and Automata Theory and Applications (LATA 2008)
Nonadditive Measures of Average Charge for Heterogeneous Questionnaires
On Predecessors of Finite Languages
Mutual Information for Stochastic Differential Equations
On the Power of Two-Dimensional Grammars Which Are Not Lenght Consistent
Efficient Fault-Tolerant Routings in Networks
Minimum Coefficient Rate for Stationary Random Processes
Cutting-edge cryptography through the lens of secret sharing
An efficient simulation algorithm based on abstract interpretation
A robust class of linear recurrence sequences
Generalized t-Designs and Weighted Majority Decoding
Greibach normal form for ω -algebraic systems and weighted simple ω -pushdown automata
Special issue: Formal verification of cyber-physical systems
An Approximation Theorem for Continuous Functions on L p (1 ⩽ p < ∞) Spaces Including Representation
On the codewords of generalized Reed-Muller codes reaching the fourth weight
Triangle Cellular Automata
A Note on a Sampling Theorem for Simply Connected Closed Contours
Fixed-parameter algorithms for Fair Hitting Set problems
Characterisation of the state spaces of marked graph Petri nets
On the Problem of Coding with Minimal Costs
On the Sample Complexity of Weakly Learning
Routing in Polygons without Rectilinear Visible Corners
Probabilistic Propositional Temporal Logics
Affine and General Linear Equivalences of Boolean Functions
The Equivalence of Two Concepts of Categorical Grammar
Mathematical Learning Theory: A Formalized, Axiomatic, Abstract Approach