Gustavus J. Simmons

From MaRDI portal
Person:697640

Available identifiers

zbMath Open simmons.gustavus-jDBLP12/4161WikidataQ381312 ScholiaQ381312MaRDI QIDQ697640

List of research outcomes





PublicationDate of PublicationType
The prisoners' problem and the subliminal channel2022-01-08Paper
Message authentication with arbitration of transmitter/receiver disputes2021-07-10Paper
https://portal.mardi4nfdi.de/entity/Q32955042020-07-10Paper
Two related (?) 2-edge-Hamiltonian bigraph conjectures. Addendum2020-07-10Paper
Non-cubic, edge-critical Hamilton laceable bigraphs with \(3m\) edges on \(2m\) vertices2019-11-19Paper
On edge extremal properties of Hamilton laceable bigraphs2017-10-06Paper
https://portal.mardi4nfdi.de/entity/Q29712452017-04-04Paper
https://portal.mardi4nfdi.de/entity/Q29660812017-03-06Paper
Cubic, edge critical, Hamilton laceable bigraphs.2016-10-26Paper
Linking rings and edge-critical Hamilton laceable cubic bigraphs2016-07-20Paper
A possible upper bound on the number of edges an edge-critical Hamilton-laceable bigraph can have2016-04-13Paper
The Hamilton path morphology of star-crossed graphs2016-04-13Paper
https://portal.mardi4nfdi.de/entity/Q29488182015-10-06Paper
A surprising regularity in the number of Hamilton paths in polygonal bigraphs.2015-08-26Paper
A paradoxical result concerning the Hamilton laceability of polygonal bigraphs2015-08-05Paper
Enumeration of Hamilton paths in ladders2015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q31891892014-09-09Paper
Graph avoidance in Hamilton laceable bipartite graphs2014-01-03Paper
Graph avoidance in Hamilton laceable bipartite graphs: a sequel2014-01-03Paper
Parity encoding of binary sequences2002-09-17Paper
A pretty, surprising, graph graft2001-06-19Paper
https://portal.mardi4nfdi.de/entity/Q45221072001-04-20Paper
https://portal.mardi4nfdi.de/entity/Q49347212000-01-31Paper
https://portal.mardi4nfdi.de/entity/Q49347202000-01-31Paper
https://portal.mardi4nfdi.de/entity/Q52840861997-05-19Paper
https://portal.mardi4nfdi.de/entity/Q48736751996-04-17Paper
https://portal.mardi4nfdi.de/entity/Q48537121995-11-02Paper
https://portal.mardi4nfdi.de/entity/Q42795761994-09-20Paper
Proof of soundness (integrity) of cryptographic protocols1994-08-17Paper
https://portal.mardi4nfdi.de/entity/Q40282471993-03-28Paper
A Cartesian product construction for unconditionally secure authentication codes that permit arbitration1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34808201990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34952311989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38243241988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37738211987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37894761987-01-01Paper
Cycle Structure of the DES for Keys Having Palindromic (or Antipalindromic) Sequences of Round Keys1987-01-01Paper
The Practice of Authentication1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37278591986-01-01Paper
Authentication Theory/Coding Theory1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37206561985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33479051985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37895861985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51873211984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33204131983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33256221983-01-01Paper
A “WEAK” PRIVACY PROTOCOL USING THE RSA CRYPTO ALGORITHM1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33439111983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33256231982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36633261982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36609541981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39490811981-01-01Paper
Maximal non- hamilton-laceable graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47498461981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39001011980-01-01Paper
Cryptology: The mathematics of secure communication1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38521971979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38583011979-01-01Paper
A Two-Coloring Inequality for Euclidean Two-Arrangements1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38807431979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41916281979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42000861978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41733891978-01-01Paper
On permutations containing no long arithmetic progressions1977-01-01Paper
How Many 3-Term Arithmetic Progressions Can There Be If There Are No Longer Ones?1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40988371976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40609801975-01-01Paper
Pair designs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40836931975-01-01Paper
On a problem of Erdős concerning a 3-coloring of the unit sphere1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655601974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q44035631974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56762461974-01-01Paper
Sums of valences in bigraphs1973-01-01Paper
A maximal 2-arrangement of sixteen lines in the projective plane1973-01-01Paper
Sums of valences in bigraphs. II1973-01-01Paper
Some properties of components of bigraphs1973-01-01Paper
A generalized converse to a lemma of L. Lovász1973-01-01Paper
Shorter Notes: A Quadrilateral-Free Arrangement of Sixteen Lines1972-01-01Paper
An extremal problem in the uniform covering of finite sets1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56553711972-01-01Paper
The Number of Irreducible Polynomials of Degree n Over GF ( p)1970-01-01Paper
Some Results Concerning the Occurrence of Specified Prime Factors in \binommr1970-01-01Paper
A constructive analysis of the aperiodic binary correlation function1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55714751968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56151961967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56018131964-01-01Paper
A Combinatorial Problem Associated with a Family of Combination Locks1964-01-01Paper

Research outcomes over time

This page was built for person: Gustavus J. Simmons