Person:1074590: Difference between revisions

From MaRDI portal
Person:1074590
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Herbert S. Shank to Herbert S. Shank: Duplicate
 
(No difference)

Latest revision as of 10:06, 13 December 2023

Available identifiers

zbMath Open shank.herbert-sMaRDI QIDQ1074590

List of research outcomes





PublicationDate of PublicationType
Defining Bernoulli Polynomials in Z/pZ (A Generic Regularity Condition)1990-01-01Paper
The Gauss code problem off the plane1987-01-01Paper
Edge‐disjoint spanning trees: A connectedness theorem1985-01-01Paper
The cycle space of an embedded graph1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808531984-01-01Paper
Clique coverings of graphs V: maximal-clique partitions1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39330101981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505731981-01-01Paper
The rational case of a matrix problem of Harrison1979-01-01Paper
Full 4-colorings of 4-regular maps1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38724841979-01-01Paper
Analogs of Bernoulli polynomials in fields \(\mathbb{Z}_p\)1976-01-01Paper
On the functional equation \(f(x)=\sum^{k-1}_{j=0}f((x+j)/k)\) over finite rings.1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40631821975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40749261975-01-01Paper
On the undecidability of finite planar cubic graphs1972-01-01Paper
Records of turing machines1971-01-01Paper
Graph property recognition machines1971-01-01Paper
On the undecidability of finite planar graphs1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55747121970-01-01Paper
Two memory bounds for the recognition of primes by automata1969-01-01Paper
Two memory bounds for the recognition of primes by automata1969-01-01Paper
On the Recognition of Primes by Automata1968-01-01Paper
An Algebraic Proof of Kirchhoff's Network Theorem1961-01-01Paper

Research outcomes over time

This page was built for person: Herbert S. Shank