Stanislaw P. Radziszowski

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

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



In proceedings 
PhD thesis 





On the Nonexistence of Some Generalized Folkman Numbers.
Graphs and Combinatorics, 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

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

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

On bipartization of cubic graphs by removal of an independent set.
Discrete Applied Mathematics, 2016

On some three-color Ramsey numbers for paths.
Discrete Applied Mathematics, 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

Ramsey Numbers of C4 versus Wheels and Stars.
Graphs and Combinatorics, 2015

Wheel and star-critical Ramsey numbers for quadrilateral.
Discrete Applied Mathematics, 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

Cybersecurity Education: Bridging the Gap Between Hardware and Software Domains.
TOCE, 2014

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

The Ramsey Number R(3, K10-e) and Computational Bounds for R(3, G).
Electr. J. Comb., 2013

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

On Some Multicolor Ramsey Numbers Involving K3+e and K4-e.
SIAM J. Discrete Math., 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

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

Trustworthy Data Collection From Implantable Medical Devices Via High-Speed Security Implementation Based on IEEE 1363.
IEEE Trans. Information Technology in Biomedicine, 2010

NTRU-based sensor network security: a low-power hardware implementation perspective.
Security and Communication Networks, 2009

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

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

The vertex and edge graph reconstruction numbers of small graphs.
Australasian J. Combinatorics, 2009

A constructive approach for the lower bounds on the Ramsey numbers R (s, t).
Journal of Graph Theory, 2004

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers.
Electr. 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

Complexity Results in Graph Reconstruction.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

On halving line arrangements.
Discrete Mathematics, 2002

The Ramsey Multiplicity of K4.
Ars Comb., 2001

Computation of the Folkman number Fe(3, 3; 5).
Journal of Graph Theory, 1999

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

R(4, 5) = 25.
Journal of Graph Theory, 1995

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

Paths, cycles and wheels in graphs without antitriangles.
Australasian J. Combinatorics, 1994

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

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

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

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

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

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