James K. Park

According to our database, James K. Park authored at least 16 papers between 1988 and 2005.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2005

The algebraic Monge property and path problems.

Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park

Discret. Appl. Math., 2005

2002

Fast Algorithms with Algebraic Monge Properties.

Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

1997

Parallel Searching in Generalized Monge Arrays.

Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen

Algorithmica, 1997

1996

The Cost of Complex Communication on Simple Networks.

David S. Greenberg, James K. Park, Eric J. Schwabe

J. Parallel Distributed Comput., 1996

1995

A Monge Property for the D-dimensional Transportation Problem.

Wolfgang W. Bein, Peter Brucker, James K. Park, Pramod K. Pathak

Discret. Appl. Math., 1995

1994

Long Tours and Short Superstrings (Preliminary Version)

S. Rao Kosaraju, James K. Park, Clifford Stein

Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993

Improved Algorithms for Economic Lot Size Problems.

Alok Aggarwal, James K. Park

Oper. Res., 1993

Improved selection in totally monotone arrays.

Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen

Int. J. Comput. Geom. Appl., 1993

Finding minimum-quotient cuts in planar graphs.

James K. Park, Cynthia A. Phillips

Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Becoming a Better Host Through Origami: A Mesh Can Be More Than Rows and Columns.

David S. Greenberg, James K. Park, Eric J. Schwabe

Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

1991

The Monge array-an abstraction and its applications.

James K. Park

PhD thesis, 1991

Selection and Sorting in Totally Monotone Arrays.

Dina Kravets, James K. Park

Math. Syst. Theory, 1991

A Special Case of the n-Vertex Traveling-Salesman Problem that can be Solved in O(n) Time.

James K. Park

Inf. Process. Lett., 1991

Improved Selection on Totally Monotone Arrays.

Yishay Mansour, James K. Park, Baruch Schieber

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

1990

Parallel Searching in Generalized Monge Arrays with Applications.

Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

1988

Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version)

Alok Aggarwal, James K. Park

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988