yusuke1997/dblp-id-title huggingface dataset:
Complexity Limitations on One-turn Quantum Refereed Games
On the Combinational Complexity of Certain Symmetric Boolean Functions
Convergence Theorems for Stochastic Automata and Learning Systems
Design and Implementation of an Efficient Priority Queue
Algebraic Characterization of Reversible Logic Gates
Effective Versions of Local Connectivity Properties
Concise Representations of Regular Languages by Degree and Probabilistic Finite Automata
The Number of Clones Determined by Disjunctions of Unary Relations
A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games
The Complexity of Monotone Boolean Functions
Greedy is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs
The Addition of Dynamical Systems
On Embeddability of Unit Disk Graphs Onto Straight Lines
Stability Analysis of the Orbits of Control Systems
Bounds on the Bend Number of Split and Cocomparability Graphs
Dynamic Programming for Minimum Steiner Trees
A Note on Undecidable Properties of Formal Languages
A Framework for Simple Sorting Algorithms on Parallel Disk Systems
Bandwidth Minimization: An Approximation Algorithm for Caterpillars
P Systems with Global Rules
Approximability of open k-monopoly problems
Endomorphisms and Automorphisms of the Shift Dynamical Systems
On Restricted One-counter Machines
The Chain Method to Separate Counting Classes
Limitations of the Upward Separation Technique
On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions
Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries
Improved Methods to Solve Nonlinear Invariants with Low Algebraic Degree for Linear Transformation
A Fast Algorithm To Compute Irreducible and Primitive Polynomials in Finite Fields
On the Ergodic Theory of Cellular Automata
Juggling with Pattern Matching
Expressiveness and Complexity of Generic Graph Machines
Connected Sets: Bases and Metrics
On Stability of Probability Laws with Respect to Small Violations of Algorithmic Randomness
Correction: Yet Another Proof of the Cascade Decomposition Theorem for Finite Automata
Optimal Embeddings of Butterfly-Like Graphs in the Hypercube
More Fun with Symmetric Venn Diagrams
Correction: On Realization of Nonlinear Systems Described by Higher-Order Differential Equations
Representing the Integer Factorization Problem Using Ordered Binary Decision Diagrams
Prolongations and Stability Analysis via Lyapunov Functions of Dynamical Polysystems
Unveiling Order in Chaos: A Systematic Approach Based on Graph Theory in Enumerating Sudoku Grids of Rank n
Games with Uniqueness Properties
Some Open Problems in the Theory of Computation as Questions about Two-Way Deterministic Pushdown Automaton Languages
A New Normal Form for the Compositions of Morphisms and Inverse Morphisms
The Complexity of Debate Checking
The Structure of Nonsingular Polynomial Matrices
On Confluence of One-Rule Trace-Rewriting Systems
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Extra Processors versus Future Information in Optimal Deadline Scheduling
Lower Bounds on the Error of Query Sets Under the Differentially-Private Matrix Mechanism
Verification of Quantum Computation: An Overview of Existing Approaches
Efficient Exploration of Faulty Trees
Rudimentary Relations and Stack Languages
An Experimental Analysis of Parallel Sorting Algorithms
Prolongations and Lyapunov Functions in Control Systems
A Characterization and Nearly Linear-Time Equivalence Test for µ-Branching Programs
Prudence in Vacillatory Language Identification
Processor-Time Tradeoffs under Bounded-Speed Message Propagation: Part I, Upper Bounds
On the Complexity of the Clone Membership Problem
Representation of Continuous Curves on the 3-Dimensional Rotation Group
Lower Bounds on the Efficiency of Transforming Static Data sSructures into Dynamic Structures
A Reference Correction of "Effective Jordan Decomposition"
Wazewski's Topological Method for Caratheodory Systems
Non-determinism in Gödel's System T
Algebraic Representation of Dynamics and Behavior for Continuous-Time Linear Systems
Independence Results Concerning a Problem of N. Lusin
Efficiency of Semisynchronous Versus
Realizations of Nonlinear Analytic Input-Output Maps
Characterizations of Reduction Classes Modulo Oracle Conditions
Attainable Sets in Infinite-Dimensional Spaces
Almost Surely Continuous Solutions of a Nonlinear Stochastic Integral Equation
Parallel Random Access Machines with Powerful Instruction Sets
Correction to: Submodular Functions and Rooted Trees
Layered Hashing Algorithm for Real-time Systems
Pseudo-Random Graphs and Bit Probe Schemes with One-Sided Error
Bounding the Expected Length of Longest Common Subsequences and Forests
Real-Time Computations with Restricted Nondeterminism
Existence of Bounded Solutions and Asymptotic Relationships for Nonlinear Volterra Integral Equations
Gathering on Rings for Myopic Asynchronous Robots with Lights
Programmed Mutagenesis Is Universal
On Intractability of the Class UP
Derandomization for Sliding Window Algorithms with Strict Correctness ∗
Real-Time Solutions of the Origin-Crossing Problem
The Complexity of Polynomial-Time Approximation
Measurable Selectors of Multifunctions and Applications
Cellular Automata: Real-Time Equivalence between One-Dimensional Neighborhoods
Online Hierarchical Cooperative Caching
WAOA 2005 Special Issue of TOCS
Hereditary Structure in Differential Equations
Fast Parallel Lyndon Factorization with Applications
Generalized River Crossing Problems
On the Stab Number of Rectangle Intersection Graphs
Actor Grammars
Branching Time Logics BTL U, S N, N -1 ( Z ) a with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms
The Automorphisms of the Shift Dynamical System are Relatively Sparse
Power Indices and Easier Hard Problems
Partial Bi-immunity, Scaled Dimension, and NP-Completeness
Probabilistic Asynchronous Automata
On the structure of solution-sets to regular word equations
Equivalence of Input-Output Stability and Exponential Stability for Infinite-Dimensional Systems
Trichotomies in the Complexity of Minimal Inference
Equivariant Maps onto Minimal Flows
States and the Free Orthogonality Monoid
Flexible Usage of Redundancy in Disk Arrays
On Sequence Entropy II
On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth
Speed Scaling of Processes with Arbitrary Speedup Curves on a Multiprocessor
Automatic Presentations and Semigroup Constructions
Compact DSOP and Partial DSOP Forms
Semantics of Trees
A Linear-Time Algorithm for Hamming Distance with Shifts
Space Bounds for a Game on Graphs
Chomskian Hierarchies of Families of Sets of Piecewise Continuous Functions
Attack Propagation in Networks
Types of Isomorphisms of Transformation Groups
Two-Way Automata and Length-Preserving Homomorphisms
Self-Referential Justifications in Epistemic Logic
Some Classes of Automata as Partially Ordered Sets
Stability and Nonsingular Stable Precompensation: An Algebraic Approach
Tropically Convex Constraint Satisfaction
A Polynomial Bound for Certain Cases of the D0L Sequence Equivalence Problem
Classification Problems
Space Saving by Dynamic Algebraization Based on Tree-Depth
Parameterised Algorithms for Deletion to Classes of DAGs
On Extracting Space-bounded Kolmogorov Complexity
What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs
Congruence Separation of Subsets of a Monoid with Applications to Automata
Insertion Sort is O(n log n)
Real Hypercomputation and Continuity
Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays
Graph Embeddings and Simplicial Maps
On Forced Periodicity of Perfect Colorings
Diffusion Schemes for Load Balancing on Heterogeneous Networks
A Thread Algebra with Multi-Level Strategic Interleaving
DNA Computing Based on Splicing: The Existence of Universal Computers
Adversarial Multiple Access Channels with Individual Injection Rates
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications
Non-Tangential Limits of a Solution of a Bondary-Value Problem for the Heat Equation
Une Relation d'Equivalence Decidable sur la Classe des Forêts Reconnaissables
The Coolest Way to Generate Binary Strings
Total Complexity and the Inference of Best Programs
New Lower Bounds on Circuit Size of Multi-output Functions
Comparing Linear Width Parameters for Directed Graphs
A Framework for Memory Efficient Context-Sensitive Program Analysis
Deciding Confluence for a Simple Class of Relational Transducer Networks
Local Controllability of a Nonlinear Wave Equation
Strategic Candidacy Equilibria for Common Voting Rules
The Complexity of Model Checking Multi-Stack Systems
Computability, Complexity and Randomness
Remarks on Algebraic Decomposition of Automata
Approximation by Bernstein Systems
Algorithmic Minimal Sufficient Statistics: a New Approach
Query Languages for Data Exchange: Beyond Unions of Conjunctive Queries
The Complexity of Problems for Quantified Constraints
Team Learning of Computable Languages
A Cost-Effective Architecture for Vectorizable Numerical and Multimedia Applications
TCP is Competitive with Resource Augmentation
A Note on N-Body Computations with Cutoffs
On the Properties of the Realizations of Linear Dynamical Systems
Program Self-Reference in Constructive Scott Subdomains
Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs
Syntactic Complexity of Regular Ideals
Comparing Language Operations
On the Time and Space Complexity of Computation Using Write-Once Memory Or Is Pen Really Much Worse Than Pencil?
Model Checking Weighted Integer Reset Timed Automata
Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing
Built-in Coloring for Highly-Concurrent Doubly-Linked Lists
A Generalization of Cobham's Theorem
On Approximation Properties of the Independent Set Problem for Low Degree Graphs
Compressed Suffix Trees with Full Functionality
W-Hierarchies Defined by Symmetric Gates
Normality, Relativization, and Randomness
Improved Approximations for the Minimum-Cut Ratio and the Flux
Arithmetic for Rooted Trees
Recursive Generation of Local Adjunct Languages
Note on Constrained Long Choice with Multiple Beginning Elements
Computational Complexity of Random Acess Stored Program Machines
Arithmetizing Classes Around NC\textsf{NC} 1 and L\textsf{L}
Generalizations of a Theorem of Dolezal
Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic
On the Depth Complexity of Formulas
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers
Nondeterminisic Sublinear Time Has Measure 0 in P
Toward Maximizing the Quality of Results of Dependent Tasks Computed Unreliably
Structure of the Boundary of the Attainable Set in Certain Nonlinear Systems
A Simple Optimal Solution for the Temporal Precedence Problem on Pure Pointer Machines
OBDD-Based Cryptanalysis of Oblivious Keystream Generators
The subset sum game revisited
Dynamic Multiple-Message Broadcast: Bounding Throughput in the Affectance Model
Computation and Logic in the Real World: CiE 2007
On Approximate Jumbled Pattern Matching in Strings
Axiomatizing Kolmogorov Complexity
The Power of Nondeterminism and Randomness for Oblivious Branching Programs
Guest Editorial: Special Issue on Approximation and Online Algorithms
Bijective Linear Time Coding and Decoding for k -Trees
Structural Analysis of Polynomial-Time Query Learnability
Essentially Every Unimodular Matrix Defines an Expander
Optimal Enumerations and Optimal Gödel Numberings
Adaptive Logspace Reducibility and Parallel Time
Graph Expressions and Graph Rewritings
Polynomial-Size Binary Decision Diagrams for the Exactly Half- d -Hyperclique Problem Reading Each Input Bit Twice
Distributed Object Location in a Dynamic Network
A New Performance Measure for Stochastic Optimization in Hilbert Space
On Avoiding Spare Aborts in Transactional Memory
Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System
Generic Results for Concatenation Hierarchies
Self-Stabilizing Leader Election in Dynamic Networks
Dimension Extractors and Optimal Decompression
The Conjugacy Problem in Free Solvable Groups and Wreath Products of Abelian Groups is in TC 0
P-selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP
Decision Problems Concerning L Systems
Endomorphisms of Irreducible Subshifts of Finite Type
Short lists with short programs from programs of functions and strings
On the Power of 1-Tape Off-Line ATMs Running in a Bounded Number of Reversals
Yet Another Proof of the Cascade Decomposition Theorem for Finite Automata
DCAS-Based Concurrent Deques
Recursive Order Estimation of Stochastic Control Systems
The Most Points Connected-Covering Problem with Two Disks
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
On Algorithmic Statistics for Space-bounded Algorithms
Factorizing Strings into Repetitions
On Perturbing Lyapunov Functions
Extremal Problems in Linear Topological Spaces. I
Correction: Space Bounds for a Game on Graphs
Sitting Closer to Friends than Enemies, Revisited
(Worst-case) Optimal Adaptive Dynamic Bitvectors
Editors' Foreword
Partition Into Triangles on Bounded Degree Graphs
On Lower Bounds of the Closeness Between Complexity Classes
A Constructive Generalization of the Borel-Cantelli Lemma with Application to the Complexity of Infinite Strings
On the Price of Heterogeneity in Parallel Systems
A Method for Minimizing the Number of States for a Restricted Class of Incompletely Specified Sequential Machines
Quadratic Sequential Computations of Boolean Mappings
Bottom-up and Top-down Tree Transformations - A Comparison
Real-Time Recognition of Substring Repetition and Reversal
On Non-principal Arithmetical Numberings and Families
The Reflection Complexity of Sequences Over Finite Alphabets
Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks
On the Periodic Solutions of the Matrix Riccati Equation
Guest Editor's Foreward
Characterizations and Directed Path-Width of Sequence Digraphs
Bounded Turing Reductions and Data Processing Inequalities for Sequences
Asymptotic Properties of Expansive Homeomorphisms
Optimal q-Markov COVER for Finite Wordlength Implementation
Pushdown Tree Automata
Multi-Linearity Self-Testing with Relative Error
Towards Optimal Degree Distributions for Left-Perfect Matchings in Random Bipartite Graphs
Composition Closure of Linear Extended Top-down Tree Transducers
Sofic Tree-Shifts
Power of Interconnections and of Nondeterminism in Regular Y-Tree Systolic Automata
Holant Problems for 3-Regular Graphs with Complex Edge Functions
Time and Space Complexity for Splicing Systems
Mappings and Grammars on Trees
On the Group of Automorphisms of Strongly Connected Automata
Identification and Filtering
Unit Read-once Refutations for Systems of Difference Constraints
Distributed Streams Algorithms for Sliding Windows
Two-Way Automata Characterizations of L/poly Versus NL
Observations on Measure and Lowness for \Delta^p_2
Computing Nash Equilibria for Scheduling on Restricted Parallel Links
Lie Algebraic Representation Results for Nonstationary Evolution Operators
Log-Space Algorithms for Paths and Matchings in k-Trees
Distinguishing Two Probability Ensembles with One Sample from each Ensemble
Counter Machines and Counter Languages
Process Algebra with Strategic Interleaving
Broadcasting Spanning Forests on a Multiple-Access Channel
Evaluating Datalog via Tree Automata and Cycluits
On Delivery Times in Packet Networks under Adversarial Traffic
From Tree Automata to String Automata Minimization
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series
Target Set Selection Parameterized by Vertex Cover and More
Relationships between Pushdown Automata with Counters and Complexity Classes
The Lazy Adversary Conjecture Fails
The Computational Complexity of Iterated Elimination of Dominated Strategies
Some Formal Results about Stratificational Grammars and Their Relevance to Linguistics
Foreword: a Commemorative Issue for Alan L. Selman
Complexity-Theoretic Hierarchies Induced by Fragments of Gödel's T
Categories of Semimodules: The Categorical Structural Properties of Transition Systems
On Characteristics of Information System Homomorphisms
An Embedding Theorem for Contracting Homeomorphisms
Some Perturbation Problems in the Theory of Integral Equations
An analytic System with a Computable Hyperbolic Sink Whose Basin of Attraction is Non-Computable
Probabilistic Length-Reducing Two-Pushdown Automata
Editorial Message
On Decidability of Theories of Regular Languages
A Self-Tester for Linear Functions over the Integers with an Elementary Proof of Correctness
Productivity of Edalat-Potts Exact Arithmetic in Constructive Type Theory
Datatype-Generic Termination Proofs
Canonical Systems which Produce Periodic Sets
Regionally Almost Periodic Transformation Groups
Preface of STACS 2007 Special Issue
Preface of the Special Issue on Theoretical Aspects of Computer Science (2018)
One-Way Multihead Finite Automata and 2-Bounded Languages
On Multidimensional Generalized Homogeneous Random Fields in R^n;
Commuting Continuous Flows on Manifolds
A Note on Balanced Immunity
Probabilistic Automata and Stochastic Transformations
Admissibility and Integra Operators
Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest
Statistical Properties of Finite Sequences with High Kolmogorov Complexity
Top-down Tree Transducers with Regular Look-ahead
Absolute Results Concerning One-Way Functions and Their Applications
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs
2-Balanced Sequences Coding Rectangle Exchange Transformation
A Model for Pattern Perception with Musical Applications Part I: Pitch Structures as Order-Preserving Maps
Sharply Bounded Alternation and Quasilinear Time
Editorial: Special Issue on "Theoretical Aspects of Computer Science" (STACS 2015)
Characterizations of the Decidability of Some Problems for Regular Trace Languages
Two Sources Are Better than One for Increasing the Kolmogorov Complexity of Infinite Sequences
On the Usefulness of Bifaithful Rational Cones
The Navigational Power of Web Browsers
Predicting the Future of Functions on Flows
Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings
Context-Sensitive Immediate Constituent Analysis: Context-Free Languages Revisited
Flit-Serial Packet Routing on Meshes and Tori
Correction to: Parameterized Complexity of Min-Power Asymmetric Connectivity
Editorial: Special Issue on International Workshop on Combinatorial Algorithms (IWOCA 2019)
Approximability of Clausal Constraints
Fixed Points of Contraction Mappings on Probabilistic Metric Spaces
Representation Theorems for Analytic Machines and Computability of Analytic Functions
Polynomial Enumeration of Multidimensional Lattices
On the Gap Between Trivial and Nontrivial Initial Segment Prefix-Free Complexity
One-Way Functions Using Algorithmic and Classical Information Theories
Causality for Nonlinear Systems in Hilbert Space
Characterisation of Limit Measures of Higher-Dimensional Cellular Automata
Fixpoint Logics over Hierarchical Structures
Relations Between Varieties of Kolmogorov Complexities
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is)
Contrôlabilité des systèmes bilinéaires
Images of AFL under Certain Families of Homomorphisms
Deciding Twig-definability of Node Selecting Tree Automata
The Minimum Tollbooth Problem in Atomic Network Congestion Games with Unsplittable Flows
Chinese Remaindering with Multiplicative Noise
An Outer-Measure Approach for Resource-Bounded Measure
A Note on Dense and Nondense Families of Complexity Classes
Comparing Representations for Function Spaces in Computable Analysis
Preface of STACS 2020 Special Issue
Some Structural Properties of Generalized Automata and Algebras
A Stochastic Integral Equation in Hilbert Space with a Discrete Version and Application to Stochastic Systems
On Approximation Scheme Preserving Reducibility and Its Applications
A Cubic Kernel for Feedback Vertex Set and Loop Cutset
The Effect of Synchronicity on the Behavior of Autonomous Mobile Robots
On Empirical Meaning of Randomness with Respect to Parametric Families of Probability Distributions
Minimal Solutions of Paull-Unger Problems
On Generalized Connection Caching
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees
Grasp and Delivery for Moving Objects on Broken Lines
Exploration of Dynamic Cactuses with Sub-logarithmic Overhead
Enumerations and Completely Decomposable Torsion-Free Abelian Groups
Scope Consistency: A Bridge between Release Consistency and Entry Consistency
The Complexity of Grid Coloring
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
On Efficient Deterministic Simulation of Turing Machine Computations Below Logspace
Stochastic Cellular Automata Solutions to the Density Classification Problem - When Randomness Helps Computing
Random Access in Persistent Strings and Segment Selection
Network Characterizations for Excluding Braess's Paradox
Finding Similar Users in Social Networks
On Preserving Stability of Volterra Integral Equations under a General Class of Perturbations
Semiflows Associated with Compact and Uniform Processes
A Simple 3-Edge-Connected Component Algorithm
Linear-Time Snapshot Implementations in Unbalanced Systems
Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via Semi-Smoothness
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling
A Model for Pattern Perception with Musical Applications Part III: The Graph Embedding of Pitch Structures
A Combinatorial Analysis for the Critical Clause Tree
Generalized Theorems on Relationships Among Reducibility Notions to Certain Complexity Classes
An Effective Carathéodory Theorem
Semi-Flows on Spaces of Probability Measures
Permutation Automata
Terminal Manifolds and Switching Locus
On a Local Protocol for Concurrent File Transfers
An Almost Quadratic Time Algorithm for Sparse Spliced Alignment
Local Limit Properties for Pattern Statistics and Rational Models
A Universal Topological Transformation Group in L²(G \times G)
Synchronization of Interacting Automata
Preface to Special Issue on Algorithmic Game Theory - Dedicated to the Memory of Berthold Vöcking
Approximate Self-Assembly of the Sierpinski Triangle
Minimization Problems for Parity OBDDs
Distributed Approximation of Capacitated Dominating Sets
Computing the Maximum Overlap of Two Convex Polygons under Translations
Topological Entropy and Measure-Theoretic Entropy for Automorphisms on Compact Groups
A Kleene Theorem for Weighted Tree Automata
Cores of Targets in Linear Control Systems
Right Topological Groups, Distal Flows, and a Fixed-Point Theorem
Recurrent Words for Substitution
Limit Complexities Revisited
Static Strategies for Worksharing with Unrecoverable Interruptions
Tell Me Who I Am: An Interactive Recommendation System
Complexity of Approximating CSP with Balance / Hard Constraints
The Lattice of Minimal Realizations of Response Maps Over Rings
Exponential Sums and Circuits with a Single Threshold Gate and Mod-Gates
Encoding Invariance in Average Case Complexity
Relating and Contrasting Plain and Prefix Kolmogorov Complexity
A Note on Special Thue Systems with a Single Defining Relation
Classes of Bounded Nondeterminism
Vertex Cover Problem Parameterized Above and Below Tight Bounds
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
On the Stability of Asynchronous Iterative Processes
Operator Factorization on Partially Ordered Hilbert Resolution Spaces
Polynomial Time Introreducibility
Guest Editorial: Special Issue on Algorithmic Game Theory
Modular Cosntruction of an Efficient 1-Bit Byzantine Agreement Protocol
Lie Algebraic Canonical Representations in Nonlinear Control Systems
Algorithms to Compute Minimum Cycle Basis in Directed Graphs
Equational Elements in Additive Algebras
Efficient On-Line Frequency Allocation and Call Control in Cellular Networks
Models of Deterministic Systems