494 results on '"Christian Scheideler"'
Search Results
2. Reconfiguration and Locomotion with Joint Movements in the Amoebot Model.
3. Efficient Shape Formation by 3D Hybrid Programmable Matter: An Algorithm for Low Diameter Intermediate Structures.
4. Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter.
5. Invited Paper: Blockchains made Lightweight: A Median Rule for State Machine Replication.
6. The structural power of reconfigurable circuits in the amoebot model.
7. Routing Schemes for Hybrid Communication Networks.
8. Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.
9. The canonical amoebot model: algorithms and concurrency control.
10. Time-optimal construction of overlay networks.
11. Local Mutual Exclusion for Dynamic, Anonymous, Bounded Memory Message Passing Systems.
12. The Structural Power of Reconfigurable Circuits in the Amoebot Model.
13. Fault-Tolerant Shape Formation in the Amoebot Model.
14. Routing schemes for hybrid communication networks.
15. Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.
16. Brief Announcement: The (Limited) Power of Multiple Identities: Asynchronous Byzantine Reliable Broadcast with Improved Resilience through Collusion.
17. Coordinating Amoebots via Reconfigurable Circuits.
18. Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs.
19. Universal Coating in the 3D Hybrid Model.
20. Shape Formation and Locomotion with Joint Movements in the Amoebot Model.
21. The Canonical Amoebot Model: Algorithms and Concurrency Control.
22. Time-Optimal Construction of Overlay Networks.
23. Beep-And-Sleep: Message and Energy Efficient Set Cover.
24. Near-Shortest Path Routing in Hybrid Communication Networks.
25. Coordinating Amoebots via Reconfigurable Circuits.
26. Convex Hull Formation for Programmable Matter.
27. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.
28. Time- and Space-Optimal Discrete Clock Synchronization in the Beeping Model.
29. Fast Hybrid Network Algorithms for Shortest Paths in Sparse Graphs.
30. Shortest Paths in a Hybrid Network Model.
31. Survey on Algorithms for Self-stabilizing Overlay Networks.
32. Near-Shortest Path Routing in Hybrid Communication Networks.
33. Routing Schemes for Hybrid Communication Networks in Unit-Disk Graphs.
34. Beep-and-Sleep: Message and Energy Efficient Set Cover.
35. On the Complexity of Local Graph Transformations.
36. MULTISKIPGRAPH: A Self-Stabilizing Overlay Network that Maintains Monotonic Searchability.
37. Always be Two Steps Ahead of Your Enemy.
38. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks.
39. Faster Construction of Overlay Networks.
40. Fast Distributed Algorithms for LP-Type Problems of Low Dimension.
41. Skeap & Seap: Scalable Distributed Priority Queues for Constant and Arbitrary Priorities.
42. Distributed Computation in Node-Capacitated Networks.
43. A Loosely Self-stabilizing Protocol for Randomized Congestion Control with Logarithmic Memory.
44. Computing by Programmable Particles.
45. Forming tile shapes with simple robots.
46. 2022 Edsger W. Dijkstra Prize in Distributed Computing.
47. Skueue: A Scalable and Sequentially Consistent Distributed Queue.
48. Self-Stabilizing Supervised Publish-Subscribe Systems.
49. Forming Tile Shapes with Simple Robots.
50. Competitive Routing in Hybrid Communication Networks.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.