default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRonald I. Greenberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i5]Ronald I. Greenberg:
Effective Wordle Heuristics. CoRR abs/2408.11730 (2024)- 2021
- [c23]Ting Xiao
, Ronald I. Greenberg, Mark V. Albert:
Design and Assessment of a Task-Driven Introductory Data Science Course Taught Concurrently in Multiple Languages: Python, R, and MATLAB. ITiCSE (1) 2021: 290-295 - 2020
- [c22]Steven McGee, Randi McGee-Tekula, Jennifer Duck, Lucia Dettori, Ronald I. Greenberg, Andrew M. Rasmussen, Erica Wheeler, Adam Shelton:
Does a Computer Science Graduation Requirement Contribute to Increased Enrollment in Advanced Computer Science Coursework? RESPECT 2020: 1-2 - [c21]Ronald I. Greenberg, Julie Medero, Samuel A. Rebelsky, Frances P. Trees, Dale Reed:
The Impact of CS for All on College Placement in Computer Science. SIGCSE 2020: 327-328 - [c20]Renee Fall, Seth Freeman, Ronald I. Greenberg, Dan Kaiser, Nigamanth Sridhar:
Computer Science through Concurrent Enrollment: A Strategy to Broaden Participation. SIGCSE 2020: 805-806 - [c19]Steven McGee, Lucia Dettori, Ronald I. Greenberg, Andrew M. Rasmussen, Dale F. Reed, Don Yanek:
The Changing Profile of ECS Teachers. SIGCSE 2020: 1382
2010 – 2019
- 2019
- [c18]Ronald I. Greenberg, George K. Thiruvathukal:
Exercises Integrating High School Mathematics with Robot Motion Planning. FIE 2019: 1-5 - [c17]Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg:
Integrating Mathematics and Educational Robotics: Simple Motion Planning. RiE 2019: 262-269 - [c16]Steven McGee, Ronald I. Greenberg, Randi McGee-Tekula, Jennifer Duck, Andrew M. Rasmussen, Lucia Dettori, Dale F. Reed:
An Examination of the Correlation of Exploring Computer Science Course Performance and the Development of Programming Expertise. SIGCSE 2019: 1067-1073 - 2018
- [c15]Ronald I. Greenberg, Dale F. Reed:
Using Magic in Computing Education and Outreach. FIE 2018: 1-4 - [c14]Steven McGee, Randi McGee-Tekula, Jennifer Duck, Catherine McGee, Lucia Dettori, Ronald I. Greenberg, Eric Snow, Daisy Rutstein, Dale Reed, Brenda Wilkerson, Don Yanek, Andrew M. Rasmussen, Dennis Brylow:
Equal Outcomes 4 All: A Study of Student Learning in ECS. SIGCSE 2018: 50-55 - [c13]Lucia Dettori, Ronald I. Greenberg, Steven McGee, Dale Reed, Brenda Wilkerson, Don Yanek:
CS as a Graduation Requirement: Catalyst for Systemic Change. SIGCSE 2018: 406-407 - 2017
- [j12]Steven McGee, Randi McGee-Tekula, Jennifer Duck, Ronald I. Greenberg, Lucia Dettori, Dale Reed, Brenda Wilkerson, Don Yanek, Andrew M. Rasmussen, Gail Chapman:
Does a Taste of Computing Increase Computer Science Enrollment? Comput. Sci. Eng. 19(3): 8-18 (2017) - [c12]Ronald I. Greenberg:
Educational Magic Tricks Based on Error-Detection Schemes. ITiCSE 2017: 170-175 - [c11]Ronald I. Greenberg:
Pythagorean Approximations for LEGO: Merging Educational Robot Construction with Programming and Data Analysis. RiE 2017: 65-76 - 2016
- [j11]Lucia Dettori, Ronald I. Greenberg, Steven McGee, Dale Reed:
The Impact of the Exploring Computer Science Instructional Model in Chicago Public Schools. Comput. Sci. Eng. 18(2): 10-17 (2016) - 2015
- [c10]Ronald I. Greenberg, Dale Reed:
Tools for Outreach Presentations. ITiCSE 2015: 331
2000 – 2009
- 2003
- [c9]Ronald I. Greenberg:
Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract). COCOON 2003: 528-536 - [i4]Ronald I. Greenberg:
Bounds on the Number of Longest Common Subsequences. CoRR cs.DM/0301030 (2003) - [i3]Ronald I. Greenberg:
Computing the Number of Longest Common Subsequences. CoRR cs.DS/0301034 (2003) - 2002
- [j10]Ronald I. Greenberg, Lee Guan:
On the area of hypercube layouts. Inf. Process. Lett. 84(1): 41-46 (2002) - [i2]Ronald I. Greenberg:
Fast and Simple Computation of All Longest Common Subsequences. CoRR cs.DS/0211001 (2002) - 2001
- [i1]Ronald I. Greenberg, Lee Guan:
On the Area of Hypercube Layouts. CoRR cs.DC/0105034 (2001)
1990 – 1999
- 1997
- [j9]Ronald I. Greenberg, Jau-Der Shih:
Minimizing Channel Density with Movable Terminals. Algorithmica 17(2): 89-99 (1997) - [j8]Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih:
Parallel Algorithms for Single-Layer Channel Routing. Parallel Process. Lett. 7(3): 267-277 (1997) - [j7]Ronald I. Greenberg, Hyeong-Cheol Oh:
Universal Wormhole Routing. IEEE Trans. Parallel Distributed Syst. 8(3): 254-262 (1997) - [c8]Ronald I. Greenberg, Lee Guan:
An Improved Analytical Model for Wormhole Routed Networks with Application to Butterfly Fat-Trees. ICPP 1997: 44-48 - 1995
- [j6]Ronald I. Greenberg, Hyeong-Cheol Oh:
Packet Routing in Networks with Long Wires. J. Parallel Distributed Comput. 31(2): 153-158 (1995) - [j5]Ronald I. Greenberg, Jau-Der Shih:
Feasible Offset and Optimal Offset for General Single-Layer Channel Routing. SIAM J. Discret. Math. 8(4): 543-554 (1995) - [c7]Ronald I. Greenberg:
Finding Connected Components on a Scan Line Array Processor. SPAA 1995: 195-202 - 1994
- [j4]Ronald I. Greenberg:
The Fat-Pyramid and Universal Parallel Computation Independent of Wire Delay. IEEE Trans. Computers 43(12): 1358-1364 (1994) - 1993
- [c6]Ronald I. Greenberg, Jau-Der Shih:
Minimizing channel density with movable terminals. Great Lakes Symposium on VLSI 1993: 1-5 - [c5]Ronald I. Greenberg, Shih-Chuan Hung, Jau-Der Shih:
Parallel Algorithms for Single-Layer Channel Routing. ISAAC 1993: 456-465 - [c4]Ronald I. Greenberg, Jau-Der Shih:
Feasible Offset an Optimal Offset for Single-Layer Channel Routing. ISTCS 1993: 193-201 - [c3]Ronald I. Greenberg, Hyeong-Cheol Oh:
Universal Wormhole Routing. SPDP 1993: 56-63 - 1992
- [j3]Ronald I. Greenberg, F. Miller Maley:
Minimum Separation for Single-Layer Channel Routing. Inf. Process. Lett. 43(4): 210-205 (1992) - [j2]Ronald I. Greenberg, Joseph F. JáJá, Sridhar Krishnamurthy:
On the Difficulty of Manhattan Channel Routing. Inf. Process. Lett. 44(5): 281-284 (1992)
1980 – 1989
- 1989
- [j1]M. J. Foster, Ronald I. Greenberg:
Lower Bounds on the Area of Finite-State Machines. Inf. Process. Lett. 30(1): 1-7 (1989) - 1988
- [c2]Ronald I. Greenberg, Alexander T. Ishii, Alberto L. Sangiovanni-Vincentelli:
MulCh: a multi-layer channel router using one, two, and three layer partitions. ICCAD 1988: 88-91 - 1985
- [c1]Ronald I. Greenberg, Charles E. Leiserson:
Randomized Routing on Fat-Trees (Preliminary Version). FOCS 1985: 241-249
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
