Stanislaw P. Radziszowski

Orcid: 0000-0002-1470-5517

Affiliations:
  • Rochester Institute of Technology, USA


According to our database1, Stanislaw P. Radziszowski authored at least 66 papers between 1986 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On Some Generalized Vertex Folkman Numbers.
Graphs Comb., June, 2023

Power Analysis Attacks on the Customizable MK-3 Authenticated Encryption Algorithm.
Proceedings of the 30th International Conference on Mixed Design of Integrated Circuits and System, 2023

The Complexity of (P<sub>k,</sub> P<sub>ℓ</sub> )-Arrowing.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022
Memory Protection with Dynamic Authentication Trees.
Proceedings of the 29th International Conference on Mixed Design of Integrated Circuits and System, 2022

Statistical Analysis of the MK-3 Customizable Authenticated Encryption.
Proceedings of the IEEE Military Communications Conference, 2022

2021
Star-critical Ramsey numbers for cycles versus <i>K<sub>4</sub></i>.
Discuss. Math. Graph Theory, 2021

Hardware Obfuscation of the 16-bit S-box in the MK-3 Cipher.
Proceedings of the 2021 28th International Conference on Mixed Design of Integrated Circuits and System, 2021

Solving the Cross Domain Problem with Functional Encryption.
Proceedings of the 2021 IEEE Military Communications Conference, 2021

2020
Chromatic Vertex Folkman Numbers.
Electron. J. Comb., 2020

Failed power domination on graphs.
Australas. J Comb., 2020

2019
A note on upper bounds for some generalized Folkman numbers.
Discuss. Math. Graph Theory, 2019

On a Diagonal Conjecture for classical Ramsey numbers.
Discret. Appl. Math., 2019

Design of a Flexible Schönhage-Strassen FFT Polynomial Multiplier with High- Level Synthesis to Accelerate HE in the Cloud.
Proceedings of the 2019 International Conference on ReConFigurable Computing and FPGAs, 2019

Flexible HLS-Based Implementation of the Karatsuba Multiplier Targeting Homomorphic Encryption Schemes.
Proceedings of the 26th International Conference on Mixed Design of Integrated Circuits and Systems, 2019

Exploring the Application of Homomorphic Encryption to a Cross Domain Solution.
Proceedings of the 2019 IEEE Military Communications Conference, 2019

2018
On the Nonexistence of Some Generalized Folkman Numbers.
Graphs Comb., 2018

Array-Based Statistical Analysis of the MK-3 Authenticated Encryption Scheme.
Proceedings of the 2018 IEEE Military Communications Conference, 2018

Customization Modes for the Harris MK-3 Authenticated Encryption Algorithm.
Proceedings of the 2018 IEEE Military Communications Conference, 2018

2017
Neural networks and the search for a quadratic residue detector.
Proceedings of the 2017 International Joint Conference on Neural Networks, 2017

2016
A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers R(3, k).
Discret. Appl. Math., 2016

On bipartization of cubic graphs by removal of an independent set.
Discret. Appl. Math., 2016

On some three-color Ramsey numbers for paths.
Discret. Appl. Math., 2016

Implementing authenticated encryption algorithm MK-3 on FPGA.
Proceedings of the 2016 IEEE Military Communications Conference, 2016

Effectiveness of variable bit-length power analysis attacks on SHA-3 based MAC.
Proceedings of the 2016 IEEE Military Communications Conference, 2016

Homomorphic proximity computation in geosocial networks.
Proceedings of the IEEE Conference on Computer Communications Workshops, 2016

2015
Ramsey Numbers of C<sub>4</sub> versus Wheels and Stars.
Graphs Comb., 2015

Wheel and star-critical Ramsey numbers for quadrilateral.
Discret. Appl. Math., 2015

On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral.
Ars Comb., 2015

Constructing large S-boxes with area minimized implementations.
Proceedings of the 34th IEEE Military Communications Conference, 2015

Customizable sponge-based authenticated encryption using 16-bit S-boxes.
Proceedings of the 34th IEEE Military Communications Conference, 2015

2014
Cybersecurity Education: Bridging the Gap Between Hardware and Software Domains.
ACM Trans. Comput. Educ., 2014

2013
Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs.
IEEE Trans. Inf. Theory, 2013

Computation of the Ramsey Numbers $R(C_4, K_9)$ and $R(C_4, K_{10})$.
CoRR, 2013

The Ramsey Number $R(3, K_{10}-e)$ and Computational Bounds for $R(3, G)$.
CoRR, 2013

The Ramsey Number R(3, K<sub>10</sub>-e) and Computational Bounds for R(3, G).
Electron. J. Comb., 2013

New Computational Upper Bounds for Ramsey Numbers R(3, k).
Electron. J. Comb., 2013

2012
On Some Multicolor Ramsey Numbers Involving K<sub>3+e</sub> and K<sub>4-e</sub>.
SIAM J. Discret. Math., 2012

Use of MAX-CUT for Ramsey Arrowing of Triangles
CoRR, 2012

Computing the Ramsey Number $R(K_5-P_3,K_5)$
CoRR, 2012

On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$
CoRR, 2012

Secure Access for Healthcare Data in the Cloud Using Ciphertext-Policy Attribute-Based Encryption.
Proceedings of the Workshops Proceedings of the IEEE 28th International Conference on Data Engineering, 2012

2011
More Constructive Lower Bounds on Classical Ramsey Numbers.
SIAM J. Discret. Math., 2011

2010
Trustworthy Data Collection From Implantable Medical Devices Via High-Speed Security Implementation Based on IEEE 1363.
IEEE Trans. Inf. Technol. Biomed., 2010

2009
NTRU-based sensor network security: a low-power hardware implementation perspective.
Secur. Commun. Networks, 2009

An Improvement to Mathon's Cyclotomic Ramsey Colorings.
Electron. J. Comb., 2009

Bounds on Some Ramsey Numbers Involving Quadrilateral.
Ars Comb., 2009

The vertex and edge graph reconstruction numbers of small graphs.
Australas. J Comb., 2009

2007
Complexity results in graph reconstruction.
Discret. Appl. Math., 2007

2005
Computation of the Ramsey Number R(W<sub>5</sub>,K<sub>5</sub>)
CoRR, 2005

2004
A constructive approach for the lower bounds on the Ramsey numbers <i>R</i> (<i>s, t</i>).
J. Graph Theory, 2004

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers.
Electron. J. Comb., 2004

Ramsey Numbers for Triangles versus Almost-Complete Graphs.
Ars Comb., 2004

An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3).
Ars Comb., 2004

2002
On halving line arrangements.
Discret. Math., 2002

2001
The Ramsey Multiplicity of K4.
Ars Comb., 2001

1999
Computation of the Folkman number <i>F<sub>e</sub></i>(3, 3; 5).
J. Graph Theory, 1999

1997
Subgraph Counting Identities and Ramsey Numbers.
J. Comb. Theory B, 1997

1995
<i>R</i>(4, 5) = 25.
J. Graph Theory, 1995

1994
Linear Programming in Some Ramsey Problems.
J. Comb. Theory B, 1994

Paths, cycles and wheels in graphs without antitriangles.
Australas. J Comb., 1994

1993
The parameters 4-(12, 6, 6) and related t-designs.
Australas. J Comb., 1993

1992
A new upper bound on the Ramsey number R(5, 5).
Australas. J Comb., 1992

1991
On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5).
Discret. Math., 1991

The First Classical Ramsey Number for Hypergraphs is Computed.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1988
Search algorithm for Ramsey graphs by union of group orbits.
J. Graph Theory, 1988

1986
The existence of simple 6-(14, 7, 4) designs.
J. Comb. Theory A, 1986


  Loading...