default search action
William J. Collins
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Justin Xu, Zhihong Chen, Andrew Johnston, Louis Blankemeier, Maya Varma, Jason Hom, William J. Collins, Ankit Modi, Robert Lloyd, Benjamin Hopkins, Curtis P. Langlotz, Jean-Benoit Delbrouck:
Overview of the First Shared Task on Clinical Text Generation: RRG24 and "Discharge Me!". BioNLP@ACL 2024: 85-98 - [i1]Justin Xu, Zhihong Chen, Andrew Johnston, Louis Blankemeier, Maya Varma, Jason Hom, William J. Collins, Ankit Modi, Robert Lloyd, Benjamin Hopkins, Curtis P. Langlotz, Jean-Benoit Delbrouck:
Overview of the First Shared Task on Clinical Text Generation: RRG24 and "D$ischarge Me!". CoRR abs/2409.16603 (2024)
2000 – 2009
- 2007
- [c9]Jeffrey O. Pfaffmann, William J. Collins:
Teaching Artificial Intelligence across the Computer Science Curriculum Using Sudoku as a Problem Domain. FLAIRS 2007: 327-332 - 2003
- [c8]William J. Collins, Josh Tenenberg, Raymond Lister, Suzanne Westbrook:
The role for framework libraries in CS2. SIGCSE 2003: 403-404
1990 – 1999
- 1999
- [c7]William J. Collins, Yi Sun:
Web labs for the Standard Template Library and the Java generic library in a CS2 course. SIGCSE 1999: 174-178 - 1993
- [j7]William J. Collins:
An Object-Oriented CS2 Course. Comput. Sci. Educ. 4(1): 77-85 (1993) - 1992
- [b1]William J. Collins:
Data structures - an object-oriented approach. Addison-Wesley 1992, ISBN 978-0-201-56953-7, pp. I-XVII, 1-624 - [j6]William J. Collins, Gabriel T. Gagliano:
The Use of Turbo Vision in a Course on Object-Oriented Programming. Comput. Sci. Educ. 3(1): 53-61 (1992) - [j5]William J. Collins, T'seliso E. Mosiuoa:
How Good Sorts Go Bad. Comput. Sci. Educ. 3(3): 277-283 (1992) - [c6]William J. Collins:
Verification and testing in an object-oriented CS2 course. OOPSLA Addendum 1992: 285-288 - 1991
- [c5]William J. Collins:
Estimating execution times: a laboratory exercise for CS2. SIGCSE 1991: 358-363 - 1990
- [c4]Thomas C. McMillan, William J. Collins:
Implementing abstract data types in Turbo Pascal. SIGCSE 1990: 134-138
1980 – 1989
- 1989
- [c3]William J. Collins:
An extension to the external path length theorem. ACM Conference on Computer Science 1989: 407 - [c2]Thomas C. McMillan, William J. Collins:
A recurrence relation in uniform hashing. ACM Conference on Computer Science 1989: 410 - 1988
- [c1]William J. Collins:
The trouble with for-loop invariants. SIGCSE 1988: 1-4 - 1984
- [j4]William J. Collins:
Solution trees in the program design process. ACM SIGCSE Bull. 16(2): 51-55 (1984) - 1983
- [j3]William J. Collins, Paul Young:
Discontinuities of Provably Correct Operators on the Provably Recursive Real Numbers. J. Symb. Log. 48(4): 913-920 (1983)
1970 – 1979
- 1979
- [j2]William J. Collins:
A data-oriented introduction to program design. ACM SIGCSE Bull. 11(4): 49-55 (1979) - 1978
- [j1]William J. Collins:
Provably recursive real numbers. Notre Dame J. Formal Log. 19(4): 513-522 (1978)
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-10-18 19:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint