


default search action
Thomas P. Murtagh
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [c14]Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh:
Introducing concurrency in CS 1. SIGCSE 2010: 224-228 - [c13]Nick Parlante, Julie Zelenski, Zachary Dodds, Wynn Vonnegut, David J. Malan, Thomas P. Murtagh, Todd W. Neller, Mark Sherriff, Daniel Zingaro:
Nifty assignments. SIGCSE 2010: 478-479
2000 – 2009
- 2009
- [c12]Nick Parlante, Thomas P. Murtagh, Mehran Sahami, Owen L. Astrachan, David Reed, Christopher A. Stone
, Brent Heeringa, Karen L. Reid:
Nifty assignments. SIGCSE 2009: 483-484 - 2007
- [c11]Thomas P. Murtagh:
Weaving CS into CS1: a doubly depth-first approach. SIGCSE 2007: 336-340 - [c10]Thomas P. Murtagh:
Squint: barely visible library support for CS1. SIGCSE 2007: 526-530 - 2005
- [c9]Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh:
Why structural recursion should be taught before arrays in CS 1. SIGCSE 2005: 246-250 - 2001
- [c8]Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh:
Event-driven programming is simple enough for CS1. ITiCSE 2001: 1-4 - [c7]Thomas P. Murtagh:
Teacing breadth-first depth-first. ITiCSE 2001: 37-40 - [c6]Kim B. Bruce, Andrea Pohoreckyj Danyluk, Thomas P. Murtagh:
A library to support a graphics-based object-first approach to CS 1. SIGCSE 2001: 6-10
1990 – 1999
- 1993
- [c5]Kim B. Bruce, Jonathan Crabtree, Thomas P. Murtagh, Robert van Gent, Allyn Dimock, Robert Muller:
Safe and Decidable Type Checking in an Object-Oriented Language. OOPSLA 1993: 29-46 - 1991
- [j3]Thomas P. Murtagh:
An Improved Storage Management Scheme for Block Structured Languages. ACM Trans. Program. Lang. Syst. 13(3): 372-398 (1991) - 1990
- [j2]Douglas Comer, Ralph E. Droms, Thomas P. Murtagh:
An Experimental Implementation of the Tilde Naming System. Comput. Syst. 3(4): 487-515 (1990)
1980 – 1989
- 1988
- [c4]Cristina Ruggieri, Thomas P. Murtagh:
Lifetime Analysis of Dynamically Allocated Objects. POPL 1988: 285-293 - 1987
- [j1]Thomas P. Murtagh:
Redundant Proofs of Non-Interference in Levin-Gries CSP Program Proofs. Acta Informatica 24(2): 145-156 (1987) - 1986
- [c3]Thomas P. Murtagh:
Eliminating Proofs of Non-interference from Levin-Gries CSP Program Proofs. ICDCS 1986: 494-499 - [c2]Douglas Comer, Thomas P. Murtagh:
The Tilde File Naming Scheme. ICDCS 1986: 509-514 - 1984
- [c1]Thomas P. Murtagh:
A Less Dynamic Memory Allocation Scheme for Algol-like Languages. POPL 1984: 283-289
Coauthor Index

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint