default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames K. Park
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1991
[b1]James K. Park:
The Monge array-an abstraction and its applications. Massachusetts Institute of Technology, Cambridge, MA, USA, 1991
Journal Articles
- 2005
- [j8]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
The algebraic Monge property and path problems. Discret. Appl. Math. 145(3): 455-464 (2005) - 1997
- [j7]Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays. Algorithmica 19(3): 291-317 (1997) - 1996
- [j6]David S. Greenberg, James K. Park, Eric J. Schwabe:
The Cost of Complex Communication on Simple Networks. J. Parallel Distributed Comput. 35(2): 133-141 (1996) - 1995
- [j5]Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak:
A Monge Property for the D-dimensional Transportation Problem. Discret. Appl. Math. 58(2): 97-109 (1995) - 1993
- [j4]Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen:
Improved selection in totally monotone arrays. Int. J. Comput. Geom. Appl. 3(2): 115-132 (1993) - [j3]Alok Aggarwal, James K. Park:
Improved Algorithms for Economic Lot Size Problems. Oper. Res. 41(3): 549-571 (1993) - 1991
- [j2]James K. Park:
A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time. Inf. Process. Lett. 40(5): 247-254 (1991) - [j1]Dina Kravets, James K. Park:
Selection and Sorting in Totally Monotone Arrays. Math. Syst. Theory 24(3): 201-220 (1991)
Conference and Workshop Papers
- 2002
- [c8]Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park:
Fast Algorithms with Algebraic Monge Properties. MFCS 2002: 104-117 - 1994
- [c7]S. Rao Kosaraju, James K. Park, Clifford Stein:
Long Tours and Short Superstrings (Preliminary Version). FOCS 1994: 166-177 - 1993
- [c6]David S. Greenberg, James K. Park, Eric J. Schwabe:
Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns. SPDP 1993: 276-283 - [c5]James K. Park, Cynthia A. Phillips:
Finding minimum-quotient cuts in planar graphs. STOC 1993: 766-775 - 1991
- [c4]Yishay Mansour, James K. Park, Baruch Schieber:
Improved Selection on Totally Monotone Arrays. FSTTCS 1991: 347-359 - 1990
- [c3]Dina Kravets, James K. Park:
Selection and Sorting in Totally Monotone Arrays. SODA 1990: 494-502 - [c2]Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen:
Parallel Searching in Generalized Monge Arrays with Applications. SPAA 1990: 259-268 - 1988
- [c1]Alok Aggarwal, James K. Park:
Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version). FOCS 1988: 497-512
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-04-24 23:05 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:
