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 Akamai approach to achieving performance and reliability on the internet: Label: en
  2. Self-stabilizing counting in mobile sensor networks: Label: en
  3. DoS-resilient secure aggregation queries in sensor networks: Label: en
  4. Distributed algorithms for dynamic coverage in sensor networks: Label: en
  5. Practical summation via gossip: Label: en
  6. Geographic gossip on geometric random graphs via affine combinations: Label: en
  7. Solvability of geocasting in mobile ad-hoc networks: Label: en
  8. Optimal atomic broadcast and multicast algorithms for wide area networks: Label: en
  9. Distributed broadcasting and mapping protocols in directed anonymous networks: Label: en
  10. Non-searchability of random scale-free graphs: Label: en
  11. Trinitya: Label: en
  12. Toward an optimal social network defense against Sybil attacks: Label: en
  13. SuperTrust: Label: en
  14. Measuring robustness of superpeer topologies: Label: en
  15. A denial-of-service resistant DHT: Label: en
  16. Bringing order to BGP: Label: en
  17. Asynchronous recommendation systems: Label: en
  18. On cost sharing mechanisms in the network design game: Label: en
  19. An incentive-compatible multi-armed bandit mechanism: Label: en
  20. An algorithm composition scheme preserving monotonicity: Label: en
  21. Theory of BAR games: Label: en
  22. Game authority for robust andscalable distributed selfish-computer systems: Label: en
  23. Minimizing the total cost of network measurements in a distributed manner: Label: en
  24. On local representation of distances in trees: Label: en
  25. The coBFIT toolkit: Label: en
  26. An analysis of intention preservation in group editors: Label: en
  27. Sharpness, a tight condition for throughput scalability: Label: en
  28. Object replication degree customization for high availability: Label: en
  29. The power of DCAS: Label: en
  30. From causal to z-linearizable transactional memory: Label: en
  31. Privatization techniques for software transactional memory: Label: en
  32. Transactions and privatization in Delaunay triangulation: Label: en
  33. A formal treatment of an abstract channel implementation using java sockets and TCP: Label: en
  34. Configurations: Label: en
  35. d -clock: Label: en
  36. Integrated resource allocation in heterogeneous SAN data centers: Label: en
  37. Practical private computation of vector addition-based functions: Label: en
  38. Space adaptation: Label: en
  39. Constant phase efficient protocols for secure message transmission in directed networks: Label: en
  40. From an intermittent rotating star to a leader: Label: en
  41. The complexity of updating multi-writer snapshot objects: Label: en
  42. Multicoordinated Paxos: Label: en
  43. Towards the minimal synchrony for byzantine consensus: Label: en
  44. Remote storage with byzantine servers: Label: en
  45. Bounded wait-free implementation of optimally resilient byzantine storage without (unproven) cryptographic assumptions: Label: en
  46. Failure detectors are schedulers: Label: en
  47. Partition approach to failure detectors for k-set agreement: Label: en
  48. Network formation games with local coalitions: Label: en
  49. The price of anarchy in network creation games: Label: en
  50. Distributed network monitoring and multicommodity flows: Label: en

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