| 1990 | A Competitive 3-Server Algorithm. Piotr Berman, Howard J. Karloff, Gábor Tardos |
| 1990 | A Data Structure for Arc Insertion and Regular Path Finding. Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey Scott Vitter |
| 1990 | A Practical Algorithm for Computing the Delaunay Triangulation for Convex Distance Functions. Robert L. (Scot) Drysdale III |
| 1990 | An Efficient Parallel Algorithm that Finds Independent Sets of Guaranteed Size. Mark K. Goldberg, Thomas H. Spencer |
| 1990 | An Efficiently Computable Metric for Comparing Polygonal Shapes. Esther M. Arkin, L. Paul Chew, Daniel P. Huttenlocher, Klara Kedem, Joseph S. B. Mitchell |
| 1990 | An Optimal Algorithm for the Maximum Two-Chain Problem. Ruey-Der Lou, Majid Sarrafzadeh, D. T. Lee |
| 1990 | Analysis of Boyer-Moore-Type String Searching Algorithms. Ricardo A. Baeza-Yates, Gaston H. Gonnet, Mireille Régnier |
| 1990 | Applying Parallel Processing Techniques to Classification Problems in Constructive Solid Geometry. Michael T. Goodrich |
| 1990 | Approximation Algorithms for the Maximum Acyclic Subgraph Problem. Bonnie Berger, Peter W. Shor |
| 1990 | Asymptotically Fast Triangularization of Matrices Over Rings. James L. Hafner, Kevin S. McCurley |
| 1990 | Characterization and Algorithms for Greedily Solvable Transportation Problems. Ron Shamir, Brenda L. Dietrich |
| 1990 | Coloration Neighborhood Structures for General Graph Coloring. Craig A. Morgenstern, Harry Shapiro |
| 1990 | Compact Interval Trees: A Data Structure for Convex Hulls. Leonidas J. Guibas, John Hershberger, Jack Snoeyink |
| 1990 | Competitive Randomized Algorithms for Non-Uniform Problems. Anna R. Karlin, Mark S. Manasse, Lyle A. McGeoch, Susan S. Owicki |
| 1990 | Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. Harold N. Gabow |
| 1990 | Determining the Evolutionary Tree. Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow |
| 1990 | Efficient Algorithms for Generalized Cut Trees. Dan Gusfield, Dalit Naor |
| 1990 | Efficient Maintenance of the Union Intervals on a Line, with Applications. Siu-Wing Cheng, Ravi Janardan |
| 1990 | Efficient Pattern Matching with Scaling. Amihood Amir, Gad M. Landau, Uzi Vishkin |
| 1990 | Embedding Planar Graphs on the Grid. Walter Schnyder |
| 1990 | Experiments on Traveling Salesman Heuristics. Jon Louis Bentley |
| 1990 | Factor Refinement. Eric Bach, James R. Driscoll, Jeffrey O. Shallit |
| 1990 | Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine |
| 1990 | Fast Parallel Algorithms for the Clique Separator Decomposition. Elias Dahlhaus, Marek Karpinski, Mark B. Novick |
| 1990 | Finding Steiner Forests in Planar Graphs. Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki |
| 1990 | First-Fit Storage of Linear Lists: Tight Probabilistic Bounds on Wasted Space. Edward G. Coffman Jr., Leopold Flatto, Frank Thomson Leighton |
| 1990 | Improved Dual Network Simplex. Serge A. Plotkin, Éva Tardos |
| 1990 | Incremental Algorithms for Minimal Length Paths. Giorgio Ausiello, Giuseppe F. Italiano, Alberto Marchetti-Spaccamela, Umberto Nanni |
| 1990 | Incremental Evaluation of Computational Circuits. Bowen Alpern, Roger Hoover, Barry K. Rosen, Peter F. Sweeney, F. Kenneth Zadeck |
| 1990 | Length-Limited Coding. Lawrence L. Larmore, Daniel S. Hirschberg |
| 1990 | Maintenance of a Minimum Spanning Forest in a Dynamic Planar Graph. David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery R. Westbrook, Moti Yung |
| 1990 | Manhattan Channel Routing with Good Theoretical and Practical Performance. Charlotte Wieners-Lummer |
| 1990 | Multilevel Adaptive Hashing. Andrei Z. Broder, Anna R. Karlin |
| 1990 | New Results on Server Problems. Marek Chrobak, Howard J. Karloff, T. H. Payne, Sundar Vishwanathan |
| 1990 | New Techniques for Some Dynamic Closest-Point and Farthest-Point Problems. Kenneth J. Supowit |
| 1990 | New Techniques for the Union-Find Problems. Johannes A. La Poutré |
| 1990 | On Finding Non-Intersecting Paths in Grids and Its Application in Reconfiguring VLSI/WSI Arrays. Vwani P. Roychowdhury, Jehoshua Bruck |
| 1990 | On the Number of Minimum Size Separating Vertex Sets in a Graph and How to Find All of Them. Arkady Kanevsky |
| 1990 | On the Parsimonious Property of Connectivity Problems. Michel X. Goemans, Dimitris Bertsimas |
| 1990 | On-Line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure. Lawrence L. Larmore, Baruch Schieber |
| 1990 | Optimal Binary Space Partitions for Orthogonal Objects. Mike Paterson, F. Frances Yao |
| 1990 | Packing Random Items of Three Colors. Wansoo T. Rhee, Michel Talagrand |
| 1990 | Parallel Search for Maximal Independence Given Minimal Dependence. Paul Beame, Michael Luby |
| 1990 | Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1990, San Francisco, California, USA. David S. Johnson |
| 1990 | Representing Sets with Constant Time Equality Testing. Daniel M. Yellin |
| 1990 | Selection and Sorting in Totally Monotone Arrays. Dina Kravets, James K. Park |
| 1990 | Shrinking Lattice Polyhedra. John Cremona, Susan Landau |
| 1990 | Sparse Dynamic Programming. David Eppstein, Zvi Galil, Raffaele Giancarlo, Giuseppe F. Italiano |
| 1990 | Split Decomposition of Undirected Graphs. Tze-Heng Ma, Jeremy P. Spinrad |
| 1990 | Stable Husbands. Donald E. Knuth, Rajeev Motwani, Boris G. Pittel |
| 1990 | Suffix Arrays: A New Method for On-Line String Searches. Udi Manber, Gene Myers |
| 1990 | Superlinear Bounds on Matrix Searching. Maria M. Klawe |
| 1990 | The Bisection Width of Grid Graphs. Christos H. Papadimitriou, Martha Sideri |
| 1990 | Using Separation Algorithms in Fixed Dimension. Carolyn Haibt Norton, Serge A. Plotkin, Éva Tardos |
| 1990 | Visibility with a Moving Point of View. Marshall W. Bern, David P. Dobkin, David Eppstein, Robert L. Grossman |