Search the dblp DataBase
Greg N. Frederickson :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Greg N. Frederickson Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees [Citation Graph (1, 0)][DBLP ] FOCS, 1991, pp:632-641 [Conf ] Greg N. Frederickson Optimal Algorithms for Tree Partitioning. [Citation Graph (1, 0)][DBLP ] SODA, 1991, pp:168-177 [Conf ] Greg N. Frederickson , Donald B. Johnson The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns. [Citation Graph (1, 0)][DBLP ] J. Comput. Syst. Sci., 1982, v:24, n:2, pp:197-208 [Journal ] Greg N. Frederickson , Donald B. Johnson Generalized Selection and Ranking: Sorted Matrices. [Citation Graph (1, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:1, pp:14-30 [Journal ] Greg N. Frederickson , Nicola Santoro Breaking Symmetry in Synchronous Networks. [Citation Graph (0, 0)][DBLP ] Aegean Workshop on Computing, 1986, pp:26-33 [Conf ] Robert A. Hearn , Erik D. Demaine , Greg N. Frederickson Hinged Dissection of Polygons is Hard. [Citation Graph (0, 0)][DBLP ] CCCG, 2003, pp:98-102 [Conf ] Greg N. Frederickson Implicit Data Structures with Fast Update (Preliminary Report) [Citation Graph (0, 0)][DBLP ] FOCS, 1980, pp:255-259 [Conf ] Greg N. Frederickson Implicit Data Structures for the Weighted Dictionary Problem (preliminary version) [Citation Graph (0, 0)][DBLP ] FOCS, 1981, pp:133-139 [Conf ] Greg N. Frederickson Shortest Path Problems in Planar Graphs (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1983, pp:242-247 [Conf ] Greg N. Frederickson Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:448-453 [Conf ] Greg N. Frederickson , D. J. Guan Ensemble Motion Planning in Trees [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:66-71 [Conf ] Greg N. Frederickson , Matthew S. Hecht , Chul E. Kim Approximation Algorithms for some Routing Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1976, pp:216-227 [Conf ] Greg N. Frederickson , Ravi Janardan Separator-Based Strategies for Efficient Message Routing (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1986, pp:428-437 [Conf ] Greg N. Frederickson Searching among Intervals and Compact Routing Tables. [Citation Graph (0, 0)][DBLP ] ICALP, 1993, pp:28-39 [Conf ] Greg N. Frederickson , Donald B. Johnson Generating and Searching Sets Induced by Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 1980, pp:221-233 [Conf ] Greg N. Frederickson Geometric Dissections that Swing and Twist. [Citation Graph (0, 0)][DBLP ] JCDCG, 2000, pp:137-148 [Conf ] Greg N. Frederickson Piano-Hinged Dissections: Now Let's Fold! [Citation Graph (0, 0)][DBLP ] JCDCG, 2002, pp:159-171 [Conf ] Greg N. Frederickson Tradeoffs for Selection in Distributed Networks (Preliminary Version). [Citation Graph (0, 0)][DBLP ] PODC, 1983, pp:154-160 [Conf ] Greg N. Frederickson , Ravi Janardan Optimal Message Routing without Complete Routing Tables (preliminary version). [Citation Graph (0, 0)][DBLP ] PODC, 1986, pp:88-97 [Conf ] Greg N. Frederickson A Data Structure for Dynamically Maintaining Rooted Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1993, pp:175-184 [Conf ] Greg N. Frederickson , Roberto Solis-Oba Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] SODA, 1996, pp:539-546 [Conf ] Greg N. Frederickson , Roberto Solis-Oba Efficient Algorithms for Robustness in Matroid Optimization. [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:659-668 [Conf ] Greg N. Frederickson A Single Source Shortest Path Algorithm for a Planar Distributed Network. [Citation Graph (0, 0)][DBLP ] STACS, 1985, pp:143-150 [Conf ] Greg N. Frederickson Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:252-257 [Conf ] Greg N. Frederickson A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1987, pp:19-28 [Conf ] Greg N. Frederickson The Information Theory Bound Is Tight for Selection in a Heap [Citation Graph (0, 0)][DBLP ] STOC, 1990, pp:26-33 [Conf ] Greg N. Frederickson , Donald B. Johnson Generalized Selection and Ranking (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:420-428 [Conf ] Greg N. Frederickson , Nancy A. Lynch The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring [Citation Graph (0, 0)][DBLP ] STOC, 1984, pp:493-503 [Conf ] Greg N. Frederickson , Mandayam A. Srinivas Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1984, pp:383-390 [Conf ] Greg N. Frederickson Parametric Search and Locating Supply Centers in Trees. [Citation Graph (0, 0)][DBLP ] WADS, 1991, pp:299-319 [Conf ] Greg N. Frederickson Editor's Foreword Special Issue on Graph Algorithms. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1992, v:7, n:5&6, pp:429-431 [Journal ] Greg N. Frederickson Searching Among Intervals and Compact Routing Tables. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1996, v:15, n:5, pp:448-466 [Journal ] Greg N. Frederickson Maintaining Regular Properties Dynamically in k -Terminal Graphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1998, v:22, n:3, pp:330-350 [Journal ] Greg N. Frederickson , Ravi Janardan Designing Networks with Compact Routing Tables. [Citation Graph (0, 0)][DBLP ] Algorithmica, 1988, v:3, n:, pp:171-190 [Journal ] Greg N. Frederickson , Roberto Solis-Oba Algorithms for Measuring Perturbability in Matroid Optimization. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1998, v:18, n:4, pp:503-518 [Journal ] Erik D. Demaine , Martin L. Demaine , David Eppstein , Greg N. Frederickson , Erich Friedman Hinged dissection of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 2005, v:31, n:3, pp:237-262 [Journal ] Erik D. Demaine , Martin L. Demaine , David Eppstein , Greg N. Frederickson , Erich Friedman Hinged Dissection of Polyominoes and Polyforms [Citation Graph (0, 0)][DBLP ] CoRR, 1999, v:0, n:, pp:- [Journal ] Greg N. Frederickson , Susan H. Rodger A New Approach to the Dynamic Maintaince of Maximal Points in a Plane. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1990, v:5, n:, pp:365-374 [Journal ] Greg N. Frederickson Implicit Data Structures for Weighted Elements [Citation Graph (0, 0)][DBLP ] Information and Control, 1985, v:66, n:1/2, pp:61-82 [Journal ] Greg N. Frederickson A Distributed Shortest Path Algorithm for a Planar Network [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1990, v:86, n:2, pp:140-159 [Journal ] Greg N. Frederickson An Optimal Algorithm for Selection in a Min-Heap [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1993, v:104, n:2, pp:197-214 [Journal ] Greg N. Frederickson , Mandayan A. Srinivas On-line Updating of Solutions to a Class of Matroid Intersection Problems [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1987, v:74, n:2, pp:113-139 [Journal ] Mikhail J. Atallah , Greg N. Frederickson , S. Rao Kosaraju Sorting with Efficient Use of Special-Purpose Sorters. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1988, v:27, n:1, pp:13-15 [Journal ] Malcolm C. Fields , Greg N. Frederickson A Faster Algorithm for the Maximum Weighted Tardiness Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1990, v:36, n:1, pp:39-44 [Journal ] Greg N. Frederickson Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1980, v:11, n:4/5, pp:156-161 [Journal ] Greg N. Frederickson Scheduling Unit-Time Tasks With Integer Release Times and Deadlines. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1983, v:16, n:4, pp:171-173 [Journal ] Greg N. Frederickson On Linear-Time Algorithms for Five-Coloring Planar Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1984, v:19, n:5, pp:219-224 [Journal ] Greg N. Frederickson , Susanne E. Hambrusch , Hung-Yi Tu Shortest Path Computations in Source-Deplanarized Graphs. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1993, v:47, n:2, pp:71-75 [Journal ] John L. Bruno , Peter J. Downey , Greg N. Frederickson Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. [Citation Graph (0, 0)][DBLP ] J. ACM, 1981, v:28, n:1, pp:100-113 [Journal ] Greg N. Frederickson Approximation Algorithms for Some Postman Problems. [Citation Graph (0, 0)][DBLP ] J. ACM, 1979, v:26, n:3, pp:538-554 [Journal ] Greg N. Frederickson Implicit Data Structures for the Dictionary Problem [Citation Graph (0, 0)][DBLP ] J. ACM, 1983, v:30, n:1, pp:80-94 [Journal ] Greg N. Frederickson Planar Graph Decomposition and All Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP ] J. ACM, 1991, v:38, n:1, pp:162-204 [Journal ] Greg N. Frederickson , Nancy A. Lynch Electing a leader in a synchronous ring. [Citation Graph (0, 0)][DBLP ] J. ACM, 1987, v:34, n:1, pp:98-115 [Journal ] Greg N. Frederickson Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1995, v:19, n:1, pp:45-85 [Journal ] Greg N. Frederickson A Data Structure for Dynamically Maintaining Rooted Trees. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:24, n:1, pp:37-65 [Journal ] Greg N. Frederickson , D. J. Guan Nonpreemptive Ensemble Motion Planning on a Tree. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1993, v:15, n:1, pp:29-60 [Journal ] Greg N. Frederickson , Donald B. Johnson Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1983, v:4, n:1, pp:61-80 [Journal ] Greg N. Frederickson , Roberto Solis-Oba Increasing the Weight of Minimum Spanning Trees. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1999, v:33, n:2, pp:244-266 [Journal ] Greg N. Frederickson Upper Bounds for Time-Space Trade-Offs in Sorting and Selection. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1987, v:34, n:1, pp:19-26 [Journal ] Greg N. Frederickson Distributed Algorithms for Selection in Sets. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1988, v:37, n:3, pp:337-348 [Journal ] Greg N. Frederickson Self-Organizing Heuristics for Implicit Data Structures. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:2, pp:277-291 [Journal ] Greg N. Frederickson Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1985, v:14, n:4, pp:781-798 [Journal ] Greg N. Frederickson Fast Algorithms for Shortest Paths in Planar Graphs, with Applications. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1987, v:16, n:6, pp:1004-1022 [Journal ] Greg N. Frederickson A Note on the Complexity of a Simple Transportation Problem. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:1, pp:57-61 [Journal ] Greg N. Frederickson Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:2, pp:484-538 [Journal ] Greg N. Frederickson , D. J. Guan Preemptive Ensemble Motion Planning on a Tree. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1992, v:21, n:6, pp:1130-1152 [Journal ] Greg N. Frederickson , Matthew S. Hecht , Chul E. Kim Approximation Algorithms for Some Routing Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1978, v:7, n:2, pp:178-193 [Journal ] Greg N. Frederickson , Joseph JáJá Approximation Algorithm for Several Graph Augmentation Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1981, v:10, n:2, pp:270-283 [Journal ] Greg N. Frederickson , Ravi Janardan Efficient Message Routing in Planar Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:4, pp:843-857 [Journal ] Greg N. Frederickson , Ravi Janardan Space-Efficient Message Routing in c-Decomposable Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:1, pp:164-181 [Journal ] Greg N. Frederickson , Donald B. Johnson Erratum: Generalized Selection and Ranking: Sorted Matrices. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1990, v:19, n:1, pp:205-206 [Journal ] Greg N. Frederickson , Susan H. Rodger An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:1, pp:185-211 [Journal ] Greg N. Frederickson , Mandayam A. Srinivas Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1989, v:18, n:1, pp:112-138 [Journal ] Greg N. Frederickson , Ravi Janardan Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1988, v:37, n:12, pp:1529-1540 [Journal ] Greg N. Frederickson Recursively Rotated Orders and Implicit Data Structures: A Lower Bound. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1984, v:29, n:, pp:75-85 [Journal ] Greg N. Frederickson , Joseph JáJá On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1982, v:19, n:, pp:189-201 [Journal ] Greg N. Frederickson , Roberto Solis-Oba Efficient algorithms for robustness in resource allocation and scheduling problems. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:352, n:1-3, pp:250-265 [Journal ] Greg N. Frederickson , Barry Wittman Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2007, pp:119-133 [Conf ] On the Utility of Inference Mechanisms. [Citation Graph (, )][DBLP ] Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems [Citation Graph (, )][DBLP ] Speedup in the Traveling Repairman Problem with Unit Time Windows [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.457secs