Entity usage

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

1. An almost-surely terminating polynomial protocol for asynchronous byzantine agreement with optimal resilience: Label: en
2. OCD: Label: en
3. Fast self-stabilizing byzantine tolerant digital clock synchronization: Label: en
4. Asynchronous exclusive selection: Label: en
5. Distributed order scheduling and its application to multi-core dram controllers: Label: en
6. Optimizing data popularity conscious bloom filters: Label: en
7. The impact of randomization in smoothing networks: Label: en
8. Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing: Label: en
9. Randomized consensus in expected O(n log n) individual work: Label: en
10. Lower bounds for randomized consensus under a weak adversary: Label: en
11. Timeliness-based wait-freedom: Label: en
12. New combinatorial topology upper and lower bounds for renaming: Label: en
13. The stretched exponential distribution of internet media access patterns: Label: en
14. On the locality of distributed sparse spanner construction: Label: en
15. Efficient distributed approximation algorithms via probabilistic tree embeddings: Label: en
16. Distributed algorithms for ultrasparse spanners and linear size skeletons: Label: en
17. Sleeping on the job: Label: en
18. Virtual infrastructure for collision-prone wireless networks: Label: en
19. On the effect of the deployment setting on broadcasting in Euclidean radio networks: Label: en
20. Flooding time in edge-Markovian dynamic graphs: Label: en
21. The forgiving tree: Label: en
22. Tight bounds for delay-sensitive aggregation: Label: en
23. Improved compact routing schemes for dynamic trees: Label: en
24. On a capacitated multivehicle routing problem: Label: en
25. Bounded budget connection (BBC) games or how to make friends and influence people, on a budget: Label: en
26. Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems: Label: en
27. Brahms: Label: en
28. On the complexity of asynchronous gossip: Label: en
29. On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary: Label: en
30. Secure communication over radio channels: Label: en
31. Collaborative enforcement of firewall policies in virtual private networks: Label: en
32. Sharing is harder than agreeing: Label: en
33. Every problem has a weakest failure detector: Label: en
34. Failure detectors in loosely named systems: Label: en
35. Anti-Ω: Label: en
36. A jamming-resistant MAC protocol for single-hop wireless networks: Label: en
37. A log-star distributed maximal independent set algorithm for growth-bounded graphs: Label: en
38. Sublogarithmic distributed MIS algorithm for sparse graphs using nash-williams decomposition: Label: en
39. Distributed computation of the mode: Label: en
40. Beyond nash equilibrium: Label: en
41. Efficient single phase unconditionally secure message transmission with optimum communication complexity: Label: en
42. Stateless distributed algorithms for near optimal maximum multicommodity flows: Label: en