David R. Surma

According to our database, David R. Surma authored at least 20 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Understanding the Effects of Adding a CS0 Course to a Computer Science Curriculum: A Long-Term Study.

David R. Surma, Zoe Surma

J. Comput. Sci. Coll., 2024

2017

Reinventing a digital design course: migrating electronics instruction from physics to CS and using problem-based learning.

Liqiang Zhang, James Wolfer, David R. Surma

J. Comput. Sci. Coll., 2017

2012

Computer literacy: what it means and do today's college students need a formal course in it?

David R. Surma, Mary Jo Geise, Jeff Lehman, Robert Beasley, E. Kent Palmer

J. Comput. Sci. Coll., 2012

Rolling the dice on theory: one department's decision to strengthen the theoretical computing aspect of their curriculum.

David R. Surma

J. Comput. Sci. Coll., 2012

2009

Communication Reduction Techniques for Application-Specific Traffic in Mesh Networks.

David R. Surma

Proceedings of the ISCA 22nd International Conference on Computer Applications in Industry and Engineering, 2009

2007

Techniques to Reduce Communication Overhead in Multiple Multicasts in 3D Mesh and Torus Networks.

David R. Surma

Proceedings of the ISCA 20th International Conference on Computer Applications in Industry and Engineering, 2007

2006

The use of presentations and competition in an introductory computer graphics course.

David R. Surma

J. Comput. Sci. Coll., 2006

2005

Lab activities requiring minimal resources for courses in computer networking.

David R. Surma

J. Comput. Sci. Coll., 2005

Improving Performance in Mesh and Torus Networks by Reducing Communication Overhead.

David R. Surma

Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

2004

Communication Scheduling With Re-Routing Based On Static And Hybrid Techniques.

David R. Surma, Edwin Hsing-Mean Sha, Nelson L. Passos

J. Circuits Syst. Comput., 2004

Reducing Communication Overhead in 3D Mesh Networks for Unicast and Path-based Multiple Multicasts.

David R. Surma

Proceedings of the 17th International Conference on Computer Applications in Industry and Engineering, 2004

2003

Using graph theory to reduce communication overhead in parallel systems.

David R. Surma

J. Comput. Sci. Coll., 2003

Teaching microprocessors utilizing a project-based approach.

David R. Surma

J. Comput. Sci. Coll., 2003

2002

Reducing Communication Overhead inMultiple Multicasts for Mesh Networks.

David R. Surma

Proceedings of the ISCA 17th International Conference Computers and Their Applications, 2002

2001

Collision Graph based Communication Reduction Techniques for Mesh Networks.

David R. Surma

Proceedings of the 14th International Conference on Computer Applications in Industry and Engineering, 2001

2000

Communication Reduction in Multiple Multicasts Based on Hybrid Static-Dynamic Scheduling.

David R. Surma, Edwin Hsing-Mean Sha

IEEE Trans. Parallel Distributed Syst., 2000

Probabilistic Loop Scheduling for Applications with Uncertain Execution Time.

Sissades Tongsima, Edwin Hsing-Mean Sha, Chantana Chantrapornchai, David R. Surma, Nelson L. Passos

IEEE Trans. Computers, 2000

1997

Hybrid static-dynamic communication scheduling for parallel systems.

David R. Surma, Edwin Hsing-Mean Sha

Proceedings of the 1997 ACM symposium on Applied Computing, 1997

1996

Optimal communication scheduling based on collision graph model.

David R. Surma, Sissades Tongsima, Edwin Hsing-Mean Sha

Proceedings of the 1996 IEEE International Conference on Acoustics, 1996

Static Communication Scheduling for Minimizing Collisions in Application Specific Parallel Systems.

David R. Surma, Edwin Hsing-Mean Sha

Proceedings of the 1996 International Conference on Application-Specific Systems, 1996