The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Ginat: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Ginat
    On Novices' Local Views of Algorithmic Characteristics. [Citation Graph (0, 0)][DBLP]
    ISSEP, 2006, pp:127-137 [Conf]
  2. Vicki L. Almstrum, David Ginat, Orit Hazzan, John M. Clement
    Transfer to/from computing science education: the case of science education research. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2003, pp:303-304 [Conf]
  3. Daniel D. Garcia, David Ginat, Peter Henderson
    Everything you always wanted to know about game theory: but were afraid to ask. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2003, pp:96-97 [Conf]
  4. David Ginat
    Misleading intuition in algorithmic problem solving. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2001, pp:21-25 [Conf]
  5. David Ginat
    On varying perspectives of problem decomposition. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2002, pp:331-335 [Conf]
  6. David Ginat
    The greedy trap and learning from mistakes. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2003, pp:11-15 [Conf]
  7. David Ginat
    Loop invariants and mathematical games. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1995, pp:263-267 [Conf]
  8. David Ginat
    Efficiency of algorithms for programming beginners. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1996, pp:256-260 [Conf]
  9. David Ginat, Owen L. Astrachan, Daniel D. Garcia, Mark Guzdial
    "But it looks right!": the bugs students don't see. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2004, pp:284-285 [Conf]
  10. David Ginat, Richard Anderson, Daniel D. Garcia, Richard Rasala
    Randomness and probability in the early CS courses. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2005, pp:556-557 [Conf]
  11. David Ginat, Daniel D. Garcia, Owen L. Astrachan, Joseph Bergin
    Colorful illustrations of algorithmic design techniques and problem solving. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2001, pp:425-426 [Conf]
  12. David Ginat, Daniel D. Garcia, William I. Gasarch
    Aha! an illuminating perspective. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2002, pp:1-2 [Conf]
  13. David Ginat, Eyal Shifroni
    Teaching recursion in a procedural environment -- how much should we emphasize the computing model? [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1999, pp:127-131 [Conf]
  14. Eyal Shifroni, David Ginat
    Simulation game for teaching communications protocols. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1997, pp:184-188 [Conf]
  15. David Ginat, Michal Armoni
    Reversing: an essential heuristic in program and proof design. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2006, pp:469-473 [Conf]
  16. David Ginat, A. Udaya Shankar, Ashok K. Agrawala
    An Efficient Solution to the Drinking Philosophers Problem and Its Extension. [Citation Graph (0, 0)][DBLP]
    WDAG, 1989, pp:83-93 [Conf]
  17. David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan
    A Tight Amortized Bound for Path Reversal. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:1, pp:3-5 [Journal]
  18. David Ginat
    Effective binary perspectives in algorithmic problem solving. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Educational Resources in Computing, 2002, v:2, n:2, pp:4- [Journal]
  19. Orna Muller, David Ginat, Bruria Haberman
    Pattern-oriented instruction and its influence on problem decomposition and solution construction. [Citation Graph (0, 0)][DBLP]
    ITiCSE, 2007, pp:151-155 [Conf]
  20. David Ginat
    Hasty design, futile patching and the elaboration of rigor. [Citation Graph (0, 0)][DBLP]
    ITiCSE, 2007, pp:161-165 [Conf]
  21. Bruria Haberman, Haim Averbuch, David Ginat
    Is it really an algorithm: the need for explicit discourse. [Citation Graph (0, 0)][DBLP]
    ITiCSE, 2005, pp:74-78 [Conf]

  22. Didactics of Introduction to Computer Science in High School. [Citation Graph (, )][DBLP]


  23. Impasse, Conflict, and Learning of CS Notions. [Citation Graph (, )][DBLP]


  24. Design Disciplines and Non-specific Transfer. [Citation Graph (, )][DBLP]


  25. Learning from wrong and creative algorithm design. [Citation Graph (, )][DBLP]


  26. The baffling CS notions of "as-if" and "don't-care". [Citation Graph (, )][DBLP]


  27. Do senior CS students capitalize on recursion? [Citation Graph (, )][DBLP]


  28. Embedding instructive assertions in program design. [Citation Graph (, )][DBLP]


  29. Import and export to/from computing science education: the case of mathematics education research. [Citation Graph (, )][DBLP]


  30. The novice programmers' syndrome of design-by-keyword. [Citation Graph (, )][DBLP]


  31. Metacognitive awareness utilized for learning control elements in algorithmic problem solving. [Citation Graph (, )][DBLP]


  32. Interleaved pattern composition and scaffolded learning. [Citation Graph (, )][DBLP]


  33. Colorful examples for elaborating exploration of regularities in high-school CS1. [Citation Graph (, )][DBLP]


  34. Distance learning model with local workshop sessions applied to in-service teacher training. [Citation Graph (, )][DBLP]


Search in 0.207secs, Finished in 0.209secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002