default search action
Martha J. Kosa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [c17]Mark A. Boshart, Martha J. Kosa:
Delegate, Decorate, State, and Illustrate in the OOP Course. ITiCSE 2015: 339 - 2014
- [c16]Martha J. Kosa, Ambareen Siraj:
The rising renaissance engineer spectrum awards (abstract only). SIGCSE 2014: 717-718 - 2012
- [c15]Ambareen Siraj, Martha J. Kosa, Summer-Mistine Olmstead:
Weaving a tapestry: creating a satellite workshop to support HS CS teachers in attracting and engaging students. SIGCSE 2012: 493-498
2000 – 2009
- 2007
- [j3]Xubin (Ben) He, Li Ou, Martha J. Kosa, Stephen L. Scott, Christian Engelmann
:
A unified multiple-level cache for high performance storage systems. Int. J. High Perform. Comput. Netw. 5(1/2): 97-109 (2007) - [c14]Jonathan Byrd, Monty Carter, David Cook, Philip Kirkham, Martha J. Kosa:
Solving recurring student problems with recurrences. ITiCSE 2007: 343 - 2005
- [c13]J. C. Ernest, A. S. Bowser, S. Ghule, S. Sudireddy, Jameson P. Porter, Douglas A. Talbert, Martha J. Kosa:
Weathering MindStorms with drizzle and DIODE in CS0. ITiCSE 2005: 353 - [c12]Li Ou, Xubin (Ben) He, Martha J. Kosa, Stephen L. Scott:
A Unified Multiple-Level Cache for High Performance Storage Systems. MASCOTS 2005: 143-152 - 2004
- [c11]Martha J. Kosa, Mark A. Boshart:
Treemap visualizations for CS2. ITiCSE 2004: 259 - 2003
- [c10]Mark A. Boshart, Martha J. Kosa:
Growing a GUI from an XML tree. ITiCSE 2003: 223 - 2002
- [c9]Jason N. Wyatt, Martha J. Kosa, Mark A. Boshart:
Implementing student ideas in CS2: a simple IDE. ITiCSE 2002: 224 - 2001
- [c8]Martha J. Kosa, Mark A. Boshart:
XML and browser development activities in CS2. ITiCSE 2001: 182 - 2000
- [j2]Soma Chaudhuri, Martha J. Kosa, Jennifer L. Welch:
One-write algorithms for multivalued regular and atomic registers. Acta Informatica 37(3): 161-192 (2000) - [c7]Martha J. Kosa:
Distributed algorithms in the discrete mathematics course (poster session). ITiCSE 2000: 189-190
1990 – 1999
- 1999
- [j1]Martha J. Kosa:
Time Bounds for Strong and Hybrid Consistency for Arbitrary Abstract Data Types. Chic. J. Theor. Comput. Sci. 1999 (1999) - [c6]Martha J. Kosa:
Beginners program Web page builders and verifiers. ITiCSE 1999: 185 - 1998
- [c5]Martha J. Kosa:
Wait-free lazy-writer registers with eager readers. ACM Southeast Regional Conference 1998: 274-276 - 1996
- [c4]Martha J. Kosa:
What Critical Algebraic Property Allows Operations of Concurrent Abstract Data Types to be Fast? (Brief Announement). PODC 1996: 244 - 1995
- [c3]Martha J. Kosa:
Lazy-Writer Multivalued Registers (Abstract). PODC 1995: 270 - 1994
- [c2]Martha J. Kosa:
Making Operations of Concurrent Data Types Fast. PODC 1994: 32-41 - 1991
- [c1]Soma Chaudhuri, Martha J. Kosa, Jennifer L. Welch:
Upper and lower bounds for one-write multivalued regular registers. SPDP 1991: 134-141
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 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: