Jean R. S. Blair

Orcid: 0000-0001-7176-6730

According to our database1, Jean R. S. Blair authored at least 43 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Seeing the Whole Elephant - A Comprehensive Framework for Data Education.
Proceedings of the 55th ACM Technical Symposium on Computer Science Education, 2024

2022
On the Maximum Number of Edges in Chordal Graphs of Bounded Degree and Matching Number.
Algorithmica, 2022

2021
On the effectiveness of the incremental approach to minimal chordal edge modification.
Theor. Comput. Sci., 2021

Establishing ABET Accreditation Criteria for Data Science.
Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Creating a Multifarious Cyber Science Major.
Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

2020
Infusing Principles and Practices for Secure Computing Throughout an Undergraduate Computer Science Curriculum.
Proceedings of the 2020 ACM Conference on Innovation and Technology in Computer Science Education, 2020

2019
Educating Future Multidisciplinary Cybersecurity Teams.
Computer, 2019

2016
A Capstone Design Project for Teaching Cybersecurity to Non-technical Users.
Proceedings of the 17th Annual Conference on Information Technology Education and the 5th Annual Conference on Research in Information Technology, 2016

What is Information Technology's Role in Cybersecurity?
Proceedings of the 17th Annual Conference on Information Technology Education and the 5th Annual Conference on Research in Information Technology, 2016

2015
Cyber Education: A Multi-Level, Multi-Discipline Approach.
Proceedings of the 16th Annual Conference on Information Technology Education, 2015

2014
Meaningful assessment.
Proceedings of the 15th Annual Conference on Information Technology Education, 2014

2012
An efficient self-stabilizing distance-2 coloring algorithm.
Theor. Comput. Sci., 2012

2010
Graph Extremities Defined by Search Algorithms.
Algorithms, 2010

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Efficient Self-stabilizing Graph Searching in Tree Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

2008
On domination and reinforcement numbers in trees.
Discret. Math., 2008

2006
Avoiding the pratfalls of program assessment.
ACM SIGCSE Bull., 2006

An Undergraduate Success Story: A Computer Science and Electrical Engineering Integrative Experience.
IEEE Pervasive Comput., 2006

Preface.
Discret. Math., 2006

Faculty development in information technology education.
Proceedings of the 7th Conference on Information Technology Education, 2006

Designing an interdisciplinary information technology program.
Proceedings of the 7th Conference on Information Technology Education, 2006

Catch that speeding turtle: latching onto fun graphics in CS1.
Proceedings of the 2006 Annual ACM SIGAda International Conference on Ada, 2006

2005
Extremities and orderings defined by generalized graph search algorithms.
Electron. Notes Discret. Math., 2005

2004
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs.
Algorithmica, 2004

Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees.
Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003
Puzzles and games: addressing different learning styles in teaching operating systems concepts.
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

Efficient Self-stabilizing Algorithms for Tree Network.
Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002
Maximum Cardinality Search for Computing Minimal Triangulations.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001
A practical algorithm for making filled graphs minimal.
Theor. Comput. Sci., 2001

Evaluating the fidelity of a partitioned digital image halftoning algorithm.
Proceedings of the Visual Information Processing X, Orlando, FL, USA, April 16, 2001, 2001

1997
The Undergraduate Capstone Software Design Experience.
Proceedings of the Conference, The annual meeting of the Ada programming world, 1997

1996
River Routing with a Generalized Model.
J. Comput. Syst. Sci., 1996

Perfect Recall and Pruning in Games with Imperfect Information.
Comput. Intell., 1996

Making an Arbitrary Filled Graph Minimal by Removing Fill Edges.
Proceedings of the Algorithm Theory, 1996

1994
On Finding Minimum-Diameter Clique Trees.
Nord. J. Comput., 1994

1993
The Efficiency of AC Graphs.
Discret. Appl. Math., 1993

1992
Minimizing External Wires in Generalized Single-Row Routing.
IEEE Trans. Computers, 1992

The Impact of wire Topology on Single Row Routing.
J. Circuits Syst. Comput., 1992

1991
The Benefits of External Wires in Single Row Routing.
Inf. Process. Lett., 1991

Practical Parallel Algorithms for Chordal Graphs.
Proceedings of the Advances in Computing and Information, 1991

1987
Minimizing Channel Density in Standard Cell Layout.
Algorithmica, 1987

1986
Generalized River Routing - Algorithms and Performance Bounds (Extended Abstract).
Proceedings of the VLSI Algorithms and Architectures, 1986

1985
An optimistic implementation of the stack-heap.
J. Syst. Softw., 1985


  Loading...