yusuke1997/dblp-id-title huggingface dataset:
A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization
On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors
Multiway Cuts in Directed and Node Weighted Graphs
Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices
The Average CRI-Length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects
Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
DAGs and Chomsky Hierarchy (Extended Abstract)
Approximating CSPs Using LP Relaxation
Resolving the Complexity of Some Data Privacy Problems
Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings
Recoverable Values for Independent Sets
Maximizing Non-Monotone Submodular Functions over Small Subsets: Beyond 1/2-Approximation
The Schützenberger Product for Syntactic Spaces
Amortized Communication Complexity of Distributions
Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
Maximal Infinite-Valued Constraint Languages
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
Partitioned LL(k) Grammars
Uniform Mixed Equilibria in Network Congestion Games with Link Failures
Termination of Linear Loops over the Integers
Valuations and Unambiguity of Languages, with Applications to Fractal Geometry
Shortest Anisotropic Paths on Terrains
A Linear Lower Bound for Incrementing a Space-Optimal Integer Representation in the Bit-Probe Model
Congestion-Free Rerouting of Flows on DAGs
Lower Bounds for Unambiguous Automata via Communication Complexity
On Branching Programs With Bounded Uncertainty (Extended Abstract)
Online Computation with Advice
Counting Perfect Matchings and the Eight-Vertex Model
A Rational Theory of AFLS
On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words
Cell Probe Lower Bounds and Approximations for Range Mode
On Restricting the Access to an NP-Oracle
Lower Bounds for Constant Depth Circuits for Prefix Problems
Faster Fréchet Distance Under Transformations
A Good Class of Tree Automata and Application to Inductive Theorem Proving
Dynamic Graph Stream Algorithms in o(n) Space
Exotic Quantifiers, Complexity Classes, and Complete Problems
Sharp Noisy Binary Search with Monotonic Probabilities
Generalized Parikh Mappings and Homomorphisms
On the Rectilinear Art Gallery Problem (Extended Abstract)
Near-Optimal Algorithm for Directed Expander Decompositions
An Improved Integrality Gap for Disjoint Cycles in Planar Graphs
Primal-Dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs
Sublinear Time Estimation of Degree Distribution Moments: The Degeneracy Connection
Efficient Black-Box Reductions for Separable Cost Sharing
A Generalisation of Parikh's Theorem in Formal Language Theory
Tight Bounds for Online Weighted Tree Augmentation
Parallel Decomposition of LR(k) Parsers (Extended Abstract)
Online Market Intermediation
Parameterized Approximation via Fidelity Preserving Transformations
On Area-Optimal Planar Graph Drawings
Lower Bounds for Complementation of omega -Automata Via the Full Automata Technique
Concurrency, Automata and Domains
On the Existence of Hamiltonian Cycles in Random Intersection Graphs
The Cost of Traveling between Languages
Logical Definability on Infinite Traces
Optimization Algorithms for Faster Computational Geometry
Locality in Online, Dynamic, Sequential, and Distributed Graph Algorithms
An Improved Algorithm for Approximate String Matching
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions
On the Complexity of Temporal-Logic Path Checking
Comparing and Putting Together Recursive Path Ordering, Simplification Orderings and Non-Ascending Property for Termination Proofs of Term Rewriting Systems
UP and the Low and High Hierarchies: A Relativized Separation
L(A) = L(B)? Decidability Results from Complete Formal Systems
Fractional Path Coloring with Applications to WDM Networks
Branching-Time Probalistic Model Checking
Nesting Depth of Operators in Graph Database Queries: Expressiveness vs. Evaluation Complexity
On the Definition of Classes of Interpretations
Seamless Integration of Parallelism and Memory Hierarchy
Improved Bounds on the Sign-Rank of AC^0
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs
Ring Packing and Amortized FHEW Bootstrapping
Maximal Dense Intervals of Grammar Forms
Uniformization Problems for Synchronizations of Automatic Relations on Words
Partial Garbling Schemes and Their Applications
Online Covering with Sum of $ell_q$-Norm Objectives
Reachability in Two-Clock Timed Automata Is PSPACE-Complete
High-Girth Near-Ramanujan Graphs with Lossy Vertex Expansion
Oracle Circuits for Branching-Time Model Checking
Optimal Parallel Pattern Matching in Strings (Extended Summary)
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
Online Demand Scheduling with Failovers
On Determinisation of Good-for-Games Automata
On Commutativity Based Edge Lean Search
Approximating Decision Trees with Multiway Branches
Vertex Cover in Graphs with Locally Few Colors
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond
Two Moves per Time Step Make a Difference
Fairness to All While Downsizing
Reasoning about Message Passing in Finite State Environments
Linear Time Algorithms for Clustering Problems in Any Dimensions
Toward a Dichotomy for Approximation of H-Coloring
Automata-Based CSL Model Checking
Pumping, Cleaning and Symbolic Constraints Solving
MAX k-CUT and Approximating the Chromatic Number of Random Graphs
Algorithms for 2-Route Cut Problems
Universal Algorithms for Clustering Problems
Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations
An Output-Sensitive Algorithm for Computing the Union of Cubes and Fat Boxes in 3D
Relationship Between Density and Deterministic Complexity of NP-Complete Languages
Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings
Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing
Duality and Equational Theory of Regular Languages
Amalgamation of Transition Sequences in the PEPA Formalism
A Proposal for Consistent Integration of Visual Computing with Visual Development of Software Components
On the k -Independence Required by Linear Probing and Minwise Independence
Gales and the Constructive Dimension of Individual Sequences
Bounded Depth Data Trees
Matrices of Optimal Tree-Depth and Row-Invariant Parameterized Algorithm for Integer Programming
Analysis of Probabilistic Systems via Generating Functions and Padé Approximation
A Collapse of the Parity Index Hierarchy of Tree Automata, Based on Cantor-Bendixson Ranks
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
Reset Nets Between Decidability and Undecidability
A Graph Reduction Step Preserving Element-Connectivity and Applications
Formal Properties of One-Visit and Multi-Pass Attribute Grammars
The Downward-Closure of Petri Net Languages
On the Construction of Reversible Automata for Reversible Languages
Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
Between Linearizability and Quiescent Consistency - Quantitative Quiescent Consistency
On the Hardest Problem Formulations for the 0/1 0 / 1 Lasserre Hierarchy
Combining Intruder Theories
Parallel Rewriting Systems on terms
Faster Random k-CNF Satisfiability
Secure and Efficient Off-Line Digital Money (Extended Abstract)
Computation Tree Logic CTL* and Path Quantifiers in the Monadic Theory of the Binary Tree
On Logical Relations and Conservativity
The Complexity of Searching Succinctly Represented Graphs
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
Fractional Cascading: A Data Structuring Technique with Geometric Applications
A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity
Approximation Algorithms for Aversion k-Clustering via Local k-Median
Block-Sorted Quantified Conjunctive Queries
Restoring Pure Equilibria to Weighted Congestion Games
A Brief Tour in Twin-Width (Invited Talk)
Automates Boustrophendon, Semi-Groupe de Birget et Monoide Inversiv Libre (Abstract/ Résumé)
A Note on Model Checking the Modal nu-Calculus
Coding for Interactive Communication Correcting Insertions and Deletions
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters
Regular Separability of Parikh Automata
An Analog Characterization of Elementarily Computable Functions over the Real Numbers
Synchronizability of Communicating Finite State Machines is not Decidable
Finite Power Property of Regular Languages
On the Instance Optimality of Detecting Collisions and Subgraphs
Complete Axiomatizations of Some Quotient Term Algebras
*-Liftings for Differential Privacy
A String Matching Algorithm Fast on the Average
On the Complexity of Dataflow Analysis of Logic Programs
Price of Anarchy for Mechanisms with Risk-Averse Agents
Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet
Partial Commutations
How to Compute the Volume in Low Dimension?
Improved Sampling with Applications to Dynamic Graph Algorithms
Linearly Ordered Colourings of Hypergraphs
Kernelization of Cycle Packing with Relaxed Disjointness Constraints
Bounded Ciphertext Policy Attribute Based Encryption
On the Construction of Huffman Trees
Do Distributed Differentially-Private Protocols Require Oblivious Transfer?
Invitation to Algorithmic Uses of Inclusion-Exclusion
Random Separating Hyperplane Theorem and Learning Polytopes
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
On the Composition of Zero-Knowledge Proof Systems
A Generalization of the Procedure of Karp and Miller to Well Structured Transition Systems
Secure Computation Using Leaky Tokens
Some Behavioural Aspects of Net Theory
Incremental Maximization via Continuization
Efficient Strategies for Robot Navigation in Unknown Environment
On Equivalence and Uniformisation Problems for Finite Transducers
Permutation Editing and Matching via Embeddings
Metastability of the Potts Ferromagnet on Random Regular Graphs
Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks
Refusal Testing
Flow Analysis of Lambda Expressions (Preliminary Version)
Approximating Longest Directed Paths and Cycles
Efficient Information Exchange in the Random Phone-Call Model
Area-Time Optimal VLSI Integer Multiplier with Minimum Computation Time
On Skolem-Hardness and Saturation Points in Markov Decision Processes
Refining and Compressing Abstract Domains
Synchronization Strings: List Decoding for Insertions and Deletions
Direct Product via Round-Preserving Compression
Energy Complexity and Entropy of Threshold Circuits
The Power of Many Samples in Query Complexity
Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
Transparent Long Proofs: A First PCP Theorem for NP R
Distributed Algorithms for Network Diameter and Girth
Rule-Based and Visual Model Evolution using GENGED
Ready Simulation for Concurrency: It's Logical!
Partial Order Semantics versus Interleaving Semantics for CSP-like Languages and its Impact on Fairness
A Tight Lower Bound for Determinization of Transition Labeled Büchi Automata
A Centralized Local Algorithm for the Sparse Spanning Graph Problem
Algebraic Characterizations of Decorated Trace Equivalences over Tree-Like Structures
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching
New Results on a General Class of Minimum Norm Optimization Problems
New Imperfect Random Source with Applications to Coin-Flipping
On-Line Routing in All-Optical Networks
Decision Problems for Lower/Upper Bound Parametric Timed Automata
En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations
Tight Lower Bounds for Multi-pass Stream Computation Via Pass Elimination
A Multiprocess Network Logic with Temporal and Spatial Modalities
Lower Bounds by Algorithm Design: A Progress Report (Invited Paper)
Runtime Analysis of Probabilistic Programs with Unbounded Recursion
A Connection between the Star Problem and the Finite Power Property in Trace Monoids
A Generalization of Ginsburg and Rose's Characterization of G-S-M Mappings
Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
Randomized Binary and Tree Search Under Pressure
A Theory Independent Curry-De Bruijn-Howard Correspondence
Circular Arrangements
Finding Triconnected Components by Local Replacements
Sound 3-Query PCPPs Are Long
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
Finite Automata, Digraph Connectivity, and Regular Expression Size
Towards the k-Server Conjecture: A Unifying Potential, Pushing the Frontier to the Circle
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer Science
A Simple Protocol for Verifiable Delegation of Quantum Computation in One Round
The Wadge-Wagner Hierarchy of omega-Rational Sets
Coloring Semirandom Graphs Optimally
VC-Dimension and Shortest Path Algorithms
On the Complexity of Local Graph Transformations
Automata for Coalgebras: An Approach Using Predicate Liftings
Learning Algorithms Versus Automatability of Frege Systems
Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language
Temporal Rewards for Performance Evaluation
Quantum Query Complexity of Some Graph Problems
Categorical Views on Computations on Trees (Extended Abstract)
Compositionality in Graph Transformation
Two-Way Automata with Multiplicity
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract)
On Growing Context-Sensitive Languages
Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation
Population Protocols with Unordered Data
Minimal NFA Problems Are Hard
CONS-Free Programs with Tree Input (Extended Abstract)
A Strategy for Dynamic Programs: Start over and Muddle Through
Computing Permanents and Counting Hamiltonian Cycles by Listing Dissimilar Vectors
Delegating Capabilities in Predicate Encryption Systems
On the Size Complexity of Monotone Formulas
T-Rex: Termination of Recursive Functions Using Lexicographic Linear Combinations
Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare
On Constructing Efficient Evaluators for Attribute Grammars
Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs
Safety for Branching Time Semantics
Deterministic M2M Multicast in Radio Networks: (Extended Abstract)
Mixing Time of Markov Chains, Dynamical Systems and Evolution
Minimum Chain Cover in Almost Linear Time
On Discerning Words by Automata
Lower Bounds on Matrix Rigidity Via a Quantum Argument
Operational Semantics for Order-Sorted Algebra
Competitive Analysis of Constrained Queueing Systems
A Topological Approach to Recognition
Randomized Load Balancing on Networks with Stochastic Inputs
On Matrix Multiplication Using Array Processors
Testing Coverage Functions
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
On Regular Compatibility of Semi-Commutations
A Programming Language for the Inductive Sets, and Applications
Passes, Sweeps and Visits
Simple Fast Parallel Hashing
The Odds of Staying on Budget
On a Family of Deterministic Grammars (Extended Abstract)
Efficient Splitting and Merging Algorithms for Order Decomposable Problems (Extended Abstract)
Optimal Analysis of Best Fit Bin Packing
Constraint Programming and Graph Algorithms
Concurrent Knowledge Extraction in the Public-Key Model
Existence and Uniqueness of Equilibria for Flows over Time
Verification Conditions as Programs
A Statically Allocated Parallel Functional Language
A Lower Bound for the Formula Size of Rational Functions
Succinct Filters for Sets of Unknown Sizes
When Does Partial Commutative Closure Preserve Regularity?
Secretary Markets with Local Information
Robust-Sorting and Applications to Ulam-Median
A Linear-Time n 0.4 -Approximation for Longest Common Subsequence
Unboundedness for Recursion Schemes: A Simpler Type System
LTL Path Checking Is Efficiently Parallelizable
Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems
On Capital Investment
Exponential Lower Bounds for AC 0 -Frege Imply Superpolynomial Frege Lower Bounds
Extending Partial 1-Planar Drawings
Compositionality Through an Operational Semantics of Contexts
Exponential Lower Bounds and Separation for Query Rewriting
Polynominal Time Approximation Schemes for General Multiprocessor Job Shop Scheduling
Recognizing Regular Expressions by Means of Dataflow Networks
Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata
Sparse Suffix Tree Construction in Small Space
The Adversarial Stackelberg Value in Quantitative Games
Graph Coloring via Degeneracy in Streaming and Other Space-Conscious Models
A Characterization of Non-interactive Instance-Dependent Commitment-Schemes (NIC)
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound
On Packing Low-Diameter Spanning Trees
Unambiguous Languages Exhaust the Index Hierarchy
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable
Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper)
A Theory of Nondeterminism
Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract)
Finite Automata with Markers
Communication among Relations (Extended Abstract)
On Fixed-Point Clones (Extended Abstract)
Two Choices Are Enough for P-LCPs, USOs, and Colorful Tangents
A Program Logic for Union Bounds
Scalably Scheduling Power-Heterogeneous Processors
Optimal Gröbner Base Algorithms for Binomial Ideals
Enumeration of Success Patterns in Logic Programs
Noncommutativity Makes Determinants Hard
Approximating the Orthogonal Knapsack Problem for Hypercubes
Communication of Two Stacks and Rewriting
Homogenization and the Polynominal Calculus
Network Satisfaction Problems Solved by k-Consistency
Tolerant Testers of Image Properties
Recursive Markov Decision Processes and Recursive Stochastic Games
Optimal Decremental Connectivity in Non-Sparse Graphs
On Finding Constrained Independent Sets in Cycles
On Some Properties of Local Testability
Combinatorics of Periods in Strings
Secure Equality and Greater-Than Tests with Sublinear Online Complexity
Algorithmic Theories of Data Structures
Near-Optimal Two-Pass Streaming Algorithm for Sampling Random Walks over Directed Graphs
A View of Directions in Relational Database Theory
Communicating Finite State Machines with Priority Channnels
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Generating Labeled Planar Graphs Uniformly at Random
Characterizing Data Base Dependencies
Thorp Shuffling, Butterflies, and Non-Markovian Couplings
A Powerdomain for Countable Non-Determinism (Extended Abstract)
Efficient Collective Communication in Optical Networks
Abelian Squares are Avoidable on 4 Letters
On Standard Sturmian Morphisms
Popular Matchings with Two-Sided Preferences and One-Sided Ties
Dynamic Normal Forms and Dynamic Characteristic Polynomial
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
A Total Approach to Partial Algebraic Specification
On Recent Trends in Formal Language Theory
On Characterization of Escrow Encryption Schemes
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems
Approximate Counting of k-Paths: Deterministic and in Polynomial Space
Incompressibility through Colors and IDs
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search
Galloping in Fast-Growth Natural Merge Sorts
Termination of Context-Sensitive Rewriting by Rewriting
A (1+epsilon)-Approximation for Unsplittable Flow on a Path in Fixed-Parameter Running Time
A Dynamic Programming Algorithm for Constructing Optimal Refix-Free Codes for Unequal Letter Costs
Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract)
Informative Labeling Schemes
Monotone Proofs of the Pigeon Hole Principle
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
Hierarchical and Recursive State Machines with Context-Dependent Properties
Optimal Strategies for Patrolling Fences
Fully Dynamic Algorithms for Minimum Weight Cycle and Related Problems
Popular Half-Integral Matchings
Similarity Matrices for Pairs of Graphs
Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher
A Hierarchy Theorem for the µ-Calculus
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem
Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More
Minimizing Diameters of Dynamic Trees
Unboundedness Problems for Languages of Vector Addition Systems
Basic Observables for a Calculus for Global Computing
Guarded Kleene Algebra with Tests: Coequations, Coinduction, and Completeness
NNS Lower Bounds via Metric Expansion for l ∞ and EMD
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Wavelength Routing of Uniform Instances in Optical Rings
A Dynamic Data Structure for Planar Graph Embedding (Extended Abstract)
Problems on Pairs of Trees and the Four Colour Problem of Planar Graphs
OpenSESAME: A Tool's Concept
Finding Monotone Patterns in Sublinear Time, Adaptively
Improved Streaming Edge Coloring
Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets
Hybrid Automata with Finite Bisimulatioins
A Complex Example of a Simplifying Rewrite System
Private Locally Decodable Codes
Searching for Regularity in Bounded Functions
Two Techniques in the Area of the Star Problem
Open Implication
A Complete System of B-Rational Identities
Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs
Expressiveness of Efficient Semi-Deterministic Choice Constructs
Optimal Circuits and Transitive Automorphism Groups
Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs
A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits
Characterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types
Quantum Commitments from Complexity Assumptions
Faster Algorithms for All-Pairs Bounded Min-Cuts
Bidirectional Functional Semantics for Pregroup Grammars
A Tight Lower Bound for Primitivity in k-Structures
Nonlinear Pattern Matching in Trees
Isomorphism for Tournaments of Small Twin Width
Optimal Encodings for Range Top- k k , Selection, and Min-Max
Revisiting Directed Disjoint Paths on Tournaments (And Relatives)
How to Play Optimally for Regular Objectives?
Effectively Given Spaces
Energy Parity Games
Optimal PSPACE-Hardness of Approximating Set Cover Reconfiguration
On a Duality Between Kruskal and Dershowitz Theorems
Sorting Short Integers
The Memory of ω-Regular and BC(Σ⁰₂) Objectives