dblp.uni-trier.dewww.uni-trier.de

Michal Armoni

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
12EEShimon Schocken, Noam Nisan, Michal Armoni: A synthesis course in hardware architecture, compilers, and software engineering. SIGCSE 2009: 443-447
11EEMichal Armoni: Reduction in CS: A (Mostly) Quantitative Analysis of Reductive Solutions to Algorithmic Problems. ACM Journal of Educational Resources in Computing 8(4): (2009)
2008
10EEMichal Armoni: Reductive thinking in a quantitative perspective: the case of the algorithm course. ITiCSE 2008: 53-57
9EEMichal Armoni, Noa Lewenstein, Mordechai Ben-Ari: Teaching students to think nondeterministically. SIGCSE 2008: 4-8
2006
8EEMichal Armoni, Judith Gal-Ezer, Orit Hazzan: Reductive thinking in undergraduate CS courses. ITiCSE 2006: 133-137
7EEMichal Armoni, S. Rodger, Moshe Y. Vardi, R. Verma: Automata theory: its relevance to computer science students and course contents. SIGCSE 2006: 197-198
6EEMichal Armoni, Judith Gal-Ezer: Reduction -- an abstract thinking pattern: the case of the computational models course. SIGCSE 2006: 389-393
5EEDavid Ginat, Michal Armoni: Reversing: an essential heuristic in program and proof design. SIGCSE 2006: 469-473
4EEMichal Armoni: On the role of proofs in a course on design and analysis of algorithms. SIGCSE Bulletin 38(4): 39-42 (2006)
2005
3EEMichal Armoni, Judith Gal-Ezer: Reductive thinking in undergraduate CS courses. ITiCSE 2005: 362
2004
2EEMichal Armoni, Judith Gal-Ezer: On the achievements of high school students studying computational models. ITiCSE 2004: 17-21
1EEMichal Armoni: Reductive thinking: how to teach it? ITiCSE 2004: 280

Coauthor Index

1Mordechai Ben-Ari [9]
2Judith Gal-Ezer [2] [3] [6] [8]
3David Ginat [5]
4Orit Hazzan [8]
5Noa Lewenstein [9]
6Noam Nisan [12]
7S. Rodger [7]
8Shimon Schocken [12]
9Moshe Y. Vardi [7]
10R. Verma [7]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)