Refereed Publications

• D. S. Taylor, A. F. Lurie, C. S. Horstmann, M. B. Johnson, S. K. Sharma, E. C. Yin.
  Predictive vs. passive animation learning tools.
  Proceedings of the 40th SIGCSE Technical Symposium on Computer Science Education, Chattanooga, TN, 2009.
• D. S. Taylor.
  Online distributed object migration.
  4th International Workshop on Approximation and Online Algorithmson Online Algorithms, Zurich, Switzerland, 2006.
• E. Koutsoupias and D. S. Taylor.
  The CNN problem and other k-server variants.
  Theoretical Computer Science 324(2-3), Special Issue on Online Algorithms, Elsevier Science, 2004.
  Conference Version © Springer-Verlag. PostScript
  Part of Springer-Verlag LNCS series.
  In Proceedings of the Seventeenth International Symposium on Theoretical Aspects of Computer Science, Lille, France, February 17-19, 2000.
• J-P. Dittrich, B. Seeger, D. S. Taylor, and P. Widmayer
  On producing join results early. PDF PostScript
  Proceedings of the 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, California, June 9-12, 2003.
• E. Kranakis, P. Penna, K. Schlude, D. S. Taylor, and P. Widmayer
  Improving customer proximity to railway stations. PDF
  Proceedings of the Fifth Italian Conference on Algorithms and Complexity, Rome, Italy, May 28-30, 2003.
• L. Anderegg, S. Eidenbenz, M. Gantenbein, C. Stamm, D. S. Taylor, B. Weber, and P. Widmayer.
  Train routing algorithms: concepts, design choices, and practical considerations. PDF PostScript
  Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, Baltimore, Maryland, January 11 2003.
• A. Pagourtzis, P. Penna, K. Schlude, K. Steinhöfel, D. S. Taylor, and P. Widmayer.
  Server placements, Roman domination and other dominating set variants. PDF
  Proceedings of the Second IFIP International Conference on Theoretical Computer Science, Montreal, Quebec, Canada, August 25-30, 2002.
• J-P. Dittrich, B. Seeger, D. S. Taylor, and P. Widmayer.
  Progressive Merge Join: a generic and non-blocking sort-based join algorithm. PDF Postscript
  Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China, August 20-23, 2002.
• T. Erlebach, M. Gantenbein, D. Hürlimann, G. Neyer, A. Pagourtzis, P. Penna, K. Schlude, K. Steinhöfel, D. S. Taylor, and P. Widmayer.
  On the complexity of train assignment problems. © Springer-Verlag. Postscript Part of Springer-Verlag LNCS series.
  In Proceedings of the Twelfth International Symposium on Algorithms and Computation, Christchurch, New Zealand, Dec 19-21, 2001.
• S. Doddi, M. Marathe, S. S. Ravi, D. S. Taylor, and P. Widmayer.
  Approximation algorithms for clustering to minimize the sum of diameters. © Publishing Association Nordic Journal of Computing. Postscript
  In Nordic Journal of Computing, 7(3), 2000.
  Conference Version © Springer-Verlag. PostScript
  Part of Springer-Verlag LNCS series.
  In Proceedings of the Seventh Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000.
• E. Koutsoupias and D. S. Taylor.
  Indexing schemes for random points. PostScript
  In Proceedings of the Tenth ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, January 17-19, 1999.
• E. Koutsoupias and D. S. Taylor.
  Tight bounds for 2-dimensional indexing schemes. PostScript
  In Proceedings of the Seventeenth ACM-SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, Washington, June 1-4, 1998.