Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #151 to #200.

Toward a Structure Theory of Regular Infinitary Trace Languages: Label: en
The Complexity of Ergodic Mean-payoff Games: Label: en
Games with a Weak Adversary: Label: en
Parameterised Linearisability: Label: en
On the Complexity of Temporal-Logic Path Checking: Label: en
Turing Degrees of Limit Sets of Cellular Automata: Label: en
A Coalgebraic Foundation for Coinductive Union Types: Label: en
On the Decidability of MSO+U on Infinite Trees: Label: en
Weak MSO+U with Path Quantifiers over Infinite Trees: Label: en
Transducers with Origin Information: Label: en
Handling Infinitely Branching WSTS: Label: en
Symmetric Groups and Quotient Complexity of Boolean Operations: Label: en
Spatial Mixing of Coloring Random Graphs: Label: en
Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles: Label: en
Optimal Query Complexity for Estimating the Trace of a Matrix: Label: en
Certificates in Data Structures: Label: en
On Learning, Lower Bounds and (un)Keeping Promises: Label: en
Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem: Label: en
Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs: Label: en
Close to Uniform Prime Number Generation with Fewer Random Bits: Label: en
Balanced Allocations: A Simple Proof for the Heavily Loaded Case: Label: en
The Mondshein Sequence: Label: en
Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications: Label: en
Pseudorandom Graphs in Data Structures: Label: en
A Faster Parameterized Algorithm for Treedepth: Label: en
An Improved Interactive Streaming Algorithm for the Distinct Elements Problem: Label: en
Secure Computation Using Leaky Tokens: Label: en
On Input Indistinguishable Proof Systems: Label: en
Lower Bounds for Oblivious Subspace Embeddings: Label: en
Determining Majority in Networks with Local Interactions and Very Small Local Memory: Label: en
Fast Pseudorandomness for Independence and Load Balancing: Label: en
QCSP on Semicomplete Digraphs: Label: en
Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability: Label: en
Precedence-Constrained Scheduling of Malleable Jobs with Preemption: Label: en
Nonuniform Graph Partitioning with Unrelated Weights: Label: en
Parameterized Algorithms to Preserve Connectivity: Label: en
FPTAS for Weighted Fibonacci Gates and Its Applications: Label: en
Parameterized Approximation Schemes Using Graph Widths: Label: en
Testing Forest-Isomorphism in the Adjacency List Model: Label: en
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits: Label: en
Asymmetric coloring games on incomparability graphs: Label: en
Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields: Label: en
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound: Label: en
The Complexity of Somewhat Approximation Resistant Predicates: Label: en
Information Theoretical Cryptogenography: Label: en
On the Complexity of Trial and Error for Constraint Satisfaction Problems: Label: en
Partial Garbling Schemes and Their Applications: Label: en
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not: Label: en
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions: Label: en
Privately Solving Linear Programs: Label: en