David Ginat

Affiliations:
  • Tel Aviv University, Israel


According to our database1, David Ginat authored at least 98 papers between 1989 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
COLORFUL CHALLENGES: Maximal partitions.
Inroads, 2021

Abstraction, Declarative Observations and Algorithmic Problem Solving.
Informatics Educ., 2021

2020
COLORFUL CHALLENGES: Widest inversion.
Inroads, 2020

COLORFUL CHALLENGESPermutation inversion.
Inroads, 2020

2019
COLORFUL CHALLENGES: Letter game.
Inroads, 2019

COLORFUL CHALLENGES: Fence leveling.
Inroads, 2019

2018
COLORFUL CHALLENGES: Reversing.
Inroads, 2018

COLORFUL CHALLENGES: Molecule collisions.
Inroads, 2018

2017
COLORFUL CHALLENGES: Row/column transformations II.
Inroads, 2017

COLORFUL CHALLENGES: Row/column transformations.
Inroads, 2017

Multiple Levels of Abstraction in Algorithmic Problem Solving.
Proceedings of the 2017 ACM SIGCSE Technical Symposium on Computer Science Education, 2017

2016
COLORFUL CHALLENGES: Linear cat & mouse game.
Inroads, 2016

COLORFUL CHALLENGES: Magic swaps.
Inroads, 2016

Demystifying Computing with Magic, part III.
Proceedings of the 47th ACM Technical Symposium on Computing Science Education, 2016

2015
Intersecting lines.
Inroads, 2015

Getting the golden coin.
Inroads, 2015

SOLO Taxonomy for Assessing Novices' Algorithmic Design.
Proceedings of the 46th ACM Technical Symposium on Computer Science Education, 2015

2014
No arithmetic progression.
Inroads, 2014

Longest sum modulo-3.
Inroads, 2014

2013
Tuple transformation.
Inroads, 2013

Proving lower bound.
Inroads, 2013

Constructive use of errors in teaching CS1.
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Demystifying computing with magic, continued.
Proceedings of the 44th ACM Technical Symposium on Computer Science Education, 2013

Novice Difficulties with Interleaved Pattern Composition.
Proceedings of the Informatics in Schools. Sustainable Informatics Education for Pupils of all Ages, 2013

2012
Rectangle cover.
Inroads, 2012

Chains and edges.
Inroads, 2012

DeMystifying computing with magic.
Proceedings of the 43rd ACM technical symposium on Computer science education, 2012

Fuzzy OOP: expanded and reduced term interpretations.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

Pseudo abstract composition: the case of language concatenation.
Proceedings of the Annual Conference on Innovation and Technology in Computer Science Education, 2012

2011
Powers-of-2 game.
Inroads, 2011

Cards shuffle.
Inroads, 2011

Transfer, Cognitive Load, and Program Design Difficulties.
Proceedings of the Informatics in Schools. Contributing to 21st Century Education, 2011

2010
Finish line.
Inroads, 2010

Bean transfers.
Inroads, 2010

The baffling CS notions of "as-if" and "don't-care".
Proceedings of the 41st ACM technical symposium on Computer science education, 2010

Impasse, Conflict, and Learning of CS Notions.
Proceedings of the Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools, 2010

Didactics of Introduction to Computer Science in High School.
Proceedings of the Teaching Fundamentals Concepts of Informatics, 4th International Conference on Informatics in Secondary Schools, 2010

2009
On the non-modular design of on-the-fly computations.
ACM SIGCSE Bull., 2009

Colorful challenges: The lengthy 0-1.
ACM SIGCSE Bull., 2009

Colorful Challenges: chips game.
ACM SIGCSE Bull., 2009

The Overlooked Don't-Care Notion in Algorithmic Problem Solving.
Informatics Educ., 2009

Interleaved pattern composition and scaffolded learning.
Proceedings of the 14th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2009

2008
Colorful challenges: Kangaroo hops.
ACM SIGCSE Bull., 2008

Separating between foes.
ACM SIGCSE Bull., 2008

The Unfortunate Novice Theme of Direct Transformation.
Informatics Educ., 2008

Reversing: a fundamental idea in computer science.
Comput. Sci. Educ., 2008

Learning from wrong and creative algorithm design.
Proceedings of the 39th SIGCSE Technical Symposium on Computer Science Education, 2008

Design Disciplines and Non-specific Transfer.
Proceedings of the Informatics Education - Supporting Computational Thinking, Third International Conference on Informatics in Secondary Schools, 2008

2007
Elaborating heuristic reasoning and rigor with mathematical games.
ACM SIGCSE Bull., 2007

Alternating accumulation.
ACM SIGCSE Bull., 2007

Domino arrangements.
ACM SIGCSE Bull., 2007

Pattern-oriented instruction and its influence on problem decomposition and solution construction.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

Hasty design, futile patching and the elaboration of rigor.
Proceedings of the 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2007

2006
Hidden squares.
ACM SIGCSE Bull., 2006

Graph cycles.
ACM SIGCSE Bull., 2006

Reversing: an essential heuristic in program and proof design.
Proceedings of the 37th SIGCSE Technical Symposium on Computer Science Education, 2006

On Novices' Local Views of Algorithmic Characteristics.
Proceedings of the Informatics Education - The Bridge between Using and Understanding Computers, International Conference in Informatics in Secondary Schools, 2006

2005
Queens on a chessboard.
ACM SIGCSE Bull., 2005

Tuple enumeration.
ACM SIGCSE Bull., 2005

Randomness and probability in the early CS courses.
Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

Is it really an algorithm: the need for explicit discourse.
Proceedings of the 10th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2005

2004
Helipad.
ACM SIGCSE Bull., 2004

Algorithmic patterns and the case of the sliding delta.
ACM SIGCSE Bull., 2004

On the verge of an empty tank.
ACM SIGCSE Bull., 2004

On Novice Loop Boundaries and Range Conceptions.
Comput. Sci. Educ., 2004

Special Issue on Import/Export Relationships to Computer Science Education Research.
Comput. Sci. Educ., 2004

"But it looks right!": the bugs students don't see.
Proceedings of the 35th SIGCSE Technical Symposium on Computer Science Education, 2004

Do senior CS students capitalize on recursion?
Proceedings of the 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2004

Embedding instructive assertions in program design.
Proceedings of the 9th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2004

2003
Board reconstruction.
ACM SIGCSE Bull., 2003

Sorting and disorders.
ACM SIGCSE Bull., 2003

Seeking or Skipping Regularities? Novice Tendencies and the Role of Invariants.
Informatics Educ., 2003

The greedy trap and learning from mistakes.
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

Everything you always wanted to know about game theory: but were afraid to ask.
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

Transfer to/from computing science education: the case of science education research.
Proceedings of the 34th SIGCSE Technical Symposium on Computer Science Education, 2003

The novice programmers' syndrome of design-by-keyword.
Proceedings of the 8th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2003

2002
Divisor games.
ACM SIGCSE Bull., 2002

Effective binary perspectives in algorithmic problem solving.
ACM J. Educ. Resour. Comput., 2002

Aha! an illuminating perspective.
Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

On varying perspectives of problem decomposition.
Proceedings of the 33rd SIGCSE Technical Symposium on Computer Science Education, 2002

Import and export to/from computing science education: the case of mathematics education research.
Proceedings of the 7th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2002

2001
Striving for mathematical thinking.
ACM SIGCSE Bull., 2001

Starting top-down, refining bottom-up, sharpening by zoom-in.
ACM SIGCSE Bull., 2001

Chain of permutations.
ACM SIGCSE Bull., 2001

Color conversion.
ACM SIGCSE Bull., 2001

Early Algorithm Efficiency with Design Patterns.
Comput. Sci. Educ., 2001

Colorful illustrations of algorithmic design techniques and problem solving.
Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

Misleading intuition in algorithmic problem solving.
Proceedings of the 32rd SIGCSE Technical Symposium on Computer Science Education, 2001

Metacognitive awareness utilized for learning control elements in algorithmic problem solving.
Proceedings of the 6th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2001

2000
Placement calculations.
ACM SIGCSE Bull., 2000

Colorful examples for elaborating exploration of regularities in high-school CS1.
Proceedings of the 5th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2000

1999
Teaching recursion in a procedural environment -- how much should we emphasize the computing model?
Proceedings of the 30th SIGCSE Technical Symposium on Computer Science Education, 1999

Distance learning model with local workshop sessions applied to in-service teacher training.
Proceedings of the 4th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 1999

1997
Simulation game for teaching communications protocols.
Proceedings of the 28th SIGCSE Technical Symposium on Computer Science Education, 1997

1996
Efficiency of algorithms for programming beginners.
Proceedings of the 27th SIGCSE Technical Symposium on Computer Science Education, 1996

1995
Loop invariants and mathematical games.
Proceedings of the 26th SIGCSE Technical Symposium on Computer Science Education, 1995

1989
A Tight Amortized Bound for Path Reversal.
Inf. Process. Lett., 1989

An Efficient Solution to the Drinking Philosophers Problem and Its Extension.
Proceedings of the Distributed Algorithms, 1989


  Loading...