AAAAAA

   
Results: 1-11 |
Results: 11

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, MAINTAINING REGULAR PROPERTIES DYNAMICALLY IN K-TERMINAL GRAPHS, Algorithmica, 22(3), 1998, pp. 330-350

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, A DATA STRUCTURE FOR DYNAMICALLY MAINTAINING ROOTED TREES, Journal of algorithms, 24(1), 1997, pp. 37-65

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, AMBIVALENT DATA-STRUCTURES FOR DYNAMIC 2-EDGE-CONNECTIVITY AND K SMALLEST SPANNING-TREES, SIAM journal on computing, 26(2), 1997, pp. 484-538

Authors: LOUI MC CONDON A FICH F FREDERICKSON GN GOLDBERG AV JOHNSON DS MAHANEY S RAGHAVAN P SAVAGE J SELMAN AL SHMOYS DB
Citation: Mc. Loui et al., STRATEGIC DIRECTIONS IN RESEARCH IN THEORY OF COMPUTING, ACM computing surveys, 28(4), 1996, pp. 575-590

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, SEARCHING AMONG INTERVALS AND COMPACT ROUTING TABLES, Algorithmica, 15(5), 1996, pp. 448-466

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, USING CELLULAR GRAPH EMBEDDINGS IN SOLVING ALL PAIRS SHORTEST PATHS PROBLEMS, Journal of algorithms, 19(1), 1995, pp. 45-85

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, EDITOR FOREWORD, Journal of algorithms, 17(3), 1994, pp. 291-291

Authors: FREDERICKSON GN RODGER SH
Citation: Gn. Frederickson et Sh. Rodger, AN NC ALGORITHM FOR SCHEDULING UNIT-TIME JOBS WITH ARBITRARY RELEASE TIMES AND DEADLINES, SIAM journal on computing, 23(1), 1994, pp. 185-211

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, AN OPTIMAL ALGORITHM FOR SELECTION IN A MIN-HEAP, Information and computation, 104(2), 1993, pp. 197-214

Authors: FREDERICKSON GN HAMBRUSCH SE TU HY
Citation: Gn. Frederickson et al., SHORTEST-PATH COMPUTATIONS IN SOURCE-DEPLANARIZED GRAPHS, Information processing letters, 47(2), 1993, pp. 71-75

Authors: FREDERICKSON GN
Citation: Gn. Frederickson, SPECIAL ISSUE ON GRAPH ALGORITHMS - FOREWORD, Algorithmica, 7(5-6), 1992, pp. 429-431
Risultati: 1-11 |