The SCEAS System
| |||||||

## Search the dblp DataBase
James K. Park:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Alok Aggarwal, James K. Park
**Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version)**[Citation Graph (1, 0)][DBLP] FOCS, 1988, pp:497-512 [Conf] - S. Rao Kosaraju, James K. Park, Clifford Stein
**Long Tours and Short Superstrings (Preliminary Version)**[Citation Graph (0, 0)][DBLP] FOCS, 1994, pp:166-177 [Conf] - Yishay Mansour, James K. Park, Baruch Schieber
**Improved Selection on Totally Monotone Arrays.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1991, pp:347-359 [Conf] - Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
**Fast Algorithms with Algebraic Monge Properties.**[Citation Graph (0, 0)][DBLP] MFCS, 2002, pp:104-117 [Conf] - Dina Kravets, James K. Park
**Selection and Sorting in Totally Monotone Arrays.**[Citation Graph (0, 0)][DBLP] SODA, 1990, pp:494-502 [Conf] - Alok Aggarwal, Dina Kravets, James K. Park, S. Sen
**Parallel Searching in Generalized Monge Arrays with Applications.**[Citation Graph (0, 0)][DBLP] SPAA, 1990, pp:259-268 [Conf] - David S. Greenberg, James K. Park, Eric J. Schwabe
**Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns.**[Citation Graph (0, 0)][DBLP] SPDP, 1993, pp:276-283 [Conf] - James K. Park, Cynthia A. Phillips
**Finding minimum-quotient cuts in planar graphs.**[Citation Graph (0, 0)][DBLP] STOC, 1993, pp:766-775 [Conf] - Alok Aggarwal, Dina Kravets, James K. Park, S. Sen
**Parallel Searching in Generalized Monge Arrays.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:19, n:3, pp:291-317 [Journal] - Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
**The algebraic Monge property and path problems.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:145, n:3, pp:455-464 [Journal] - Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak
**A Monge Property for the D-dimensional Transportation Problem.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:58, n:2, pp:97-109 [Journal] - Yishay Mansour, James K. Park, Baruch Schieber, S. Sen
**Improved selection in totally monotone arrays.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1993, v:3, n:2, pp:115-132 [Journal] - James K. Park
**A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:40, n:5, pp:247-254 [Journal] - David S. Greenberg, James K. Park, Eric J. Schwabe
**The Cost of Complex Communication on Simple Networks.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1996, v:35, n:2, pp:133-141 [Journal] - Dina Kravets, James K. Park
**Selection and Sorting in Totally Monotone Arrays.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1991, v:24, n:3, pp:201-220 [Journal]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |