Harold Abelson
Affiliations: | Massachusetts Institute of Technology, Cambridge, MA, United States |
Google:
"Harold Abelson"Bio:
Parents
Sign in to add mentor| Dennis Sullivan | grad student | 1973 | MIT (MathTree) | |
| (Topologically Distinct Conjugate-Varieties with Finite Fundamental-Group.) | ||||
Children
Sign in to add trainee| Kurt VanLehn | grad student | 1983 | MIT (MathTree) |
| Mitchel Resnick | grad student | 1992 | MIT |
| Radhika Nagpal | grad student | 2001 | MIT |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Weitzner DJ, Abelson H, Berners-Lee T, et al. (2008) Information accountability Communications of the Acm. 51: 82-87 |
| Abelson H, Allen D, Coore D, et al. (2000) Amorphous computing Communications of the Acm. 43: 74-82 |
| Abelson H, Dybvig RK, Haynes CT, et al. (1991) Revised 4 report on the algorithmic language scheme Acm Sigplan Lisp Pointers. 1-55 |
| Abelson H, Berlin AA, Katzenelson J, et al. (1991) The Supercomputer Toolkit: A General Framework for Special- purpose Computing International Journal of High Speed Electronics and Systems. 3: 337-361 |
| Abelson H, Eisenberg M, Halfant M, et al. (1989) Intelligence in scientific computing Communications of the Acm. 32: 546-562 |
| Cline T, Abelson H, Harris W. (1989) Symbolic computing in engineering design Ai Edam Artificial Intelligence For Engineering Design, Analysis and Manufacturing. 3: 195-206 |
| Abelson H. (1989) The Bifurcation Interpreter: A Step Towards the Automatic Analysis of Dynamical Systems Computers & Mathematics With Applications. 20: 13-35 |
| diSessa AA, Abelson H. (1986) Boxer: A reconstructible computational medium Communications of the Acm. 29: 859-868 |
| Adams NI, Bartley DH, Brooks G, et al. (1986) Revised 3 report on the algorithmic language scheme Sigplan Notices. 21: 26-76 |
| Abelson H, Andreae P. (1980) Information transfer and area-time tradeoffs for VLSI multiplication Communications of the Acm. 23: 20-23 |