| 2009 | ICDCS | On the Utility of Inference Mechanisms. | Ethan Blanton, Sonia Fahmy, Greg N. Frederickson |
| 1997 | SODA | Efficient Algorithms for Robustness in Matroid Optimization. | Greg N. Frederickson, Roberto Solis-Oba |
| 1996 | SODA | Increasing the Weight of Minimum Spanning Trees. | Greg N. Frederickson, Roberto Solis-Oba |
| 1993 | ICALP | Searching among Intervals and Compact Routing Tables. | Greg N. Frederickson |
| 1993 | SODA | A Data Structure for Dynamically Maintaining Rooted Trees. | Greg N. Frederickson |
| 1991 | FOCS | Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees | Greg N. Frederickson |
| 1991 | SODA | Optimal Algorithms for Tree Partitioning. | Greg N. Frederickson |
| 1991 | WADS | Parametric Search and Locating Supply Centers in Trees. | Greg N. Frederickson |
| 1990 | STOC | The Information Theory Bound Is Tight for Selection in a Heap | Greg N. Frederickson |
| 1989 | FOCS | Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version) | Greg N. Frederickson |
| 1989 | FOCS | Ensemble Motion Planning in Trees | Greg N. Frederickson, D. J. Guan |
| 1987 | STOC | A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) | Greg N. Frederickson |
| 1986 | FOCS | Separator-Based Strategies for Efficient Message Routing (Preliminary Version) | Greg N. Frederickson, Ravi Janardan |
| 1986 | PODC | Optimal Message Routing without Complete Routing Tables (preliminary version). | Greg N. Frederickson, Ravi Janardan |
| 1985 | STACS | A Single Source Shortest Path Algorithm for a Planar Distributed Network. | Greg N. Frederickson |
| 1984 | STOC | The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring | Greg N. Frederickson, Nancy A. Lynch |
| 1984 | STOC | Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version) | Greg N. Frederickson, Mandayam A. Srinivas |
| 1983 | FOCS | Shortest Path Problems in Planar Graphs (Preliminary Version) | Greg N. Frederickson |
| 1983 | PODC | Tradeoffs for Selection in Distributed Networks (Preliminary Version). | Greg N. Frederickson |
| 1983 | STOC | Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) | Greg N. Frederickson |
| 1981 | FOCS | Implicit Data Structures for the Weighted Dictionary Problem (preliminary version) | Greg N. Frederickson |
| 1980 | FOCS | Implicit Data Structures with Fast Update (Preliminary Report) | Greg N. Frederickson |
| 1980 | ICALP | Generating and Searching Sets Induced by Networks. | Greg N. Frederickson, Donald B. Johnson |
| 1980 | STOC | Generalized Selection and Ranking (Preliminary Version) | Greg N. Frederickson, Donald B. Johnson |
| 1976 | FOCS | Approximation Algorithms for some Routing Problems | Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim |