Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul K. Stockmeyer
Person information
- affiliation: College of William and Mary, Williamsburg, VA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j12]Thierry Bousch, Andreas M. Hinz, Sandi Klavzar, Daniele Parisse, Ciril Petr, Paul K. Stockmeyer:
A note on the Frame-Stewart conjecture. Discret. Math. Algorithms Appl. 11(4): 1950049:1-1950049:4 (2019)- 2009
- [j11]Paul K. Stockmeyer:
Erratum to: "The falsity of the reconstruction conjecture for tournaments". J. Graph Theory 62(2): 199-200 (2009) - 2004
- [j10]David C. Banks, Stephen A. Linton, Paul K. Stockmeyer:
Counting Cases in Substitope Algorithms. IEEE Trans. Vis. Comput. Graph. 10(4): 371-384 (2004) - 2000
- [j9]Emeric Deutsch, Harris Kwong, Cecil C. Rousseau, Paul K. Stockmeyer:
A Formula for the Pell Sequence: 10663. Am. Math. Mon. 107(4): 370-371 (2000) - 1995
- [j8]Paul K. Stockmeyer, C. Douglass Bateman, James W. Clark, Cyrus R. Eyster, Matthew T. Harrison, Nicholas A. Loehr, Patrick J. Rodriguez, Joseph R. Simmons III:
Exchanging disks in the tower of hanoi. Int. J. Comput. Math. 59(1-2): 37-47 (1995) - 1991
- [j7]Bennet Manvel, Aaron Meyerowitz, Allen J. Schwenk, K. Smith, Paul K. Stockmeyer:
Reconstruction of sequences. Discret. Math. 94(3): 209-219 (1991) - 1981
- [j6]Paul K. Stockmeyer:
A census of non-reconstructable digraphs, I: Six related families. J. Comb. Theory, Ser. B 31(2): 232-239 (1981) - [j5]Robert J. Kimble Jr., Allen J. Schwenk, Paul K. Stockmeyer:
Pseudosimilar vertices in a graph. J. Graph Theory 5(2): 171-181 (1981) - 1980
- [j4]Paul K. Stockmeyer, F. Frances Yao:
On the Optimality of Linear Merge. SIAM J. Comput. 9(1): 85-90 (1980) - 1977
- [j3]Paul K. Stockmeyer:
The falsity of the reconstruction conjecture for tournaments. J. Graph Theory 1(1): 19-25 (1977) - 1976
- [j2]Norman E. Gibbs, William G. Poole Jr., Paul K. Stockmeyer:
A Comparison of Several Bandwidth and Profile Reduction Algorithms. ACM Trans. Math. Softw. 2(4): 322-330 (1976) - [j1]H. L. Crane Jr., Norman E. Gibbs, William G. Poole Jr., Paul K. Stockmeyer:
Algorithm 508: Matrix Bandwidth and Profile Reduction [F1]. ACM Trans. Math. Softw. 2(4): 375-377 (1976)
Parts in Books or Collections
- 2009
- [p2]David C. Banks, Paul K. Stockmeyer:
DeBruijn Counting for Visualization Algorithms. Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration 2009: 69-88 - 2003
- [p1]Mark Watkins, Brian Alspach, Paul K. Stockmeyer, Krishnaiyan Thulasirarnan, Michael Doob, James G. Oxley:
Algebraic Graph Theory. Handbook of Graph Theory 2003: 484-609
Reference Works
- 1999
- [r2]Lowell W. Beineke, Stephen B. Maurer, Edward R. Scheinerman, Bennet Manvel, Arthur T. White, Paul K. Stockmeyer, Michael Doob, Stefan A. Burr, András Gyárfás:
Graph Theory. Handbook of Discrete and Combinatorial Mathematics 1999 - [r1]Lisa Carbone, Uri N. Peled, Paul K. Stockmeyer:
Trees. Handbook of Discrete and Combinatorial Mathematics 1999
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 01:22 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:
