World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
35
Citations
6777
World Ranking
11540
National Ranking
4741

Overview

Greg N. Frederickson is affiliated with Purdue University West Lafayette in the United States. Their research spans multiple fields, with primary expertise in engineering and materials science. The subfields of study include automotive engineering, materials chemistry, and industrial and manufacturing engineering.

Their work addresses several main topics:

  • Additive Manufacturing and 3D Printing Technologies
  • Quasicrystal Structures and Properties
  • Manufacturing Process and Optimization

Greg N. Frederickson has published in recognized academic venues. Their frequent publication venue is The Mathematical Gazette, with at least one recorded publication there.

A notable recent paper is titled Hole dissections for planar figures, published in 2021 in The Mathematical Gazette. This publication focuses on mathematical aspects relevant to their broader engineering interests.

There are no recorded frequent co-authors listed for their work, indicating independent or varied collaborative endeavors.

Best Publications

  • Fast algorithms for shortest paths in planar graphs, with applications

    Greg N. Frederickson

  • Approximation algorithms for some routing problems

    Unknown

  • Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications

    Greg N. Frederickson

  • Approximation Algorithms for Several Graph Augmentation Problems

    Greg N. Frederickson;Joseph F. JáJá

  • Electing a leader in a synchronous ring

    Greg N. Frederickson;Nancy A. Lynch

  • Generalized Selection and Ranking: Sorted Matrices

    Greg N. Frederickson;Donald B. Johnson

  • Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees

    Greg N. Frederickson

  • The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns

    Unknown

  • Data structures for on-line updating of minimum spanning trees

    Greg N. Frederickson

  • Increasing the weight of minimum spanning trees

    Greg N. Frederickson;Roberto Solis-Oba

  • Approximation Algorithms for Some Postman Problems

    Unknown

  • Designing networks with compact routing tables

    Greg N. Frederickson;Ravi Janardan

  • Dissections: Plane and Fancy

    Greg N. Frederickson

  • Parametric search and locating supply centers in trees

    Greg N. Frederickson

  • Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan

    Unknown

  • Optimal algorithms for tree partitioning

    Greg N. Frederickson

  • Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures

    Unknown

  • An optimal algorithm for selection in a min-heap

    Greg N. Frederickson

  • The impact of synchronous communication on the problem of electing a leader in a ring

    Greg N. Frederickson;Nancy A. Lynch

  • Planar graph decomposition and all pairs shortest paths

    Greg N. Frederickson

  • Efficient message routing in planar networks

    Greg N. Frederickson;Ravi Janardan

  • A Data Structure for Dynamically Maintaining Rooted Trees

    Greg N. Frederickson

  • Upper bounds for time-space trade-offs in sorting and selection

    Greg N. Frederickson

  • Preemptive ensemble motion planning on a tree

    Greg N. Frederickson;D. J. Guan

  • Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)

    Greg N. Frederickson

Frequent Co-Authors

Mikhail J. Atallah
Mikhail J. Atallah Purdue University West Lafayette
David Eppstein
David Eppstein University of California, Irvine
Sonia Fahmy
Sonia Fahmy Purdue University West Lafayette
Nicola Santoro
Nicola Santoro Carleton University
John R. Rice
John R. Rice Purdue University West Lafayette
Joseph JaJa
Joseph JaJa University of Maryland, College Park

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

A degree in computer science opens doors to related fields with strong career potential. Students often explore engineering and data-focused programs to broaden their skills and job prospects. There are many affordable online options to consider when looking to compliment or expand your expertise.

For those interested in bridging software and hardware knowledge, pursuing an online mechanical engineering degree can provide hands-on skills valued in robotics, automation, and manufacturing industries. Similarly, the cheapest online physics degree programs deliver a solid foundation in scientific computation and problem solving, ideal for technology and research careers.

Data continues to drive innovation and hiring. If you are interested in analytics or AI, consider the cheapest data science degree programs available online. For deeper technical expertise, pursuing an online master’s in electrical engineering degree is another respected pathway, especially in electronics and telecommunications sectors.

Exploring these additional online degrees can enhance your versatility and increase career options across rapidly evolving STEM fields.

Best Scientists Citing Greg N. Frederickson

Trending Scientists