default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon Kahan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j5]Jacob Nelson, Brandon Holt, Brandon Myers, Preston Briggs, Simon Kahan, Luis Ceze, Mark Oskin:
Trading Latency for Performance in Data-Intensive Applications. login Usenix Mag. 40(5) (2015)- [c13]Jacob Nelson, Brandon Holt, Brandon Myers, Preston Briggs, Luis Ceze, Simon Kahan, Mark Oskin:
Latency-Tolerant Software Distributed Shared Memory. USENIX ATC 2015: 291-305 - 2014
- [j4]Seunghwa Kang, Simon Kahan, Jason E. McDermott
, Nicholas S. Flann, Ilya Shmulevich:
Biocellion: accelerating computer simulation of multicellular biological system models. Bioinform. 30(21): 3101-3108 (2014) - 2011
- [c12]Jacob Nelson, Brandon Myers, A. H. Hunter, Preston Briggs, Luis Ceze, Carl Ebeling, Dan Grossman, Simon Kahan, Mark Oskin:
Crunching Large Graphs with Commodity Processors. HotPar 2011
2000 – 2009
- 2007
- [c11]Jonathan W. Berry, Bruce Hendrickson, Simon Kahan, Petr Konecny:
Software and Algorithms for Graph Queries on Multithreaded Architectures. IPDPS 2007: 1-14 - 2006
- [c10]Simon Kahan, Petr Konecny:
"MAMA!": a memory allocator for multithreaded architectures. PPoPP 2006: 178-186 - 2005
- [c9]John Feo, David Harper, Simon Kahan, Petr Konecny:
ELDORADO. Conf. Computing Frontiers 2005: 28-34 - 2003
- [c8]Robert R. Henry, Simon Kahan, Jason Liu, David M. Nicol:
An Implementation of the SSF Scalable Simulation Framework on the Cray MTA. PADS 2003: 77-88
1990 – 1999
- 1999
- [j3]Simon Kahan, Jack Snoeyink:
On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. Comput. Geom. 12(1-2): 33-44 (1999) - [c7]Leonid Y. Zaslavsky, Simon Kahan, Bracy H. Elton, Kristyn J. Maschhoff, Louis G. Stern:
A Scalable Approach for Solving Irregular Sparse Linear Systems on the Tera MTA Multithreaded Parallel Shared-Memory Computer. PP 1999 - 1997
- [c6]Gail A. Alverson, Preston Briggs, Susan Coatney, Simon Kahan, Richard Korry:
Tera Hardware Software Cooperation. SC 1997: 38 - 1996
- [c5]Simon Kahan, Jack Snoeyink:
On the Bit Complexity of Minimum Link Paths: Superquadratic Algorithms for Problems Solvable in Linear Time. SCG 1996: 151-158 - 1995
- [c4]Gail A. Alverson, Simon Kahan, Richard Korry, Cathy McCann, Burton J. Smith:
Scheduling on the Tera MTA. JSSPP 1995: 19-44 - 1993
- [j2]Richard Anderson, Simon Kahan, Martine D. F. Schlag:
Single-Layer Cylindrical Compaction. Algorithmica 9(3): 293-312 (1993) - 1991
- [c3]Simon Kahan:
A Model for Data in Motion. STOC 1991: 267-277
1980 – 1989
- 1989
- [c2]Richard Anderson, Simon Kahan, Martine D. F. Schlag:
An O(n log n) algorithm for 1-D tile compaction. ICCAD 1989: 144-147 - [c1]Richard Anderson, Simon Kahan, Martine D. F. Schlag:
An O(n log n) Algorithm for 1-D Tile Compaction. WG 1989: 287-301 - 1987
- [j1]Simon Kahan, Theo Pavlidis, Henry S. Baird:
On the Recognition of Printed Characters of Any Font and Size. IEEE Trans. Pattern Anal. Mach. Intell. 9(2): 274-288 (1987)
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-07-17 21:29 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:
