The SCEAS System
| |||||||

## Search the dblp DataBase
Jean R. S. Blair:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Jean R. S. Blair, Fredrik Manne
**Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees.**[Citation Graph (0, 0)][DBLP] ISCA PDCS, 2004, pp:333-338 [Conf] - Jean R. S. Blair, Errol L. Lloyd
**Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract).**[Citation Graph (0, 0)][DBLP] Aegean Workshop on Computing, 1986, pp:317-328 [Conf] - Eric S. Kirsch, Jean R. S. Blair
**Practical Parallel Algorithms for Chordal Graphs.**[Citation Graph (0, 0)][DBLP] ICCI, 1991, pp:372-382 [Conf] - Jean R. S. Blair, Fredrik Manne
**Efficient Self-stabilizing Algorithms for Tree Network.**[Citation Graph (0, 0)][DBLP] ICDCS, 2003, pp:20-0 [Conf] - Jean R. S. Blair, Eugene K. Ressler, Thomas D. Wagner
**The Undergraduate Capstone Software Design Experience.**[Citation Graph (0, 0)][DBLP] TRI-Ada, 1997, pp:41-47 [Conf] - John M. D. Hill, Clark K. Ray, Jean R. S. Blair, Curtis A. Carver Jr.
**Puzzles and games: addressing different learning styles in teaching operating systems concepts.**[Citation Graph (0, 0)][DBLP] SIGCSE, 2003, pp:182-186 [Conf] - Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
**Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.**[Citation Graph (0, 0)][DBLP] SWAT, 1996, pp:173-184 [Conf] - Anne Berry, Jean R. S. Blair, Pinar Heggernes
**Maximum Cardinality Search for Computing Minimal Triangulations.**[Citation Graph (0, 0)][DBLP] WG, 2002, pp:1-12 [Conf] - Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton
**Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:39, n:4, pp:287-298 [Journal] - Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit
**Minimizing Channel Density in Standard Cell Layout.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1987, v:2, n:, pp:267-282 [Journal] - Jean R. S. Blair, David Mutchler, Michael van Lent
**Perfect Recall and Pruning in Games with Imperfect Information.**[Citation Graph (0, 0)][DBLP] Computational Intelligence, 1996, v:12, n:, pp:131-154 [Journal] - Jean R. S. Blair
**The Efficiency of AC Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:119-138 [Journal] - Anne Berry, Jean R. S. Blair, Geneviève Simonet
**Preface.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:3, pp:293- [Journal] - Jean R. S. Blair, Errol L. Lloyd
**The Benefits of External Wires in Single Row Routing.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:40, n:1, pp:43-49 [Journal] - Jean R. S. Blair, Errol L. Lloyd
**River Routing with a Generalized Model.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1996, v:53, n:3, pp:525-544 [Journal] - Jean R. S. Blair, Phil Kearns, Mary Lou Soffa
**An optimistic implementation of the stack-heap.**[Citation Graph (0, 0)][DBLP] Journal of Systems and Software, 1985, v:5, n:3, pp:193-202 [Journal] - Jean R. S. Blair, Barry W. Peyton
**On Finding Minimum-Diameter Clique Trees.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1994, v:1, n:2, pp:173-201 [Journal] - Jean R. S. Blair, Errol L. Lloyd
**Minimizing External Wires in Generalized Single-Row Routing.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1992, v:41, n:6, pp:771-776 [Journal] - Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle
**A practical algorithm for making filled graphs minimal.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:250, n:1-2, pp:125-141 [Journal] **Catch that speeding turtle: latching onto fun graphics in CS1.**[Citation Graph (, )][DBLP]**Faculty development in information technology education.**[Citation Graph (, )][DBLP]**Designing an interdisciplinary information technology program.**[Citation Graph (, )][DBLP]**An Efficient Self-stabilizing Distance-2 Coloring Algorithm.**[Citation Graph (, )][DBLP]**Efficient Self-stabilizing Graph Searching in Tree Networks.**[Citation Graph (, )][DBLP]**Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure.**[Citation Graph (, )][DBLP]**On domination and reinforcement numbers in trees.**[Citation Graph (, )][DBLP]
Search in 0.149secs, Finished in 0.150secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |