24 results on '"Widmayer, Peter"'
Search Results
2. Simple agents learn to find their way: An introduction on mapping polygons
3. Corner cuts are close to optimal: From solid grids to polygons and back
4. A polygon is determined by its angles
5. Discovery of network properties with all-shortest-paths queries
6. Strongly polynomial-time truthful mechanisms in one shot
7. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
8. Agreement in synchronous networks with ubiquitous faults
9. Gathering of asynchronous robots with limited visibility
10. Finding the most vital node of a shortest path
11. Online train disposition: To wait or not to wait?
12. Class Steiner trees and VLSI-design
13. A faster computation of the most vital edge of a shortest path
14. Chapter 17 - Spatial Data Structures: Concepts and Design Choices
15. FUN with algorithms
16. Combinatorial Optimization and Applications
17. Preface
18. Space-filling curves and their use in the design of geometric data structures
19. Finding the detour-critical edge of a shortest path between two nodes
20. Pre-analysis locking
21. On the complexity of concurrency control by locking in distributed database systems
22. Time- and space-optimal contour computation for a set of rectangles
23. k-Violation linear programming
24. Chapter 7 Fundamental algorithms and data structures
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.