yusuke1997/dblp-id-title huggingface dataset:
Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities
Some Results About Finite and Infinite Behaviours of a Pushdown Automaton
New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
Fully Dynamic Matching in Bipartite Graphs
Simultaneous Approximation of Constraint Satisfaction Problems
Better Algorithms for the Pathwidth and Treewidth of Graphs
The Complexity of Hex and the Jordan Curve Theorem
Crossing-Optimal Extension of Simple Drawings
A Dependent LP-Rounding Approach for the k-Median Problem
On the Complexity of Intersecting Regular, Context-Free, and Tree Languages
Local Model Checking for Context-Free Processes
Induction Rules and Termination Proofs
A Theory of Even Functionals and Their Algorithmic Applications
Pairwise-Interaction Games
Forcing, Transition Algebras, and Calculi
Towards a Uniform Topological Treatment of Streams and Functions on Streams
Light Spanners with Small Hop-Diameter
Algebraic Language Theory with Effects
Semigroups and Languages of Dot-Depth 2
IID Prophet Inequality with Random Horizon: Going Beyond Increasing Hazard Rates
Majority Consensus and the Local Majority Rule
Randomized Query Complexity of Sabotaged and Composed Functions
From Primal-Dual to Cost Shares and Back: A Stronger LP Relaxation for the Steiner Forest Problem
Nondeterministic Interactive Refutations for Nearest Boolean Vector
Saturation Problems for Families of Automata
Controller Synthesis and Verification for Markov Decision Processes with Qualitative Branching Time Objectives
A Maximal Entropy Stochastic Process for a Timed Automaton,
Symmetric Graph Properties Have Independent Edges
General Morphisms of Petri Nets (Extended Abstract)
Biprefix Codes and Semisimple Algebras
Temporal Network Optimization Subject to Connectivity Constraints
k-Center Clustering Under Perturbation Resilience
Limited Wavelength Conversion in All-Optical Tree Networks
Efficient Separability of Regular Languages by Subsequences and Suffixes
A New Approach to Maximum Matching in General Graphs
Fast Parallel Constraint Satisfaction
General Bounds for Incremental Maximization
Call Control in Rings
Computations, Residuals, and the POwer of Indeterminancy
Data Structure Lower Bounds for Document Indexing Problems
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
Distributed Broadcast Revisited: Towards Universal Optimality
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)
A Better Approximation Ratio for the Vertex Cover Problem
Extended Chomsky-Schützenberger Theorems
Unexpected Upper Bounds on the Complexity of Some Communication Games
Performance Analysis of UMTS Resource Allocation Strategies using TIPPtool
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
NC Algorithms for Finding a Maximal Set of Paths with Application to Compressing Strings
Bisimulation Metrics for Weighted Automata
Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints
Generalized Comparison Trees for Point-Location Problems
E-Unification Algorithms for a Class of Confluent Term Rewriting Systems
On the Power of Nondeterminism in Dynamic Logic
Parallel Retrieval of Scattered Information
On Dynamic Bit-Probe Complexity
A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
The Equivalence Problem for D0L Systems and its Decidability for Binary Alphabets
On Asynchrony in Name-Passing Calculi
Improving Gebauer's Construction of 3-Chromatic Hypergraphs with Few Edges
Optimal Reachability for Weighted Timed Games
An Upper Bound on the Weisfeiler-Leman Dimension
Distributed Reconfiguration of Maximal Independent Sets
Wagner's Theorem on Realizers
Two-Sets Cut-Uncut on Planar Graphs
Algorithms and Data Structures for First-Order Logic with Connectivity Under Vertex Failures
Hierarchies of One-Way Multihead Automata Languages
Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings
Tree-Walking Automata Cannot Be Determinized
Succinct Representations of Functions
On the Computing Power of One-Way Cellular Arrays
Fast Algorithms for Diameter-Optimally Augmenting Paths
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes
A Parallel Repetition Theorem for All Entangled Games
Generating Partial and Multiple Transversals of a Hypergraph
The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm
Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
Decidability of Fully Quantum Nonlocal Games with Noisy Maximally Entangled States
The Satisfiability Threshold for Non-Uniform Random 2-SAT
On Greedily Packing Anchored Rectangles
Linear Orders in the Pushdown Hierarchy
Power of Cooperation and Multihead Finite Systems
Fully-Scalable MPC Algorithms for Clustering in High Dimension
Linear and Branching Metrics for Quantitative Transition Systems
Dynamic Binary Search
An Automata-Theoretic Model of Idealized Algol - (Extended Abstract)
Sampling with a Black Box: Faster Parameterized Approximation Algorithms for Vertex Deletion Problems
Accessing Multiple Sequences Through Set Associative Caches
Partitioned Chain Grammars
A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs
An Improved Analysis of the ER-SpUD Dictionary Learning Algorithm
Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s - t Paths in Digraphs
The Functions Computed by a Monadic Program Schema with One Location
Limitations of the Upward Separation Technique (Preliminary Version)
Simple Chain Grammars
The Complexity of Approximating the Matching Polynomial in the Complex Plane
Hybrid Trapdoor Commitments and Their Applications
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
The Speed of Convergence in Congestion Games under Best-Response Dynamics
Topological Characterizations of Infinite Behaviours of Transition Systems
Efficient Algorithms for Graph-Related Problems in Computer-Aided Verification (Invited Talk)
About the Derivation Languages of Grammars and Machines
A Time Lower Bound for Satisfiability
Rerouting Flows When Links Fail
Quasi-PTAS for Scheduling with Precedences using LP Hierarchies
A Complete and Decidable Proof System for Call-by-Value Equalities (Preliminary Report)
Online Weighted Cardinality Joint Replenishment Problem with Delay
Groupoids That Recognize Only Regular Languages
Size-Depth Tradeoff in Boolean Formulas
Fully Dynamic Strongly Connected Components in Planar Digraphs
lambda -RBAC: Programming with Role-Based Access Control
Lattices of Logical Fragments over Words - (Extended Abstract)
Algebras for Classifying Regular Tree Languages and an Application to Frontier Testability
Finite-State Dimension
Numeration Systems, Linear Recurrences, and Regular Sets (Extended Abstract)
Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary)
Performance Aspects of Distributed Caches Using TTL-Based Consistency
How to Play in Infinite MDPs (Invited Talk)
Algorithmic Game Theory: A Snapshot
On Randomization Versus Synchronization in Distributed Systems
Hardness of Computing and Approximating Predicates and Functions with Leaderless Population Protocols
Polynomially Bounded Minimization Problems which are Hard to Approximate
Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata
Finding Is as Easy as Detecting for Quantum Walks
Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree
An Algebraic Approach to Communication Complexity
Third International Colloquium on Automata, Languages and Programming, University of Edinburgh, UK, July 20-23, 1976
Semantics for Nondeterministic Asynchronous Broadcast Networks
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds
Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory
Intersection Types and Properties of Lambda Terms
The Approximation of Maximum Subgraph Problems
Completing the Temporal Picture
Maximum Bipartite vs. Triangle-Free Subgraph
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One
About Hoare Logics for Higher-Order Store
Monadic Datalog Containment
Fast Sampling via Spectral Independence Beyond Bounded-Degree Graphs
Fault-Tolerance Threshold for a Distance-Three Quantum Code
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
Online and Feasible Presentability: From Trees to Modal Algebras
Asynchronous Perfectly Secure Communication over One-Time Pads
A Completeness Theorem for Recursively Defined Types
Fully Dynamic MIS in Uniformly Sparse Graphs
Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
Tuple Sequences and Indexes
The VLSI Revolution in Theoretical Circles
Aliased Register Allocation for Straight-Line Programs Is NP-Complete
What Can Oracles Teach Us About the Ultimate Fate of Life?
La Reconnaissance des Facteurs d'un Language Fini dans un Texte en Temps Lineaire (Resume)
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
Õptimal Dynamic Time Warping on Run-Length Encoded Strings
Deterministic Techniques for Efficient Non-Deterministic Parsers
Controlled Quantum Amplification
Practical Approximation Schemes for Maximum Induced-Subgraph Problems on K_{3, 3}-free or K_5-free Graphs
Faster Semi-Streaming Matchings via Alternating Trees
Asynchronous Cellular Automata for Infinite Traces
On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages
Structural Operational Semantics and Bisimulation as a Congruence (Extended Abstract)
Synthesis of Uninitialized Systems
Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set
A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
Identity-Based Encryption Gone Wild
Improved Bounds for Flow Shop Scheduling
Chomsky-Schützenberger Representations for Families of Languages and Grammatical Types
Recursive Stochastic Games with Positive Rewards
Credentials-Based Authorization: Evaluation and Implementation
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product
Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local Search
On k-Repetition Free Words Generated by Length Uniform Morphisms Over a Binary Alphabet
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs
How to Hide a Clique?
Tight Bounds for Linkages in Planar Graphs
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
Why Computational Complexity Requires Stricter Martingales
Locally Commutative Categories
A Distributed Abstract Machine for Safe Ambients
Con Constructing LL(k) Parsers
Difficult Configurations - On the Complexity of LTrL
Bisimulation Invariant Monadic-Second Order Logic in the Finite
Foundations of Wide Area Network Computing, F-WAN 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002
Fine-Grained Derandomization: From Problem-Centric to Resource-Centric Complexity
Informational Systems with Incomplete Information
Fourier Conjectures, Correlation Bounds, and Majority
Lower Bounds for Online Integer Multiplication and Convolution in the Cell-Probe Model
Un critère de rationnalité des langages algébriques
An Improved Master Theorem for Divide-and-Conquer Recurrences
Geodesic Obstacle Representation of Graphs
Fast Distributed Coloring Algorithms for Triangle-Free Graphs
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits
Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps
Approximation Algorithms for Optimal Hopsets
Union-Find with Constant Time Deletions
Sample-Based Distance-Approximation for Subsequence-Freeness
On the Hardness of Losing Weight
Canadians Should Travel Randomly
Beyond PCSP(1-in-3, NAE)
Syntactic Control of Concurrency
Faster Algorithms for Bounded Tree Edit Distance
Proof Systems for Retracts in Simply Typed Lambda Calculus
Arithmetic Circuit Lower Bounds via MaxRank
The Taming of the Semi-Linear Set
Kernelization, Proof Complexity and Social Choice
Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
Automatic Synthesis of Real Time Systems
On Minimal Unsatisfiability and Time-Space Trade-offs for k -DNF Resolution
Robust Simulations and Significant Separations
Threshold Rates of Code Ensembles: Linear Is Best
The Propositional Mu-Calculus is Elementary
Truthful Matching with Online Items and Offline Agents
Completion of Finite Codes with Finite Deciphering Delay
What Is a Pure Functional?
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
Kleene Algebra with Equations
Factor Graphs, Failure Functions and BI-Trees
A Decidable Characterization of Locally Testable Tree Languages
Efficient Approximations for the Online Dispersion Problem
Reachability in Networks of Register Protocols under Stochastic Schedulers
A Proof System for the Parallel Object-Oriented Language POOL
Bi-transductions de forêts
Brief Announcement: Give Me Some Slack: Efficient Network Measurements
There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)
Mathematics, Logic and Computation, Satellite Event of ICALP 2003, Eindhoven, The Netherlands, July 4-5, 2003
Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
A Pseudorandom Generator for Functions of Low-Degree Polynomial Threshold Functions
On the Power of Multiple Reads in a Chip
Deterministic Partially Dynamic Single Source Shortest Paths in Weighted Graphs
Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques
Multi-Round Cooperative Search Games with Multiple Players
More Complicated Questions About Maxima and Minima, and Some Closures of NP
On Maximal Merging of Information in Boolean Computations
Relational Algorithms for k-Means Clustering
Dynamic Algorithms for Graphs of Bounded Treewidth
Program Debugging and Validation Using Semantic Approximations and Partial Specifications
Single-Valued Finite Transduction
A Graph Rewriting Semantics for the Polyadic Calculus
Realizable and Unrealizable Specifications of Reactive Systems
The Expressive Power of Implicit Specifications
The Inverse Shapley Value Problem
On Non-Counting Regular Classes
Lower Space Bounds for Randomized Computation
Nonuniform Learnability
Solving the Robots Gathering Problem
String-to-String Interpretations With Polynomial-Size Output
A Note on Two-Colorability of Nonuniform Hypergraphs
The Complexity of Base Station Positioning in Cellular Networks
Proceedings of the Second Workshop on Cryptography for Ad-hoc Networks, WCAN@ICALP 2006, Venice, Italy, July 16, 2006
An Optimal Separation Between Two Property Testing Models for Bounded Degree Directed Graphs
Gröbner Bases: An Introduction
Optimal Slope Selection
A 2 O(n 1-(1/d) log n) Time Algorithm for d-Dimensional Protein Folding in the HP-Model
Context-Sensitive Grammars Generating Context-Free Languages
The Algebra of Recursively Defined Processes and the Algebra of Regular Processes
A Polynomial Quantum Query Lower Bound for the Set Equality Problem
Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method
Feasible Interpolation for QBF Resolution Calculi
Expressiveness of Probabilistic Modal Logics, Revisited
The Local Nature of List Colorings for Graphs of High Girth
Stochastic Online Metric Matching
Decidability of Graph Neural Networks via Logical Characterizations
Spatial Logics for Bigraphs
Approximation Strategies for Generalized Binary Search in Weighted Trees
Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
Decremental Data Structures for Connectivity and Dominators in Directed Graphs
Logarithmic Weisfeiler-Leman Identifies All Planar Graphs
Algebraic Synchronization Trees and Processes
The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem
Parameterized Intractability of Even Set and Shortest Vector Problem from Gap-ETH
Faster Monotone Min-Plus Product, Range Mode, and Single Source Replacement Paths
Approximate Sparse Linear Regression
Secrecy in Untrusted Networks
An Algebraic Semantics for Busy (Data-Driven) and Lazy (Demand-Driven) Evaluation and its Application to a Functional Language
The Past, Present, and Future of Web Search Engines p
Probabilistic Guarded KAT Modulo Bisimilarity: Completeness and Complexity
On the Power of Ambainis's Lower Bounds
Hyperbolic Recognition by Graph Automata
Near-Optimal Decremental Hopsets with Applications
Optimal Streaming Algorithms for Submodular Maximization with Cardinality Constraints
On Fast Decoding of High-Dimensional Signals from One-Bit Measurements
New Upper Bounds for Generalized Intersection Searching Problems
Modular Compiler Descriptions Based on Abstract Semantic Data Types (Extended Abstract)
Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
On the Complexity of Infinite Advice Strings
Refined Analysis and Improvements on Some Factoring Algorithms
Error-Tolerant Combiners for Oblivious Primitives
Flipper Games for Monadically Stable Graph Classes
How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
Automata, Languages and Programming, 8th Colloquium, Acre (Akko), Israel, July 13-17, 1981, Proceedings
On the Representation of Timed Polyhedra
Monodic Fragments of Probabilistic First-Order Logic
The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable
A Comparison of the Properties of Complexity Classes and Honesty Classes
Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition
Holographic Algorithms: The Power of Dimensionality Resolved
Fully-Dynamic Bin Packing with Little Repacking
Functional Closure Properties of Finite ℕ-Weighted Automata
Randomized Self-assembly for Approximate Shapes
Hiding Pebbles When the Output Alphabet Is Unary
Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract)
Testing Membership in Commutative Transformation Semigroups
Checking Equality and Regularity for Normed BPA with Silent Moves
A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption
Models and Termination of Proof Reduction in the lambda Pi-Calculus Modulo Theory
Approximation Algorithms for 𝓁 p -Shortest Path and 𝓁 p -Group Steiner Tree
T(A) = T(B)?
On Recognizable Subsets of Free Partially Commutative Monoids
Solving Linear Programming with Constraints Unknown
Estimating the Frequency of a Clustered Signal
Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable
Program Result Checking: A New Approach to Making Programs More Reliable
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Finite State Transformations of Images
Graph Exploration: The Impact of a Distance Constraint
Learning a Ring Cheaply and Fast
An Optimal Error-Correcting Reduction for Matrix Multiplication
Graph Transformations on the UML Metamodel
The Complexity of the Inequivalence Problem for Regular Expressions with Intersection
Universally Composable Undeniable Signature
Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
Deterministic Maximum Flows in Simple Graphs
Sur une propriete syntactique des relations rationnelles
Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
Symmetric Space-Bounded Computation (Extended Abstract)
Robustness against Power is PSpace-complete
On the Power of Probabilistic Choice in Synchronous Parallel Computations
On the Theory of One-Step Rewriting in Trace Monoids
Arithmetical Completeness in Logics of Programs
On the Complexity of 2D Discrete Fixed Point Problem
Model Checking Succinct and Parametric One-Counter Automata
Deterministic Polylog Approximation for Minimum Communication Spanning Trees
Sparsification of Directed Graphs via Cut Balance
On the Positivity Problem for Simple Linear Recurrence Sequences,
Outline of an Algebraic Theory of Structured Objects
Ushering in a New Era of Algorithm Design
Low-Memory Algorithms for Online Edge Coloring
Linear Automata - Approximation Problem (Extended Abstract)
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems
Streaming Tree Transducers
The Complexity of Presburger Arithmetic with Power or Powers
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
Affiliation-Hiding Envelope and Authentication Schemes with Efficient Support for Multiple Credentials
Finding Short Paths on Polytopes by the Shadow Vertex Algorithm
The Bit Complexity of Dynamic Algebraic Formulas and Their Determinants
The Travelling Salesman Problem in Bounded Degree Graphs
Representing Nested Inductive Types Using W-Types
A Tail Estimate for Mulmuley's Segment Intersection Algorithm
The Fork Calculus
An Optimal Dual Fault Tolerant Reachability Oracle
Labeling Schemes for Weighted Dynamic Trees
Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions
Polynomial Size Test Sets for Context-Free Languages
Tight Bounds for Chordal/Interval Vertex Deletion Parameterized by Treewidth
Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings
Rewriting Measurement-Based Quantum Computations with Generalised Flow
The Complexity of Finding Minimum-Length Generator Sequences (Extended Abstract)
Finding Frequent Items in Data Streams
Collusion in Atomic Splittable Routing Games
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract)
Reservation Exchange Markets for Internet Advertising
On the Skolem Problem for Continuous Linear Dynamical Systems
Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems
Ambiguity and Decision Problems Concerning Number Systems
Congruences for Visibly Pushdown Languages
Application of the Level-2 Quantum Lasserre Hierarchy in Quantum Approximation Algorithms
New Additive Emulators
Stability and Sequentiality in Dataflow Networks
Deterministic Regular Functions of Infinite Words
On Restricted Nonnegative Matrix Factorization
On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete k-Center for Small k
Power of d Choices with Simple Tabulation
Constraint Satisfaction Problems and Finite Algebras
Bridges for Concatenation Hierarchies
Semantic-Based Code Obfuscation by Abstract Interpretation
Coalgebraic Weak Bisimulation from Recursive Equations over Monads
Byzantine Gathering in Polynomial Time
Optimal Coding Theorems in Time-Bounded Kolmogorov Complexity
Language Emptiness of Continuous-Time Parametric Timed Automata
Automata, Languages and Programming, 17th International Colloquium, ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings
Modular Markovian Logic
Reducing Simple Polygons to Triangles - A Proof for an Improved Conjecture
On Improving the Worst Case Running Time of the Boyer-Moore String Matching Algorithm
Idealized Algol with Ground Recursion, and DPDA Equivalence
Formalizing the Development of Agent-Based Systems Using Graph Processes
Symmetric and Economical Solutions to the Mutual Exclusion Problem in a Distributed System (Extended Abstract)
Lower Bounds for Approximate LDCs
On the Locality of Some NP-Complete Problems
A Star-Height Problem in Free Monoids with Partial Communications
Online Load Balancing Made Simple: Greedy Strikes Back
Worst-Case and Average-Case Hardness of Hypercycle and Database Problems