| 1993 | An Optimal Algorithm for Roundness Determination on Convex Polygons. | Kurt Swanson |
| 1993 | Fast Algorithms for One-Dimensional Compaction with Jog Insertion. | Matthias F. M. Stallmann, Thomas A. Hughes |
| 1993 | Combinatorial Complexity of Signed Discs (Extended Abstract). | Diane L. Souvaine, Chee-Keng Yap |
| 1993 | Reconstructing Strings from Substrings (Extended Abstract). | Steven Skiena, Gopalakrishnan Sundaram |
| 1993 | On Reconfigurability of VLSI Linear Arrays. | Roberto De Prisco, Angelo Monti |
| 1993 | Repetivive Hidden-Surface-Removal for Polyhedral Scenes. | Marco Pellegrini |
| 1993 | Counting and Reporting Red/Blue Segment Intersections. | Larry F. Palazzi, Jack Snoeyink |
| 1993 | Efficient Approximate Shortest-Path Queries Among Isothetic Rectangular Obstacles. | Pinaki Mitra, Binay K. Bhattacharya |
| 1993 | Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs. | Andy Mirzaian |
| 1993 | The Exhaustion of Shared Memory: Stochastic Results. | Robert S. Maier, Ren Schott |
| 1993 | An Algorithm for Finding Predecessors in Integer Sets. | Bruce M. Maggs, Monika Rauch |
| 1993 | Detecting Race Conditions in Parallel Programs that Use One Semaphore. | Hsueh-I Lu, Philip N. Klein, Robert H. B. Netzer |
| 1993 | A Time-Randomness Tradeoff for Selection in Parallel. | Danny Krizanc |
| 1993 | On Fat Partitioning, Fat Covering and the Union Size of Polygons (Extended Abstract). | Marc J. van Kreveld |
| 1993 | A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs. | Philip N. Klein, Sairam Subramanian |
| 1993 | Designing Multi-Commodity Flow Trees. | Samir Khuller, Balaji Raghavachari, Neal E. Young |
| 1993 | A Generalization of Binary Search. | Richard M. Karp |
| 1993 | On Approximating the Longest Path in a Graph (Preliminary Version). | David R. Karger, Rajeev Motwani, G. D. S. Ramkumar |
| 1993 | Improved Parallel Depth-First Search in Undirected Planar Graphs. | Ming-Yang Kao, Shang-Hua Teng, Kentaro Toyama |
| 1993 | Tree Reconstruction from Partial Orders. | Sampath Kannan, Tandy J. Warnow |
| 1993 | Approximating Shortest Superstrings with Constraints (Extended Abstract). | Tao Jiang, Ming Li |
| 1993 | Generalized Approzimate Algorithms for Point Set Congruence. | Paul J. Heffernan |
| 1993 | Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization. | Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid |
| 1993 | A Plane-Sweep Algorithm for the All-Nearest-Neighbors Problem for a Set of Convex Planar Objects. | Thorsten Graf, Klaus H. Hinrichs |
| 1993 | An Index Data Structure For Matrices, with Applications to Fast Two-Dimensional Pattern Matching. | Raffaele Giancarlo |