The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Owen L. Astrachan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Owen L. Astrachan, Donald W. Loveland
    METEORs: High Performance Theorem Provers Using Model Elimination. [Citation Graph (0, 0)][DBLP]
    Automated Reasoning: Essays in Honor of Woody Bledsoe, 1991, pp:31-60 [Conf]
  2. Owen L. Astrachan, Mark E. Stickel
    Caching and Lemmaizing in Model Elimination Theorem Provers. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:224-238 [Conf]
  3. Owen L. Astrachan
    METEORs: High Performance Theorem Provers Using Model Elimination. [Citation Graph (0, 0)][DBLP]
    Dagstuhl Seminar on Parallelization in Inference Systems, 1990, pp:353- [Conf]
  4. Owen L. Astrachan, Kim B. Bruce, Elliot B. Koffman, Michael Kölling, Stuart Reges
    Resolved: objects early has failed. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2005, pp:451-452 [Conf]
  5. Owen L. Astrachan, Robert Cartwight, Rich Kick, Cay S. Horstmann, Fran Trees, Gail Chapman, David Gries, Henry Walker, Ursula Wolz
    Recommendations for changes in advanced placement computer science (panel session). [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2000, pp:416- [Conf]
  6. Owen L. Astrachan, W. Garrett Mitchener, Geoffrey Berry, Landon P. Cox
    Design patterns: an essential component of CS curricula. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:153-160 [Conf]
  7. Owen L. Astrachan, David Reed
    AAA and CS 1: the applied apprenticeship approach to CS 1. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1995, pp:1-5 [Conf]
  8. Owen L. Astrachan, Susan H. Rodger
    Animation, visualization, and interaction in CS 1 assignments. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:317-321 [Conf]
  9. Owen L. Astrachan, Robert F. Smith, James T. Wilkes
    Application-based modules using apprentice learning for CS 2. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1997, pp:233-237 [Conf]
  10. Owen L. Astrachan
    Using classes early, an object-based approach to using C++ in introductory courses (seminar). [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:383- [Conf]
  11. David Arnow, Owen L. Astrachan, James D. Kiper, Robert Workman, Paula A. Whitlock, Brent Auernheimer, John E. Rager
    Themes and tapestries: a diversity of approaches to computer science for liberal arts students. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1994, pp:374-375 [Conf]
  12. Owen L. Astrachan
    OO overkill: when simple is better than not. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2001, pp:302-306 [Conf]
  13. Owen L. Astrachan
    Bubble sort: an archaeological algorithmic analysis. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2003, pp:1-5 [Conf]
  14. Owen L. Astrachan
    Why i care about programming and how to teach it. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2004, pp:235- [Conf]
  15. Owen L. Astrachan
    Pictures as invariants. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1991, pp:112-118 [Conf]
  16. Owen L. Astrachan
    On finding a stable roommate, job, or spouse: a case study crossing the boundaries of computer science courses. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1992, pp:107-112 [Conf]
  17. Owen L. Astrachan
    Self-reference is an illustrative essential. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1994, pp:238-242 [Conf]
  18. Gail Chapman, Sarah Fix, Owen L. Astrachan, Joseph W. Kmoch, Michael J. Clancy
    Case studies in the advanced placement computer science curriculum (abstract). [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1994, pp:371- [Conf]
  19. 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]
  20. 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]
  21. Stuart Hirshfield, Owen L. Astrachan, John Barr, Karen Donnelly, David Levine, Mark McGinn
    Object-oriented programming (abstract): how to "scale up" CS 1. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1994, pp:396- [Conf]
  22. Vivek Khera, Owen L. Astrachan, David Kotz
    The internet programming contest: a report and philosophy. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1993, pp:48-52 [Conf]
  23. Daniel D. McCracken, A. Michael Berman, Ursula Wolz, Owen L. Astrachan, Nell B. Dale
    Possible futures for CS2 (panel). [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1998, pp:357-358 [Conf]
  24. Nick Parlante, Owen L. Astrachan, Michael J. Clancy, Richard E. Pattis, Julie Zelenski, Stuart Reges
    Nifty assignments panel. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1999, pp:354-355 [Conf]
  25. Nick Parlante, Michael J. Clancy, Stuart Reges, Julie Zelenski, Owen L. Astrachan
    Nifty assignments panel. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2001, pp:412-413 [Conf]
  26. Charles M. Shub, Owen L. Astrachan, David B. Levine, Stuart Reges, Henry Walker
    Faster, fairer, and more consistent grading, using techniques from the Advanced Placement reading (panel session). [Citation Graph (0, 0)][DBLP]
    SIGCSE, 1990, pp:266- [Conf]
  27. Owen L. Astrachan, Nick Parlante, Daniel D. Garcia, Stuart Reges
    Teaching tips we wish they'd told us before we started. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2007, pp:2-3 [Conf]
  28. Casey Alt, Owen L. Astrachan, Jeffrey Forbes, Richard Lucic, Susan Rodger
    Social networks generate interest in computer science. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2006, pp:438-442 [Conf]
  29. Owen L. Astrachan
    Education Goals and Priorities. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:4es, pp:92- [Journal]
  30. Owen L. Astrachan
    Meteor: Exploring Model Elimination Theorem Proving. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1994, v:13, n:3, pp:283-296 [Journal]
  31. Owen L. Astrachan, Donald W. Loveland
    The Use of Lemmas in the Model Elimination Procedure. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1997, v:19, n:1, pp:117-141 [Journal]

  32. Innovating our self image. [Citation Graph (, )][DBLP]


  33. Advanced placement computer science: the future of tracking the first year of instruction. [Citation Graph (, )][DBLP]


  34. Pander to ponder. [Citation Graph (, )][DBLP]


  35. The present and future of computational thinking. [Citation Graph (, )][DBLP]


  36. Nifty assignments. [Citation Graph (, )][DBLP]


  37. Re-imagining the first year of computing. [Citation Graph (, )][DBLP]


  38. Has our curriculum become math-phobic? (an American perspective). [Citation Graph (, )][DBLP]


  39. Concrete teaching: hooks and props as instructional technology. [Citation Graph (, )][DBLP]


  40. Point/counterpoint - CS education in the U.S.: heading in the wrong direction? [Citation Graph (, )][DBLP]


  41. CS education in the U.S.: heading in the wrong direction. [Citation Graph (, )][DBLP]


Search in 0.137secs, Finished in 0.139secs
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