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.

Lightweight Data Indexing and Compression in External Memory: Label: en
Layered Working-Set Trees: Label: en
Rank Selection in Multidimensional Data: Label: en
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs: Label: en
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time: Label: en
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration: Label: en
Approximating Maximum Diameter-Bounded Subgraphs: Label: en
Counting Hexagonal Patches and Independent Sets in Circle Graphs: Label: en
The Interval Constrained 3-Coloring Problem: Label: en
Some Observations on Holographic Algorithms: Label: en
Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization: Label: en
The Power of Fair Pricing Mechanisms: Label: en
Kernelization through Tidying: Label: en
Prize-Collecting Steiner Networks via Iterative Rounding: Label: en
Euclidean Prize-Collecting Steiner Forest: Label: en
Visiting a Sequence of Points with a Bevel-Tip Needle: Label: en
Tilings Robust to Errors: Label: en
Homotopic Rectilinear Routing with Few Links and Thick Edges: Label: en
Matching Points with Things: Label: en
Finding the Smallest Gap between Sums of Square Roots: Label: en
Minimum-Perimeter Intersecting Polygons: Label: en
Ambiguity and Deficiency in Costas Arrays and APN Permutations: Label: en
Lipschitz Unimodal and Isotonic Regression on Paths and Trees: Label: en
The Size and Depth of Layered Boolean Circuits: Label: en
Finding the Best CAFE Is NP-Hard: Label: en
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming: Label: en
On Quadratic Threshold CSPs: Label: en
Limit Theorems for Random MAX-2-XORSAT: Label: en
Randomised Broadcasting: Memory vs. Randomness: Label: en
Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization: Label: en
Communication-Efficient Construction of the Plane Localized Delaunay Graph: Label: en
Modelling the LLL Algorithm by Sandpiles: Label: en
A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication: Label: en
Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields: Label: en
Fast Set Intersection and Two-Patterns Matching: Label: en
Complexity of Operations on Cofinite Languages: Label: en
Quotient Complexity of Ideal Languages: Label: en
Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata: Label: en
Radix Cross-Sections for Length Morphisms: Label: en
Compact Rich-Functional Binary Relation Representations: Label: en
Optimal Succinctness for Range Minimum Queries: Label: en
The I/O Complexity of Sparse Matrix Dense Matrix Multiplication: Label: en
Faithful Representations of Graphs by Islands in the Extended Grid: Label: en
Packet Routing on the Grid: Label: en
Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling: Label: en
The Language Theory of Bounded Context-Switching: Label: en
Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight: Label: en
Sharp Separation and Applications to Exact and Parameterized Algorithms: Label: en
Average Parameterization and Partial Kernelization for Computing Medians: Label: en
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width: Label: en