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