Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Greg N. Frederickson
2010 – today
- 2012
[j52]Greg N. Frederickson, Barry Wittman: Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems. Algorithmica 62(3-4): 1198-1221 (2012)- 2011
- [j51]Ethan Blanton, Sonia Fahmy, Greg N. Frederickson, Sriharsha Gangam: On the Cost of Network Inference Mechanisms. IEEE Trans. Parallel Distrib. Syst. 22(4): 662-672 (2011)
- [i5]Greg N. Frederickson, Barry Wittman: Two Multivehicle Routing Problems with Unit-Time Windows. CoRR abs/1101.3953 (2011)
- [i4]Greg N. Frederickson, Barry Wittman: Speedup in the Traveling Repairman Problem with Constrained Time Windows. CoRR abs/1101.3960 (2011)
2000 – 2009
- 2009
- [c30]Ethan Blanton, Sonia Fahmy, Greg N. Frederickson: On the Utility of Inference Mechanisms. ICDCS 2009: 256-263
- [i3]Greg N. Frederickson, Barry Wittman: Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems. CoRR abs/0905.4444 (2009)
- [i2]Greg N. Frederickson, Barry Wittman: Speedup in the Traveling Repairman Problem with Unit Time Windows. CoRR abs/0907.5372 (2009)
- 2008
- [j50]Mikhail J. Atallah, Greg N. Frederickson, Ashish Kundu: A tree-covering problem arising in integrity of tree-structured data. Inf. Process. Lett. 109(1): 79-82 (2008)
- 2007
- [c29]Greg N. Frederickson, Barry Wittman: Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows. APPROX-RANDOM 2007: 119-133
- 2006
- [j49]Greg N. Frederickson, Roberto Solis-Oba: Efficient algorithms for robustness in resource allocation and scheduling problems. Theor. Comput. Sci. 352(1-3): 250-265 (2006)
- 2005
- [j48]Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman: Hinged dissection of polyominoes and polyforms. Comput. Geom. 31(3): 237-262 (2005)
- 2003
- [c28]Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson: Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102
- 2002
- [c27]
- 2000
- [c26]
1990 – 1999
- 1999
- [j47]Greg N. Frederickson, Roberto Solis-Oba: Increasing the Weight of Minimum Spanning Trees. J. Algorithms 33(2): 244-266 (1999)
- [i1]Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman: Hinged Dissection of Polyominoes and Polyforms. CoRR cs.CG/9907018 (1999)
- 1998
- [j46]Greg N. Frederickson: Maintaining Regular Properties Dynamically in k-Terminal Graphs. Algorithmica 22(3): 330-350 (1998)
- [j45]Greg N. Frederickson, Roberto Solis-Oba: Algorithms for Measuring Perturbability in Matroid Optimization. Combinatorica 18(4): 503-518 (1998)
- 1997
- [j44]Greg N. Frederickson: A Data Structure for Dynamically Maintaining Rooted Trees. J. Algorithms 24(1): 37-65 (1997)
- [j43]Greg N. Frederickson: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. SIAM J. Comput. 26(2): 484-538 (1997)
- [j42]Anne Condon, Faith Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys: Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997)
- [c25]Greg N. Frederickson, Roberto Solis-Oba: Efficient Algorithms for Robustness in Matroid Optimization. SODA 1997: 659-668
- 1996
- [j41]Greg N. Frederickson: Searching Among Intervals and Compact Routing Tables. Algorithmica 15(5): 448-466 (1996)
- [c24]Greg N. Frederickson, Roberto Solis-Oba: Increasing the Weight of Minimum Spanning Trees. SODA 1996: 539-546
- 1995
- [j40]Greg N. Frederickson: Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. J. Algorithms 19(1): 45-85 (1995)
- 1994
- [j39]Greg N. Frederickson, Susan H. Rodger: An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines. SIAM J. Comput. 23(1): 185-211 (1994)
- 1993
- [j38]Greg N. Frederickson: An Optimal Algorithm for Selection in a Min-Heap. Inf. Comput. 104(2): 197-214 (1993)
- [j37]Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu: Shortest Path Computations in Source-Deplanarized Graphs. Inf. Process. Lett. 47(2): 71-75 (1993)
- [j36]Greg N. Frederickson, D. J. Guan: Nonpreemptive Ensemble Motion Planning on a Tree. J. Algorithms 15(1): 29-60 (1993)
- [j35]Greg N. Frederickson: A Note on the Complexity of a Simple Transportation Problem. SIAM J. Comput. 22(1): 57-61 (1993)
- [c23]
- [c22]
- 1992
- [j34]Greg N. Frederickson: Editor's Foreword Special Issue on Graph Algorithms. Algorithmica 7(5&6): 429-431 (1992)
- [j33]Greg N. Frederickson, D. J. Guan: Preemptive Ensemble Motion Planning on a Tree. SIAM J. Comput. 21(6): 1130-1152 (1992)
- [e1]Greg N. Frederickson (Ed.): Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida. ACM/SIAM 1992, ISBN 0-89791-466-X
- 1991
- [j32]Greg N. Frederickson: Planar Graph Decomposition and All Pairs Shortest Paths. J. ACM 38(1): 162-204 (1991)
- [c21]Greg N. Frederickson: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. FOCS 1991: 632-641
- [c20]
- [c19]
- 1990
- [j31]Greg N. Frederickson, Susan H. Rodger: A New Approach to the Dynamic Maintaince of Maximal Points in a Plane. Discrete & Computational Geometry 5: 365-374 (1990)
- [j30]Greg N. Frederickson: A Distributed Shortest Path Algorithm for a Planar Network. Inf. Comput. 86(2): 140-159 (1990)
- [j29]Malcolm C. Fields, Greg N. Frederickson: A Faster Algorithm for the Maximum Weighted Tardiness Problem. Inf. Process. Lett. 36(1): 39-44 (1990)
- [j28]Greg N. Frederickson, Ravi Janardan: Space-Efficient Message Routing in c-Decomposable Networks. SIAM J. Comput. 19(1): 164-181 (1990)
- [j27]Greg N. Frederickson, Donald B. Johnson: Erratum: Generalized Selection and Ranking: Sorted Matrices. SIAM J. Comput. 19(1): 205-206 (1990)
- [c18]Greg N. Frederickson: The Information Theory Bound Is Tight for Selection in a Heap. STOC 1990: 26-33
1980 – 1989
- 1989
- [j26]Greg N. Frederickson, Mandayam A. Srinivas: Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems. SIAM J. Comput. 18(1): 112-138 (1989)
- [j25]Greg N. Frederickson, Ravi Janardan: Efficient Message Routing in Planar Networks. SIAM J. Comput. 18(4): 843-857 (1989)
- [c17]
- [c16]Greg N. Frederickson: Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version). FOCS 1989: 448-453
- 1988
- [j24]Greg N. Frederickson, Ravi Janardan: Designing Networks with Compact Routing Tables. Algorithmica 3: 171-190 (1988)
- [j23]Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju: Sorting with Efficient Use of Special-Purpose Sorters. Inf. Process. Lett. 27(1): 13-15 (1988)
- [j22]Greg N. Frederickson: Distributed Algorithms for Selection in Sets. J. Comput. Syst. Sci. 37(3): 337-348 (1988)
- [j21]Greg N. Frederickson, Ravi Janardan: Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. IEEE Trans. Computers 37(12): 1529-1540 (1988)
- 1987
- [j20]Greg N. Frederickson, Mandayan A. Srinivas: On-line Updating of Solutions to a Class of Matroid Intersection Problems. Inf. Comput. 74(2): 113-139 (1987)
- [j19]Greg N. Frederickson, Nancy A. Lynch: Electing a leader in a synchronous ring. J. ACM 34(1): 98-115 (1987)
- [j18]Greg N. Frederickson: Upper Bounds for Time-Space Trade-Offs in Sorting and Selection. J. Comput. Syst. Sci. 34(1): 19-26 (1987)
- [j17]Greg N. Frederickson: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications. SIAM J. Comput. 16(6): 1004-1022 (1987)
- [c15]Greg N. Frederickson: A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract). STOC 1987: 19-28
- 1986
- [c14]Greg N. Frederickson, Nicola Santoro: Breaking Symmetry in Synchronous Networks. Aegean Workshop on Computing 1986: 26-33
- [c13]Greg N. Frederickson, Ravi Janardan: Separator-Based Strategies for Efficient Message Routing (Preliminary Version). FOCS 1986: 428-437
- [c12]Greg N. Frederickson, Ravi Janardan: Optimal Message Routing without Complete Routing Tables (preliminary version). PODC 1986: 88-97
- 1985
- [j16]Greg N. Frederickson: Implicit Data Structures for Weighted Elements. Information and Control 66(1/2): 61-82 (1985)
- [j15]Greg N. Frederickson: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications. SIAM J. Comput. 14(4): 781-798 (1985)
- [c11]Greg N. Frederickson: A Single Source Shortest Path Algorithm for a Planar Distributed Network. STACS 1985: 143-150
- 1984
- [j14]Greg N. Frederickson: On Linear-Time Algorithms for Five-Coloring Planar Graphs. Inf. Process. Lett. 19(5): 219-224 (1984)
- [j13]Greg N. Frederickson, Donald B. Johnson: Generalized Selection and Ranking: Sorted Matrices. SIAM J. Comput. 13(1): 14-30 (1984)
- [j12]Greg N. Frederickson: Self-Organizing Heuristics for Implicit Data Structures. SIAM J. Comput. 13(2): 277-291 (1984)
- [j11]Greg N. Frederickson: Recursively Rotated Orders and Implicit Data Structures: A Lower Bound. Theor. Comput. Sci. 29: 75-85 (1984)
- [c10]Greg N. Frederickson, Mandayam A. Srinivas: Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version). STOC 1984: 383-390
- [c9]Greg N. Frederickson, Nancy A. Lynch: The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring. STOC 1984: 493-503
- 1983
- [j10]Greg N. Frederickson: Scheduling Unit-Time Tasks With Integer Release Times and Deadlines. Inf. Process. Lett. 16(4): 171-173 (1983)
- [j9]Greg N. Frederickson: Implicit Data Structures for the Dictionary Problem. J. ACM 30(1): 80-94 (1983)
- [j8]Greg N. Frederickson, Donald B. Johnson: Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. J. Algorithms 4(1): 61-80 (1983)
- [c8]Greg N. Frederickson: Shortest Path Problems in Planar Graphs (Preliminary Version). FOCS 1983: 242-247
- [c7]Greg N. Frederickson: Tradeoffs for Selection in Distributed Networks (Preliminary Version). PODC 1983: 154-160
- [c6]Greg N. Frederickson: Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version). STOC 1983: 252-257
- 1982
- [j7]Greg N. Frederickson, Donald B. Johnson: The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns. J. Comput. Syst. Sci. 24(2): 197-208 (1982)
- [j6]Greg N. Frederickson, Joseph JáJá: On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. Theor. Comput. Sci. 19: 189-201 (1982)
- 1981
- [j5]John L. Bruno, Peter J. Downey, Greg N. Frederickson: Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. J. ACM 28(1): 100-113 (1981)
- [j4]Greg N. Frederickson, Joseph JáJá: Approximation Algorithms for Several Graph Augmentation Problems. SIAM J. Comput. 10(2): 270-283 (1981)
- [c5]Greg N. Frederickson: Implicit Data Structures for the Weighted Dictionary Problem (preliminary version). FOCS 1981: 133-139
- 1980
- [j3]Greg N. Frederickson: Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms. Inf. Process. Lett. 11(4/5): 156-161 (1980)
- [c4]Greg N. Frederickson: Implicit Data Structures with Fast Update (Preliminary Report). FOCS 1980: 255-259
- [c3]Greg N. Frederickson, Donald B. Johnson: Generating and Searching Sets Induced by Networks. ICALP 1980: 221-233
- [c2]Greg N. Frederickson, Donald B. Johnson: Generalized Selection and Ranking (Preliminary Version). STOC 1980: 420-428
1970 – 1979
- 1979
- [j2]Greg N. Frederickson: Approximation Algorithms for Some Postman Problems. J. ACM 26(3): 538-554 (1979)
- 1978
- [j1]Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim: Approximation Algorithms for Some Routing Problems. SIAM J. Comput. 7(2): 178-193 (1978)
- 1976
- [c1]Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim: Approximation Algorithms for some Routing Problems. FOCS 1976: 216-227
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:03 CET by the dblp team