| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Peter Widmayer 103 Evangelos Kranakis , Paolo Penna , Konrad Schlude , David Scot Taylor , Peter Widmayer: Improving Customer Proximity to Railway Stations. CIAC 2003 : 264-276 102 Eljas Soisalon-Soininen , Peter Widmayer: Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis. Computer Science in Perspective 2003 : 278-292 101 Gustavo Alonso , Evangelos Kranakis , Roger Wattenhofer , Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. IPDPS 2003 : 218 100 Jens-Peter Dittrich , Bernhard Seeger , David Scot Taylor , Peter Widmayer: On producing join results early. PODS 2003 : 134-142 99 Enrico Nardelli , Guido Proietti , Peter Widmayer: Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast. Algorithmica 35 (1): 56-74 (2003) 98 Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding the most vital node of a shortest path. TCS 296 (1): 167-177 (2003) 97 Peter Widmayer, Francisco Triguero Ruiz , Rafael Morales , Matthew Hennessy , Stephan Eidenbenz , Ricardo Conejo : Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Springer 2002 96 Aris Pagourtzis , Paolo Penna , Konrad Schlude , Kathleen Steinhöfel , David Scot Taylor , Peter Widmayer: Server Placements, Roman Domination and other Dominating Set Variants. IFIP TCS 2002 : 280-291 95 Eljas Soisalon-Soininen , Peter Widmayer: Amortized Complexity of Bulk Updates in AVL-Trees. SWAT 2002 : 439-448 94 Jens-Peter Dittrich , Bernhard Seeger , David Scot Taylor , Peter Widmayer: Progressive Merge Join: A Generic and Non-blocking Sort-based Join Algorithm. VLDB 2002 : 299-310 93 Luzi Anderegg , Paolo Penna , Peter Widmayer: Online train disposition: to wait or not to wait? ENTCS 66 (6): (2002) 92 Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding the Most Vital Node of a Shortest Path. COCOON 2001 : 278-287 91 Stephan Eidenbenz , Peter Widmayer: An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001 : 333-344 90 Juraj Hromkovic , Kathleen Steinhöfel , Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001 : 90-106 89 Thomas Erlebach , Martin Gantenbein , Daniel Hürlimann , Gabriele Neyer , Aris Pagourtzis , Paolo Penna , Konrad Schlude , Kathleen Steinhöfel , David Scot Taylor , Peter Widmayer: On the Complexity of Train Assignment Problems. ISAAC 2001 : 390-402 88 Paola Flocchini , Giuseppe Prencipe , Nicola Santoro , Peter Widmayer: Gathering of Asynchronous Oblivious Robots with Limited Visibility. STACS 2001 : 247-258 87 Stephan Eidenbenz , Christoph Stamm , Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31 (1): 79-113 (2001) 86 Kim S. Larsen , Eljas Soisalon-Soininen , Peter Widmayer: Relaxed Balance Using Standard Rotations. Algorithmica 31 (4): 501-512 (2001) 85 Enrico Nardelli , Guido Proietti , Peter Widmayer: A faster computation of the most vital edge of a shortest path. Information Processing Letters 79 (2): 81-85 (2001) 84 Renato Pajarola , Peter Widmayer: Virtual Geoexploration: Concepts and Design Choices. International Journal of Computational Geometry and Applications 11 (1): 1-14 (2001) 83 Enrico Nardelli , Guido Proietti , Peter Widmayer: Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA 2000 : 346-355 82 Srinivas Doddi , Madhav V. Marathe , S. S. Ravi , David Scot Taylor , Peter Widmayer: Approximation Algorithms for Clustering to Minimize the Sum of Diameters. SWAT 2000 : 237-250 81 Srinivas Doddi , Madhav V. Marathe , S. S. Ravi , David Scot Taylor , Peter Widmayer: Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Nordic Journal of Computing 7 (3): 185-203 (2000) 80 Peter Widmayer, Gabriele Neyer , Stephan Eidenbenz : Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings. Springer 1999 79 Enrico Nardelli , Guido Proietti , Peter Widmayer: How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON 1999 : 144-153 78 Jochen Van den Bercken , Bernhard Seeger , Peter Widmayer: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999 : 257 77 Paola Flocchini , Giuseppe Prencipe , Nicola Santoro , Peter Widmayer: Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots. ISAAC 1999 : 93-102 76 Eljas Soisalon-Soininen , Peter Widmayer: Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG 1999 : 192-198 75 Edmund Ihler , Gabriele Reich , Peter Widmayer: Class Steiner Trees and VLSI-design. Discrete Applied Mathematics 90 (1-3): 173-194 (1999) 74 Andrew U. Frank , Stéphane Grumbach , Ralf Hartmut Güting , Christian S. Jensen , Manolis Koubarakis , Nikos A. Lorentzos , Yannis Manolopoulos , Enrico Nardelli , Barbara Pernici , Hans-Jörg Schek , Michel Scholl , Timos K. Sellis , Babis Theodoulidis , Peter Widmayer: Chorochronos: A Research Network for Spatiotemporal Database Systems. SIGMOD Record 28 (3): 12-21 (1999) 73 Stephan Eidenbenz , Christoph Stamm , Peter Widmayer: Inapproximability of some art gallery problems. CCCG 1998 72 Stephan Eidenbenz , Christoph Stamm , Peter Widmayer: Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998 : 187-198 71 Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding All the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. ESA 1998 : 55-66 70 Renato Pajarola , Thomas Ohler , Peter Stucki , Kornel Szabo , Peter Widmayer: The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. ICDE 1998 : 550-557 69 Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Information Processing Letters 67 (1): 51-54 (1998) 68 Roger Wattenhofer , Peter Widmayer: An Inherent Bottleneck in Distributed Counting. Journal of Parallel and Distributed Computing 49 (1): 135-145 (1998) 67 Marc J. van Kreveld , Jürg Nievergelt , Thomas Roos , Peter Widmayer: Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems, Udine, Italy, September 16-20, 1996. Springer 1997 66 Eljas Soisalon-Soininen , Peter Widmayer: Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity 1997 : 267-283 65 Gabriele Neyer , Peter Widmayer: Singularities Make Spatial Join Scheduling Hard. ISAAC 1997 : 293-302 64 Roger Wattenhofer , Peter Widmayer: An Inherent Bottleneck in Distributed Counting. PODC 1997 : 159-167 63 Jochen Van den Bercken , Bernhard Seeger , Peter Widmayer: A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997 : 406-415 62 Kim S. Larsen , Eljas Soisalon-Soininen , Peter Widmayer: Relaxed Balance through Standard Rotations. WADS 1997 : 450-461 61 Tetsuo Asano , Desh Ranjan , Thomas Roos , Emo Welzl , Peter Widmayer: Space-Filling Curves and Their Use in the Design of Geometric Data Structures. TCS 181 (1): 3-15 (1997) 60 Jürg Nievergelt , Peter Widmayer: Spatial Data Structures: Concepts and Design Choices. Algorithmic Foundations of Geographic Information Systems 1996 : 153-197 59 Edouard Bugnion , Thomas Roos , Roger Wattenhofer , Peter Widmayer: Space Filling Curves versus Random Walks. Algorithmic Foundations of Geographic Information Systems 1996 : 199-211 58 Renato Pajarola , Peter Widmayer: Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression. IW-MMDBMS 1996 : 94-100 57 Bruno Becker , Paolo Giulio Franciosa , Stephan Gschwind , Stefano Leonardi , Thomas Ohler , Peter Widmayer: Enclosing a Set of Objects by Two Minimum Area Rectangles. J. Algorithms 21 (3): 520-541 (1996) 56 Bruno Becker , Stephan Gschwind , Thomas Ohler , Bernhard Seeger , Peter Widmayer: An Asymptotically Optimal Multiversion B-Tree. VLDB Journal 5 (4): 264-275 (1996) 55 Viet Hai Nguyen , Peter Widmayer: Binary Space Partitions for Sets of Hyperrectangles. ASIAN 1995 : 59-72 54 Tetsuo Asano , Desh Ranjan , Thomas Roos , Emo Welzl , Peter Widmayer: Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN 1995 : 36-48 53 Brigitte Kröll , Peter Widmayer: Balanced Distributed Search Trees Do Not Exist. WADS 1995 : 50-61 52 Fabrizio d'Amore , V. H. Nguyen , Thomas Roos , Peter Widmayer: On Optimal Cuts of Hyperrectangles. Computing 55 (3): 191-206 (1995) 51 Jürg Nievergelt , Thomas Roos , Hans-Jörg Schek , Peter Widmayer: IGIS '94: Geographic Information Systems, International Workshop on Advanced Information Systems, Monte Verita, Ascona, Switzerland, February 28 - March 4, 1994, Proceedings. Springer 1994 50 Thomas Roos , Fei Shi , Peter Widmayer: A Data Structure for Approximate String Searching. HICSS (5) 1994 : 45-46 49 Viet Hai Nguyen , Thomas Ohler , Peter Widmayer: VisTool: A Visualization Tool for Spatial Access Structures. IGIS 1994 : 274-287 48 Brigitte Kröll , Peter Widmayer: Distributing a Search Tree Among a Growing Number of Processors. SIGMOD Conference 1994 : 265-276 47 Thomas Roos , Peter Widmayer: k-Violation Linear Programming. Information Processing Letters 52 (2): 109-114 (1994) 46 Viet Hai Nguyen , Thomas Roos , Peter Widmayer: Balanced Cuts of a Set of Hyperrectangles. CCCG 1993 : 121-126 45 Thomas Ohler , Peter Widmayer: A Brief Tutorial Introduction to Data Structures for Geometric Databases. CISM - Advances in Database Systems 1993 : 329-351 44 Thomas Ohler , Peter Widmayer: Data Structures and Algorithms for Geographic Information Systems: Selected Topics. CISM - Advances in Database Systems 1993 : 353-364 43 Thomas Ohler , Peter Widmayer: Geographic Information Systems: An Example. CISM - Advances in Database Systems 1993 : 365-377 42 Fabrizio d'Amore , Thomas Roos , Peter Widmayer: An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. ICCG 1993 : 215-224 41 Bernd-Uwe Pagel , Hans-Werner Six , Heinrich Toben , Peter Widmayer: Towards an Analysis of Range Query Performance in Spatial Data Structures. PODS 1993 : 214-221 40 Bruno Becker , Stephan Gschwind , Thomas Ohler , Bernhard Seeger , Peter Widmayer: On Optimal Multiversion Access Structures. SSD 1993 : 123-141 39 Jürg Nievergelt , Peter Widmayer: Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. The Computer Journal 36 (2): 107-116 (1993) 38 Hans-Werner Six , Peter Widmayer: Spatial Access Structures for Geometric Databases. Data Structures and Efficient Algorithms 1992 : 214-232 37 Bruno Becker , Paolo Giulio Franciosa , Stephan Gschwind , Thomas Ohler , Gerald Thiemt , Peter Widmayer: Enclosing Many Boxes by an Optimal Pair of Boxes. STACS 1992 : 475-486 36 Andreas Henrich , Andreas Hilbert , Hans-Werner Six , Peter Widmayer: Anbindung einer rämlich clusternden Zugriffstruktur für geometrische Attribute an ein Standard-Datenbanksystem am Beispiel von Oracle. BTW 1991 : 161-177 35 Peter Widmayer: Datenstrukturen für Geodatenbanken. Entwicklungstendenzen bei Datenbanksystemen 1991 : 317-361 34 Bruno Becker , Hans-Werner Six , Peter Widmayer: Spatial Priority Search: An Access Technique for Scaleless Maps. SIGMOD Conference 1991 : 128-137 33 Edmund Ihler , Gabriele Reich , Peter Widmayer: On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry 1991 : 103-111 32 Bruno Becker , Paolo Giulio Franciosa , Stephan Gschwind , Thomas Ohler , Gerald Thiemt , Peter Widmayer: An Optimal Algorithm for Approximating a Set of Rectangles by Two Minimum Area Rectangles. Workshop on Computational Geometry 1991 : 13-25 31 Bruno Becker , Hans-Werner Six , Peter Widmayer: Maßstabsunabhängige Verwaltung von Landschaftsdaten. GI Jahrestagung (2) 1990 : 487-496 30 Peter Widmayer, Bruno Becker : Ein Vorschlag zur maßstabsunabhängigen Verwaltung von Landschaftsdaten. Grundlagen von Datenbanken 1990 : 95-96 29 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: The R-File: An Efficient Access Structure for Proximity Queries. ICDE 1990 : 372-379 28 Nicola Santoro , Peter Widmayer: Distributed Function Evaluation in the Presence of Transmission Faults. SIGAL International Symposium on Algorithms 1990 : 358-367 27 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: On the Power of Safe Locking. JCSS 40 (2): 269-288 (1990) 26 Peter Widmayer: Räumliche Suche in geometrischen Datenbanken. Grundlagen von Datenbanken 1989 25 Nicola Santoro , Peter Widmayer: Time is Not a Healer. STACS 1989 : 304-313 24 Andreas Henrich , Hans-Werner Six , Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989 : 45-53 23 Gabriele Reich , Peter Widmayer: Beyond Steiner's Problem: A VLSI Oriented Generalization. WG 1989 : 196-210 22 Andreas Henrich , Hans-Werner Six , Peter Widmayer: Paging Binary Trees with External Balancing. WG 1989 : 260-276 21 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: The Twin Grid File: A Nearly Space Optimal Index Structure. EDBT 1988 : 352-363 20 Hans-Werner Six , Peter Widmayer: Spatial Searching in Geometric Databases. ICDE 1988 : 496-503 19 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: Globally Order Preserving Multidimensional Linear Hashing. ICDE 1988 : 572-579 18 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: Twin Grid Files: Space Optimizing Access Schemes. SIGMOD Conference 1988 : 183-190 17 Andreas Hutflesz , Peter Widmayer, Hans-Werner Six : Twin Grid Files: A Performance Evaluation. Workshop on Computational Geometry 1988 : 15-24 16 Gregory J. E. Rawlins , Peter Widmayer, Derick Wood : Hole Problems for Rectangles in the Plane. SIAM Journal on Discrete Mathematics 1 (1): 86-97 (1988) 15 Thomas Rottke , Hans-Werner Six , Peter Widmayer: On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. WG 1987 : 94-105 14 Ying-Fung Wu , Peter Widmayer, Martine D. F. Schlag , C. K. Wong : Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles. IEEE Transactions on Computers 36 (3): 321-331 (1987) 13 Peter Widmayer, Derick Wood : Time- and Space-Optimal Contour Computation for a Set of Rectangles. Information Processing Letters 24 (5): 335-338 (1987) 12 Peter Widmayer, Y. F. Wu , C. K. Wong : On Some Distance Problems in Fixed Orientations. SIAM J. Comput. 16 (4): 728-746 (1987) 11 Hans-Werner Six , Peter Widmayer: Hintergrundspeicherstrukturen für ausgedehnte Objekte. GI Jahrestagung (1) 1986 : 538-552 10 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Towards Online Schedulers Based on Pre-Analysis Locking. ICDT 1986 : 242-259 9 Thomas Ottmann , Peter Widmayer: Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. INFOS 1986 : 420-431 8 Peter Widmayer: An Approximation Algorithms for Steiner's Problem in Graphs. WG 1986 : 17-28 7 Y. F. Wu , Peter Widmayer, C. K. Wong : A Faster Approximation Algorithm for the Steiner Problem in Graphs. Acta Informatica 23 (2): 223-229 (1986) 6 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Pre-analysis Locking. Information and Control 70 (2/3): 193-215 (1986) 5 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB 1985 : 270-281 4 Peter Widmayer, C. K. Wong : An Optimal Algorithm for the Maximum Alignment of Terminals. Information Processing Letters 20 (2): 75-82 (1985) 3 Thomas Ottmann , Peter Widmayer: Solving Visibility Problems by Using Skeleton Structures. MFCS 1984 : 459-470 2 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Maximal Concurrency by Locking. PODS 1984 : 38-44 1 Eljas Soisalon-Soininen , Peter Widmayer: On the Complexity of Concurrency Control by Locking in Distributed Database Systems. Information and Control 60 (1-3): 103-108 (1984)  DiSC'03 © 2003 Association for Computing Machinery |
