45 results on '"Peleg, David"'
Search Results
2. Misleading Stars: What Cannot Be Measured in the Internet?
3. Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast
4. Deterministic and Energy-Optimal Wireless Synchronization
5. Leader Election Using Loneliness Detection
6. Optimal Random Sampling from Distributed Streams Revisited
7. Byzantizing Paxos by Refinement
8. Unbounded Contention Resolution in Multiple-Access Channels
9. Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
10. Leakage-Resilient Coin Tossing
11. Physical Expander in Virtual Tree Overlay
12. Oblivious Collaboration
13. The Complexity of Data Aggregation in Directed Networks
14. Maximum Metric Spanning Tree Made Byzantine Tolerant
15. Trading Bit, Message, and Time Complexity of Distributed Algorithms
16. SMV: Selective Multi-Versioning STM
17. Sub-logarithmic Test-and-Set against a Weak Adversary
18. Tight Space Bounds for ℓ-Exclusion
19. Combinatorial Algorithms for Distributed Graph Coloring
20. Synchronous Rendezvous for Location-Aware Agents
21. On Approximate Distance Labels and Routing Schemes with Affine Stretch
22. Beeping a Maximal Independent Set
23. Toward a Formal Semantic Framework for Deterministic Parallel Programming
24. CAFÉ: Scalable Task Pools with Adjustable Fairness and Contention
25. Structured Derivation of Semi-Synchronous Algorithms
26. Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers
27. Black Hole Search with Finite Automata Scattered in a Synchronous Torus
28. The Contest between Simplicity and Efficiency in Asynchronous Byzantine Agreement
29. Byzantine Agreement Using Partial Authentication
30. Fast and Scalable Rendezvousing
31. Locality and Checkability in Wait-Free Computing
32. DISC 2011 Invited Lecture: Deterministic Rendezvous in Networks: Survey of Models and Results
33. Brief Announcement: Bridging the Theory-Practice Gap in Multi-commodity Flow Routing
34. Brief Announcement: Algorithmic Mechanisms for Internet-Based Computing under Unreliable Communication
35. Brief Announcement: Opportunistic Information Dissemination in Mobile Ad-Hoc Networks : Adaptiveness vs. Obliviousness and Randomization vs. Determinism
36. DISC 2011 Invited Lecture by Dahlia Malkhi: Going beyond Paxos
37. Brief Announcement: Composition Games for Distributed Systems: The EU Grants Games
38. Brief Announcement: Distributed Approximations for the Semi-matching Problem
39. Brief Announcement: Leaderless Byzantine Paxos
40. Brief Announcement: On the Meaning of Solving a Task with a Failure Detector
41. Brief Announcement: When You Don’t Trust Clients: Byzantine Proposer Fast Paxos
42. Brief Announcement: The BG-Simulation for Byzantine Mobile Robots
43. Brief Announcement: ΔΩ: Specifying an Eventual Leader Service for Dynamic Systems
44. Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic Networks
45. DISC 2011 Invited Lecture: Polygon Reconstruction with Little Information: An Example for the Power of Simple Micro-robots
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.