yusuke1997/dblp-id-title huggingface dataset:
Compositional Generation of Home States in Free Choice Systems
Algebraic Program Interpreter APREX2
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, Hannover, Germany, March 8-11, 2017
Temporal Reasoning Under Generalized Fairness Constraints
Finding Irrefutable Certificates for S 2 p via Arthur and Merlin
Bounded Size Dictionary Compression: SC k -Completeness and NC Algorithms
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization
Forward Analysis for WSTS, Part I: Completions
How Common Can Be Universality for Cellular Automata?
Unfairly Splitting Separable Necklaces
A Randomized Polynomial Kernel for Subset Feedback Vertex Set
Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates
The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex
Weighted Picture Automata and Weighted Logics
Linear Approximation of Simple Objects
A Unified Framework of Quantum Walk Search
Robust Fault Tolerant Uncapacitated Facility Location
On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts
Nonclairvoyant Speed Scaling for Flow and Energy
Bounds on the Cover Time of Parallel Rotor Walks
Measure of Parallelism of Distributed Computations
A Simple Protocol for Secure Circuit Evaluation
Worst Case Performance of an Approximation Algorithm for Asymmetric TSP
Hotz-Isomorphism Theorems in Formal Language Theory
Read-Once Branching Programs for Tree Evaluation Problems
An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs
The Field of Reals is not omega-Automatic
On Hotz Groups and Homomorphic Images of Sentential Form Languages
Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case
Lower Bounds for DeMorgan Circuits of Bounded Negation Width
Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
Ultimate Traces of Cellular Automata
Solving Discontinuous Initial Value Problems with Unique Solutions Is Equivalent to Computing over the Transfinite
Lower Bounds for Elimination via Weak Regularity
Tribes Is Hard in the Message Passing Model
Décomposition de Fonctions Rationnelles
Monte Carlo Computability
On the Size of Lempel-Ziv and Lyndon Factorizations
On Isomorphism Testing of Groups with Normal Hall Subgroups
Nested Pebbles and Transitive Closure
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles
Space Hierarchy Results for Randomized Models
The Containment Problem for Unambiguous Register Automata
Polynomial-Time Pseudodeterministic Constructions (Invited Talk)
Structured Operational Semantics for Concurrency and Hierarchy
Interactive Proof Systems and Alternating Time-Space Complexity
Systolic Tree Omega-Languages
Variétés de Semis Groupes et Mots Infinis
On the Existence of Polynomial Time Approximation Schemes for OBDD Minimization (Extended Abstract)
A Model Theoretic Proof of Büchi-Type Theorems and First-Order Logic for N-Free Pomsets
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
The Relation of Two Patterns with Comparable Languages
Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs
New Results on the Generalized Star-Height Problem
Local Normal Forms for First-Order Logic with Applications to Games and Automata
Lower Bounds for Dynamic Algebraic Problems
A Nonlinear Lower Bound on the Practical Combinational Complexity
Periodicity and Unbordered Words: A Proof of Duval?s Conjecture
A Unified and Generalized Treatment of Authentification Theory
Computational Aspects of Logics in Team Semantics (Tutorial)
On Finding the Adams Consensus Tree
A Property of Three-Element Codes
Conflict-free Chromatic Art Gallery Coverage
Lower Bounds for Depth-Three Circuits With Equals and Mod-Gates
Collapsible Pushdown Graphs of Level 2 are Tree-Automatic
Rank-1 Modal Logics Are Coalgebraic
Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
Normal Numbers and Sources for BPP
Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
Amortised Analysis of Dynamic Data Structures (Invited Talk)
Geometry of Numbers and Integer Programming (Summary)
Backdoors to q-Horn
An Order on Sets of Tilings Corresponding to an Order on Languages
Fast FPT-Algorithms for Cleaning Grids
Parallel Computations on Strings and Arrays
Efficient Construction of Hitting Sets for Systems of Linear Functions
Computability Properties of Low-dimensional Dynamical Systems
Probability One Separation of the Boolean Hierarchy
One-Tape Turing Machine and Branching Program Lower Bounds for MCSP
A Compositional Semantics for Concurrent Prolog
Constant-Time Dynamic (Δ+1)-Coloring
On Visibility Representation of Plane Graphs
q-Grammars: Results, Implementation
On Matrix Powering in Low Dimensions
Algorithmics in Exponential Time
A New Definition of Morphism on Petri Nets
Representation of Short Distances in Structurally Sparse Graphs
Inapproximability of Diameter in Super-Linear Time: Beyond the 5/3 Ratio
Complexity of Token Swapping and its Variants
A Placement System for Constrained Blocks with Flexible Shapes
External Selection
A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games
Cycle Cover with Short Cycles
Linear Advice for Randomized Logarithmic Space
Finite Sequentiality of Unambiguous Max-Plus Tree Automata
Multi-linearity Self-Testing with Relative Error
Completeness of Neighbourhood Logic
Approximating the Generalized Terminal Backup Problem via Half-integral Multiflow Relaxation
Solving Systems of Set Constraints using Tree Automata
Algebraic and Logical Characterizations of Deterministic Linear Time Classes
A Trichotomy for Regular Trail Queries
A Dichotomy Theorem for Ordinal Ranks in MSO
On the Expected Number of Nodes at Level k in 0-balanced Trees
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations
On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract)
On the Concatenation of Infinite Traces
Algorithms for Dynamic Speed Scaling
Parallel Algorithm for the Matrix Chain Product and the Optimal Triangulation Problems (Extended Abstract)
The Power of Polynomial Size Omega-Branching Programs
Multicounter Automata with Sublogarithmic Reversal Bounds
Weighted Coloring in Trees
Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata
Executable Higher-Order Algebraic Specifications
Truthful Approximation Mechanisms for Scheduling Selfish Related Machines
New Trends in Quantum Computing
Memory Management for Union-Find Algorithms
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs
Lower Bounds on Black-Box Reductions of Hitting to Density Estimation
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
Unsatisfiable Linear CNF Formulas Are Large and Complex
Fairness in Context-Free Grammars under Canonical Derivations
STACS 88, 5th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 11-13, 1988, Proceedings
Faster Edge Coloring by Partition Sieving
A Solution to Wiehagen's Thesis
Linear Numeration Systems, Theta-Developments and Finite Automata
Recompression: New Approach to Word Equations and Context Unification (Invited Talk)
Preface - 26th International Symposium on Theoretical Aspects of Computer Science
Sharp Indistinguishability Bounds from Non-Uniform Approximations
An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs
Temporal Synthesis for Bounded Systems and Environments
An Optimal Competitive Strategy for Walking in Streets
Fooling One-Sided Quantum Protocols
Cluster Editing on Cographs and Related Classes
Arithmetizing Classes Around NC 1 and L
A Topology for Complete Semirings
Typical Sequences Revisited - Computing Width Parameters of Graphs
Hitting forbidden minors: Approximation and Kernelization
Tutorial on Cellular Automata and Tilings (Tutorial)
Efficient Isomorphism Testing for a Class of Group Extensions
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes
Uniformly Defining Complexity Classes of Functions
One n Remains to Settle the Tree Conjecture
Search versus Decision for Election Manipulation Problems
Delay-Robust Routes in Temporal Graphs
Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals
Existential Second-order Logic over Graphs: A Complete Complexity-theoretic Classification
An Improved Sketching Algorithm for Edit Distance
Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
Catalytic Space: Non-determinism and Hierarchy
Stochastic Cellular Automata Solve the Density Classification Problem with an Arbitrary Precision
Approximating Geometric Bottleneck Shortest Paths
FPTAS for Hardcore and Ising Models on Hypergraphs
Compression and Entropy
Shortest Paths on Polyhedral Surfaces
Characterizing and Deciding MSO-Definability of Macro Tree Transductions
The Intersection Problem for Finite Monoids
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
An Algorithmic View on OVSF Code Assignment
Speeding Up Two String-Matching Algorithms
Separation and the Successor Relation
String Periods in the Order-Preserving Model
Dispersing Obnoxious Facilities on a Graph
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
Randomness, Computability, and Density
Hardness and Algorithms for Rainbow Connectivity
Building Strategies into QBF Proofs
1st Grade - A System for Implementation, Testing and Animation of Graph Algorithms
Algebras of Minimal Rank over Arbitrary Fields
Linear temporal logic for regular cost functions
Cake-Cutting Is Not a Piece of Cake
Packing a Knapsack of Unknown Capacity
Treewidth and Minimum Fill-in of Weakly Triangulated Graphs
The Synthesis Problem of Petri Nets
Decidability and Undecidability of Marked PCP
A Unifying Type-Theoretic Framework for Objects
Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics
Mu-SPEED: A System for the Specification and Verification of Microprocessors
Pure Stationary Optimal Strategies in Markov Decision Processes
Failures Semantics Based on Interval Semiwords is a Congruence for Refinement
An Approximation Algorithm for l infinity Fitting Robinson Structures to Distances
Cyclic Languages and Strongly Cyclic Languages
Binary Matrix Completion Under Diameter Constraints
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds
Communication Complexity of Key Agreement on Small Ranges
Computing Least Fixed Points of Probabilistic Systems of Polynomials
Complexity Classes with Finite Acceptance Types
Two-phase Algorithms for the Parametric Shortest Path Problem
Stabilization Time in Weighted Minority Processes
Independence and Domination on Bounded-Treewidth Graphs: Integer, Rational, and Irrational Distances
Algorithms for SAT Based on Search in Hamming Balls
Logic Programs and Many-Valued Logic
Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices
Competing Provers Yield Improved Karp-Lipton Collapse Results
On Minimum Circular Arrangement
The 2-Attractor Problem Is NP-Complete
Associative-Commutative Deducibility Constraints
The KIV System: A Tool for Formal Program Development
Online Scheduling on Identical Machines with a Metric State Space
On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States
Complete Problems and Strong Polynomial Reducibilities
Scheduling for Weighted Flow Time and Energy with Rejection Penalty
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
Clique-width: When Hard Does Not Mean Impossible
Removable Online Knapsack and Advice
Online Dynamic Power Management with Hard Real-Time Guarantees
Information Distance Revisited
The Power of Local Search: Maximum Coverage over a Matroid
Construction of a Family of Finite Maximal Codes
Finding Minimal Generalizations for Unions of Pattern Languages and Its Application to Inductive Inference from Positive Data
Computability in Higher Types and the Universal Domain P_omega
Genuine Lower Bounds for QBF Expansion
Approximation Schemes for Covering and Packing Problems in Robotics and VLSI
Descriptive Complexity on Non-Polish Spaces
Combining Multiple Heuristics
Economical Caching
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs
Dynamic Maintenance of Monotone Dynamic Programs and Applications
Maintaining Range Trees in Secondary Memory (Extended Abstract)
A Dynamization of the All Pairs Least Cost Path Problem
Space Lower Bounds for the Signal Detection Problem
The Variable Hierarchy of the µ-Calculus Is Strict
SPRAC: A Software Engineering Environment
32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, Garching, Germany, March 4-7, 2015
A Logspace Approximation Scheme for the Shortest Path Problem for Graphs with Bounded Independence Number
Coding with Traces
General Refinement and Recursion Operators for the Petri Box Calculus
The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
Voting and Bribing in Single-Exponential Time
Symmetries and the Complexity of Pure Nash Equilibrium
Supporting Increment and Decrement Operations in Balancing Networks
Some Recent Results on Squarefree Words
Approximation of Spanning Tree Congestion Using Hereditary Bisection
Geometry Models Design System GammaPOM
The Hardness of Decision Tree Complexity
Redundancy in Complete Sets
On Ergodic Linear Cellular Automata over Z m
A Faster Algorithm for Constructing the Frequency Difference Consensus Tree
Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid
STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings
The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms
Trimming of Graphs, with Application to Point Labeling
Pure Dominance Constraints
Testing Linear-Invariant Non-Linear Properties
On Batcher's Merge Sorts as Parallel Sorting Algorithms
If Deterministic and Nondeterministic Space Complexities are Equal for log log n then they are also Equal for log n
Myhill-Nerode Relations on Automatic Systems and the Completeness of Kleene Algebra
Secret Key Agreement from Correlated Data, with No Prior Information
Approximate Sampling and Counting of Graphs with Near-Regular Degree Intervals
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems
Counting Edge-Injective Homomorphisms and Matchings on Restricted Graph Classes
On Disguised Double Horn Functions and Extensions
Tractable QBF by Knowledge Compilation
An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph Grammars
Modification to Planarity is Fixed Parameter Tractable
Real Numbers Equally Compressible in Every Base
On Uniform DOL Words
Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs
TIME vs BITS
On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams
Locally Threshold Testable Languages of Infinite Words
Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash)
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables
A Unified Approach to Tail Estimates for Randomized Incremental Construction
On the Positive Calculus of Relations with Transitive Closure
Decidability of Reachability Problems for Classes of Two Counters Automata
On the Many Faces of Block Codes
A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
Computing Shrub-Depth Decompositions
Deterministic Regular Expressions with Back-References
Unlabeled Data Does Provably Help
Lower Bounds for Set-Blocked Clauses Proofs
Detours in Directed Graphs
Probabilistic Proof Systems - A Survey
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
Beyond Boolean Surjective VCSPs
The Bit Probe Complexity Measure Revisited
Balls into bins via local search: cover time and maximum load
Can You Link Up With Treewidth?
Interprocedurally Analyzing Polynomial Identities
Ambiguity and Communication
Tree Automata with Global Constraints for Infinite Trees
Gap Preserving Reductions Between Reconfiguration Problems
An Approximation Algorithm for Max p-Section
Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
On the Borel Inseparability of Game Tree Languages
AMORE: A System for Computing Automata, MOnoids, and Regular Expressions
From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
Complexity of solutions of equations over sets of natural numbers
Inapproximability Results for Scheduling with Interval and Resource Restrictions
A New Algorithm for MAX-2-SAT
A Model of Behaviour Abstraction for Communicating Processes
Labeling Schemes for Dynamic Tree Networks
Bottom-up automata on data trees and vertical XPath
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
Minimal Transition Systems for History-Preserving Bisimulation
Decidability and Periodicity of Low Complexity Tilings
A Brief History of History-Determinism (Invited Talk)
A Relativization Perspective on Meta-Complexity
Power Consumption in Packet Radio Networks (Extended Abstract)
On the Complexity of Partial Derivatives
Geometric Containment is not Reducible to Pareto Dominance
On the Power of Non-Observable Actions in Timed Automata
Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata
On the Induced Matching Problem
Approximation Algorithms for Minimum Size 2-Connectivity Problems
On the separation question for tree languages
How to Forget a Secret
Generalized Bisimulation in Relational Specifications
Planar Graphs: Logical Complexity and Parallel Isomorphism Tests
Wavelength Management in WDM Rings to Maximize the Number of Connections
Towards Executable Specifications Using Conditional Axioms
Online Paging with Heterogeneous Cache Slots
On Rational Recursive Sequences
Online Matching with Delays and Size-Based Costs
Temporalizing Digraphs via Linear-Size Balanced Bi-Trees
Solvable Black-Box Group Problems Are Low for PP
On Bijections vs. Unary Functions
The Number of Views of Piecewise-Smooth Algebraic Objects
Log-supermodular functions, functional clones and counting CSPs
Distinguishing Short Quantum Computations
Small PCPs with Low Query Complexity
Deciding Equivalence of Finite Tree Automata
Axiomatizing GSOS with Termination
The Complexity of Logic-Based Abduction
Sub-Exponential Time Lower Bounds for #VC and #Matching on 3-Regular Graphs
Unambiguous Separators for Tropical Tree Automata
A Better Upper Bound on the Bisection Width of de Bruijn Networks (Extended Abstract)
Computing Minimum Spanning Trees with Uncertainty
Minimum s-t cut in undirected planar graphs when the source and the sink are close
The Operator Approach to Entropy Games
On the decomposition of k-valued rational relations
AXE: The Syntax Driven Diagram Editor for Visual Languages used in the Software Engineering Environments AxIS
Streaming Complexity of Checking Priority Queues
Parallel Prefetching and Caching Is Hard
Icons and Local Definitions in Logic Programming
Quantifying Homology Classes
One-sided Versus Two-sided Error in Probabilistic Computation
On Symmetric Signatures in Holographic Algorithms
An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality
Markov Decision Processes with Multiple Objectives
A Subquadratic Bound for Online Bisection
Exploiting Dense Structures in Parameterized Complexity
New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata
Asymptotic enumeration of Minimal Automata
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
Decidability of Waek Fairness in Petri Nets
On Competitive On-Line Paging with Lookahead
On Read-k Projections of the Determinant
Analysis of Agglomerative Clustering
Quantum Algorithms for Matching and Network Flows
Using Statistical Encoding to Achieve Tree Succinctness Never Seen Before
Modal Logic Is More Succinct Iff Bi-Implication Is Available in Some Form
Fixed-Parameter Debordering of Waring Rank
Increasing Kolmogorov Complexity
On the Multilinear Complexity of Associative Algebras
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schützenberger and Straubing
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
Trimmed Moebius Inversion and Graphs of Bounded Degree
Tight Bounds for Repeated Balls-Into-Bins
Tight Bounds for Counting Colorings and Connected Edge Sets Parameterized by Cutwidth
Fine-Grained Complexity Theory (Tutorial)
Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution
Stabilization of Branching Queueing Networks
Scheduling at Twilight the Easy Way
An Improved Bound for Random Binary Search Trees with Concurrent Insertions
Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
The Complexity of Resource-Bounded First-Order Classical Logic
Speed-Up Techniques for Shortest-Path Computations
Near-Optimal Algorithms for Point-Line Covering Problems
Improving and Extending the Testing of Distributions for Shape-Restricted Properties
Constant Queue Routing on a Mesh
The Complexity of Knapsack in Graph Groups
STACS 90, 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, February 22-24, 1990, Proceedings
CEC (Conditional Equations Completion)
Centrality Measures Based on Current Flow
Three Optimal Algorithms for Balls of Three Colors
Tree Automata and Logic Programs
Locally Definable Acceptance Types for Polynomial Time Machines
Depth First Search in the Semi-streaming Model
On the Complexity of Protein Similarity Search under mRNA Structure Constraints
Dispersion in Unit Disks
Weakly Unambiguous Morphisms
On Robustness for the Skolem and Positivity Problems
Languages with Bounded Multiparty Communication Complexity
Locating P/poly Optimally in the Extended Low Hierarchy
On Different Reducibility Notions for Function Classes
Efficient Approximation Schemes for Scheduling on a Stochastic Number of Machines
Log-space Algorithms for Paths and Matchings in k-trees
A Search Algorithm for the Maximal Attractor of a Cellular Automaton
Kolmogorov Complexity and Solovay Functions
Order-Invariant MSO is Stronger than Counting MSO in the Finite
Planar Circuits Have Short Specifications
Long Unavoidable Patterns
On Quantum Computation with Some Restricted Amplitudes
Las Vegas Computability and Algorithmic Randomness
Shortest Monotone Descent Path Problem in Polyhedral Terrain
On the Separators on an Infinite Word Generated by a Morphism
On the Planar Monotone Computation of Threshold Functions
Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs
Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier Alternations
Lattices with Many Cycles Are Dense
Chordal Editing is Fixed-Parameter Tractable
Finding Large Independent Sets in Polynomial Expected Time
Small Progress Measures for Solving Parity Games
Specification and Implementation of Concurrently Accessed Data Structures: An Abstract Data Type Approach
On the Complexity of Finding a Local Maximum of Functions on Discrete Planar Subsets
Graphic TSP in Cubic Graphs
Approximate Path Coloring with Applications to Wavelength Assignment in WDM Optical Networks
On the Complexity of the Interlace Polynomial
On the Performance of Networks with Multiple Busses
Theory and Application of Width Bounded Geometric Separator
A Simplicial Model for KB4_n: Epistemic Logic with Agents That May Die
Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves