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 #101 to #150.

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

  1. Block-Sorted Quantified Conjunctive Queries: Label: en
  2. Self-shuffling Words: Label: en
  3. Coalgebraic Announcement Logics: Label: en
  4. Nondeterminism in the Presence of a Diverse or Unknown Future: Label: en
  5. Complexity of Two-Variable Logic on Finite Trees: Label: en
  6. A Maximal Entropy Stochastic Process for a Timed Automaton,: Label: en
  7. Beyond Differential Privacy: Composition Theorems and Relational Logic for f-divergences between Probabilistic Programs: Label: en
  8. Decision Problems for Additive Regular Functions: Label: en
  9. A Guided Tour in Random Intersection Graphs: Label: en
  10. Formalizing and Reasoning about Quality: Label: en
  11. Recent Advances for a Classical Scheduling Problem: Label: en
  12. Star Partitions of Perfect Graphs: Label: en
  13. Geometry of Online Packing Linear Programs: Label: en
  14. Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners: Label: en
  15. Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems: Label: en
  16. The Melbourne Shuffle: Improving Oblivious Storage in the Cloud: Label: en
  17. Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router: Label: en
  18. Orienting Fully Dynamic Graphs with Worst-Case Time Bounds: Label: en
  19. Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems: Label: en
  20. Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods: Label: en
  21. Randomized Rumor Spreading in Dynamic Graphs: Label: en
  22. Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set: Label: en
  23. Solving the ANTS Problem with Asynchronous Finite State Machines: Label: en
  24. Facility Location in Evolving Metrics: Label: en
  25. Jamming-Resistant Learning in Wireless Networks: Label: en
  26. The Power of Two Choices in Distributed Voting: Label: en
  27. Data Delivery by Energy-Constrained Mobile Agents on a Line: Label: en
  28. Fault-Tolerant Rendezvous in Networks: Label: en
  29. Distributed Computing on Core-Periphery Networks: Axiom-Based Design: Label: en
  30. Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints: Label: en
  31. Labeling Schemes for Bounded Degree Graphs: Label: en
  32. Branching Bisimilarity Checking for PRS: Label: en
  33. Hardness Results for Intersection Non-Emptiness: Label: en
  34. Going Higher in the First-Order Quantifier Alternation Hierarchy on Words: Label: en
  35. Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences: Label: en
  36. On the Positivity Problem for Simple Linear Recurrence Sequences,: Label: en
  37. Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus: Label: en
  38. All–Instances Termination of Chase is Undecidable: Label: en
  39. Kleene Algebra with Equations: Label: en
  40. Stability and Complexity of Minimising Probabilistic Automata: Label: en
  41. Monodic Fragments of Probabilistic First-Order Logic: Label: en
  42. Context Unification is in PSPACE: Label: en
  43. Bisimulation Equivalence of First-Order Grammars: Label: en
  44. Between Linearizability and Quiescent Consistency: Label: en
  45. Piecewise Boolean Algebras and Their Domains: Label: en
  46. Coalgebraic Weak Bisimulation from Recursive Equations over Monads: Label: en
  47. Computability in Anonymous Networks: Revocable vs. Irrecovable Outputs: Label: en
  48. A Nivat Theorem for Weighted Timed Automata and Weighted Relative Distance Logic: Label: en
  49. Robustness against Power is PSpace-complete: Label: en
  50. Unary Pushdown Automata and Straight-Line Programs: Label: en

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