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 #51 to #100.

Time-Efficient Quantum Walks for 3-Distinctness: Label: en
Search-Space Size in Contraction Hierarchies: Label: en
Improved Approximation Algorithms for (Budgeted) Node-Weighted Steiner Problems: Label: en
Algorithms for Hub Label Optimization: Label: en
Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm: Label: en
Optimal Partitioning for Dual Pivot Quicksort: Label: en
Tight Lower Bound for Linear Sketches of Moments: Label: en
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines: Label: en
Exact Weight Subgraphs and the k-Sum Conjecture: Label: en
Fast Distributed Coloring Algorithms for Triangle-Free Graphs: Label: en
Strong Bounds for Evolution in Networks: Label: en
Temporal Network Optimization Subject to Connectivity Constraints: Label: en
Secure Equality and Greater-Than Tests with Sublinear Online Complexity: Label: en
Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices: Label: en
A Refined Complexity Analysis of Degree Anonymization in Graphs: Label: en
Efficient Computation of Balanced Structures: Label: en
Competitive Auctions for Markets with Positive Externalities: Label: en
Learning a Ring Cheaply and Fast: Label: en
Outsourced Pattern Matching: Label: en
Deterministic Polynomial Approach in the Plane: Label: en
Fast Collaborative Graph Exploration: Label: en
Localization for a System of Colliding Robots: Label: en
Price of Stability in Polynomial Congestion Games: Label: en
On Revenue Maximization for Agents with Costly Information Acquisition: Label: en
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds: Label: en
Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints: Label: en
New Online Algorithms for Story Scheduling in Web Advertising: Label: en
Silent Transitions in Automata with Storage: Label: en
Revisiting the Equivalence Problem for Finite Multitape Automata: Label: en
Proof Systems for Retracts in Simply Typed Lambda Calculus: Label: en
Coeffects: Unified Static Analysis of Context-Dependence: Label: en
Fair Subtyping for Open Session Types: Label: en
Evolving Graph-Structures and Their Implicit Computational Complexity: Label: en
The IO and OI Hierarchies Revisited: Label: en
One-Variable Word Equations in Linear Time: Label: en
Algebras, Automata and Logic for Languages of Labeled Birooted Trees: Label: en
Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types: Label: en
Querying the Guarded Fragment with Transitivity: Label: en
Asynchronous Games over Tree Architectures: Label: en
Strategy Composition in Compositional Games: Label: en
FO Model Checking of Interval Graphs: Label: en
Checking Equality and Regularity for Normed BPA with Silent Moves: Label: en
Ramsey Goes Visibly Pushdown: Label: en
Reachability in Two-Clock Timed Automata Is PSPACE-Complete: Label: en
Stochastic Context-Free Grammars, Regular Languages, and Newton’s Method: Label: en
Component Reconfiguration in the Presence of Conflicts: Label: en
Multiparty Compatibility in Communicating Automata: Characterisation and Synthesis of Global Session Types: Label: en
On the Complexity of Verifying Regular Properties on Flat Counter Systems,: Label: en
Efficient Separability of Regular Languages by Subsequences and Suffixes: Label: en
From Security Protocols to Pushdown Automata: Label: en