yusuke1997/dblp-id-title huggingface dataset:
Optimizing Linear Functions with Randomized Search Heuristics - The Robustness of Mutation
Enumerating Extreme Points in Higher Dimensions
On Fixed Point Equations over Commutative Semirings
Joining k- and l-Recognizable Sets of Natural Numbers
Auction Algorithms for Market Equilibrium with Weak Gross Substitute Demands and Their Applications
Testing Equivalence to Design Polynomials
The Computational Complexity of Some Problems of Linear Algebra (Extended Abstract)
Space-Time Trade-offs for Stack-Based Algorithms
The UPS Problem
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra
Parallel Searching on m Rays
Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
Key-Problems and Key-Methods in Computational Geormetry
Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable
Subshifts Defined by Nondeterministic and Alternating Plane-Walking Automata
Computing Minimal Multi-homogeneous Bézout Numbers Is Hard
The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming
Variable time amplitude amplification and quantum algorithms for linear algebra problems
Algorithms for Selfish Agents
Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages
Randomized Query Composition and Product Distributions
Communication Lower Bounds for Distributed-Memory Computations
The Semialgebraic Orbit Problem
Characterisation of an Algebraic Algorithm for Probabilistic Automata
Faster Sparse Suffix Sorting
Generalization Guarantees for Data-Driven Mechanism Design (Invited Talk)
On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem
On Covering Segments with Unit Intervals
Mapping Networks via Parallel kth-Hop Traceroute Queries
Ideal Decompositions for Vector Addition Systems (Invited Talk)
Extended Formulation Lower Bounds via Hypergraph Coloring?
Floats, Integers, and Single Source Shortest Paths
From Pathwidth to Connected Pathwidth
Algorithms for Transposition Invariant String Matching
Efficient Minimization of DFAs with Partial Transition
Lower Bound Techniques for QBF Proof Systems
L_1 Shortest Path Queries among Polygonal Obstacles in the Plane
Algorithms for Visibility Representations of Planar Graphs
On Kernelization for Edge Dominating Set under Structural Parameters
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
An Approximation Algorithm for Distance-Constrained Vehicle Routing on Trees
From Expanders to Better Superconcentrators without Cascading
Isolation Schemes for Problems on Decomposable Graphs
Fixed-Parameter Algorithms for Unsplittable Flow Cover
On Geometric Spanners of Euclidean and Unit Disk Graphs
SLOG: A Logic Interpreter for Equational Clauses
Faster Compact On-Line Lempel-Ziv Factorization
Solving the 2-Disjoint Paths Problem in Nearly Linear Time
Expander Properties in Random Regular Graphs with Edge Faults
On the Confluence of Linear Shallow Term Rewrite Systems
Tight Bounds on the Path Length of Binary Trees
Space Efficient Hash Tables with Worst Case Constant Access Time
Automatic Presentations for Finitely Generated Groups
A Decision Procedure for Well-Formed Linear Quantum Cellular Automata
Separating and Testing
Testing Membership: Beyond Permutation Groups (Extended Abstract)
Sampling Unlabeled Chordal Graphs in Expected Polynomial Time
Semigroup Intersection Problems in the Heisenberg Groups
Methods and Applications of (MAX, +) Linear Algebra
Identity-Preserving Lax Extensions and Where to Find Them
Local Automata and Completion
Functional Oracle Queries as a Measure of Parallel Time
Perpetuality and Strong Normalization in Orthogonal Term Rewriting Systems
A Mahler's theorem for functions from words to integers
Inductive Inference and Reverse Mathematics
Random Sparse Bit Strings at the Threshold of Adjacency
On the Performance of WEAK-HEAPSORT
Separating Counting Communication Complexity Classes
Combining Treewidth and Backdoors for CSP
An FPT Algorithm for Minimum Additive Spanner Problem
Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement
The Analysis of Local Search Problems and Their Heuristics
Time-Optimal Simulations of Networks by Universal Parallel Computers
The Stability of Saturated Linear Dynamical Systems Is Undecidable
Prototype de Venus: Un Outil d'Aide à la Verification de Systemes Communicants
Complexity of the List Homomorphism Problem in Hereditary Graph Classes
Quantum Circuits with Unbounded Fan-out
Compressed Representations of Permutations, and Applications
Compressed Decision Problems in Hyperbolic Groups
Distance Approximating Spanning Trees
37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, Montpellier, France, March 10-13, 2020
Entanglement in Interactive Proof Systems with Binary Answers
Algorithmic Statistics, Prediction and Machine Learning
Asymptotically Optimal Lower Bounds on the NIH-Multi-Party Information Complexity of the AND-Function and Disjointness
Locally Decodable Quantum Codes
On Explicit Constructions of Extremely Depth Robust Graphs
On the Descriptive Complexity of Color Coding
Extracting Best Consensus Motifs from Positive and Negative Examples
Equivalence of F-Algebras and Cubic Forms
Absorbing Patterns in BST-Like Expression-Trees
Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs
The Program Verifier Tatzelwurm
Optimal Simulation of Automata by Neural Nets
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs
Towards a Process Semantics in the Logic Programming Style
Finding an Optimal Alphabet Ordering for Lyndon Factorization Is Hard
Centralized, Parallel, and Distributed Multi-Source Shortest Paths via Hopsets and Rectangular Matrix Multiplication
Combinatorial Rewriting on Traces
Generalized Inner Product Estimation with Limited Quantum Communication
33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, Orléans, France, February 17-20, 2016
Attractors of D-dimensional Linear Cellular Automata
Subgroup Membership in GL(2, Z)
Pattern Matching with Variables: Fast Algorithms and New Hardness Results
On Extendibility of Unavoidable Sets
Complexity and Expressive Power of Ontology-Mediated Queries (Invited Talk)
Connecting Polygonizations via Stretches and Twangs
Improved Approximation Algorithms for (1, 2)-TSP and Max-TSP Using Path Covers in the Semi-Streaming Model
On Using Oracles That Compute Values
On Approximating the Stationary Distribution of Time-reversible Markov Chains
A First Investigation of Sturmian Trees
Characterizing Minimal Interval Completions
Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate
Near-Optimal Generalisations of a Theorem of Macbeath
Efficient Scaling-Invariant Checking of Timed Bisimulation
Interactive Protocols on the Reals
A Combinatorial Design Approach to MAXCUT
Structural Complexity of Omega-Automata
Partially Commutative Lyndon Words
The RELVIEW-System
Average Number of Messages for Distributed Leader Finding in Rings of Processors
A Modal Fixpoint Logic with Chop
On the Average Complexity of Moore's State Minimization Algorithm
Forms of Determinism for Automata (Invited Talk)
A Probabilistic 3-SAT Algorithm Further Improved
The Complexity of Satisfiability Problems over Finite Lattices
Beyond P^(NP) - NEXP
On Sparse Oracles Separating Feasible Complexity Classes
Gapped String Indexing in Subquadratic Space and Sublinear Query Time
Cluster Editing Parameterized Above Modification-Disjoint P₃-Packings
Barrington Plays Cards: The Complexity of Card-Based Protocols
Algebras for Automata: Reasoning with Regularity (Invited Talk)
Automaticity: Properties of a Measure of Descriptional Complexity
Pairwise Preferences in the Stable Marriage Problem
The Complexity of Phylogeny Constraint Satisfaction
Constant-Time Retrieval with O(log m) Extra Bits
Deterministic Asynchronous Automata for Infinite Traces
Causal and Distributed Semantics for Concurrent Processes (Abstract)
Generalized Wong sequences and their applications to Edmonds' problems
Learning Expressions over Monoids
Functional Equations for Data Structures
Canonizing Graphs of Bounded Tree Width in Logspace
Algebraic Results on Quantum Automata
A Polynomial Kernel for Multicut in Trees
The Chi-t-Coloring Problem
Homomorphism Reconfiguration via Homotopy
On Parsimonious Explanations For 2-D Tree- and Linearly-Ordered Data
35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, Caen, France, February 28 - March 3, 2018
Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM
The Alternation Hierarchy for Machines with Sublogarithmic Space is Infinite
A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar Objects
Constructing Light Spanning Trees with Small Routing Cost
Sponsored Search, Market Equilibria, and the Hungarian Method
Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space
Overcoming Intractability in Unsupervised Learning (Invited Talk)
Algorithmic Graph Structure Theory (Tutorial)
Updating Almost Complete Trees or One Level Makes All the Difference
Observational Implementations
A Comparison of Techniques for Sampling Web Pages
Regular Separability in Büchi VASS
The Complexity of the List Homomorphism Problem for Graphs
On Lovász' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version)
Dense Subset Sum May Be the Hardest
Scheduling Dynamic Graphs
The "log Rank" Conjecture for Modular Communication Complexity
Subset Sum in the Absence of Concentration
Algorithmic Properties of Sparse Digraphs
Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-Shortest Induced Paths
Language Learning with a Bounded Number of Mind Changes
External Memory Three-Sided Range Reporting and Top-k Queries with Sublogarithmic Updates
Online Sorting Buffers on Line
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
Algorithmic Game Theory (Tutorial)
Finding Paths with the Right Cost
The Operators min and max on the Polynomial Hierarchy
Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm
Some Results on Derandomization
Hiding Instances in Multioracle Queries
High Quality Consistent Digital Curved Rays via Vector Field Rounding
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
Upper Bounds for Vertex Cover Further Improved
Twin-Width V: Linear Minors, Modular Counting, and Matrix Multiplication
On the Complexity of the Maximum Cut Problem
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games
Reversal Complexity of Multicounter and Multihead Machines
Finding the Largest Empty Rectangle on a Grated Surface
A Characterization of Wreath Products Where Knapsack Is Decidable
An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings
Towards Uniform Certification in QBF
Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint
Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs
Barriers for Faster Dimensionality Reduction
Polynomial Kernelizations for MIN F + Pi 1 and MAX NP
An Approximation Algorithm for #k-SAT
An Algebraic Transformation System for Occam Programs
Being Efficient in Time, Space, and Workload: a Self-Stabilizing Unison and Its Consequences
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods
Regular Language Matching and Other Decidable Cases of the Satisfiability Problem for Constraints between Regular Open Terms
An 𝒪(3.82 k ) Time FPT Algorithm for Convex Flip Distance
On Complexity Classes and Algorithmically Random Languages (Extended Abstract)
Measuring Learning Complexity with Criteria Epitomizers
The Complexity of Colouring Circle Graphs (Extended Abstract)
Remarks on Generalized Post Correspondence Problem
Evaluating Monotone Circuits on Cylinders, Planes and Tori
Roundings Respecting Hard Constraints
Diverse Collections in Matroids and Graphs
Relation-Sorted Algebraic Specifications with Built-in Coercers: Basic Notions and Results
Prototype of a Verification Tool
Transforming Stacks into Queues: Mixed and Separated Layouts of Graphs
The Complexity of Resolution with Generalized Symmetry Rules
Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
Exploring Subexponential Parameterized Complexity of Completion Problems
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems
Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions
Quantum Query Complexity of Multilinear Identity Testing
Maximum Matchings in Geometric Intersection Graphs
Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols
On the Existential Theory of the Reals Enriched with Integer Powers of a Computable Number
Recursive Combinatorial Structures: Enumeration, Probabilistic Analysis and Random Generation
Improving PPSZ for 3-SAT using Critical Variables
On the Sensitivity Complexity of k-Uniform Hypergraph Properties
Improved Algorithms for the Range Next Value Problem and Applications
Periods and Borders of Random Words
Trimming and Gluing Gray Codes
On the Average Running Time of Odd-Even Merge Sort
The Complexity of Translationally Invariant Problems Beyond Ground State Energies
The arithmetic complexity of tensor contractions
Two Proof Procedures for a Cardinality Based Language in Propositional Calculus
Slightly Non-Linear Higher-Order Tree Transducers
Tropical Effective Primary and Dual Nullstellens"atze
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles
Advice Lower Bounds for the Dense Model Theorem
Generalized Langton's Ant: Dynamical Behavior and Complexity
Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines
Lean Tree-Cut Decompositions: Obstructions and Algorithms
The Dynamic Complexity of Formal Languages
Coloring 3-colorable graphs with o(n^{1/5}) colors
Fixed-Parameter Intractability II (Extended Abstract)
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
Eliminating Recursion in the µ-Calculus
Positionality in Σ⁰₂ and a Completeness Result
28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, Dortmund, Germany, March 10-12, 2011
Optimal Proof Systems for Propositional Logic and Complete Sets
Identifying Efficiently Solvable Cases of Max CSP
The Syntactic Graph of a Sofic Shift
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
A Family of Tag Systems for Paperfolding Sequences
The Edit Distance to k-Subsequence Universality
The Role of Local Algorithms in Privacy (Invited Talk)
Algebraic Characterizations of Small Classes of Boolean Functions
Optimal Oracles for Point-To-Set Principles
STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings
Perfect Resolution of Conflict-Free Colouring of Interval Hypergraphs
On the Containment Problem for Linear Sets
Trichotomy for Integer Linear Systems Based on Their Sign Patterns
Computational Power of One-Way Multihead Finite Automata
Efficient Algorithms for Solving Systems of Linear Equations and Path Problems
The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract)
Comparing Verboseness for Finite Automata and Turing Machines
Table of Contents - 27th International Symposium on Theoretical Aspects of Computer Science
Polynomial Fitting of Data Streams with Applications to Codeword Testing
Proof Complexity of Resolution-based QBF Calculi
Distributed Quantum Interactive Proofs
Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs
New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings
Characterizing Omega-Regularity Through Finite-Memory Determinacy of Games on Infinite Graphs
On the practically interesting instances of MAXCUT
On the Relative Complexity of Subproblems of Intractable Problems
On Local Symmetries and Universality in Cellular Automata
The Aperiodic Domino Problem in Higher Dimension
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank
On the Expressiveness of Deterministic Transducers over Infinite Trees
Succinct Representations of Model Based Belief Revision
MODULOG and the MODULA WorkStation
Geometric Amortization of Enumeration Algorithms
On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages
A Single Source Shortest Path Algorithm for a Planar Distributed Network
Modular Counting CSP: Reductions and Algorithms
Planar Subgraph Isomorphism Revisited
A (5/2)n 2 -Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication
A Simplified Technique for Hidden-Line Elimination in Terrains
A Modal Semantics for the Negation as Failure and the Closed World Assumption Rules
Complete Codes in a Sofic Shift
In-place Linear Probing Sort
On the Successor Function in Non-Classical Numeration Systems
The Plurality Problem with Three Colors
Random Noise Increases Kolmogorov Complexity and Hausdorff Dimension
On the Accepting Power of 2-Tape Büchi Automata
REVE: A Rewrite Rule Laboratory
A Characterization of Strong Learnability in the Statistical Query Model
Splittings, Robustness and Structure of Complete Sets
Energy-Efficient Algorithms for Flow Time Minimization
Enumerating Homomorphisms
Graph Isomorphism is Low for PP
Strictness and Serializability
Structural aspects of tilings
Fine Separation of Average Time Complexity Classes
Best-Of-Two-Worlds Analysis of Online Search
Understanding Maximal Repetitions in Strings
Width of Non-deterministic Automata
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
New Algorithms for Special Cases of the Hidden Line Elimination Problem
Towards an Isomorphism Dichotomy for Hereditary Graph Classes
A Sub-Quadratic Algorithm for the Longest Common Increasing Subsequence Problem
Tight bounds for rumor spreading in graphs of a given conductance
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
Read-once Projections and Formal Circuit Verification with Binary Decision Diagrams
Reconfiguration of Digraph Homomorphisms
The Number of Runs in a String: Improved Analysis of the Linear Upper Bound
Strong Completeness of Coalgebraic Modal Logics
On the Size of the Universal Automaton of a Regular Language
The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems
On the Complexity of Elementary Modal Logics
Lyndon Factorization of Infinite Words
Pseudorandom Generators and the Frequency of Simplicity
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets
Large-Girth Roots of Graphs
Translating Polygons in the Plane
Concurrent Process Equivalences: Some Decision Problems (Abstract)
On the Sparse Set Conjecture for Sets with Low Denisty
On Testing Decision Tree
A Quasi-Polynomial Time Algorithm for Multi-Arrival on Tree-Like Multigraphs
Scheduling Interval Ordered Tasks in Parallel
Deterministic Radio Broadcasting at Low Cost
The Limit Set of Recognizable Substitution Systems
Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width
A Faster Algorithm for the Steiner Tree Problem
Polynomial Time Inference of General Pattern Languages
Continuous Monitoring of Distributed Data Streams over a Time-based Sliding Window
On Approximating Multi-Criteria TSP
Flat Holonomies on Automata Networks
Functions and Relations: The GRAAL System
The Volume of the Union of Many Sheres and Point Inclusion Problems
The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete
An Aperiodic Set of Wang Cubes
Counting Homomorphisms to Cactus Graphs Modulo 2
Model Checking Games for the Quantitative µ-Calculus
36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, Berlin, Germany, March 13-16, 2019
Synthesis for Testability: Binary Decision Diagrams
Spectral Sparsification in the Semi-Streaming Setting
On Vertex Ranking for Permutations and Other Graphs
Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region
Existential Definability over the Subword Ordering
The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography
Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type
Tractable Structures for Constraint Satisfaction with Truth Tables
First-Order Transductions of Graphs (Invited Talk)
31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, Lyon, France, March 5-8, 2014
Parallel Machines and their Communication Theoretical Limits
An Information Theoretic Lower Bound for Broadcasting in Radio Networks
Cross-Composition: A New Technique for Kernelization Lower Bounds
Complexity Classification of Truth Maintenance Systems
Fast and Longest Rollercoasters
Church Synthesis on Register Automata over Linearly Ordered Data Domains
Weisfeiler and Leman's Unlikely Journey from Graph Isomorphism to Neural Networks (Invited Talk)
On Adaptive Dlogtime and Polylogtime Reductions (Extended Abstract)
Varieties of Codes and Kraft Inequality
Error-Correcting Data Structures
Packet Buffering: Randomization Beats Deterministic Algorithms
Fairly Popular Matchings and Optimality
Optimal Lower Bounds on the Multiparty Communication Complexity
On Termination for Faulty Channel Machines
The Relation between Polynomial Calculus, Sherali-Adams, and Sum-of-Squares Proofs
The Open Shop Scheduling Problem
Exact Price of Anarchy for Polynomial Congestion Games
On Presburger Liveness of Discrete Timed Automata
Efficient Oracles and Routing Schemes for Replacement Paths
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
Ground Term Confluence in Parametric Conditional Equational Specifications
Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths
On the Expected Complexity of Distributed Selection
Solving Homogeneous Linear Equations over Polynomial Semirings
A Calculus and Algebra for Distributed Data Management
Upper Tail Estimates with Combinatorial Proofs
Algorithms for Computing Closest Points for Segments
Balanced Coloring: Equally Easy for All Numbers of Colors?
On Sand Automata
Base non finie de varietes
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
Constant Width Planar Computation Characterizes ACC 0
Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
The PCP theorem for NP over the reals
A Complexity Dichotomy for Poset Constraint Satisfaction
A Ramsey Theorem for Finite Monoids
Time-Approximation Trade-offs for Inapproximable Problems
Mind Change Speed-up for Learning Languages from Positive Data
Dynamic Planar Embeddings of Dynamic Graphs
The Query Topology in Logic Programming
On the Fluted Fragment (Invited Talk)
Recursive Automata on Infinite Words
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs
Las Vegas Versus Determinism for One-way Communication Complexity, Finite Automata, and Polynomial-time Computations
Simulation and Bisimulation over One-Counter Processes
Finding Largest Common Embeddable Subtrees
Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices