yusuke1997/dblp-id-title huggingface dataset:
Polynomially Ambiguous Unary Weighted Automata over Fields
Cascades of Tree-Automata and Computations in Universal Algebras
An Internal Presentation of Regular Graphs by Prefix-Recognizable Graphs
Preface of the Special Issue Dedicated to Selected Papers from DLT 2022
On the Capabilities of Systolic Systems
Universal Quantifiers and Time Complexity of Random Access Machines
Stability and Welfare in (Dichotomous) Hedonic Diversity Games
Cutting and Independent Stacking of Intervals
Normal and Quasiregular Points for Automorphisms of the Torus
On Positively Expansive Maps
Dichotomy for Holant ∗ Problems on the Boolean Domain
Complexity of Fixed-Size Bit-Vector Logics
OBDDs of a Monotone Function and Its Prime Implicants
The Bounded Membership Problem of the Monoid SL_2(N)
On Reducing the Number of States in a PDA
Preface to Special Issue on Algorithmic Game Theory
Learning Reliably and with One-Sided Error
RFID Authentication Efficient Proactive Information Security within Computational Security
Correction to: How to Play Old Maid with Virtual Players
Knapsack in Graph Groups
Reasoning about integrity constraints for tree-structured data
On Relativizations with Restricted Number of Accesses to the Oracle Set
Collaborate with Strangers to Find Own Preferences
Restricted One-Counter Machines with Undecidable Universe Problems
On the Definition of the Variables Used and Set by a Computation
The Complexity of Counting CSP d
A Note on Complete Closure Algebras
On Spectral Bounds for the k-Partitioning of Graphs
On Problems for Which no Oracle Can Help
Performance of One-Round Walks in Linear Congestion Games
Vectorial Approximation by Restricted Rationals
Pumping Lemmas Can be "Harmful"
Generating Visual Invariants -a New Approach to Invariant Recognition
Polylog Space Compression, Pushdown Compression, and Lempel-Ziv Are Incomparable
Reasoning About XML Constraints Based on XML-to-Relational Mappings
Infinite Traces and Symbolic Dynamics
Stability of some Linear Time-Varying Systems
On the Partial Vertex Cover Problem in Bipartite Graphs - a Parameterized Perspective
Efficient Data Storage in Large Nanoarrays
Applying Modular Decomposition to Parameterized Cluster Editing Problems
On Category of Mixing in Infinite Measure Spaces
Special Issue on Fun with Algorithms
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes
Realization Algorithms for Systems over a Principal Ideal Domain
The Equivalence of Four Extensions of Context-Free Grammars
Formal Computations of Non Deterministic Recursive Program Schemes
The Complexity of Deterministic PRAM Simulation on Distributed Memory Machines
Le Théorème de Transversale Rationnelle dans les Langages d'Arbres
A Criterion for Weak Controllability
On a Random Volterra Integral Equation
A Geometrical View of the Determinization and Minimization of Finite-State Automata
Can a Shared-Memory Model Serve as a Bridging Model for Parallel Computation?
Local Determinacy of Abstract Local Dynamical Systems
An Adequacy Theorem for Dependent Type Theory
Approximation Algorithms for Connected Graph Factors of Minimum Weight
Two-Dimensional Packet Classification and Filter Conflict Resolution in the Internet
The Strong Price of Anarchy of Linear Bottleneck Congestion Games
Sorting Stably, in Place, with O(n log n) Comparisons and O(n) Moves
Correction to: On the Transformation of LL(k)-linear to LL(1)-linear Grammars
Coinduction for Exact Real Number Computation
Preface to the Special Issue on Algorithmic Game Theory
A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors
A Unified Approach to the Definition of Random Sequences
A Note on Complete Sets and Transitive Closure
Linear Semi-Dynamical Systems
The Containment Problem for Unambiguous Register Automata and Unambiguous Timed Automata
Processor Efficient Parallel Matching
Fast Learning of Restricted Regular Expressions and DTDs
Group-Complexity and Reversals of Finite Semigroups
Strict Interpretations of Deterministic Pushdown Acceptors
Cryptography and Algorithmic Randomness
Reordered Computable Numbers
Optimal Semicomputable Approximations to Reachable and Invariant Sets
Querying Probabilistic Business Processes for Sub-Flows
Optimal Implicit Dictionaries over Unbounded Universes
Nonlevelable Sets and Immune Sets in the Accepting Density Hierarchy in NP
Extensions of an Idea of McNaughton
A Generalization of Leftmost Derivations
Stable Marriage with General Preferences
Functions Computable with Nonadaptive Queries to NP
On Equilibria in Quantitative Games with Reachability/Safety Objectives
Universal Coalgebra and Categories of Transition Systems
A Partial Equivalence Between Shared-Memory and Message-Passing in an Asynchronous Fail-Stop Distributed Environment
(Approximate) Uncertain Skylines
Sur un Algorithme Donnant les Codes Bipréfixes Finis
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids
A Note on Topological Linearization of Locally Compact Transformation Groups in Hilbert Space
Constructive Dimension and Turing Degrees
Reduced-Order Controllers in H^\infty-Optimal Synthesis Methods of the First Kind
Control Structures in Computable Numberings and the Completion Operator
Productive Functions and Isomorphisms
Effective Randomness of Unions and Intersections
Second-Level Algorithms, Superrecursivity, and Recovery Problem in Distributed Systems
Complexity of the Bollobás-Riordan Polynomial. Exceptional Points and Uniform Reductions
The Rank-Width of Edge-Coloured Graphs
Random Sequences with Respect to a Measure Defined by Two Linear Fractional Transformations
Restart Strategies in a Continuous Setting
A Counterexample in Asymptotic Behavior of Holomorphic Functions
Computing Hitting Set Kernels By AC 0 -Circuits
Computing a Partition Function of a Generalized Pattern-Based Energy over a Semiring
Computability of Countable Subshifts in One Dimension
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems
Sturmian Trees
Normalized Range Voting Broadly Resists Control
Context-free Preserving Functions
Fixed-Point Logics and Solitaire Games
Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems
A Model for Ergodic Automorphisms on Groups
Basic Optimal Estimation and Control Problems in Hilbert Space
General Circular Permutation Layout
Synthesis of Nonlinear Observers: A Harmonic-Analysis Approach
13/9 -Approximation for Graphic TSP
Lifting Recursion Properties
Vandermonde and Resultant Matrices: An Abstract Approach
Different Local Controls for Graph Relabeling Systems
Minimal Symbolic Flows Having Minimal Block Growth
A Result About Languages Concerning Paperfolding Sequences
Induced Function Theorems in Topology
Computing the Number of Affine Equivalent Classes on ℛ(s, n)/ℛ(k, n)
Some Bilinear Forms Whose Multiplicative Complexity Depends on the Field of Constants
Black-Box Correctness Tests for Basic Parallel Data Structures
Correction: Semantics of Context-Free Languages
A Class of Finite Commutative Archimedean Semigroups
On Representation and Boundedness of Solutions of a Functional Differential Equation
Topological Transitivity and Ergodic Measures
Laws of Large Numbers for Random Linear Programs
Fixed and Periodic Points of Local Contraction Mappings on Probabilistic Metric Spaces
Semi-Oblivious Chase Termination: The Sticky Case
Characterization of Kurtz Randomness by a Differentiation Theorem
Model Checking Abilities of Agents: A Closer Look
Deductive Systems and Categories I. Syntactic Calculus and Residuated Categories
Implicit Representation of Relations
Periodic Points Under Expansive Homeomorphisms
When is a Sequential Machine the Realization of Another?
Quantum Search with Variable Times
A Forbidden Subposet Characterization of an Order-Dimension Inequality
Some Systems with Unique Equilibrium States
Editor's Note: Special Issue on Database Theory
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets
Conjugacy Properties of Affine Transformations of Nilmanifolds
Motion Planning with Pulley, Rope, and Baskets
Slopes of Multidimensional Subshifts
XML Compression via Directed Acyclic Graphs
On the Transformation of LL(k)-linear to LL(1)-linear Grammars
The Lexicographically First Maximum Subgraph Problems: P-Completeness and NC Algorithms
On Limitations of Transformations Between Combinatorial Problems
Designing Fast Converging Cost Sharing Methods for Multicast Transmissions
Overlapping Algorithms
CSR 2018 Special Issue on TOCS
Special Factors and Uniqueness Conditions in Rational Trees
Risk-Robust Mechanism Design for a Prospect-Theoretic Buyer
Computable Analysis of a Boundary-Value Problem for the Korteweg-de Vries Equation
On Reversible Cascades in Scale-Free and Erdős-Rényi Random Graphs
On the Structure of Irreducible State Representations of a Causal System
On Optimal Heuristic Randomized Semidecision Procedures, with Applications to Proof Complexity and Cryptography
Preface of STACS 2013 Special Issue
On Nondeterministic-Causal Time Systems
The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem
Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
On Some Metamathematical Results As Properties of General Systems
On Covering Problems of Codes
A Note on Relativized Log Space
Approximation Algorithms for Multiprocessor Scheduling under Uncertainty
Controllability of General Systems
On Embedding of a Hypercube in a Completely Overlapping Network
A Second Step Toward the Strong Polynomial-Time Hierarchy
Relative Complexity of Algebras
A Note on MOD p - MOD m Circuits
Exploiting Regularities for Boolean Function Synthesis
On the Complexity of Computing Winning Strategies for Finite Poset Games
Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates
Preface of STACS 2019 Special Issue
A Fast Algorithm for the Path 2-Packing Problem
Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts
The Graham-Knowlton Problem Revisited
In Memoriam - Alan Selman (1941 - 2021)
On Strong Stability for Linear Integral Equations
Invariance for Ordinary Differential Equations
An Infinite Hierarchy of Intersections of Context-Free Language
On the Autoreducibility of Functions
Parameterized Complexity of Satisfying Almost All Linear Equations over $\mathbb{F}_{2}$
Finitely Convex Sets of Nonlinear Differential Equations
A Standard Form for Sequential Stochastic Control
Guest Editorial: Parallelism in Algorithms and Architectures
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-hoc Networks
Weighted Logics for Unranked Tree Automata
On an Algebraic Theory of Systems Defined by Convolution Operators
Fast Fault-Tolerant Parallel Communication and On-Line Maintenance for Hypercubes Using Information Dispersal
The Problem of Deciding Confluence on a Given Congruence Class is Tractable for Finite Special String-Rewriting Systems
Conditional Probabilities and van Lambalgen's Theorem Revisited
On the Uniqueness of the Equilibrium State
Nonblocking k -Compare-Single-Swap
Lie and Morse Theory for Periodic Orbits of Vector Fields and Matrix Riccati Equations, II
Une Note sur la Propriété de Prefixe
The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems
A General Theory of Translation
A Hierarchy of Monotone Deterministic Non-Forgetting Restarting Automata
Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties
On The Existence of Optimal Fixpoints
Spectral Factorization of Time-varying Covariance Functions: The Singular Case
International Colloquium on Automata, Languages and Programming (ICALP 2020)
RUSPACE(log n ) $\subseteq$ DSPACE (log 2 n / log log n )
A Time-Space Hierarchy Between Polynomial Time and Polynomial Space
A Classification of the Singularities of (X, f)
The Data Locality of Work Stealing
Computing Parameters of Sequence-Based Dynamic Graphs
Omega-Rational Expressions with Bounded Synchronization Delay
Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees
Computability by Finite Automata and Pisot Bases
Copula-based Randomized Mechanisms for Truthful Scheduling on Two Unrelated Machines
On the Separation Question for Tree Languages
Towards a Scalable and Robust DHT
A Relationship Between Difference Hierarchies and Relativized Polynomial Hierarchies
A Steady State Analysis of Diffracting Trees
Scheduling to Minimize Staleness and Stretch in Real-Time Data Warehouses
A Partition on a Bernoulli Shift which is not Weakly Bernoulli
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids
Equivalence of Finite-Valued Tree Transducers Is Decidable
On the Base-Dependence of Sets of Numbers Recognizable by Finite Automata
A Unified Approach to Layout Wirability
Graph Complexity and Slice Functions
Searching for Black Holes in Subways
Some Characteristic Properties of Dynamical Systems with Quasi-discrete Spectra
Exact Linearization of Nonlinear Systems with Outputs
Multi-Stack-Counter Languages
On Sequence Entropy I
A Closer Look at the Expressive Power of Logics Based on Word Equations
Improved Approximation Algorithm for k-level Uncapacitated Facility Location Problem (with Penalties)
Faster Approximate String Matching for Short Patterns
Codes and Bernoulli Partitions
A Model of Sequential Computation with Pipelines Access to Memory
Expansiveness on Locally Compact Spaces
On Random Perfect Matchings in Metric Spaces with Not-too-large Diameters
Characterizations and Extensions of Pushdown Translations
Approximate Comparison of Functions Computed by Distance Automata
Towards a First Vertical Prototyping of an Extremely Fine-Grained Parallel Programming Approach
Tree Series Transformations that Respect Copying
Efficient Algorithms for Anonymous Byzantine Agreement
Gaming Is a Hard Job, but Someone Has to Do It!
On P-Subset Structures
Exact Complexity of the Winner Problem for Young Elections
Preface: Algorithmic Game Theory
Logical Equivalence for Subtyping Object and Recursive Types
k-visit Attribute Grammars
On the Small Time Behavior of the Nonlinear Estimation Problem for Finite Bandwidth Signals
A Complexity Calculus for Recursive Tree Algorithms
On Storing Ragged Arrays by Hashing
Lifting and Projecting Expansive Homeomorphisms
An Alternating Algorithm for Finding Linear Arrow-Debreu Market Equilibria
Wang Tilings and Distributed Verification on Anonymous Torus Networks
Preface of STACS 2016 Special Issue
Editorial Statement
On the Complexity of the Smallest Grammar Problem over Fixed Alphabets
Linearization and Asymptotic Behavior
An Essay on Continued Fractions
Discontinuous Scalar Functions and Ordinary Differential Equations
Representation for Solutions of Linear Neutral Functional Differential Equations
50 Years of TOCS
Quantum Algorithm for Lexicographically Minimal String Rotation
Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture
Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard
Decomposition of Banach-Valued Quasimartingales
Liouville, Computable, Borel Normal and Martin-Löf Random Numbers
Model Checking Games for the Quantitative µ -Calculus
Comparing Nontriviality for E and EXP
Contributions to the Theory of Generalized Differential Equations. I
Arithmetic Complexity, Kleene Closure, and Formal Power Series
On the Endomorphisms of Finite Automata
Le Cylindre des Langages Linéaires
Complexity of Clausal Constraints Over Chains
Radio k-chromatic Number of Full m-ary Trees
Controllability of General Nonlinear Systems
State Representations for m-D Systems with Generalized Causality Structures
Undecidable Problems for Probabilistic Automata of Fixed Dimension
The Complexity of Deciding if a Boolean Function Can Be Computed by Circuits over a Restricted Basis
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Local Characterisation of Load Semi-Dynamical Systems
Nominal Monoids
Monadic Second-Order Definable Text Languages
Compact Routing Schemes for Dynamic Ring Networks
Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems
Restarting Transducers, Regular Languages, and Rational Relations
Linearization of Locally Compact Transformation Groups in Hilbert Space
Parameterized Complexity of Vertex Cover Variants
Global Controllability of Nonlinear Systems in Two Dimensions
Representing Shared Data in Distributed-Memory Parallel Computers
Buffer Management for Colored Packets with Deadlines
Some Results on More Flexible Versions of Graph Motif
Learning Monotone Log-Term DNF Formulas under the Uniform Distribution
Speed-Ups by Changing the Order in which Sets are Enumerated
Foreword: Special Issue on Database Theory
Locating Limit Sets with Weak Nonautonomous Liapunov Functions
On Languages With a Certain Prefix Property
Reachability Problems on Reliable and Lossy Queue Automata
Contiguous Search Problem in Sierpinski Graphs
Deciding Determinism of Regular Languages
Communicating Processes, Scheduling, and the Complexity of Nondeterminism
Two Memory Bounds for the Recognition of Primes by Automata
Guest Editors' Note: Special Issue in Honor of Robert McNaughton
Special Issue on the 2018 International Conference on Database Theory
Word-Mappings of Level 2
Bicontinuous Extensions of Invertible Combinatorial Functions
Special Issue on Database Theory
Level Two of the Quantifier Alternation Hierarchy Over Infinite Words
Parameterized Intractability of Distinguishing Substring Selection
Notes on Computable Analysis
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
A Simple Boosting Algorithm Using Multi-Way Branching Decision Trees
On Multidimensional Curves with Hilbert Property
The Arithmetic Complexity of Tensor Contraction
Finite-State Independence
A Combinatorial Property of EOL Languages
A One Pass Streaming Algorithm for Finding Euler Tours
Sharing Resources at Nonuniform Access Rates
Adaptive Energy Management for Incremental Deployment of Heterogeneous Wireless Sensors
Sublinear Time Algorithms for Earth Mover's Distance
Structure-Preserving Hierarchical Decompositions
Two-Way Automata Versus Logarithmic Space
Re-Chord: A Self-stabilizing Chord Overlay Network
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Subgroup Membership in GL(2,Z)
A Modofication of a Substitution Theorem and Some Neccessary and Sufficient Conditions for Sets to be Context-Free
Average-Case Non-Approximability of Optimisation Problems
Structural Recursion as a Query Language on Lists and Ordered Trees
Singular Shift Registers Over Residue Class Rings
Optimal Probabilistic Generation of XML Documents
Hierarchical Ring Network design
Description of Restricted Automata by First-Order Formulae
Enhanced Mobile Membranes: Computability Results
Control Sets on Grammars
Risk Assessment for One-Counter Threads
Editor's Introduction to Euler's "An Essay on Continued Fractions" Translated by B. F. Wyman and M. F. Wyman
Querying Data Sources that Export Infinite Sets of Views
The Strongest Model of Computation Obeying 0-1 Principles
The Shift and Commutivity II
Selfish Routing with Incomplete Information
Longest Increasing Subsequence under Persistent Comparison Errors
Non-Principalité du Cylindre des Langages à Compteur
Pictures from Mongolia. Extracting the Top Elements from a Partially Ordered Set
On the Hierarchy of Swarm-automaton for the Number of Agents
Greedy Numeration Systems and Regularity
Multiple Signal Extraction by Polynomial Filtering
The Complexity of Ranking Simple Languages
Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings
Abstract Bilinear Systems: The Forward Shift Approach
Asymptotic Equivalence for two Nonlinear Systems
Conditional Measure and the Violation of Van Lambalgen's Theorem for Martin-Löf Randomness
A Group Algebraic Approach to NPN Classification of Boolean Functions
Clique-Width for 4-Vertex Forbidden Subgraphs
The Cache-Oblivious Gaussian Elimination Paradigm: Theoretical Framework, Parallelization and Experimental Evaluation
A Note on the Complexity of Program Evaluation
Quantum and Approximate Privacy
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
OptP as the Normal Behavior of NP-Complete Problems
Optimal Control in a Banach Space
Using Ideas of Kolmogorov Complexity for Studying Biological Texts
Simple and Improved Parameterized Algorithms for Multiterminal Cuts
The Outer-connected Domination Number of Sierpiński-like Graphs
Strategic Network Formation Through an Intermediary
On Factoring the Polyvariance Operator
Generalized Lowness and Highness and Probabilistic Complexity Classes
Symbolic Dynamics: Entropy = Dimension = Complexity
The Half-Levels of the FO2 Alternation Hierarchy
On the Automatizability of Polynomial Calculus
On Closure Properties of Bounded Two-Sided Error Complexity Classes
Characterizing the Micronuclear Gene Patterns in Ciliates
Trivial Measures are not so Trivial
Correction to: Special Issue on Approximation and Online Algorithms
NP-Partitions over Posets with an Application to Reducing the Set of Solutions of NP Problems
The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace
Bounds in Ontology-Based Data Access via Circuit Complexity
New Results on Polynomial Inapproximabilityand Fixed Parameter Approximability of Edge Dominating Set
Analyses of Load Stealing Models Based on Families of Differential Equations
Corrigendum. The Linear Arrangement Problem Parameterized Above Guaranteed Value
Existence and Uniqueness of Minimal Realizations of Nonlinear Systems
Description of Developmental Languages Using Recurrence Systems
Index-based, High-dimensional, Cosine Threshold Querying with Optimality Guarantees
Parallelizing Time with Polynomial Circuits
A Hierarchy of Deterministic Top-Down Tree Transformations
Towards More Practical Linear Programming-based Techniques for Algorithmic Mechanism Design
On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts
Non-Constructive Upper Bounds for Repetition Thresholds
The Mortality Problem for Matrices of Low Dimensions
Hamiltonicity of the Hierarchical Cubic Network
Algorithmic Randomness and Fourier Analysis
Tractable Fragments of Presburger Arithmetic
Improved Bounds for Functions Related to Busy Beavers
A Medvedev Characterization of Sets Recognized by Generalized Finite Automata
Expansivity and Periodicity in Algebraic Subshifts
Topological Dynamics of Cellular Automata: Dimension Matters
WAOA 2006 Special Issue of TOCS
Relativized NC
On the Universal Computing Power of Amorphous Computing Systems
On Finite Volterra Series which Admit Hamiltonian Realizations
Strong-Diameter Decompositions of Minor Free Graphs
Verification of Cache Coherence Protocols by Aggregation of Distributed Transactions
The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy
On Balanced Versus Unbalanced Computation Trees
Duality Theorems on Control and Observation of Discrete-Time Infinite-Dimensional Systems
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science
A Difference in Complexity Between Recursion and Tail Recursion
A Relation-Theoretic Result with Applications in Topological Algebra
Superposition Based on Watson-Crick-Like Complementarity
Local Accessibility, Local Reachability, and Representations of Compact Groups
Cache Me if You Can: Capacitated Selfish Replication Games in Networks
A Refinement of the Low and High Hierarchies
An Infinite Hierarchy in a Class of Polynomial-Time Program Schemes
Tight Bounds for Adopt-Commit Objects
Realization Theory in Hilbert Space
The Solvability of Consensus in Iterated Models Extended with Safe-Consensus
A Property Tester for Tree-Likeness of Quartet Topologies
On learning down-sets in quasi-orders, and ideals in Boolean algebras
Distributed Knowledge Justification Logics
A Uniqueness Theorem on the Resultant of Two Non-Differentiable Motions
On the Advice Complexity of the k-server Problem Under Sparse Metrics
A Survey of One-Way Functions in Complexity Theory
Collapsing and Separating Completeness Notions Under Average-Case and Worst-Case Hypotheses