Jean R. S. Blair

	2010
30		Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne: Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. SEA 2010: 411-423
29		Jean R. S. Blair, Fredrik Manne, Rodica Mihai: Efficient Self-stabilizing Graph Searching in Tree Networks. SSS 2010: 111-125
28		Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Geneviève Simonet: Graph Extremities Defined by Search Algorithms. Algorithms 3(2): 100-124 (2010)
	2009
27		Jean R. S. Blair, Fredrik Manne: An Efficient Self-stabilizing Distance-2 Coloring Algorithm. SIROCCO 2009: 237-251
	2008
26		Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki: On domination and reinforcement numbers in trees. Discrete Mathematics 308(7): 1165-1175 (2008)
	2006
25		Tanya Markow, Eugene K. Ressler, Jean R. S. Blair: Catch that speeding turtle: latching onto fun graphics in CS1. SIGAda 2006: 29-34
24		William K. Suchan, Jean R. S. Blair, Duane Fairfax, Bryan S. Goda, Kevin L. Huggins, Mike J. Lemanski: Faculty development in information technology education. SIGITE Conference 2006: 15-18
23		Edward Sobiesk, Jean R. S. Blair, James D. Cook, John C. Giordano, Bryan S. Goda, Charles W. Reynolds: Designing an interdisciplinary information technology program. SIGITE Conference 2006: 71-76
22		Anne Berry, Jean R. S. Blair, Geneviève Simonet: Preface. Discrete Mathematics 306(3): 293 (2006)
21		Grant A. Jacoby, Jean R. S. Blair: An Undergraduate Success Story: A Computer Science and Electrical Engineering Integrative Experience. IEEE Pervasive Computing 5(3): 11-15 (2006)
20		Christa M. Chewar, Kevin L. Huggins, Jean R. S. Blair: Avoiding the pratfalls of program assessment. SIGCSE Bulletin 38(4): 29-33 (2006)
	2005
19		Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Richard Krueger, Geneviève Simonet: Extremities and orderings defined by generalized graph search algorithms. Electronic Notes in Discrete Mathematics 22: 413-420 (2005)
	2004
18		Jean R. S. Blair, Fredrik Manne: Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees. ISCA PDCS 2004: 333-338
17		Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton: Maximum Cardinality Search for Computing Minimal Triangulations of Graphs. Algorithmica 39(4): 287-298 (2004)
	2003
16		Jean R. S. Blair, Fredrik Manne: Efficient Self-stabilizing Algorithms for Tree Network. ICDCS 2003: 20-
15		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. SIGCSE 2003: 182-186
	2002
14		Anne Berry, Jean R. S. Blair, Pinar Heggernes: Maximum Cardinality Search for Computing Minimal Triangulations. WG 2002: 1-12
	2001
13		Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: A practical algorithm for making filled graphs minimal. Theor. Comput. Sci. 250(1-2): 125-141 (2001)
	1997
12		Jean R. S. Blair, Eugene K. Ressler, Thomas D. Wagner: The Undergraduate Capstone Software Design Experience. TRI-Ada 1997: 41-47
	1996
11		Jean R. S. Blair, Pinar Heggernes, Jan Arne Telle: Making an Arbitrary Filled Graph Minimal by Removing Fill Edges. SWAT 1996: 173-184
10		Jean R. S. Blair, David Mutchler, Michael van Lent: Perfect Recall and Pruning in Games with Imperfect Information. Computational Intelligence 12: 131-154 (1996)
9		Jean R. S. Blair, Errol L. Lloyd: River Routing with a Generalized Model. J. Comput. Syst. Sci. 53(3): 525-544 (1996)
	1994
8		Jean R. S. Blair, Barry W. Peyton: On Finding Minimum-Diameter Clique Trees. Nord. J. Comput. 1(2): 173-201 (1994)
	1993
7		Jean R. S. Blair: The Efficiency of AC Graphs. Discrete Applied Mathematics 44(1-3): 119-138 (1993)
	1992
6		Jean R. S. Blair, Errol L. Lloyd: Minimizing External Wires in Generalized Single-Row Routing. IEEE Trans. Computers 41(6): 771-776 (1992)
	1991
5		Eric S. Kirsch, Jean R. S. Blair: Practical Parallel Algorithms for Chordal Graphs. ICCI 1991: 372-382
4		Jean R. S. Blair, Errol L. Lloyd: The Benefits of External Wires in Single Row Routing. Inf. Process. Lett. 40(1): 43-49 (1991)
	1987
3		Jean R. S. Blair, Sanjiv Kapoor, Errol L. Lloyd, Kenneth J. Supowit: Minimizing Channel Density in Standard Cell Layout. Algorithmica 2: 267-282 (1987)
	1986
2		Jean R. S. Blair, Errol L. Lloyd: Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract). Aegean Workshop on Computing 1986: 317-328
	1985
1		Jean R. S. Blair, Phil Kearns, Mary Lou Soffa: An optimistic implementation of the stack-heap. Journal of Systems and Software 5(3): 193-202 (1985)

Coauthor Index

1	Anne Berry	[14] [17] [19] [22] [28]
2	Jean Paul Bordat	[19] [28]
3	Curtis A. Carver Jr.	[15]
4	Christa M. Chewar	[20]
5	James D. Cook	[23]
6	Duane Fairfax	[24]
7	John C. Giordano	[23]
8	Bryan S. Goda	[23] [24]
9	Wayne Goddard	[26]
10	Stephen T. Hedetniemi	[26]
11	Pinar Heggernes	[11] [13] [14] [17]
12	John M. D. Hill	[15]
13	Steve Horton	[26]
14	Kevin L. Huggins	[20] [24]
15	Grant A. Jacoby	[21]
16	Patrick Jones	[26]
17	Sanjiv Kapoor	[3]
18	Phil Kearns	[1]
19	Eric S. Kirsch	[5]
20	Richard Krueger	[19]
21	Grzegorz Kubicki	[26]
22	Mike J. Lemanski	[24]
23	Michael van Lent	[10]
24	Errol L. Lloyd	[2] [3] [4] [6] [9]
25	Fredrik Manne	[16] [18] [27] [29] [30]
26	Tanya Markow	[25]
27	Rodica Mihai	[29]
28	David Mutchler	[10]
29	Md. Mostofa Ali Patwary	[30]
30	Barry W. Peyton	[8] [17]
31	Clark K. Ray	[15]
32	Eugene K. Ressler	[12] [25]
33	Charles W. Reynolds	[23]
34	Geneviève Simonet	[19] [22] [28]
35	Edward Sobiesk	[23]
36	Mary Lou Soffa	[1]
37	William K. Suchan	[24]
38	Kenneth J. Supowit	[3]
39	Jan Arne Telle	[11] [13]
40	Thomas D. Wagner	[12]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page