Dina Kravets

12 papers A* 2B 1Journal 6Unranked 2
YearRankTypeTitle / Venue / Authors
1999 — ch.
Discrete And Computational Geometry.
Handbook of Discrete and Combinatorial Mathematics
Ileana Streinu, Károly Bezdek, János Pach, Tamal K. Dey, Jianer Chen, Dina Kravets, Nancy M. Amato, W. Randolph Franklin
1997 J jnl
Geometric Pattern Matching Under Euclidean Motion.
Comput. Geom.
L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
1997 J jnl
Parallel Searching in Generalized Monge Arrays.
Algorithmica
Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen
1996 J jnl
All Nearest Smaller Values on the Hypercube.
IEEE Trans. Parallel Distributed Syst.
Dina Kravets, C. Greg Plaxton
1995 J jnl
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality.
J. Algorithms
Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
1994 — conf
An optimal hypercube algorithm for the all nearest smaller values problem.
SPDP
Dina Kravets, C. Greg Plaxton
1993 — conf
Geometric Pattern Matching Under Euclidean Motion.
CCCG
L. Paul Chew, Michael T. Goodrich, Daniel P. Huttenlocher, Klara Kedem, Jon M. Kleinberg, Dina Kravets
1992 A* conf
Efficient Minimum Cost Matching Using Quadrangle Inequality
FOCS
Alok Aggarwal, Amotz Bar-Noy, Samir Khuller, Dina Kravets, Baruch Schieber
1991 J jnl
Selection and Sorting in Totally Monotone Arrays.
Math. Syst. Theory
Dina Kravets, James K. Park
1990 B conf
Parallel Searching in Generalized Monge Arrays with Applications.
SPAA
Alok Aggarwal, Dina Kravets, James K. Park, Sandeep Sen
1990 A* conf
Selection and Sorting in Totally Monotone Arrays.
SODA
Dina Kravets, James K. Park
1989 J jnl
A Linear Time Algorithm for Finding all Farthest Neighbors in a Convex Polygon.
Inf. Process. Lett.
Alok Aggarwal, Dina Kravets