Travelled to:1 × Sweden
5 × USA
Collaborated with:∅ D.B.Johnson N.A.Lynch M.A.Srinivas
Talks about:structur (2) select (2) search (2) updat (2) line (2) data (2) intersect (1) synchron (1) shortest (1) communic (1)
Person: Greg N. Frederickson
DBLP: Frederickson:Greg_N=
Contributed to:
1993
199019871984198319801980Wrote 8 papers:
- ICALP-1993-Frederickson
- Searching among Intervals and Compact Routing Tables (GNF), pp. 28–39.
- STOC-1990-Frederickson #bound
- The Information Theory Bound Is Tight for Selection in a Heap (GNF), pp. 26–33.
- STOC-1987-Frederickson #approach #graph
- A New Approach to All Pairs Shortest Paths in Planar Graphs (GNF), pp. 19–28.
- STOC-1984-FredericksonL #communication #problem
- The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring (GNF, NAL), pp. 493–503.
- STOC-1984-FredericksonS #data type #online
- Data Structures for On-Line Updating of Matroid Intersection Solutions (GNF, MAS), pp. 383–390.
- STOC-1983-Frederickson #data type #online
- Data Structures for On-Line Updating of Minimum Spanning Trees (GNF), pp. 252–257.
- ICALP-1980-FredericksonJ #generative #network #set
- Generating and Searching Sets Induced by Networks (GNF, DBJ), pp. 221–233.
- STOC-1980-FredericksonJ #ranking
- Generalized Selection and Ranking (GNF, DBJ), pp. 420–428.