yusuke1997/dblp-id-title huggingface dataset:
On Minimal Splitting Subspaces and Markovian Representations
Why Almost All k -Colorable Graphs Are Easy to Color
Expansivity, Permutivity, and Chaos for Cellular Automata
Preface of STACS 2012 Special Issue
Connecting Knowledge Compilation Classes and Width Parameters
Descendants of Primitive Substitutions
Efficient List Ranking on the Reconfigurable Mesh with Applications
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids
Observation and Distinction: Representing Information in Infinite Games
Correction: Complexity of Ideals in Finite Semigroups and Finite-State Machines
A Fixed-Point Theorem
Expressing Uniformity via Oracles
Equicontinuous Semi-Flows (One-Parameter Semi-Groups) on Locally Compact or Complete Metric Spaces
Moduli and Canonical Forms for Linear Dynamical Systems II: The Topological Case
Characterizations of Classes of Graphs Recognizable by Local Computations
On the Data Complexity of Consistent Query Answering
Complexity of Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints Between Regular Open Terms
A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks
On Two Continuum Armed Bandit Problems in High Dimensions
Pumping Lemmas for the Control Language Hierarchy
Relativized Polynomial Hierarchies Extending Two Levels
Subquadratic-time Algorithm for the Diameter and all Eccentricities on Median Graphs
A Note on Memoryless Operators
Global Aspects of the Matrix Riccati Equation
Prediction and MDL for infinite sequences
The Mixing Properties of Certain Processes Related to Markov Chains
Equation Satisfiability in Solvable Groups
On the Relative Succinctness of Sentential Decision Diagrams
Causal Polynomial Approximation for Input-Output Maps on Hilbert Spaces
Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds
Small-Bias is Not Enough to Hit Read-Once CNF
Group-Like Extensions and Similar Algebras
On Triangle Estimation Using Tripartite Independent Set Queries
Subrecursiveness: Machine-Independent Notions of Computability in Restricted Time and Storage
On the Cobham-Semenov Theorem
The Range of a Vector-Valued Measure
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism
Well-Covered Graphs With Constraints On Δ And δ
Correction to: Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
Network Design with Weighted Players
Node Bisectors of Cayley Graphs
Relativization of Questions About Log Space Computability
Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs
Multi-Pass Streaming Algorithms for Monotone Submodular Function Maximization
Efficient Algorithms for Highly Compressed Data: The Word Problem in Generalized Higman Groups Is in P
CNF Encodings of Symmetric Functions
Preface of STACS 2021 Special Issue
A Several Complex Variables Approach to Feedback Stabilization of Linear Neutral Delay-Differential Systems
On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem
Information Lower Bounds via Self-Reducibility
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Ponynominal Closure and Unambiguous Product
Strong Self-Reducibility Precludes Strong Immunity
Operator-Valued Wide-Sense Markov Processes and Solutions of Infinite-Dimensional Linear Differential Systems Driven by White Noise
Modulo Constraints and the Complexity of Typechecking XML Views
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Minimal Flows Arising from Substitutions of Non-Constant Length
Optimizing Over Serial Dictatorships
NP-Creative Sets: A New Class of Creative Sets in NP
Erratum: Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices
Division Safe Calculation in Totalised Fields
Analyzing Clustering and Partitioning Problems in Selected VLSI Models
A Number-Theoretic Class of Weak Bernoulli Transformations
The Theory of Languages
Border Correlations of Partial Words
On the Definitions of some Complexity Classes of Real Numbers
A Closer Look at Fault Tolerance
On the Generic Undecidability of the Halting Problem for Normalized Turing Machines
Unnecessary Inferences in Associative-Commutative Completion Procedures
Towards Separating Nondeterminism from Determinism
On the Uniform Computational Content of Computability Theory
Local Maps Inducing Surjective Global Maps of One-Dimensional Tesselation Automata
Certain Answers over Incomplete XML Documents: Extending Tractability Boundary
On Semigroups in a Non-Compact Transformation Group
Diagonal Polynomials and Diagonal Orders on Multidimensional Lattices
Topological Models for Generators
Computing Graph Automorphism from Partial Solutions
Helping by Unambiguous Computation and Probabilistic Computation
The Monadic Second-Order Logic of Graphs, II: Infinite Graphs of Bounded Width
Bounds on Sizes of Finite Bisimulations of Pfaffian Dynamical Systems
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids
A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs
An Efficient Syntactic Analyser of Certain Formal Languages
On Characterisations of Mixing Properties of Measure-Preserving Transformations
A Lower Bound for Monotone Perceptrons
Price of Anarchy for Highly Congested Routing Games in Parallel Networks
Reachability Problems on Regular Ground Tree Rewriting Graphs
A Remark About a Substitution Property
On Asymptotically Autonomous Differential Equations
Elastic-Degenerate String Matching with 1 Error or Mismatch
Nash Stability in Additively Separable Hedonic Games and Community Structures
Multiplication Algorithm Based on Collatz Function
An Additivity Theorem for Plain Kolmogorov Complexity
Synthesis of H^\infty-Optimal Linear Feedback Systems
Primitivity, Uniform Minimality, and State Complexity of Boolean Operations
Message-Optimal Protocols for Byzantine Agreement
On Two-Way Weak Counter Machines
The Shift and Commutativity
Three-Valued Representative Systems
Extension Complexity of Formal Languages
Faster Algorithms for the Constrained k-means Problem
The Sum 2 KM(x)-K(x) Over All Prefixes x of Some Binary Sequence Can be Infinite
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers
Online Unbounded Knapsack
Approximation Algorithms for DNF Under Distributions with Limited Independence
On the Decomposition of Measures with Applications to Continuum Physics
Advice Complexity of Maximum Independent set in Sparse and Bipartite Graphs
A Nonlinear Variation-of-Constants Formula for Functional Differential Equations
Information Theory and the Complexity of Boolean Functions
A Short Note on Simultaneous Splitting
Computational Complexity of Formal Translations
Approximately Counting Approximately-Shortest Paths in Directed Acyclic Graphs
On the Power of Deterministic Reductions to C=P
Upper Bounds for the Complexity of Sparse and Tally Descriptions
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
Relative Complexity of Operations on Numeric and Bit-String Algebras
Relations between Average-Case and Worst-Case Complexity
Bounded-Diameter Minimum-Cost Graph Problems
Complexity of Ideals in Finite Semigroups and Finite-State Machines
Inverses of Recurrent and Periodic Points under Homomorphisms of Dynamical Systems
Single-Exception Sorting Networks and the Computational Complexity of Optimal Sorting Network Verification
Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups
An Improved Exact Algorithm for TSP in Graphs of Maximum Degree 4
On the Contribution of Backward Jumps to Instruction Sequence Expressiveness
Self-Stabilizing Metric Graphs
Sur une Propriété d'Itération des Langages Algébriques Déterministes
A Process Calculus with Finitary Comprehended Terms
A Nonlinear Variation of Constants Formula for Volterra Equations
Special Issue on Computer Science Symposium in Russia (2019)
Fixed-Parameter Enumerability of Cluster Editing and Related Problems
Compressed Word Problems in HNN-extensions and Amalgamated Products
Uniqueness For Ordinary Differential Equations
Scalable Room Synchronizations
Representing Hyper-arithmetical Sets by Equations over Sets of Integers
Schnorr Triviality and Its Equivalent Notions
Storage Products and Linear Control of Derivations
Control Dynamical Systems
Programs, Proofs, Processes
A Structure Theorem for \delta-Classes of Compact Semigroup Actions
Generalized Diameters of the Mesh of Trees
The Complexity of Linear and Stratified Context Matching Problems
On the Diameter and Bisector Size of Cayley Graphs
Lexicographic Decomposition of k -Valued Transducers
Balanced Graph Partitioning
Martin-Löf Randomness, Invariant Measures and Countable Homogeneous Structures
Exponential Separation of Quantum and Classical Online Space Complexity
On the Boundedness Properties of a Perturbed Nonlinear System
Weak Attractors in R^n
Laying Out the Interconnection Network of the Transpose Bijection
A Note on Square Rooting of Time Functions of Turing Machines
A Convolution Method for Inverse Heat Conduction Problems
Randomized Algorithms for 3-SAT
Edge-Packing in Planar Graphs
Expansive Self-Homeomorphisms of the Cantor Set
On Computing Boolean Connectives of Characteristic Functions
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees
On the Expressive Power of Stateless Ordered Restart-Delete Automata
A Note on Series Parallel Irreducibility
On Random Nonlinear Contractions
The 2-Rainbow Domination of Sierpiński Graphs and Extended Sierpiński Graphs
On the Representation of Real Numbers Using Regular Languages
Effective Jordan Decomposition
Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines
Power-Separating Regular Languages
Layerwise Computability and Image Randomness
Satisfiability of ECTL∗ with Local Tree Constraints
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Knowledge Compilation Meets Database Theory: Compiling Queries to Decision Diagrams
Tree Adjoining Languages and Multipushdown Languages
Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes
An Alternative Method Based on Approximate Solutions
P-Recursion and Transformation Groups Having an Equicontinuous Replete Semigroup
On the Complexity of Matroid Isomorphism Problem
On Comparing LL(k) and LR(k) Grammars
Non-Uniform Reductions
Maintaining Privacy on a Line
On the Minimization of (Complete) Ordered Binary Decision Diagrams
Global Parallelizability of Local Dynamical Systems
On the Effective Generation of Set Elements Within Specified Ranges
Average-Case Analysis of Greedy Packet Scheduling
Obstructions to Return Preservation for Episturmian Morphisms
Effective Guessing Has Unlikely Consequences
Small Space Representations for Metric Min-sum k -Clustering and Their Applications
Isomorphism and Parallelizability in Dynamical Systems Theory
The Theory of Equivalence of Pfaffian Systems and Input Systems Under Feedback
Stabilizability of Linear Systems Defined over C*-Algebras
On Effective Birkhoff's Ergodic Theorem for Computable Actions of Amenable Groups
2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs
Realizability interpretation of proofs in constructive analysis
Construction of Locally Almost Periodic Minimal Transformation Groups
On Rationality of Verbal Subsets in a Group
Maximin Sequential-Like Machines and Chains
Notes on Sum-Tests and Independence Tests
Regular Minimal Sets over the Circle and the Ellis Minimal Set
On First-Order Logic and CPDA Graphs
Atomic Read/Write Memory in Signature-Free Byzantine Asynchronous Message-Passing Systems
Experimental Studies of Algorithms
In-place Algorithm for Erasing a Connected Component in a Binary Image
Topologies on Formal Languages
Complete Sets and Closeness to Complexity Classes
An Enlarged Family of Packing Polynomials on Multidemensional Lattices
A Difference in Expressive Power Between Flowcharts and Recursion Schemes
A Unified Framework for Off-Line Permutation Routing in Parallel Networks
Permutation-Exchange Graphs That Emulate the Binary Cube
Approximation of Measure-Preserving Transformations
Distance Vector-based Advance Reservation with Delay Performance Guarantees
In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism
The Green's Function for nth-Order Periodic Differential-Difference Equations
On Regular Expressions and Regular Canonical Systems
A Provably Correct Translation of the lambda -Calculus into a Mathematical Model of C++
The Minimum Number of Edges in Graphs with Prescribed Paths
Resource-Bounded Measure and Learnability
Infinite Trees in Normal Form and Recursive Equations Having a Unique Solution
Characterizing Polynomial Complexity Classes by Reducibilities
Imperative Process Algebra and Models of Parallel Computation
Doubly-Indexed Dynamical Systems: State-Space Models and Structural Properties
Maximizing Entropy for a Hyperbolic Flow
Improved Approximations for Weighted and Unweighted Graph Problems
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth
Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines
A Note on Weighted Distributed Match-Making
Some Symmetrical Planar Structures with their Fault-Tolerant Metric Dimension
Label Ranking Through Nonparametric Regression
Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer
On the Computational Power of Totalistic Cellular Automata
Elimination Trees and the Construction of Pools and Stacks
Improved Randomized Online Scheduling of Intervals and Jobs
A Homomorphism Theorem for Finite Semigroups
A Model for Pattern Perception with Musical Applications Part II: The Information Content of Pitch structures
On the Prime Decomposition Theorem for Finite Monoids
Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults
An Isoperimetric Problem in Cayley Graphs
Isolating an Odd Number of Elements and Applications in Complexity Theory
Wait-free Solvability of Colorless Tasks in Anonymous Shared-memory Model
Beta-Shifts, Their Languages, and Computability
Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory
Homomorphisms Between Stochastic Sequential Machines and Related Problems
Preface: Special Issue on Theoretical Aspects of Computer Science (STACS)
Regular Languages of Thin Trees
Representation of Reversible Cellular Automata with Block Permutations
Some Results on Uniform Arithmetic Circuit Complexity
Maximizing Rides Served for Dial-a-Ride on the Uniform Metric
An Improved Approximation Algorithm for the Most Points Covering Problem
Selection Functions that Do Not Preserve Normality
Direct and Subdirect Product Structure Theorems for Non-Deterministic Automata
Deducible and Equivalent Structural Knowledges in Distributed Algorithms
Bernoulli Equilibrium States for Axiom A Diffeomorphisms
Observability for Two-Dimensional Systems
Algorithms in the W-Hierarchy
Spectral Sparsification in the Semi-streaming Setting
Gradient Clock Synchronization in Dynamic Networks
Distal and Proximal Extensions of Minimal Flows
Generating, Sampling and Counting Subclasses of Regular Tree Languages
Numeration Systems on a Regular Language
Schemas for Unordered XML on a DIME
Matching and Spanning in Certain Planar Graphs
Minimum-Cost Flows in Unit-Capacity Networks
State-Complexity of Finite-State Devices, State Compressibility and Incompressibility
Convolution of Invariant Measures, Maximal Entropy
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
Differential Inequalities and Non-Lipschitz Scalar Functions
Complexity and Expressive Power of Weakly Well-Designed SPARQL
On the Turing Completeness of the Semantic Web
A Contribution to the Frobenius Theory of Positive Operators. Comparison Theorems
The Cache Complexity of Multithreaded Cache Oblivious Algorithms
Graph Property Recognition Machines
Editorial: Special Issue on "Combinatorial Algorithms" (IWOCA 2016)
On the Asymptotic Behaviour of Solutions of Differential Equations in a Banach Space
Liapunov Criteria for Uniformity
Near-Optimal Auctions on Independence Systems
Finite Approximants of Compact Totally Disconnected Machines
Editorial: Special FOCS Issue - Twenty-Second Annual IEEE Symposium on Foundations of Computer Science
On Normality in Shifts of Finite Type
Structural Properties for Feasibly Computable Classes of Type Two
Strong Decoupling in Singular Systems
Quantum Algorithms for Matching Problems
Special Issue on Algorithmic Game Theory
The Existence of the Best Stabilizing Control in Higher Dimensions
The Complexity of Optimal Design of Temporally Connected Graphs
A Characterization of Symbolic Cascades in Terms of Expansiveness and Topological Entropy
Homomorphisms of Symbolic Dynamical Systems
Computability in Europe 2006
Morpion Solitaire
On Weak Mixing of Cascades
Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality
Stochastic Models and Adaptive Algorithms for Energy Balance in Sensor Networks
Complexity of Presburger Arithmetic with Fixed Quantifier Dimension
Polynomial-Time Algorithms for Checking Some Properties of Boolean Functions Given by Polynomials
Guest Editorial: Tenth International Conference on Computability, Complexity and Randomness (CCR 2015)
Distributed Search Trees: Fault Tolerance in an Asynchronous Environment
Propriétés Booléennes des Langages Stochastiques
A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders
The Complexity of On-Line Simulations Between Multidimensional Turing Machines and Random Access Machines
Semantics of Looping Programs in Propositional Dynamic Logic
Incremental Problems in the Parameterized Complexity Setting
Computability in Europe 2008
Obituary: Shimon Even
Algorithmic Properties of Structures
A Split-Based Incremental Deterministic Automata Minimization Algorithm
Time-Varying Systems and Crossed Products
The Performance of Greedy Algorithms for the On-Line Steiner Tree and Related Problems
Size, Index, and Context-Sensitivity of Controlled Partition Grammars
Optimizing Binary Heaps
Preface of the Special Issue Dedicated to Selected Papers from CSR 2020
PP-Lowness and a Simple Definition of AWPP
R S N 1-tt (NP) Distinguishes Robust Many-One and Turing Completeness
On Reducing the Number of Stack Symbols in a PDA
A Theorem on Liapunov Functions Using V
Planar and Grid Graph Reachability Problems
Preface to the Special Issue on Computer Science in Russia 2016
Computing Colourful Simplicial Depth and Median in ℝ 2
Relaxed Notions of Schema Mapping Equivalence Revisited
Efficient Decentralized Algorithms for the Distributed Trigger Counting Problem
Foreword: Parallelism in Algorithms and Architectures
Determinization of Transducers over Infinite Words: The General Case
A Class of Infinite Dimensional Linear Systems
The Complexity of Pre-assignment Problem for Unique Minimum Vertex Cover on Bipartite Graphs
Linear Codes Correcting Repeated Bursts Equipped with Homogeneous Distance
Quasi-Disjointness, Products and Inverse Limits
Partial Symmetries for Nonlinear Systems
Optimal Cache-Oblivious Mesh Layouts
Routing in Series Parallel Networks
An Unsolvable Problem with Products of Matrices
Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs
Corrigendum Learning Two-Type Automata from Queries and Counterexamples
Multi-processor Search and Scheduling Problems with Setup Cost
Periodic Gossiping in Commuted Networks
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
On Linear Systems and Noncommutative Rings
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning
A Burnside Approach to the Finite Substitution Problem
When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem
Extension of Minimal Transformation Groups
Theoretical Aspects of Computer Science
Co-c.e. Sets with Disconnected Complements
Finite Presentations of Infinite Structures: Automata and Interpretations
Decoupling of Linear Systems by Dynamic Output Feedback
Parallel Algorithms for Routing in Nonblocking Networks
Causal C_0 Operators and Feedback Stability
Deciding a Class of Path Formulas for Conflict-Free Petri Nets
On Sets Turing Reducible to p-Selective Sets
Non-Unique Critical Points of Ordinary Differential Equations
A Note on Context Free Languages, Complexity Classes, and Diagonalization
A Characterization of the Sets of Hypertrees Generated by Hyperedge-Replacement Graph Grammars
Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators
Constructing Antidictionaries of Long Texts in Output-Sensitive Space
Automatic Abelian Complexities of Parikh-Collinear Fixed Points
Logical Definability of Some Rational Trace Languages
Playing Mastermind with Constant-Size Memory
A Single-Version STM that Is Multi-Versioned Permissive
Multiplication Induced in the State-Space of an Act
On the Chromatic Number of Non-Sparse Random Intersection Graphs
A Generalized Characterization of Algorithmic Probability
On the Information Carried by Programs About the Objects they Compute
The Parameterized Space Complexity of Embedding Along a Path
On Ergodic Homeomorphisms
Consistent Query Answering for Primary Keys in Datalog
The Growth of Configurations
Equations Over Free Inverse Monoids with Idempotent Variables
An Improved Deterministic Parameterized Algorithm for Cactus Vertex Deletion
Asymptotic Equilibrium of Ordinary Differential Systems in a Banach Space
An Improved Hierarchy Result for Partitioned BDDs
Two Algorithms in Search of a Type-System
Query Learning of Regular Tree Languages: How to Avoid Dead States
A Construction of the Greatest Ambit
A Proof of the Independence of the Continuum Hypothesis
Local System Equivalence
Structurally Stable Nonlinear Regulation with Step Inputs
Approximation Algorithms for the MAXSPACE Advertisement Problem
Farkas Bounds on Horn Constraint Systems
Periodicity in Generations of Automata
Realization is Universal
Towards a Realistic Analysis of the QuickSelect Algorithm
Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing
Satisfiability Problems for Propositional Calculi
On the Definition of a Stochastic Differential Game
Deterministic Resource Discovery in Distributed Networks
Small Subcategories and Completeness
Mathematical Systems Theory: Causality
Between Order and Chaos: The Quest for Meaningful Information
On Optimal Language Compression for Sets in PSPACE/poly
The Complexity of Unavoidable Word Patterns
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
Dolezal's Theorem, Linear Algebra With Continuously Parametrized Elements, and Time-Varying Systems
Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring
Lyapunov Functions and Stability of Dynamical Polysystems
A Normal Form Theorem for Label Grammars
A New Polynomial-Time Algorithm for the Maximum Weighted (\chi(G) - 1)-Coloring Problem in Comparability Graphs
Stability and Summability of Solutions of Difference Equations
Three Hierarchies of Transducers
On Realization of Linear Systems and Applications to Some Questions of Stability
Santha-Vazirani sources, deterministic condensers and very strong extractors
Green's Relations in Deterministic Finite Automata
Dispersion in Disks
A Note on Some Systems of Lindenmayer
Composing Stack-Attributed Tree Transducers
Blocking in Parallel Multisearch Problems
On Categories of Infinite Automata
Bi-Immune Sets for Complexity Classes
Algorithm for Online 3-Path Vertex Cover
Non-Existence of Stable Social Groups in Information-Driven Networks
Resource Bounds and Subproblem Independence
On Input Semigroups of Automata
A Geometric Programming Approach to Solve the Restricted Assignment Case of the Santa Claus Problem
A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange
One-Sided Markets with Externalities
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword
Classification of Computably Approximable Real Numbers