| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Peter Widmayer Thomas Erlebach , Riko Jacob , Matús Mihalák , Marc Nunkesser , Gábor Szabó , Peter Widmayer: An Algorithmic View on OVSF Code Assignment. STACS 2004 : 270-281 Stephan Eidenbenz , Matthew Hennessy , Rafael Morales Bueno , Francisco Triguero Ruiz , Peter Widmayer, Ricardo Conejo : Preface. Theor. Comput. Sci. 312 (1): 1-2 (2004) Gustavo Alonso , Evangelos Kranakis , Cindy Sawchuk , Roger Wattenhofer , Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks. ADHOC-NOW 2003 : 104-115 Evangelos Kranakis , Paolo Penna , Konrad Schlude , David Scot Taylor , Peter Widmayer: Improving Customer Proximity to Railway Stations. CIAC 2003 : 264-276 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 Gustavo Alonso , Evangelos Kranakis , Roger Wattenhofer , Peter Widmayer: Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks. IPDPS 2003 : 218 Stephan Eidenbenz , Aris Pagourtzis , Peter Widmayer: Flexible Train Rostering. ISAAC 2003 : 615-624 Jens-Peter Dittrich , Bernhard Seeger , David Scot Taylor , Peter Widmayer: On producing join results early. PODS 2003 : 134-142 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) Nicole Weicker , Gabor Szabó , Karsten Weicker , Peter Widmayer: Evolutionary multiobjective optimization for base station transmitter placement with frequency assignment. IEEE Trans. Evolutionary Computation 7 (2): 189-203 (2003) Stephan Eidenbenz , Peter Widmayer: An Approximation Algorithm for Minimum Convex Cover with Logarithmic Performance Guarantee. SIAM J. Comput. 32 (3): 654-670 (2003) Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding the most vital node of a shortest path. Theor. Comput. Sci. 296 (1): 167-177 (2003) Konrad Schlude , Eljas Soisalon-Soininen , Peter Widmayer: Distributed Search Trees: Fault Tolerance in an Asynchronous Environment. Theory Comput. Syst. 36 (6): 611-629 (2003) Peter Widmayer, Francisco Triguero Ruiz , Rafael Morales Bueno , Matthew Hennessy , Stephan Eidenbenz , Ricardo Conejo : Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings Springer 2002 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 Konrad Schlude , Eljas Soisalon-Soininen , Peter Widmayer: Distributed Highly Available Search Trees. SIROCCO 2002 : 259-274 Eljas Soisalon-Soininen , Peter Widmayer: Amortized Complexity of Bulk Updates in AVL-Trees. SWAT 2002 : 439-448 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 Luzi Anderegg , Paolo Penna , Peter Widmayer: Online train disposition: to wait or not to wait? Electr. Notes Theor. Comput. Sci. 66 (6): (2002) Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding the Most Vital Node of a Shortest Path. COCOON 2001 : 278-287 Stephan Eidenbenz , Peter Widmayer: An Approximation Algorithm for MINIMUM CONVEX COVER with Logarithmic Performance Guarantee. ESA 2001 : 333-344 Juraj Hromkovic , Kathleen Steinhöfel , Peter Widmayer: Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. ICTCS 2001 : 90-106 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 Paola Flocchini , Giuseppe Prencipe , Nicola Santoro , Peter Widmayer: Pattern Formation by Anonymous Robots Without Chirality. SIROCCO 2001 : 147-162 Paola Flocchini , Giuseppe Prencipe , Nicola Santoro , Peter Widmayer: Gathering of Asynchronous Oblivious Robots with Limited Visibility. STACS 2001 : 247-258 Stephan Eidenbenz , Christoph Stamm , Peter Widmayer: Inapproximability Results for Guarding Polygons and Terrains. Algorithmica 31 (1): 79-113 (2001) Kim S. Larsen , Eljas Soisalon-Soininen , Peter Widmayer: Relaxed Balance Using Standard Rotations. Algorithmica 31 (4): 501-512 (2001) Enrico Nardelli , Guido Proietti , Peter Widmayer: A faster computation of the most vital edge of a shortest path. Inf. Process. Lett. 79 (2): 81-85 (2001) Renato Pajarola , Peter Widmayer: Virtual Geoexploration: Concepts and Design Choices. Int. J. Comput. Geometry Appl. 11 (1): 1-14 (2001) Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding All the Best Swaps of a Minimum Diameter Spanning Tree Under Transient Edge Failures. J. Graph Algorithms Appl. 5 (5): 39-57 (2001) Enrico Nardelli , Guido Proietti , Peter Widmayer: Maintaining a Minimum Spanning Tree Under Transient Node Failures. ESA 2000 : 346-355 Martin Schneider , Christoph Stamm , Jürgen Symanzik , Peter Widmayer: Virtual reality and dynamic statistical graphics: A bidirectional link in a heterogeneous, distributed computing environment. PDPTA 2000 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 Srinivas Doddi , Madhav V. Marathe , S. S. Ravi , David Scot Taylor , Peter Widmayer: Approximation Algorithms for Clustering to Minimize the Sum of Diameters. Nord. J. Comput. 7 (3): 185-203 (2000) Nicola Santoro , Peter Widmayer: Distributed Data & Structures, Records of the 1st International Meeting (WDAS 1998), Orlando, Florida, USA Carleton Scientific 1999 Yuri Breitbart , Sajal K. Das , Nicola Santoro , Peter Widmayer: Distributed Data & Structures 2, Records of the 2nd International Meeting (WDAS 1999), Princeton, USA, May 10-11, 1999 Carleton Scientific 1999 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 Enrico Nardelli , Guido Proietti , Peter Widmayer: How to Swap a Failing Edge of a Single Source Shortest Paths Tree. COCOON 1999 : 144-153 Jochen Van den Bercken , Bernhard Seeger , Peter Widmayer: The Bulk Index Join: A Generic Approach to Processing Non-Equijoins. ICDE 1999 : 257 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 Eljas Soisalon-Soininen , Peter Widmayer: Concurrency and Recovery in Full-Text Indexing. SPIRE/CRIWG 1999 : 192-198 Yuri Breitbart , Sajal K. Das , Nicola Santoro , Peter Widmayer: Introduction: Distributed Data & Structures 2. WDAS 1999 Edmund Ihler , Gabriele Reich , Peter Widmayer: Class Steiner Trees and VLSI-design. Discrete Applied Mathematics 90 (1-3): 173-194 (1999) 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) Stephan Eidenbenz , Christoph Stamm , Peter Widmayer: Inapproximability of some art gallery problems. CCCG 1998 Christoph Stamm , Stephan Eidenbenz , Michael Beck , Peter Stucki , Peter Widmayer: A Prototype System for Light Propagation in Terrains. Computer Graphics International 1998 : 103- Stephan Eidenbenz , Christoph Stamm , Peter Widmayer: Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result. ESA 1998 : 187-198 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 Renato Pajarola , Thomas Ohler , Peter Stucki , Kornel Szabo , Peter Widmayer: The Alps at Your Fingertips: Virtual Reality and Geoinformation Systems. ICDE 1998 : 550-557 Roger Wattenhofer , Peter Widmayer: The counting pyramid: an adaptive distributed counting scheme. SIROCCO 1998 : 145-157 Roger Wattenhofer , Peter Widmayer: A Unified Analysis of Distributed Counting with Queueing Theory. WDAS 1998 : 84-97 Nicola Santoro , Peter Widmayer: Introduction: Distributed Data and Structures 1. WDAS 1998 Enrico Nardelli , Guido Proietti , Peter Widmayer: Finding the Detour-Critical Edge of a Shortest Path Between Two Nodes. Inf. Process. Lett. 67 (1): 51-54 (1998) Roger Wattenhofer , Peter Widmayer: An Inherent Bottleneck in Distributed Counting. J. Parallel Distrib. Comput. 49 (1): 135-145 (1998) Danny Krizanc , Peter Widmayer: SIROCCO'97, 4th International Colloquium on Structural Information & Communication Complexity, Monte Verita, Ascona, Switzerland, July 24-26, 1997 Carleton Scientific 1997 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 Eljas Soisalon-Soininen , Peter Widmayer: Relaxed Balancing in Search Trees. Advances in Algorithms, Languages, and Complexity 1997 : 267-283 Gabriele Neyer , Peter Widmayer: Singularities Make Spatial Join Scheduling Hard. ISAAC 1997 : 293-302 Roger Wattenhofer , Peter Widmayer: An Inherent Bottleneck in Distributed Counting. PODC 1997 : 159-167 Jochen Van den Bercken , Bernhard Seeger , Peter Widmayer: A Generic Approach to Bulk Loading Multidimensional Index Structures. VLDB 1997 : 406-415 Kim S. Larsen , Eljas Soisalon-Soininen , Peter Widmayer: Relaxed Balance through Standard Rotations. WADS 1997 : 450-461 Tetsuo Asano , Desh Ranjan , Thomas Roos , Emo Welzl , Peter Widmayer: Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. 181 (1): 3-15 (1997) Jürg Nievergelt , Peter Widmayer: Spatial Data Structures: Concepts and Design Choices. Algorithmic Foundations of Geographic Information Systems 1996 : 153-197 Edouard Bugnion , Thomas Roos , Roger Wattenhofer , Peter Widmayer: Space Filling Curves versus Random Walks. Algorithmic Foundations of Geographic Information Systems 1996 : 199-211 Renato Pajarola , Peter Widmayer: Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression. IW-MMDBMS 1996 : 94-100 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) Bruno Becker , Stephan Gschwind , Thomas Ohler , Bernhard Seeger , Peter Widmayer: An Asymptotically Optimal Multiversion B-Tree. VLDB J. 5 (4): 264-275 (1996) Viet Hai Nguyen , Peter Widmayer: Binary Space Partitions for Sets of Hyperrectangles. ASIAN 1995 : 59-72 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 Brigitte Kröll , Peter Widmayer: Balanced Distributed Search Trees Do Not Exist. WADS 1995 : 50-61 Fabrizio d'Amore , V. H. Nguyen , Thomas Roos , Peter Widmayer: On Optimal Cuts of Hyperrectangles. Computing 55 (3): 191-206 (1995) 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 Thomas Roos , Fei Shi , Peter Widmayer: A Data Structure for Approximate String Searching. HICSS (5) 1994 : 45-46 Viet Hai Nguyen , Thomas Ohler , Peter Widmayer: VisTool: A Visualization Tool for Spatial Access Structures. IGIS 1994 : 274-287 Brigitte Kröll , Peter Widmayer: Distributing a Search Tree Among a Growing Number of Processors. SIGMOD Conference 1994 : 265-276 Thomas Roos , Peter Widmayer: k-Violation Linear Programming. Inf. Process. Lett. 52 (2): 109-114 (1994) Thomas Ottmann , Peter Widmayer: Algorithmen und Datenstrukturen, 2. Auflage Bibliographisches Institut 1993 Viet Hai Nguyen , Thomas Roos , Peter Widmayer: Balanced Cuts of a Set of Hyperrectangles. CCCG 1993 : 121-126 Thomas Ohler , Peter Widmayer: A Brief Tutorial Introduction to Data Structures for Geometric Databases. CISM - Advances in Database Systems 1993 : 329-351 Thomas Ohler , Peter Widmayer: Data Structures and Algorithms for Geographic Information Systems: Selected Topics. CISM - Advances in Database Systems 1993 : 353-364 Thomas Ohler , Peter Widmayer: Geographic Information Systems: An Example. CISM - Advances in Database Systems 1993 : 365-377 Fabrizio d'Amore , Thomas Roos , Peter Widmayer: An Optimal Algorithm for Computing a Best Cut of a Set of Hyperrectangles. ICCG 1993 : 215-224 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 Bruno Becker , Stephan Gschwind , Thomas Ohler , Bernhard Seeger , Peter Widmayer: On Optimal Multiversion Access Structures. SSD 1993 : 123-141 Jürg Nievergelt , Peter Widmayer: Guard Files: Stabbing and Intersection Queries on Fat Spatial Objects. Comput. J. 36 (2): 107-116 (1993) Hans-Werner Six , Peter Widmayer: Spatial Access Structures for Geometric Databases. Data Structures and Efficient Algorithms 1992 : 214-232 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 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 Bruno Becker , Hans-Werner Six , Peter Widmayer: Spatial Priority Search: An Access Technique for Scaleless Maps. SIGMOD Conference 1991 : 128-137 Edmund Ihler , Gabriele Reich , Peter Widmayer: On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry 1991 : 103-111 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 Peter Widmayer: Datenstrukturen für Geodatenbanken. Entwicklungstendenzen bei Datenbanksystemen 1991 : 317-361 Thomas Ottmann , Peter Widmayer: Algorithmen und Datenstrukturen Bibliographisches Institut 1990 Bruno Becker , Hans-Werner Six , Peter Widmayer: Maßstabsunabhängige Verwaltung von Landschaftsdaten. GI Jahrestagung (2) 1990 : 487-496 Peter Widmayer, Bruno Becker : Ein Vorschlag zur maßstabsunabhängigen Verwaltung von Landschaftsdaten. Grundlagen von Datenbanken 1990 : 95-96 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: The R-File: An Efficient Access Structure for Proximity Queries. ICDE 1990 : 372-379 Nicola Santoro , Peter Widmayer: Distributed Function Evaluation in the Presence of Transmission Faults. SIGAL International Symposium on Algorithms 1990 : 358-367 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: On the Power of Safe Locking. J. Comput. Syst. Sci. 40 (2): 269-288 (1990) Peter Widmayer: Räumliche Suche in geometrischen Datenbanken. Grundlagen von Datenbanken 1989 Nicola Santoro , Peter Widmayer: Time is Not a Healer. STACS 1989 : 304-313 Andreas Henrich , Hans-Werner Six , Peter Widmayer: The LSD tree: Spatial Access to Multidimensional Point and Nonpoint Objects. VLDB 1989 : 45-53 Gabriele Reich , Peter Widmayer: Beyond Steiner's Problem: A VLSI Oriented Generalization. WG 1989 : 196-210 Andreas Henrich , Hans-Werner Six , Peter Widmayer: Paging Binary Trees with External Balancing. WG 1989 : 260-276 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: The Twin Grid File: A Nearly Space Optimal Index Structure. EDBT 1988 : 352-363 Hans-Werner Six , Peter Widmayer: Spatial Searching in Geometric Databases. ICDE 1988 : 496-503 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: Globally Order Preserving Multidimensional Linear Hashing. ICDE 1988 : 572-579 Andreas Hutflesz , Hans-Werner Six , Peter Widmayer: Twin Grid Files: Space Optimizing Access Schemes. SIGMOD Conference 1988 : 183-190 Andreas Hutflesz , Peter Widmayer, Hans-Werner Six : Twin Grid Files: A Performance Evaluation. Workshop on Computational Geometry 1988 : 15-24 Gregory J. E. Rawlins , Peter Widmayer, Derick Wood : Hole Problems for Rectangles in the Plane. SIAM J. Discrete Math. 1 (1): 86-97 (1988) Thomas Rottke , Hans-Werner Six , Peter Widmayer: On the Analysis of Grid Structures for Spatial Objects of Non-Zero Size. WG 1987 : 94-105 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 Trans. Computers 36 (3): 321-331 (1987) Peter Widmayer, Derick Wood : Time- and Space-Optimal Contour Computation for a Set of Rectangles. Inf. Process. Lett. 24 (5): 335-338 (1987) Peter Widmayer, Y. F. Wu , C. K. Wong : On Some Distance Problems in Fixed Orientations. SIAM J. Comput. 16 (4): 728-746 (1987) Hans-Werner Six , Peter Widmayer: Hintergrundspeicherstrukturen für ausgedehnte Objekte. GI Jahrestagung (1) 1986 : 538-552 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Towards Online Schedulers Based on Pre-Analysis Locking. ICDT 1986 : 242-259 Thomas Ottmann , Peter Widmayer: Modellversuch computergestützter Informatikunterricht: Algorithmen und Datenstrukturen. INFOS 1986 : 420-431 Peter Widmayer: An Approximation Algorithms for Steiner's Problem in Graphs. WG 1986 : 17-28 Y. F. Wu , Peter Widmayer, C. K. Wong : A Faster Approximation Algorithm for the Steiner Problem in Graphs. Acta Inf. 23 (2): 223-229 (1986) Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Pre-analysis Locking Information and Control 70 (2/3): 193-215 (1986) Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Pre-Analysis Locking: A Safe and Deadlock Free Locking Policy. VLDB 1985 : 270-281 Peter Widmayer, C. K. Wong : An Optimal Algorithm for the Maximum Alignment of Terminals. Inf. Process. Lett. 20 (2): 75-82 (1985) Thomas Ottmann , Peter Widmayer: Solving Visibility Problems by Using Skeleton Structures. MFCS 1984 : 459-470 Georg Lausen , Eljas Soisalon-Soininen , Peter Widmayer: Maximal Concurrency by Locking. PODS 1984 : 38-44 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) 1 [ 119 ] [ 122 ] 2 [ 106 ] 3 [ 56 ] [ 63 ] 4 [ 79 ] 5 [ 30 ] [ 31 ] [ 34 ] [ 36 ] [ 38 ] [ 41 ] [ 58 ] [ 59 ] 6 [ 65 ] [ 86 ] 7 [ 83 ] [ 89 ] 8 [ 111 ] [ 123 ] 9 [ 61 ] 10 [ 111 ] [ 123 ] 11 [ 83 ] [ 89 ] 12 [ 107 ] [ 117 ] 13 [ 91 ] [ 92 ] 14 [ 78 ] [ 79 ] [ 80 ] [ 88 ] [ 99 ] [ 104 ] [ 111 ] [ 114 ] [ 118 ] [ 123 ] 15 [ 102 ] [ 124 ] 16 [ 85 ] [ 100 ] [ 101 ] 17 [ 34 ] [ 38 ] [ 59 ] 18 [ 81 ] 19 [ 102 ] 20 [ 81 ] 21 [ 34 ] [ 38 ] [ 41 ] [ 58 ] [ 59 ] 22 [ 81 ] 23 [ 111 ] [ 123 ] 24 [ 22 ] [ 24 ] [ 37 ] 25 [ 37 ] 26 [ 103 ] 27 [ 102 ] 28 [ 17 ] [ 18 ] [ 19 ] [ 21 ] [ 29 ] 29 [ 35 ] [ 82 ] 30 [ 124 ] 31 [ 81 ] 32 [ 81 ] 33 [ 119 ] [ 121 ] [ 122 ] 34 [ 69 ] 35 [ 70 ] 36 [ 50 ] [ 55 ] 37 [ 64 ] [ 98 ] 38 [ 2 ] [ 5 ] [ 6 ] [ 10 ] [ 27 ] 39 [ 59 ] 40 [ 81 ] 41 [ 81 ] 42 [ 91 ] [ 92 ] 43 [ 124 ] 44 [ 72 ] [ 77 ] [ 81 ] [ 87 ] [ 94 ] [ 95 ] [ 97 ] [ 105 ] [ 113 ] [ 116 ] 45 [ 67 ] [ 88 ] [ 102 ] 46 [ 54 ] 47 [ 47 ] [ 51 ] [ 57 ] 48 [ 40 ] [ 53 ] [ 62 ] [ 69 ] 49 [ 124 ] 50 [ 34 ] [ 38 ] [ 41 ] [ 44 ] [ 45 ] [ 46 ] [ 51 ] [ 58 ] [ 59 ] [ 76 ] 51 [ 3 ] [ 9 ] [ 32 ] [ 48 ] 52 [ 42 ] 53 [ 102 ] [ 110 ] [ 118 ] 54 [ 60 ] [ 76 ] [ 96 ] 55 [ 102 ] [ 106 ] [ 110 ] [ 121 ] 56 [ 81 ] 57 [ 85 ] [ 100 ] [ 101 ] 58 [ 72 ] [ 77 ] [ 87 ] [ 94 ] [ 95 ] [ 97 ] [ 105 ] [ 113 ] [ 116 ] 59 [ 56 ] [ 63 ] 60 [ 91 ] [ 92 ] 61 [ 16 ] 62 [ 23 ] [ 35 ] [ 82 ] 63 [ 43 ] [ 47 ] [ 49 ] [ 52 ] [ 53 ] [ 54 ] [ 56 ] [ 61 ] [ 63 ] [ 69 ] 64 [ 15 ] 65 [ 111 ] [ 123 ] 66 [ 25 ] [ 28 ] [ 73 ] [ 83 ] [ 85 ] [ 89 ] [ 90 ] [ 100 ] [ 101 ] 67 [ 122 ] 68 [ 53 ] [ 81 ] 69 [ 14 ] 70 [ 102 ] [ 109 ] [ 110 ] [ 112 ] [ 121 ] 71 [ 93 ] 72 [ 81 ] 73 [ 41 ] [ 58 ] [ 65 ] [ 86 ] [ 107 ] [ 117 ] 74 [ 81 ] 75 [ 52 ] 76 [ 11 ] [ 15 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 22 ] [ 24 ] [ 29 ] [ 31 ] [ 36 ] [ 37 ] [ 39 ] [ 42 ] 77 [ 1 ] [ 2 ] [ 5 ] [ 6 ] [ 10 ] [ 27 ] [ 64 ] [ 68 ] [ 84 ] [ 98 ] [ 108 ] [ 109 ] [ 112 ] [ 120 ] 78 [ 78 ] [ 79 ] [ 80 ] [ 93 ] [ 99 ] 79 [ 102 ] [ 103 ] [ 110 ] 80 [ 76 ] [ 79 ] 81 [ 93 ] 82 [ 115 ] 83 [ 124 ] 84 [ 76 ] 85 [ 91 ] [ 92 ] [ 102 ] [ 107 ] [ 110 ] [ 117 ] [ 121 ] 86 [ 81 ] 87 [ 34 ] [ 38 ] 88 [ 42 ] 89 [ 61 ] [ 66 ] [ 71 ] [ 74 ] [ 75 ] [ 119 ] [ 122 ] 90 [ 115 ] 91 [ 115 ] 92 [ 56 ] [ 63 ] 93 [ 4 ] [ 7 ] [ 12 ] [ 14 ] 94 [ 13 ] [ 16 ] 95 [ 7 ] [ 12 ] 96 [ 14 ] 97 [ 43 ] [ 54 ]  ©2004 Association for Computing Machinery |
