Entity usage

From MaRDI portal

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.

List of pages that use a given entity

Showing below up to 50 results in range #1 to #50.

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)

  1. The Algorithmic Structure of Group Strategyproof Budget-Balanced Cost-Sharing Mechanisms: Label: en
  2. Markov Decision Processes with Multiple Objectives: Label: en
  3. Weighted Picture Automata and Weighted Logics: Label: en
  4. On the Accepting Power of 2-Tape Büchi Automata: Label: en
  5. Invariants of Automatic Presentations and Semi-synchronous Transductions: Label: en
  6. Theory and Application of Width Bounded Geometric Separator: Label: en
  7. Grid Vertex-Unfolding Orthogonal Polyhedra: Label: en
  8. Conflict-Free Colorings of Rectangles Ranges: Label: en
  9. Combining Multiple Heuristics: Label: en
  10. Oblivious Symmetric Alternation: Label: en
  11. Exact Price of Anarchy for Polynomial Congestion Games: Label: en
  12. Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems: Label: en
  13. Estimating Entropy and Entropy Norm on Data Streams: Label: en
  14. The Number of Runs in a String: Improved Analysis of the Linear Upper Bound: Label: en
  15. Quantum Algorithms for Matching and Network Flows: Label: en
  16. Entanglement in Interactive Proof Systems with Binary Answers: Label: en
  17. Kolmogorov Complexity with Error: Label: en
  18. Complete Codes in a Sofic Shift: Label: en
  19. Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms: Label: en
  20. On Critical Exponents in Fixed Points of Binary k-Uniform Morphisms: Label: en
  21. Distribution-Sensitive Construction of Minimum-Redundancy Prefix Codes: Label: en
  22. Amortized Rigidness in Dynamic Cartesian Trees: Label: en
  23. External String Sorting: Faster and Cache-Oblivious: Label: en
  24. Interprocedurally Analyzing Polynomial Identities: Label: en
  25. Flat Holonomies on Automata Networks: Label: en
  26. The Ubiquitous Digital Tree: Label: en
  27. On the Complexity of the “Most General” Firing Squad Synchronization Problem: Label: en
  28. Weighted Asynchronous Cellular Automata: Label: en
  29. Constant-Depth Circuits for Arithmetic in Finite Fields of Characteristic Two: Label: en
  30. Evaluating Monotone Circuits on Cylinders, Planes and Tori: Label: en
  31. Datalog and Constraint Satisfaction with Infinite Templates: Label: en
  32. Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games: Label: en
  33. Energy-Efficient Algorithms for Flow Time Minimization: Label: en
  34. Memoryless Facility Location in One Pass: Label: en
  35. Optimal Node Routing: Label: en
  36. Online Sorting Buffers on Line: Label: en
  37. Generating Randomized Roundings with Cardinality Constraints and Derandomizations: Label: en
  38. A Faster Algorithm for the Steiner Tree Problem: Label: en
  39. Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements: Label: en
  40. Reliable Computations Based on Locally Decodable Codes: Label: en
  41. DAG-Width and Parity Games: Label: en
  42. Strategy Improvement and Randomized Subexponential Algorithms for Stochastic Parity Games: Label: en
  43. Generalized Modal Satisfiability: Label: en
  44. Definability of Languages by Generalized First-Order Formulas over (N,+): Label: en
  45. Nested Pebbles and Transitive Closure: Label: en
  46. Linear Advice for Randomized Logarithmic Space: Label: en
  47. Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds: Label: en
  48. Redundancy in Complete Sets: Label: en
  49. Regular Expressions and NFAs Without ε-Transitions: Label: en
  50. Regularity Problems for Visibly Pushdown Languages: Label: en

View (previous 50 | ) (20 | 50 | 100 | 250 | 500)