Pages that link to "Item:Q5176178"
From MaRDI portal
The following pages link to Shortest-path queries in static networks (Q5176178):
Displaying 50 items.
- On the Complexity of Nash Equilibria in Anonymous Games (Q2941529) (← links)
- Hardness of Graph Pricing Through Generalized Max-Dicut (Q2941530) (← links)
- Inapproximability of Truthful Mechanisms via Generalizations of the VC Dimension (Q2941531) (← links)
- Inapproximability of Nash Equilibrium (Q2941532) (← links)
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory (Q2941534) (← links)
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs (Q2941535) (← links)
- Succinct Randomized Encodings and their Applications (Q2941536) (← links)
- Garbled RAM From One-Way Functions (Q2941537) (← links)
- Non-malleable Reductions and Applications (Q2941538) (← links)
- Leveled Fully Homomorphic Signatures from Standard Lattices (Q2941539) (← links)
- Sketching and Embedding are Equivalent for Norms (Q2941540) (← links)
- Prioritized Metric Structures and Embedding (Q2941541) (← links)
- A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds (Q2941543) (← links)
- Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (Q2941544) (← links)
- Bypassing KLS (Q2941546) (← links)
- FPTAS for #BIS with Degree Bounds on One Side (Q2941547) (← links)
- Lower Bounds on the Size of Semidefinite Programming Relaxations (Q2941550) (← links)
- 2-Server PIR with Sub-Polynomial Communication (Q2941552) (← links)
- Fast Matrix Multiplication (Q2941553) (← links)
- High Parallel Complexity Graphs and Memory-Hard Functions (Q2941555) (← links)
- Byzantine Agreement with Optimal Early Stopping, Optimal Resilience and Polynomial Complexity (Q2941556) (← links)
- Test-and-Set in Optimal Space (Q2941557) (← links)
- Adjacency Labeling Schemes and Induced-Universal Graphs (Q2941558) (← links)
- How Well Can Graphs Represent Wireless Interference? (Q2941559) (← links)
- Excluded Grid Theorem (Q2941560) (← links)
- The Directed Grid Theorem (Q2941561) (← links)
- Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (Q2941562) (← links)
- Beyond the Euler Characteristic (Q2941563) (← links)
- Faster Canonical Forms for Primitive Coherent Configurations (Q2941564) (← links)
- Random Permutations using Switching Networks (Q2941565) (← links)
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms (Q2941566) (← links)
- Testing Cluster Structure of Graphs (Q2941567) (← links)
- Solving the Shortest Vector Problem in 2 <sup>n</sup> Time Using Discrete Gaussian Sampling (Q2941568) (← links)
- Learning Arbitrary Statistical Mixtures of Discrete Distributions (Q2941569) (← links)
- Tight Bounds for Learning a Mixture of Two Gaussians (Q2941570) (← links)
- Learning Mixtures of Gaussians in High Dimensions (Q2941572) (← links)
- Efficiently Learning Ising Models on Arbitrary Graphs (Q2941573) (← links)
- Approximate <i>k</i> -flat Nearest Neighbor Search (Q2941574) (← links)
- Optimal Data-Dependent Hashing for Approximate Near Neighbors (Q2941575) (← links)
- Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms (Q2941576) (← links)
- From Independence to Expansion and Back Again (Q2941578) (← links)
- Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices (Q2941579) (← links)
- Analysis of a Classical Matrix Preconditioning Algorithm (Q2941580) (← links)
- A Polynomial-time Bicriteria Approximation Scheme for Planar Bisection (Q2941581) (← links)
- Minimizing Flow-Time on Unrelated Machines (Q2941582) (← links)
- Randomized Rounding for the Largest Simplex Problem (Q2941583) (← links)
- Greedy Algorithms for Steiner Forest (Q2941584) (← links)
- Secretary Problems with Non-Uniform Arrival Order (Q2941585) (← links)
- Online Submodular Welfare Maximization (Q2941586) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
