default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTom P. Whaley
Refine list
refinements active!
zoomed in on 12 of 12 records
view refined list in
export refined list as
refine by search term
refine by type
- |
- no options
- temporarily not available
refine by coauthor
- no options
- temporarily not available
refine by orcid
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by access 
- no options
- temporarily not available
2000 – 2009
- 2006
[j9]Tom P. Whaley:
Using a blog for enrichment readings in CSO. J. Comput. Sci. Coll. 22(2): 203-205 (2006)- 2002
- [j8]Wayne M. Dymàcek, Matthew Koerlin, Jean-Guy Speton, Tom P. Whaley, Jennifer Yanulavich:
Disconnected Complements of Steinhaus graphs. Electron. Notes Discret. Math. 11: 218-232 (2002) - [j7]Tom P. Whaley, Frank A. Settle, Elizabeth R. Blackmer:
Undergraduate participation in the development of the Alsos digital library for nuclear issues. J. Comput. Sci. Coll. 18(2): 131-137 (2002) - 2000
- [j6]Tom P. Whaley:
Adding web access to database projects - a simple approach. J. Comput. Sci. Coll. 15(5): 4-5 (2000) - no results
1990 – 1999
- 1999
- [j5]Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer
, Matthew Koerlin, Yueh-Shin Lee, Tom P. Whaley:
Characterizations of bipartite Steinhaus graphs. Discret. Math. 199(1-3): 11-25 (1999) - 1998
- [c3]Tom P. Whaley, Anurag Chandra, Noah Egorin, Wayne M. Dymàcek:
Parallel searches for hereditary node properties in binary trees. ACM Southeast Regional Conference 1998: 280-282 - 1995
- [j4]Wayne M. Dymàcek, Tom P. Whaley:
Generating strings for bipartite Steinhaus graphs. Discret. Math. 141(1-3): 95-107 (1995) - 1994
- [c2]Henry MacKay Walker, Kim B. Bruce, James Bradley, Tom P. Whaley:
Describing the CS forest to undergraduates (abstract). SIGCSE 1994: 369-370 - 1992
- [j3]Tom P. Whaley:
A Case Study in ADT Implementation Verification. Comput. Sci. Educ. 3(2): 189-202 (1992) - [j2]Tom P. Whaley:
Alternative Developments of Cyclic-Permutation Algorithms. Inf. Process. Lett. 41(5): 239-241 (1992) - 1991
- [j1]Thomas P. Whaley:
Postorder Trees and Eulerian Numbers. Acta Informatica 28(7): 703-712 (1991) - [c1]Tom P. Whaley:
A framework for program verification in the context of linked structures and pointer variables. SIGCSE 1991: 119-123 - no results
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.
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.
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.
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-05-14 23:10 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:
