yusuke1997/dblp-id-title huggingface dataset:
The Malliavin Calculus and its Application to Second Order Parabolic Differential Equations: Part I
Generating Instances for MAX2SAT with Optimal Solutions
Generalized Semimagic Squares for Digital Halftoning
On Tradeoffs Between Width- and Fill-like Graph Parameters
Perturbations of Open Sets of Attainability
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete
Transformations of Structures: an Algebraic Approach
Separating Complexity Classes Related to Bounded Alternating \omega-Branching Programs
Dynamic Analysis of the Arrow Distributed Protocol
From a Zoo to a Zoology: Towards a General Theory of Graph Polynomials
The Malliavin Calculus and its Application to Second Order Parabolic Differential Equations: Part II
On the Semigroup of a Linear Nonsingular Automaton
Regular Prefix Relations
Highly-Efficient Wait-Free Synchronization
String Attractors of Some Simple-Parry Automatic Sequences
New Results on the Remote Set Problem and Its Applications in Complexity Study
Lower Bounds for Tropical Circuits and Dynamic Programs
STACS 2008 Foreword
On the Point Transitivity of Symbolic Flows
A Strange Application of Kolmogorov Complexity
Lie and Morse Theory for Periodic Orbits of Vector Fields and Matrix Riccati Equations, I: General Lie-Theoretic Methods
Two Skew-Binary Numeral Systems and One Application
Bulk Synchronous Parallel Algorithms for the External Memory Model
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
It is Decidable Whether a Monadic Thue System is Canonical Over a Regular Set
Effective Hausdorff Dimension in General Metric Spaces
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
On a Stochastic Integral Equation of the Volterra Type
Computing the Optimal Bridge between Two Polygons
Genericity of Weakly Computable Objects
Automatic Maps in Exotic Numeration System
Exposing Graph Uniformities via Algebraic Specification
A Priority Queue in Which Initialization and Queue Operations Take O(log log D) Time
DNA Sequencing and String Learning
Online Scheduling of Parallel Programs on Heterogeneous Systems with Applications to Cilk
On the Complexity of Finite, Pushdown, and Stack Automata
Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model
New Graph Decompositions with Applications to Emulations
Simultaneous Strong Separations of Probabilistic and Unambiguous Complexity Classes
Holographic Algorithms on Domains of General Size
Online Scheduling FIFO Policies with Admission and Push-Out
Averages of Functions and Ergodic Measures in F-Spaces
Higher Randomness and Forcing with Closed Sets
Automatable Verification of Sequential Consistency
A Special Case of a Unary Regular Language Containment
Guest Editorial: Computer Science Symposium in Russia
Local Isomorphismus and Local Parallelizability in Dynamical Systems Theory
The Equivalence of pre-NTS Grammars is Decidable
Functional Expansions for Nonlinear Discrete-Time Systems
Free Gerbiers and Nets
Tilings and Submonoids of Metabelian Groups
Inverse Limits and Embedding of Compact Totally Disconnected Machines
Strong Stability of Perturbed Systems of Volterra Integral Equations
Finitary and Infinitary Interpretations of Languages
Unidirectional Lambek Grammars in Polynomial Time
Enhancing the Computation of Distributed Shortest Paths on Power-law Networks in Dynamic Scenarios
A Simple and Fast Min-Cut Algorithm
A Necessary and Sufficient Condition for Planar Flows
Decomposition of Linear Sequential Machines
Depth as Randomness Deficiency
Scheduling MapReduce Jobs on Identical and Unrelated Processors
Cops and Robber Game Without Recharging
An Efficient Algorithm for Generating Prüfer Codes from Labelled Trees
Error Detection in Precedence Parsers
Variation Ranks of Communication Matrices and Lower Bounds for Depth-Two Circuits Having Nearly Symmetric Gates with Unbounded Fan-In
Class Constrained Bin Covering
Optimizing Traffic in DSM Clusters: Fine-Grain Memory Caching versus Page Migration/Replication
Maximally Independent Sets, Minimal Generating Sets, and Irreducibles
Irregular Total Labellings of Generalized Petersen Graphs
Computability in Europe 2009
A Comparison of Asymptotically Scalable Superscalar Processors
Finite Canonical Rewriting Systems for Congruences Generated by Concurrency Relations
It's All a Matter of Degree - Using Degree Information to Optimize Multiway Joins
Sorting and Counting Networks of Arbitrary Width and Small Depth
Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group
Global Observability of Flows on the Torus: An Application to Number Theory
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs
On Restricted Turing Computability
A Category Theory for Programming Languages
The Universality of Higher-Order Attributed Tree Transducers
Deterministic Representation of Probabilistic Systems by Ergodic Machines
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
The Complexity of Compressed Membership Problems for Finite Automata
Good r-divisions Imply Optimal Amortized Decremental Biconnectivity
Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes
Differential Geometry of a Parametric Family of Invertible Linear Systems - Riemannian Metric, Dual Affine Connections, and Divergence
Universal Dynamical Systems
Performance of Scheduling Policies in Adversarial Networks with Non-synchronized Clocks
Limit Points which are not Sequentially Attainable
Three Write Heads Are as Good as k
A Framework for Polynomial-Time Query Learnability
Feasible Analysis, Randomness, and Base Invariance
Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation
Special issue on algorithmic game theory (SAGT 2019)
The Use of a Synchronizer Yields the Maximum Computation Rate in Distributed Networks
The Existence of Solutions, Stability, and Linearization of Volterra Systems
Theory of Computation at CiE 2005
Approximately Fair Cost Allocation in Metric Traveling Salesman Games
On-line Stream Merging with Max Span and Min Coverage
Iterated Linear Control and Iterated One-Turn Pushdowns
Satisfiability Algorithm for Syntactic Read-k-times Branching Programs
Additive Number Theory via Automata Theory
On the Expressiveness of Single-Pass Instruction Sequences
Sophistication vs Logical Depth
Trajectories and the Attainable Set of an Abstract Linear Control System
Optimal High-Performance Parallel Text Retrieval via Fat-Trees
An Approach To Emulating Separable Graphs
Pi-Sigma-Pi Threshold Formulas
Computational Complexity of Certain Problems Related to Carefully Synchronizing Words for Partial Automata and Directing Words for Nondeterministic Automata
FNB: Fast Non-Blocking Coordinated Checkpointing Protocol for Distributed Systems
A Faster FPT Algorithm for the Maximum Agreement Forest Problem
Representation of a Word Function as the Sum of Two Functions
An Improved Stability Bound for Binary Exponential Backoff
Homomorphisms of Expansive Transformation Groups
Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs
Max-plus Algebraic Description of Evolutions of Weighted Timed Event Graphs
Store-and-Forward Multicast Routing on the Mesh
On Envy-Free Revenue Approximation for Combinatorial Buyers with Budgets
On Scheduling Parallel Tasks at Twilight
Admissibility Results on Subspaces of C(R, R^n) and LL^p(R, R^n)
Sequences with Minimal Block Growth
Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures
The Range of a Vector Measure with Values in a Montel Space
On Time versus Space III
Context-Free Languages and Rudimentary Attributes
New Problems Complete for Nondeterministic Loc Space
Representations of Numbers and Finite Automata
Embedding Complete Binary Trees Into Star and Pancake Graphs
Improved Lower Bound for Online Strip Packing
Constant Unary Constraints and Symmetric Real-Weighted Counting Constraint Satisfaction Problems
Estimating the Volume of Solution Space for Satisfiability Modulo Linear Real Arithmetic
Randomness, Stochasticity, and Approximations
Topological Approach to Multivalued Information System
The (Non)Enumerability of the Determinant and the Rank
On Induced Transformations of Bernoulli Shifts
A Unifying Approach to Algebraic Systems Over Semirings
A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity
Distributionally Hard Languages
Quantum Nondemolition Filters
Hardness of Approximation for Knapsack Problems
Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays
On Finite 0-Simple Semigroups and Graph Theory
Structure of Polynomial-Time Approximation
Lifting Dynamical Properties
A Note on Finitely-Valued and Finitely Ambiguous Transducers
Constant Approximation Algorithms for Rectangle Stabbing and Related Problems
Compact Labeling Scheme for XML Ancestor Queries
Dolezals's Theorem Revisited
An Observation on Probability Versus Randomness with Applications to Complexity Classes
Algebraic Specification of Data Types: A Synthetic Approach
Recursive Paths in Cross-Connected Trees and an Application to Cell Spaces
On Realization of Nonlinear Systems Described by Higher-Order Differential Equations
On "Provable" Analogs of P and MP
The Proximal Relation in a Class of Substitution Minimal Sets
Compactness and Asymptotic Stability
Records of Turing Machines
Containment of Conjunctive Queries on Annotated Relations
Path-Disruption Games: Bribery and a Probabilistic Model
Some Hard Problems on Matroid Spikes
Complexity of Equations over Sets of Natural Numbers
Regular Languages and Stone Duality
Compelled Operations and Operations of Degree P
On Jump-Deterministic Pushdown Automata
A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars
Nonpreemptive Coordination Mechanisms for Identical Machines
Preservation of Normality by Non-Oblivious Group Selection
Multihead Two-Way Probabilistic Finite Automata
Quasi-dynamical Systems
Exact Localisations of Feedback Sets
Approximation Algorithms for Time-Constrained Scheduling on Line Networks
Improved Parameterized Algorithms for Cluster Vertex Deletion
Network Formation for Asymmetric Players and Bilateral Contracting
Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
Simple Wriggling is Hard Unless You Are a Fat Hippo
A Functional Approach to Fixed-Point Analysis of Noncompact Operators
On Digital Nondeterminism
Observations about Bounded Languages and Developmental Systems
A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network
A. Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction
Fault-Tolerant Sequential Scan
The lambda -Calculus and the Unity of Structural Proof Theory
An Order-Algebraic Definition of Knuthian Semantics
Algebraic Decision Procedures for Local Testability
The Expressive Power of Bijections over Weakly Arithmetized Structures
Comparisons Between Some Pumping Conditions for Context-Free Languages
Subclasses of Ptime Interpreted by Programming Languages
On Dynamical Systems of Characteristic O^+
Speeding up dynamic programming in the line-constrained k-median
Decomposition of Linear Sequential Machines. II
Structure and Importance of Logspace-MOD Class
Guest Editorial: Special Issue on Database Theory
Maximum k -Splittable s , t -Flows
The Failure Discovery Problem
Une Hiérarchie des Parties Rationelles de N²
The Complexity of the Descriptiveness of Boolean Circuits over Different Sets of Gates
On the Equivalence and Containment Problems for Context-Free Languages
Abstract Scattering for Nonlinear Evolution Equations
Minimal-Program Complexity of Pseudo-Recursive and Pseudo-Random Sequences
Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems
Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Cluster Editing for Multi-Layer and Temporal Graphs
On Asymptotic Stability in Dynamical Systems
Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees
A Note on Non-Deterministic Communication Complexity with Few Witnesses
Capturing Points with a Rotating Polygon (and a 3D Extension)
Model-Theoretic Properties of ω-Automatic Structures
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree
Minimal Sets with Discrete Abelian Phase Group
Structural Analysis of the Complexity of Inverse Functions
Space-Bounded Simulation of Multitape Turing Machines
Uniform Simulations of Nondeterministic Real Time Multitape Turing Machines
Foreword of the Special Issue Dedicated to the 2013 Workshop on Approximation and Online Algorithms
Controlled Invariance for Hamiltonian Systems
Toward Online Mobile Facility Location on General Metrics
Transitive Homeomorphisms of the Circle
Comments on the Oblivious Routing Algorithm of Kaklamanis, Krizanc, and Tsantilas in the Hypercube
Optimal Speedup for Backtrack Search on a Butterfly Network
An Application of the Translational Method
On the Complexity of Automatic Complexity
WAOA 2015 Special Issue on TOCS
Indecomposable Local Maps of Tesselation Automata
Distribution of Additive Functions with Respect to Numeration Systems on Regular Languages
Lyapunov Functions and Autonomous Differential Equations in a Banach Space
Recursive Properties of Transformation Groups in Hyperspaces
Rudin-Shapiro Sums Via Automata Theory and Logic
Control Sets on Grammars Using Depth-First Derivations
Corrigendum: Context Free Languages and Rudimentary Attributes
Synthesis of Autosymmetric Functions in a New Three-Level Form
Measure-Preserving Homeomorphisms of the Torus Represent All Finite Entropy Ergodic Transformations
Automaton Semigroups: The Two-state Case
On Bounded Rational Trace Languages
Computing with Time-Varying Data: Sequential Complexity and Parallel Speed-Up
Semantic Preserving Translations
Preface of Special Issue on Theoretical Aspects of Computer Science
Generalized Addressing Schemes for Data Graphs
The Behavior of Clique-Width under Graph Operations and Graph Transformations
On Unification of Terms with Integer Exponents
Special Issue on Distributed Computing
Efficient Scheduling of Strict Multithreaded Computations
Extended Topology and Systems
Stable Multi-Level Monotonic Eroders
Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems
Corrigendum: Speed-ups by Changing the Order in which Sets are Enumerated
Characterizing Programming Systems Allowing Program Self-Reference
Software Engineering with Transactional Memory Versus Locks in Practice
Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams
Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter
Correction to: On the Expressive Power of Linear Algebra on Graphs
On Hierarchical Diameter-Clustering and the Supplier Problem
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers
On Two-Way, Two-Tape Automata
Special Issue on Approximation and Online Algorithms
Efficient Communication Strategies for Ad Hoc Wireless Networks
Transductions of Dags and Trees
A Note on Single Input Controllability for Normal Systems
Upper Semi-Continuous Decompositions of an Are
Robust Parallel Computations through Randomization
Restricted Topological Entropy and Expansive Mappings
On the Asymptotic Stability of Differential Equations in Banach Spaces
Making Local Algorithms Wait-Free: the Case of Ring Coloring
On Edge Irregular Total Labeling of Categorical Product of Two Cycles
Topology of the Moduli Space for Reachable Linear Dynamical Systems: The Complex Case
On the Rejection Rate of Exact Sampling Algorithm for Discrete Gaussian Distributions over the Integers
Local Restrictions from the Furst-Saxe-Sipser Paper
Property Testing Lower Bounds via a Generalization of Randomized Parity Decision Trees
Characterization of Ordered Semigroups Generating Well Quasi-Orders of Words
First- and Second-Order Diffusive Methods for Rapid, Coarse, Distributed Load Balancing
Minimum Cut in O(mlog 2 n) Time
Extending Stochastic and Quantum Functions
Submodular Functions and Rooted Trees
Spinal-Formed Context-Free Tree Grammars
Sequencing from Compomers: The Puzzle
Correction to: Farkas Bounds on Horn Constraint Systems
Dynamic Matrix Rank with Partial Lookahead
On the Relation Between Structured d-DNNFs and SDDs
Minimal Distance of Propositional Models
A Message from the Springer Editorial Team
A Local Implicit Function Theorem and Applications to Systems of Differential Equations
Computational Aspects of M.C. Escher's Ribbon Patterns
Hamiltonian Dynamics with External Forces and Observations
A Decidability Result in Algebraic Language Theory
A Hierarchy below the Halting Problem for Additive Machines
Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic
FKT is Not Universal - A Planar Holant Dichotomy for Symmetric Constraints
A Basic Optimization Problem in Linear Systems
Fixed-Parameter Tractability of (n - k) List Coloring
Normality and Finite-State Dimension of Liouville Numbers
The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet
The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science
Lower Bound Techniques for QBF Expansion
Which XML Schemas are Streaming Bounded Repairable?
On Reduced Thue Systems
Zur Theorie Agorithmisch Abgeschlossener Modellklassen
State Trajectories in Hilbert Resolution Spaces
The Parameterized Approximability of TSP with Deadlines
The Random Members of a Π 1 0 Class
Property Testing of the Boolean and Binary Rank
Degree-Optimal Routing for P2P Systems
Refining Nondeterminism in Context-free Languages
First-Order Orbit Queries
Processor - Time Tradeoffs under Bounded-Speed Message Propagation: Part II, Lower Bounds
Realization Theory of Infinite-Dimensional Linear Systems. Part II
Parameterized Complexity of Voter Control in Multi-Peaked Elections
Parallel Skyline Queries
The Hub Number of Sierpiński-Like Graphs
Image Theorems for Simple Matrix Languages and n-Parallel Languages
On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables
Upper Bounds on Number of Steals in Rooted Trees
Global Structure of Families of Multivariable Linear Systems with an Application to Identification
Approximation algorithms for node and element connectivity augmentation problems
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Self-Reducible Sets of Small Sensity
A Stability Criterion for General Systems
Countable Sofic Shifts with a Periodic Direction
Reaction-Diffusion Automata: Three States Implies Universality
Cloture Votes: n/4-Resilient Distributed Consensus in t+1 Rounds
Perfect Strategies for the Ulam-Rényi Game with Multi-interval Questions
Semitopological Semirings and Pushdown Automata
Prehistoric Graph in Modal Derivations and Self-Referentiality
Closure Properties of Real Number Classes under CBV Functions
Superlinear Deterministic Top-Down Tree Transducers
Completeness for Nondeterministic Complexity Classes
Diagonal Polynomials for Small Dimensions
Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits
On B-Convex Banach Spaces
Techniques for Establishing Star Height of Regular Sets
Strong Attraction and Classification of Certain Continuous Flows
Homeomorphisms with Discrete Centralizers and Ergodic Properties
On Closedness under Switching in Banach Space
Quasi-Realtime Languages
Understanding Retiming Through Maximum Avarage-Delay Cycles
Surjectivity of Functors on Grammars
On the Solution Sets of Three-Variable Word Equations
Computing the k-Visibility Region of a Point in a Polygon
On Boolean Closed Full Trios and Rational Kripke Frames
Closure Properties and Homomorphisms of Time-varying Systems
(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions
Semantics of Context-Free Languages
Parameterized Random Complexity
Categorical and Topological Aspects of Formal Languages
Computing Functions on Asynchronous Anonymous Networks
Generalized Post Embedding Problems
Frobenius's Degree Formula and Toda's Polynomials
Optimal Path Discovery Problem with Homogeneous Knowledge
On the Parameterized Complexity of Computing Balanced Partitions in Graphs
Structural Tractability of Counting of Solutions to Conjunctive Queries
How Many Variables are Needed to Express an Existential Positive Query?
UP and the Low and High Hierarchies: A Relativized Separatin
Analysis of Approximation Algorithms for k -Set Cover Using Factor-Revealing Linear Programs
On Confluence Versus Strong Confluence for One-Rule Trace-Rewriting Systems
Coherence of Reducibilities with Randomness Notions
Commutation with Ternary Sets of Words
An Optimal and Practical Algorithm for the Planar 2-center Problem
Auxiliary Functions and Constructive Specification of General Systems
Set Cover Problems with Small Neighborhood Covers
Simple Context-Free Languages and Free Monadic Recursion Schemes
Computing Interpolating Sequences
Editorial: Fun with Algorithms
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Chains of Full AFL's
How to Prove Impossibility Under Global Fairness: On Space Complexity of Self-Stabilizing Leader Election on a Population Protocol Model
A Local Search Algorithm for the Radius-Constrained k-Median Problem
Interacting Explicit Evidence Systems
Lifting Expansive Homeomorphisms to Symbolic Flows
Fixed Points, Nash Equilibria, and the Existential Theory of the Reals
A Note on Busy Beavers and Other Creatures
Crown Structures for Vertex Cover Kernelization
Online Results for Black and White Bin Packing
Editorial: Special Issue on Computability, Complexity and Randomness
Mixing of Permutations by Biased Transpositions
Bounds on Mincut for Cayley Graphs over Abelian Groups
Polynomially Improved Efficiency for Fast Parallel Single-Source Lexicographic Depth-First Search, Breadth-First Search, and Topological-First Search
Local MST Computation with Short Advice
A Note on Thue Systems with a Single Defining Relation
Avoiding Simplicity is Complex
Sur la structure de l'ensemble d'accessibilité de certains systèmes: Application à l'equivalence des systèmes
Scheduling Without Payments
Modeling Time-Bounded Prefix Kolmogorov Complexity
Geometric Properties of Linearizable Control Systems
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
The Complexity of Finding SUBSEQ( A )
A Variation on the Min Cut Linear Arrangement Problem
Computability of Products of Chainable Continua
Constructing Sets of Functions Which Have a Given F-Cardinality
Duality for Differential Games and Optimal Control
Exact Constructive and Computable Dimensions
Gradually Intractable Problems and Nondeterministic Log-Space Lower Bounds
Editor's Note: Special Issue on Stabilization, Safety, and Security of Distributed Systems
Single-Input Observability of Continuous-Time Systems
Highly Expressive Query Languages for Unordered Data Trees
Practical Constructive Schemes for Deterministic Shared-Memory Access
Straight-line Instruction Sequence Completeness for Total Calculation on Cancellation Meadows
Computing Conformal Maps of Finitely Connected Domains onto Canonical Slit Domains
Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling
Data Spaces with Indirect Addressing
Fast Algorithms for the Shortest Unique Palindromic Substring Problem on Run-Length Encoded Strings
The Update Complexity of Selection and Related Problems
Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete
On Limitations of Structured (Deterministic) DNNFs
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
Topological Arguments for Kolmogorov Complexity
A Search Algorithm for Subshift Attractors of Cellular Automata
Zeros at Infinity for Nonlinear Discrete Time Systems
Approximating MIN 2-SAT and MIN 3-SAT
Cardinality Problems of Composition of Morphisms and Inverse Morphisms
Variants of Top-Down Tree Transducers With Look-Ahead
On Black-Box Transformations in Downward-Closed Environments