Остановите войну!
for scientists:
default search action
Greg N. Frederickson
- > Home > Persons > Greg N. Frederickson
Publications
- 2007
- [j52]Greg N. Frederickson:
Unexpected Twists in Geometric Dissections. Graphs Comb. 23(Supplement-1): 245-258 (2007) - 2002
- [c27]Greg N. Frederickson:
Piano-Hinged Dissections: Now Let's Fold! JCDCG 2002: 159-171 - 2000
- [c26]Greg N. Frederickson:
Geometric Dissections that Swing and Twist. JCDCG 2000: 137-148 - 1998
- [j48]Greg N. Frederickson:
Maintaining Regular Properties Dynamically in k-Terminal Graphs. Algorithmica 22(3): 330-350 (1998) - 1997
- [j46]Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees. J. Algorithms 24(1): 37-65 (1997) - [j45]Greg N. Frederickson:
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. SIAM J. Comput. 26(2): 484-538 (1997) - 1996
- [j43]Greg N. Frederickson:
Searching Among Intervals and Compact Routing Tables. Algorithmica 15(5): 448-466 (1996) - 1995
- [j42]Greg N. Frederickson:
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. J. Algorithms 19(1): 45-85 (1995) - 1993
- [j40]Greg N. Frederickson:
An Optimal Algorithm for Selection in a Min-Heap. Inf. Comput. 104(2): 197-214 (1993) - [j37]Greg N. Frederickson:
A Note on the Complexity of a Simple Transportation Problem. SIAM J. Comput. 22(1): 57-61 (1993) - [c23]Greg N. Frederickson:
Searching among Intervals and Compact Routing Tables. ICALP 1993: 28-39 - [c22]Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees. SODA 1993: 175-184 - 1992
- [j36]Greg N. Frederickson:
Editor's Foreword Special Issue on Graph Algorithms. Algorithmica 7(5&6): 429-431 (1992) - [e1]Greg N. Frederickson:
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA. ACM/SIAM 1992, ISBN 0-89791-466-X [contents] - 1991
- [j34]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]Greg N. Frederickson:
Optimal Algorithms for Tree Partitioning. SODA 1991: 168-177 - [c19]Greg N. Frederickson:
Parametric Search and Locating Supply Centers in Trees. WADS 1991: 299-319 - 1990
- [j32]Greg N. Frederickson:
A Distributed Shortest Path Algorithm for a Planar Network. Inf. Comput. 86(2): 140-159 (1990) - [c18]Greg N. Frederickson:
The Information Theory Bound Is Tight for Selection in a Heap. STOC 1990: 26-33 - 1989
- [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:
Distributed Algorithms for Selection in Sets. J. Comput. Syst. Sci. 37(3): 337-348 (1988) - 1987
- [j20]Greg N. Frederickson:
Upper Bounds for Time-Space Trade-Offs in Sorting and Selection. J. Comput. Syst. Sci. 34(1): 19-26 (1987) - [j19]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 - 1985
- [j17]Greg N. Frederickson:
Implicit Data Structures for Weighted Elements. Inf. Control. 66(1/2): 61-82 (1985) - [j16]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
- [j15]Greg N. Frederickson:
On Linear-Time Algorithms for Five-Coloring Planar Graphs. Inf. Process. Lett. 19(5): 219-224 (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) - 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) - [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 - 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 - 1979
- [j2]Greg N. Frederickson:
Approximation Algorithms for Some Postman Problems. J. ACM 26(3): 538-554 (1979)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint