Barry S. Fagin

According to our database1, Barry S. Fagin authored at least 46 papers between 1985 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Idempotent Factorizations of Square-Free Integers.
Inf., 2019

Streamlining Computer Science Curriculum Development and Assessment using the New ABET Student Outcomes.
Proceedings of the 24th Western Canadian Conference on Computing Education, 2019

Teaching RSA: What Happens When One of Your Primes Isn't?
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

Idempotent Factorizations: A New Addition to the Cryptography Classroom.
Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education, 2019

2018
Composite Numbers That Give Valid RSA Key Pairs for Any Coprime p.
Inf., 2018

2017
Making DNS Servers Resistant to Cyber Attacks: An Empirical Study on Formal Methods and Performance.
Proceedings of the 41st IEEE Annual Computer Software and Applications Conference, 2017

2013
Provably Secure DNS: A Case Study in Reliable Software.
Proceedings of the Reliable Software Technologies, 2013

2012
Conserved Energy Functions for Cellular Automata: Finding Nontrivials Faster Through a Complete Theory of the Trivials.
J. Cell. Autom., 2012

Debugging on the Shoulders of Giants: Von Neumann's Programs 65 Years Later.
Computer, 2012

MyTuringTable: a teaching tool to accompany Turing's original paper on computability.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

IRONSIDES: DNS with no single-packet denial of service or remote code execution vulnerabilities.
Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011
IASSim: a programmable emulator for the princeton IAS/Von Neumann machine.
Proceedings of the 42nd ACM technical symposium on Computer science education, 2011

Defining, integrating, and assessing a purposeful progression of cross-curricular initiatives into a computer science program.
Proceedings of the 2011 Frontiers in Education Conference, 2011

2010
Faster Methods for Identifying Nontrivial Energy Conservation Functions for Cellular Automata.
Proceedings of the Automata 2010, 2010

2008
Conservation Functions for 1-D Automata: Efficient Algorithms, New Results, and a Partial Taxonomy.
J. Cell. Autom., 2008

2007
New Conservation Functions and a Partial Taxonomy for 1-D Cellular Automata.
Proceedings of the First IEEE Symposium on Artificial Life, 2007

2006
Do Lego Mindstorms Robots have a future in CS education?
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2006

2003
Ada/Mindstorms 3.0.
IEEE Robotics Autom. Mag., 2003

The fulbright program: international teaching and curriculum development experiences.
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

Measuring the effectiveness of robots in teaching computer science.
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

The case for Ada at the USAF academy.
Proceedings of the 2003 Annual ACM SIGAda International Conference on Ada: The Engineering of Correct and Reliable Software for Real-Time & Distributed Systems using Ada and Related Technologies 2003, 2003

2002
Quantitative analysis of the effects of robots on introductory Computer Science education.
ACM J. Educ. Resour. Comput., 2002

Ada/Mindstorms 2.0 user's guide and reference manual.
ACM J. Educ. Resour. Comput., 2002

2001
The use of robots in the undergraduate curriculum: experience reports.
Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

Teaching computer science with robotics using Ada/Mindstorms 2.0.
Proceedings of the Proceedings ACM SIGAda Annual International Conference, 2001

2000
Using Ada-based robotics to teach computer science.
Proceedings of the 5th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2000

1999
Computers, science, and the microsoft case.
SIGCAS Comput. Soc., 1999

1998
Standardization, innovation and Microsoft.
SIGCAS Comput. Soc., 1998

Liberty and community online.
SIGCAS Comput. Soc., 1998

1997
Partial Resolution in Branch Target Buffers.
IEEE Trans. Computers, 1997

1995
The Performance of Counter- and Correlation-Based Schemes for Branch Target Buffers.
IEEE Trans. Computers, 1995

Partial resolution in branch target buffers.
Proceedings of the 28th Annual International Symposium on Microarchitecture, Ann Arbor, Michigan, USA, November 29, 1995

1994
Field programmable gate arrays and floating point arithmetic.
IEEE Trans. Very Large Scale Integr. Syst., 1994

Two years of "The Digital World": portable courseware for technological literacy.
Proceedings of the 25th SIGCSE Technical Symposium on Computer Science Education, 1994

A Reprogrammable Processor for Fractal Image Compression.
Proceedings of the Field-Programmable Logic, 1994

1993
Quantitative measurements of FPGA utility in special and general purpose processors.
J. VLSI Signal Process., 1993

A special-purpose processor for gene sequence analysis.
Comput. Appl. Biosci., 1993

1992
Negacyclic convolution using polynomial transforms on hypercubes.
IEEE Trans. Signal Process., 1992

Calculating the FHT in hardware.
IEEE Trans. Signal Process., 1992

Fast Addition of Large Integers.
IEEE Trans. Computers, 1992

Large Integer Multiplication on Hypercubes.
J. Parallel Distributed Comput., 1992

Prototyping the DLX microprocessor.
Proceedings of the Third International Workshop on Rapid System Prototyping, 1992

FPGA and Rapid Prototyping Technology Use in a Special Purpose Computer for Molecular Genetics.
Proceedings of the Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1992

1990
The Performance of Parallel Prolog Programs.
IEEE Trans. Computers, 1990

1987
Performance Studies of a Parallel Prolog Architecture.
Proceedings of the 14th Annual International Symposium on Computer Architecture. Pittsburgh, 1987

1985
Compiling Prolog into microcode: a case study using the NCR/32-000.
Proceedings of the 18th annual workshop on Microprogramming, 1985


  Loading...