| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. David Scot Taylor Evangelos Kranakis , Paolo Penna , Konrad Schlude , David Scot Taylor, Peter Widmayer : Improving Customer Proximity to Railway Stations. CIAC 2003 : 264-276 Jens-Peter Dittrich , Bernhard Seeger , David Scot Taylor, Peter Widmayer : On producing join results early. PODS 2003 : 134-142 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 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 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 Elias Koutsoupias , David Scot Taylor: The CNN Problem and Other k-Server Variants. STACS 2000 : 581-592 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) Elias Koutsoupias , David Scot Taylor: Indexing Schemes for Random Points. SODA 1999 : 596-602 Elias Koutsoupias , David Scot Taylor: Tight Bounds for 2-Dimensional Indexing Schemes. PODS 1998 : 52-58 1 [ 7 ] [ 9 ] 2 [ 3 ] [ 4 ] 3 [ 6 ] 4 [ 6 ] 5 [ 6 ] 6 [ 1 ] [ 2 ] [ 5 ] 7 [ 10 ] 8 [ 3 ] [ 4 ] 9 [ 6 ] 10 [ 6 ] [ 8 ] 11 [ 6 ] [ 8 ] [ 10 ] 12 [ 3 ] [ 4 ] 13 [ 6 ] [ 8 ] [ 10 ] 14 [ 7 ] [ 9 ] 15 [ 6 ] [ 8 ] 16 [ 3 ] [ 4 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ]  ©2004 Association for Computing Machinery |
