default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Ginat
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j60]David Ginat:
Colorful Challenges: Summation Construction. Inroads 14(1): 14-15 (2023)- [j59]David Ginat:
COLORFUL CHALLENGES: Even-Odd Game. Inroads 14(3): 6-7 (2023) - 2022
- [j58]David Ginat:
COLORFUL CHALLENGES: Domino line. Inroads 13(1): 15-16 (2022) - [j57]David Ginat:
Seating placement. Inroads 13(3): 10-11 (2022) - 2021
- [j56]David Ginat:
Abstraction, Declarative Observations and Algorithmic Problem Solving. Informatics Educ. 20(4): 567-582 (2021) - [j55]David Ginat:
COLORFUL CHALLENGES: Maximal partitions. Inroads 12(1): 18 (2021) - 2020
- [j54]David Ginat:
COLORFUL CHALLENGESPermutation inversion. Inroads 11(1): 16-17 (2020) - [j53]David Ginat:
COLORFUL CHALLENGES: Widest inversion. Inroads 11(3): 9-10 (2020)
2010 – 2019
- 2019
- [j52]David Ginat:
COLORFUL CHALLENGES: Fence leveling. Inroads 10(1): 28-29 (2019) - [j51]David Ginat:
COLORFUL CHALLENGES: Letter game. Inroads 10(3): 19-20 (2019) - 2018
- [j50]David Ginat:
COLORFUL CHALLENGES: Molecule collisions. Inroads 9(1): 12-13 (2018) - [j49]David Ginat:
COLORFUL CHALLENGES: Reversing. Inroads 9(3): 18-19 (2018) - 2017
- [j48]David Ginat:
COLORFUL CHALLENGES: Row/column transformations. Inroads 8(1): 19-20 (2017) - [j47]David Ginat:
COLORFUL CHALLENGES: Row/column transformations II. Inroads 8(3): 15-16 (2017) - [c43]David Ginat, Yoav Blau:
Multiple Levels of Abstraction in Algorithmic Problem Solving. SIGCSE 2017: 237-242 - 2016
- [j46]David Ginat:
COLORFUL CHALLENGES: Magic swaps. Inroads 7(1): 32-33 (2016) - [j45]David Ginat:
COLORFUL CHALLENGES: Linear cat & mouse game. Inroads 7(3): 14-15 (2016) - [c42]Daniel D. Garcia, David Ginat:
Demystifying Computing with Magic, part III. SIGCSE 2016: 158-159 - 2015
- [j44]David Ginat:
Getting the golden coin. Inroads 6(1): 35-36 (2015) - [j43]David Ginat:
Intersecting lines. Inroads 6(3): 47-48 (2015) - [c41]David Ginat, Eti Menashe:
SOLO Taxonomy for Assessing Novices' Algorithmic Design. SIGCSE 2015: 452-457 - 2014
- [j42]David Ginat:
Longest sum modulo-3. Inroads 5(1): 37-38 (2014) - [j41]David Ginat:
No arithmetic progression. Inroads 5(3): 42-43 (2014) - 2013
- [j40]David Ginat:
Proving lower bound. Inroads 4(1): 24-25 (2013) - [j39]David Ginat:
Tuple transformation. Inroads 4(3): 49-50 (2013) - [c40]David Ginat, Eti Menashe, Amal Taya:
Novice Difficulties with Interleaved Pattern Composition. ISSEP 2013: 57-67 - [c39]Daniel D. Garcia, David Ginat:
Demystifying computing with magic, continued. SIGCSE 2013: 207-208 - [c38]David Ginat, Ronit Shmallo
:
Constructive use of errors in teaching CS1. SIGCSE 2013: 353-358 - 2012
- [j38]David Ginat:
Chains and edges. Inroads 3(1): 32 (2012) - [j37]David Ginat:
Rectangle cover. Inroads 3(3): 34-35 (2012) - [c37]David Ginat, Ronnie Alankry:
Pseudo abstract composition: the case of language concatenation. ITiCSE 2012: 28-33 - [c36]Ronit Shmallo, Noa Ragonis, David Ginat:
Fuzzy OOP: expanded and reduced term interpretations. ITiCSE 2012: 309-314 - [c35]Daniel D. Garcia, David Ginat:
DeMystifying computing with magic. SIGCSE 2012: 83-84 - 2011
- [j36]David Ginat:
Cards shuffle. Inroads 2(1): 25 (2011) - [j35]David Ginat:
Powers-of-2 game. Inroads 2(3): 26 (2011) - [c34]David Ginat, Eyal Shifroni, Eti Menashe:
Transfer, Cognitive Load, and Program Design Difficulties. ISSEP 2011: 165-176 - 2010
- [j34]David Ginat:
Bean transfers. Inroads 1(1): 34 (2010) - [j33]David Ginat:
Finish line. Inroads 1(3): 24 (2010) - [c33]David Ginat:
Impasse, Conflict, and Learning of CS Notions. ISSEP 2010: 13-21 - [c32]Michal Armoni, Tamar Benaya, David Ginat, Ela Zur:
Didactics of Introduction to Computer Science in High School. ISSEP 2010: 36-48 - [c31]David Ginat:
The baffling CS notions of "as-if" and "don't-care". SIGCSE 2010: 385-389
2000 – 2009
- 2009
- [j32]David Ginat:
The Overlooked Don't-Care Notion in Algorithmic Problem Solving. Informatics Educ. 8(2): 217-226 (2009) - [j31]David Ginat:
Colorful Challenges: chips game. ACM SIGCSE Bull. 41(2): 82-83 (2009) - [j30]David Ginat:
Colorful challenges: The lengthy 0-1. ACM SIGCSE Bull. 41(4): 22-23 (2009) - [j29]David Ginat:
On the non-modular design of on-the-fly computations. ACM SIGCSE Bull. 41(4): 35-39 (2009) - [c30]David Ginat:
Interleaved pattern composition and scaffolded learning. ITiCSE 2009: 109-113 - 2008
- [j28]Michal Armoni, David Ginat:
Reversing: a fundamental idea in computer science. Comput. Sci. Educ. 18(3): 213-230 (2008) - [j27]David Ginat:
The Unfortunate Novice Theme of Direct Transformation. Informatics Educ. 7(2): 173-180 (2008) - [j26]David Ginat:
Separating between foes. ACM SIGCSE Bull. 40(2): 24-25 (2008) - [j25]David Ginat:
Colorful challenges: Kangaroo hops. ACM SIGCSE Bull. 40(4): 28-29 (2008) - [c29]David Ginat:
Design Disciplines and Non-specific Transfer. ISSEP 2008: 87-98 - [c28]David Ginat:
Learning from wrong and creative algorithm design. SIGCSE 2008: 26-30 - 2007
- [j24]David Ginat:
Domino arrangements. ACM SIGCSE Bull. 39(2): 24-25 (2007) - [j23]David Ginat:
Alternating accumulation. ACM SIGCSE Bull. 39(4): 28-29 (2007) - [j22]David Ginat:
Elaborating heuristic reasoning and rigor with mathematical games. ACM SIGCSE Bull. 39(4): 32-36 (2007) - [c27]Orna Muller, David Ginat, Bruria Haberman:
Pattern-oriented instruction and its influence on problem decomposition and solution construction. ITiCSE 2007: 151-155 - [c26]David Ginat:
Hasty design, futile patching and the elaboration of rigor. ITiCSE 2007: 161-165 - 2006
- [j21]David Ginat:
Graph cycles. ACM SIGCSE Bull. 38(2): 20-22 (2006) - [j20]David Ginat:
Hidden squares. ACM SIGCSE Bull. 38(4): 22-23 (2006) - [c25]David Ginat:
On Novices' Local Views of Algorithmic Characteristics. ISSEP 2006: 127-137 - [c24]David Ginat, Michal Armoni:
Reversing: an essential heuristic in program and proof design. SIGCSE 2006: 469-473 - 2005
- [j19]David Ginat:
Tuple enumeration. ACM SIGCSE Bull. 37(2): 22-23 (2005) - [j18]David Ginat:
Queens on a chessboard. ACM SIGCSE Bull. 37(4): 26-27 (2005) - [c23]Bruria Haberman, Haim Averbuch, David Ginat:
Is it really an algorithm: the need for explicit discourse. ITiCSE 2005: 74-78 - [c22]David Ginat, Richard J. Anderson, Daniel D. Garcia, Richard Rasala:
Randomness and probability in the early CS courses. SIGCSE 2005: 556-557 - 2004
- [j17]David Ginat:
On Novice Loop Boundaries and Range Conceptions. Comput. Sci. Educ. 14(3): 165-181 (2004) - [j16]Vicki L. Almstrum, Orit Hazzan, David Ginat:
Special Issue on Import/Export Relationships to Computer Science Education Research. Comput. Sci. Educ. 14(4): 251-256 (2004) - [j15]David Ginat:
On the verge of an empty tank. ACM SIGCSE Bull. 36(2): 24-26 (2004) - [j14]David Ginat:
Algorithmic patterns and the case of the sliding delta. ACM SIGCSE Bull. 36(2): 29-33 (2004) - [j13]David Ginat:
Helipad. ACM SIGCSE Bull. 36(4): 25-26 (2004) - [c21]David Ginat:
Helipad. ITiCSE-WGR 2004: 25-26 - [c20]David Ginat:
Embedding instructive assertions in program design. ITiCSE 2004: 62-66 - [c19]David Ginat:
Do senior CS students capitalize on recursion? ITiCSE 2004: 82-86 - [c18]David Ginat, Owen L. Astrachan, Daniel D. Garcia, Mark Guzdial:
"But it looks right!": the bugs students don't see. SIGCSE 2004: 284-285 - 2003
- [j12]David Ginat:
Seeking or Skipping Regularities? Novice Tendencies and the Role of Invariants. Informatics Educ. 2(2): 211-222 (2003) - [j11]David Ginat:
Sorting and disorders. ACM SIGCSE Bull. 35(2): 29-30 (2003) - [j10]David Ginat:
Board reconstruction. ACM SIGCSE Bull. 35(4): 25-26 (2003) - [c17]David Ginat:
The novice programmers' syndrome of design-by-keyword. ITiCSE 2003: 154-157 - [c16]David Ginat:
The greedy trap and learning from mistakes. SIGCSE 2003: 11-15 - [c15]Daniel D. Garcia, David Ginat, Peter B. Henderson:
Everything you always wanted to know about game theory: but were afraid to ask. SIGCSE 2003: 96-97 - [c14]Vicki L. Almstrum, David Ginat, Orit Hazzan, John M. Clement:
Transfer to/from computing science education: the case of science education research. SIGCSE 2003: 303-304 - 2002
- [j9]David Ginat:
Effective binary perspectives in algorithmic problem solving. ACM J. Educ. Resour. Comput. 2(2): 4 (2002) - [j8]David Ginat:
Divisor games. ACM SIGCSE Bull. 34(4): 28-29 (2002) - [c13]Vicki L. Almstrum, David Ginat, Orit Hazzan, Tom Morley:
Import and export to/from computing science education: the case of mathematics education research. ITiCSE 2002: 193-194 - [c12]David Ginat, Daniel D. Garcia, William I. Gasarch:
Aha! an illuminating perspective. SIGCSE 2002: 1-2 - [c11]David Ginat:
On varying perspectives of problem decomposition. SIGCSE 2002: 331-335 - 2001
- [j7]David Ginat:
Early Algorithm Efficiency with Design Patterns. Comput. Sci. Educ. 11(2): 89-109 (2001) - [j6]David Ginat:
Color conversion. ACM SIGCSE Bull. 33(2): 20-21 (2001) - [j5]David Ginat:
Chain of permutations. ACM SIGCSE Bull. 33(4): 20-21 (2001) - [j4]David Ginat:
Starting top-down, refining bottom-up, sharpening by zoom-in. ACM SIGCSE Bull. 33(4): 28-31 (2001) - [j3]Peter B. Henderson, Doug Baldwin, Venu Dasigi, Marcel Dupras, Jane Fritz, David Ginat, Don Goelman, John Hamer, Lewis E. Hitchner, Will Lloyd, Bill Marion, Charles Riedesel, Henry MacKay Walker:
Striving for mathematical thinking. ACM SIGCSE Bull. 33(4): 114-124 (2001) - [c10]David Ginat:
Metacognitive awareness utilized for learning control elements in algorithmic problem solving. ITiCSE 2001: 81-84 - [c9]David Ginat:
Misleading intuition in algorithmic problem solving. SIGCSE 2001: 21-25 - [c8]David Ginat, Daniel D. Garcia, Owen L. Astrachan, Joseph Bergin:
Colorful illustrations of algorithmic design techniques and problem solving. SIGCSE 2001: 425-426 - 2000
- [j2]David Ginat:
Placement calculations. ACM SIGCSE Bull. 32(4): 20-21 (2000) - [c7]David Ginat:
Colorful examples for elaborating exploration of regularities in high-school CS1. ITiCSE 2000: 81-84
1990 – 1999
- 1999
- [c6]Bruria Haberman, David Ginat:
Distance learning model with local workshop sessions applied to in-service teacher training. ITiCSE 1999: 64-67 - [c5]David Ginat, Eyal Shifroni:
Teaching recursion in a procedural environment -- how much should we emphasize the computing model? SIGCSE 1999: 127-131 - 1997
- [c4]Eyal Shifroni, David Ginat:
Simulation game for teaching communications protocols. SIGCSE 1997: 184-188 - 1996
- [c3]David Ginat:
Efficiency of algorithms for programming beginners. SIGCSE 1996: 256-260 - 1995
- [c2]David Ginat:
Loop invariants and mathematical games. SIGCSE 1995: 263-267
1980 – 1989
- 1989
- [j1]David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan:
A Tight Amortized Bound for Path Reversal. Inf. Process. Lett. 31(1): 3-5 (1989) - [c1]David Ginat, A. Udaya Shankar, Ashok K. Agrawala:
An Efficient Solution to the Drinking Philosophers Problem and Its Extension. WDAG 1989: 83-93
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-08-05 21:13 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:
