Ronald I. Greenberg

According to our database1, Ronald I. Greenberg authored at least 36 papers between 1985 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Effective Wordle Heuristics.
CoRR, 2024

2021
Design and Assessment of a Task-Driven Introductory Data Science Course Taught Concurrently in Multiple Languages: Python, R, and MATLAB.
Proceedings of the ITiCSE '21: Proceedings of the 26th ACM Conference on Innovation and Technology in Computer Science Education V.1, Virtual Event, Germany, June 26, 2021

2020
The Changing Profile of ECS Teachers.
Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

The Impact of CS for All on College Placement in Computer Science.
Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

Computer Science through Concurrent Enrollment: A Strategy to Broaden Participation.
Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

Does a Computer Science Graduation Requirement Contribute to Increased Enrollment in Advanced Computer Science Coursework?
Proceedings of the Research on Equity and Sustained Participation in Engineering, 2020

2019
An Examination of the Correlation of Exploring Computer Science Course Performance and the Development of Programming Expertise.
Proceedings of the 50th ACM Technical Symposium on Computer Science Education, 2019

Integrating Mathematics and Educational Robotics: Simple Motion Planning.
Proceedings of the Robotics in Education, 2019

Exercises Integrating High School Mathematics with Robot Motion Planning.
Proceedings of the IEEE Frontiers in Education Conference, 2019

2018
Equal Outcomes 4 All: A Study of Student Learning in ECS.
Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

CS as a Graduation Requirement: Catalyst for Systemic Change.
Proceedings of the 49th ACM Technical Symposium on Computer Science Education, 2018

Using Magic in Computing Education and Outreach.
Proceedings of the IEEE Frontiers in Education Conference, 2018

2017
Does a Taste of Computing Increase Computer Science Enrollment?
Comput. Sci. Eng., 2017

Pythagorean Approximations for LEGO: Merging Educational Robot Construction with Programming and Data Analysis.
Proceedings of the Robotics in Education, 2017

Educational Magic Tricks Based on Error-Detection Schemes.
Proceedings of the 2017 ACM Conference on Innovation and Technology in Computer Science Education, 2017

2016
The Impact of the Exploring Computer Science Instructional Model in Chicago Public Schools.
Comput. Sci. Eng., 2016

2015
Tools for Outreach Presentations.
Proceedings of the 2015 ACM Conference on Innovation and Technology in Computer Science Education, 2015

2003
Computing the Number of Longest Common Subsequences
CoRR, 2003

Bounds on the Number of Longest Common Subsequences
CoRR, 2003

Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract).
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

2002
On the area of hypercube layouts.
Inf. Process. Lett., 2002

Fast and Simple Computation of All Longest Common Subsequences
CoRR, 2002

1997
Universal Wormhole Routing.
IEEE Trans. Parallel Distributed Syst., 1997

Parallel Algorithms for Single-Layer Channel Routing.
Parallel Process. Lett., 1997

Minimizing Channel Density with Movable Terminals.
Algorithmica, 1997

An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees.
Proceedings of the 1997 International Conference on Parallel Processing (ICPP '97), 1997

1995
Feasible Offset and Optimal Offset for General Single-Layer Channel Routing.
SIAM J. Discret. Math., 1995

Packet Routing in Networks with Long Wires.
J. Parallel Distributed Comput., 1995

Finding Connected Components on a Scan Line Array Processor.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

1994
The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay.
IEEE Trans. Computers, 1994

1993
Feasible Offset an Optimal Offset for Single-Layer Channel Routing.
Proceedings of the Second Israel Symposium on Theory of Computing Systems, 1993

1992
Minimum Separation for Single-Layer Channel Routing.
Inf. Process. Lett., 1992

On the Difficulty of Manhattan Channel Routing.
Inf. Process. Lett., 1992

1989
Lower Bounds on the Area of Finite-State Machines.
Inf. Process. Lett., 1989

1988
MulCh: a multi-layer channel router using one, two, and three layer partitions.
Proceedings of the 1988 IEEE International Conference on Computer-Aided Design, 1988

1985
Randomized Routing on Fat-Trees (Preliminary Version)
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985


  Loading...