David R. Surma

20 papers C 4Misc 3Journal 11Unranked 2

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Understanding the Effects of Adding a CS0 Course to a Computer Science Curriculum: A Long-Term Study. J. Comput. Sci. Coll. David R. Surma, Zoe Surma
2017	J	`jnl`	Reinventing a digital design course: migrating electronics instruction from physics to CS and using problem-based learning. J. Comput. Sci. Coll. Liqiang Zhang, James Wolfer, David R. Surma
2012	J	`jnl`	Computer literacy: what it means and do today's college students need a formal course in it? J. Comput. Sci. Coll. David R. Surma, Mary Jo Geise, Jeff Lehman, Robert Beasley, E. Kent Palmer
2012	J	`jnl`	Rolling the dice on theory: one department's decision to strengthen the theoretical computing aspect of their curriculum. J. Comput. Sci. Coll. David R. Surma
2009	C	`conf`	Communication Reduction Techniques for Application-Specific Traffic in Mesh Networks. CAINE David R. Surma
2007	C	`conf`	Techniques to Reduce Communication Overhead in Multiple Multicasts in 3D Mesh and Torus Networks. CAINE David R. Surma
2006	J	`jnl`	The use of presentations and competition in an introductory computer graphics course. J. Comput. Sci. Coll. David R. Surma
2005	—	`conf`	Improving Performance in Mesh and Torus Networks by Reducing Communication Overhead. IASTED PDCS David R. Surma
2005	J	`jnl`	Lab activities requiring minimal resources for courses in computer networking. J. Comput. Sci. Coll. David R. Surma
2004	J	`jnl`	Communication Scheduling With Re-Routing Based On Static And Hybrid Techniques. J. Circuits Syst. Comput. David R. Surma, Edwin Hsing-Mean Sha, Nelson L. Passos
2004	C	`conf`	Reducing Communication Overhead in 3D Mesh Networks for Unicast and Path-based Multiple Multicasts. CAINE David R. Surma
2003	J	`jnl`	Teaching microprocessors utilizing a project-based approach. J. Comput. Sci. Coll. David R. Surma
2003	J	`jnl`	Using graph theory to reduce communication overhead in parallel systems. J. Comput. Sci. Coll. David R. Surma
2002	Misc	`conf`	Reducing Communication Overhead inMultiple Multicasts for Mesh Networks. CATA David R. Surma
2001	C	`conf`	Collision Graph based Communication Reduction Techniques for Mesh Networks. CAINE David R. Surma
2000	J	`jnl`	Communication Reduction in Multiple Multicasts Based on Hybrid Static-Dynamic Scheduling. IEEE Trans. Parallel Distributed Syst. David R. Surma, Edwin Hsing-Mean Sha
2000	J	`jnl`	Probabilistic Loop Scheduling for Applications with Uncertain Execution Time. IEEE Trans. Computers Sissades Tongsima, Edwin Hsing-Mean Sha, Chantana Chantrapornchai, David R. Surma, Nelson L. Passos
1997	Misc	`conf`	Hybrid static-dynamic communication scheduling for parallel systems. SAC David R. Surma, Edwin Hsing-Mean Sha
1996	Misc	`conf`	Optimal communication scheduling based on collision graph model. ICASSP David R. Surma, Sissades Tongsima, Edwin Hsing-Mean Sha
1996	—	`conf`	Static Communication Scheduling for Minimizing Collisions in Application Specific Parallel Systems. ASAP David R. Surma, Edwin Hsing-Mean Sha