DBLP: David Scot Taylor

	2009
c12		David Scot Taylor, Andrei F. Lurie, Cay S. Horstmenn, Menko B. Johnson, Sean K. Sharma, Edward C. Yin: Predictive vs. passive animation learning tools. SIGCSE 2009: 494-498
	2006
c11		David Scot Taylor: Online Distributed Object Migration. WAOA 2006: 330-344
	2004
j2		Elias Koutsoupias, David Scot Taylor: The CNN problem and other k-server variants. Theor. Comput. Sci. 324(2-3): 347-359 (2004)
	2003
c10		Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer: Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. ALENEX 2003: 106-118
c9		Evangelos Kranakis, Paolo Penna, Konrad Schlude, David Scot Taylor, Peter Widmayer: Improving Customer Proximity to Railway Stations. CIAC 2003: 264-276
c8		Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, Peter Widmayer: On producing join results early. PODS 2003: 134-142
	2002
c7		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
c6		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
	2001
c5		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
	2000
j1		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)
c4		Elias Koutsoupias, David Scot Taylor: The CNN Problem and Other k-Server Variants. STACS 2000: 581-592
c3		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
	1999
c2		Elias Koutsoupias, David Scot Taylor: Indexing Schemes for Random Points. SODA 1999: 596-602
	1998
c1		Elias Koutsoupias, David Scot Taylor: Tight Bounds for 2-Dimensional Indexing Schemes. PODS 1998: 52-58

2009

c12

David Scot Taylor, Andrei F. Lurie, Cay S. Horstmenn, Menko B. Johnson, Sean K. Sharma, Edward C. Yin: Predictive vs. passive animation learning tools. SIGCSE 2009: 494-498

2006

c11

David Scot Taylor: Online Distributed Object Migration. WAOA 2006: 330-344

2004

Elias Koutsoupias, David Scot Taylor: The CNN problem and other k-server variants. Theor. Comput. Sci. 324(2-3): 347-359 (2004)

2003

c10

Luzi Anderegg, Stephan Eidenbenz, Martin Gantenbein, Christoph Stamm, David Scot Taylor, Birgitta Weber, Peter Widmayer: Train Routing Algorithms: Concepts, Design Choises, and Practical Considerations. ALENEX 2003: 106-118

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

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

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

2001

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

2000

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: 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

1999

Elias Koutsoupias, David Scot Taylor: Indexing Schemes for Random Points. SODA 1999: 596-602

1998

Elias Koutsoupias, David Scot Taylor: Tight Bounds for 2-Dimensional Indexing Schemes. PODS 1998: 52-58

1	Luzi Anderegg	[c10]
2	Jens Dittrich (Jens-Peter Dittrich)	[c8] [c6]
3	Srinivas Doddi	[j1] [c3]
4	Stephan Eidenbenz	[c10]
5	Thomas Erlebach	[c5]
6	Martin Gantenbein	[c10] [c5]
7	Cay S. Horstmenn	[c12]
8	Daniel Hürlimann	[c5]
9	Menko B. Johnson	[c12]
10	Elias Koutsoupias	[j2] [c4] [c2] [c1]
11	Evangelos Kranakis	[c9]
12	Andrei F. Lurie	[c12]
13	Madhav V. Marathe	[j1] [c3]
14	Gabriele Neyer	[c5]
15	Aris Pagourtzis	[c7] [c5]
16	Paolo Penna	[c9] [c7] [c5]
17	S. S. Ravi	[j1] [c3]
18	Konrad Schlude	[c9] [c7] [c5]
19	Bernhard Seeger	[c8] [c6]
20	Sean K. Sharma	[c12]
21	Christoph Stamm	[c10]
22	Kathleen Steinhöfel	[c7] [c5]
23	Birgitta Weber	[c10]
24	Peter Widmayer	[c10] [c9] [c8] [c7] [c6] [c5] [j1] [c3]
25	Edward C. Yin	[c12]

David Scot Taylor

Coauthor Index