default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Scot Taylor
Person information
- affiliation: San Jose State University, San Jose, CA, USA
- affiliation (Ph.D., 2000): University of California, Los Angeles, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[c12]David Scot Taylor
, Andrei F. Lurie, Cay S. Horstmann, 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 J. 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
1990 – 1999
- 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
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
