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 #1 to #50.

NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets: Label: en
Decidability Classes for Mobile Agents Computing: Label: en
k-Gap Interval Graphs: Label: en
Structural Complexity of Multiobjective NP Search Problems: Label: en
Forbidden Patterns: Label: en
On the Non-progressive Spread of Influence through Social Networks: Label: en
Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism: Label: en
Hausdorff Rank of Scattered Context-Free Linear Orders: Label: en
Computing Minimum Geodetic Sets of Proper Interval Graphs: Label: en
On the Radon Number for P 3-Convexity: Label: en
Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points: Label: en
Logspace Computations in Graph Groups and Coxeter Groups: Label: en
An Improved Upper Bound on the Density of Universal Random Graphs: Label: en
Two-Dimensional Range Diameter Queries: Label: en
A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming: Label: en
Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n: Label: en
Revisiting the Cache Miss Analysis of Multithreaded Algorithms: Label: en
Pseudorandomness of a Random Kronecker Sequence: Label: en
Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks: Label: en
An Equivariance Theorem with Applications to Renaming: Label: en
Coloring Planar Homothets and Three-Dimensional Hypergraphs: Label: en
Density Classification on Infinite Lattices and Trees: Label: en
Space-Efficient Approximation Scheme for Circular Earth Mover Distance: Label: en
Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems: Label: en
On the Advice Complexity of the Knapsack Problem: Label: en
A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem: Label: en
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs: Label: en
Bichromatic 2-Center of Pairs of Points: Label: en
Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines: Label: en
Approximating Minimum Label s-t Cut via Linear Programming: Label: en
The Relationship between Inner Product and Counting Cycles: Label: en
Capacity Achieving Two-Write WOM Codes: Label: en
A Theory and Algorithms for Combinatorial Reoptimization: Label: en
On the Integrality Gap of the Subtour LP for the 1,2-TSP: Label: en
Survivable Network Activation Problems: Label: en
Degree-Constrained Node-Connectivity: Label: en
Fully Analyzing an Algebraic Pólya Urn Model: Label: en
The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem: Label: en
Random Walks and Bisections in Random Circulant Graphs: Label: en
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs: Label: en
Oblivious Two-Way Finite Automata: Decidability and Complexity: Label: en
Independence of Tabulation-Based Hash Classes: Label: en
Advantage of Overlapping Clusters for Minimizing Conductance: Label: en
On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost: Label: en
Hiring above the m-th Best Candidate: A Generalization of Records in Permutations: Label: en
Algorithms for Some H-Join Decompositions: Label: en
The Efficiency of MapReduce in Parallel External Memory: Label: en
Cache Me If You Can: Capacitated Selfish Replication Games: Label: en
New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting: Label: en
Indexed Multi-pattern Matching: Label: en