Stanisław Radziszowski

Q: What Schools Are Affiliated With Stanisław Radziszowski

Stanisław Radziszowski is affiliated with the following schools: Rochester Institute of Technology, University of Warsaw, University of Illinois Chicago

Stanisław Radziszowski's AcademicInfluence.com Rankings

Computer Science

#2405

World Rank

#2511

Historical Rank

Database

#9252

World Rank

#9737

Historical Rank

computer-science Degrees

Stanisław Radziszowski

Mathematics

#2141

World Rank

#3352

Historical Rank

Combinatorics

#41

World Rank

#46

Historical Rank

Graph Theory

#43

World Rank

#50

Historical Rank

Measure Theory

#4093

World Rank

#4823

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Stanisław Radziszowski's Degrees

PhD Mathematics University of Warsaw
Masters Mathematics University of Warsaw

Why Is Stanisław Radziszowski Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Stanisław P. Radziszowski is a Polish-American mathematician and computer scientist, best known for his work in Ramsey theory. Radziszowski was born in Gdańsk, Poland, and received his PhD from the Institute of Informatics of the University of Warsaw in 1980. His thesis topic was "Logic and Complexity of Synchronous Parallel Computations". From 1976 to 1980 he worked as a visiting professor in various universities in Mexico City. In 1984, he moved to the United States, where he took up a position in the Department of Computer Science at the Rochester Institute of Technology.

(See a Problem?)

Stanisław Radziszowski's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Small Ramsey Numbers (2011) (499)
Secure Access for Healthcare Data in the Cloud Using Ciphertext-Policy Attribute-Based Encryption (2012) (85)
Subgraph Counting Identities and Ramsey Numbers (1997) (62)
An overview of cryptanalysis research for the advanced encryption standard (2010) (55)
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers (2004) (53)
The existence of simple 6-(14, 7, 4) designs (1986) (52)
Computation of the Folkman number Fe(3, 3; 5) (1999) (43)
R(4, 5) = 25 (1995) (37)
Wheel and star-critical Ramsey numbers for quadrilateral (2015) (30)
The first classical Ramsey number for hypergraphs is computed (1991) (29)
Solving subset sum problems with the L^3 algorithm (1988) (26)
New Computational Upper Bounds for Ramsey Numbers R(3, k) (2012) (25)
Finding Simple T-designs by Using Basis Reduction (1986) (24)
A Computational Approach for the Ramsey Numbers R(C_4, K_n) (2002) (22)
Designing a Secure Cloud-Based EHR System using Ciphertext-Policy Attribute-Based Encryption (2011) (22)
NTRU-based sensor network security: a low-power hardware implementation perspective (2009) (21)
Trustworthy Data Collection From Implantable Medical Devices Via High-Speed Security Implementation Based on IEEE 1363 (2010) (21)
Minimum triangle-free graphs (1991) (20)
A constructive approach for the lower bounds on the Ramsey numbers R (s, t) (2004) (19)
On the covering of t-sets with (t + 1)-sets: C(9, 5, 4) and C(10, 6, 5) (1991) (17)
A new upper bound on the Ramsey number R(5, 5) (1992) (17)
Use of MAX-CUT for Ramsey Arrowing of Triangles (2012) (17)
An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3) (2004) (17)
Complexity results in graph reconstruction (2004) (17)
Search algorithm for Ramsey graphs by union of group orbits (1988) (16)
On (3, k) Ramsey graphs: Theoretical and computational results (1988) (15)
More Constructive Lower Bounds on Classical Ramsey Numbers (2011) (14)
Paths, cycles and wheels in graphs without antitriangles (1994) (14)
Linear Programming in Some Ramsey Problems (1994) (14)
On Some Open Questions for Ramsey and Folkman Numbers (2016) (13)
Constructing 6-(14,7,4) designs (1990) (13)
Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs (2011) (12)
On halving line arrangements (2002) (12)
Cybersecurity Education (2014) (12)
Upper bounds for some Ramsey numbers R(3, k) (1998) (11)
Customizable sponge-based authenticated encryption using 16-bit S-boxes (2015) (10)
Homomorphic proximity computation in geosocial networks (2016) (10)
Bounds on Some Ramsey Numbers Involving Quadrilateral (2009) (10)
Towards the Exact Value of the Ramsey Number R(3, 3, 4) (2001) (9)
On bipartization of cubic graphs by removal of an independent set (2014) (9)
Zarankiewicz Numbers and Bipartite Ramsey Numbers (2016) (9)
There is no 2‐(22, 8, 4) block design (2007) (9)
On (n,5,3)-Turan systems (1994) (8)
Lower bounds for multi-colored Ramsey numbers from group orbits (1988) (8)
The Ramsey Multiplicity of K4 (2001) (8)
Towards deciding the existance of 2-(22,8,4) designs (1996) (7)
The Ramsey Number R(3, K10-e) and Computational Bounds for R(3, G) (2013) (7)
Constructing large S-boxes with area minimized implementations (2015) (7)
Computation of the Ramsey Number R(B_3, K_5) (2005) (7)
The Nonexistence of 4-(12,6,6) Designs (1996) (7)
2-(22, 8, 4) Designs have no blocks of type 3 (1999) (6)
An Improvement to Mathon's Cyclotomic Ramsey Colorings (2009) (5)
Ramsey Numbers Involving Cycles (2011) (5)
Flexible HLS-Based Implementation of the Karatsuba Multiplier Targeting Homomorphic Encryption Schemes (2019) (5)
Effects of GPU and CPU Loads on Performance of CUDA Applications (2011) (5)
On Some Multicolor Ramsey Numbers Involving K3+e and K4-e (2012) (5)
Design of a Flexible Schönhage-Strassen FFT Polynomial Multiplier with High- Level Synthesis to Accelerate HE in the Cloud (2019) (5)
Ramsey Numbers for Triangles versus Almost-Complete Graphs (2004) (5)
On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral (2013) (5)
A case for a parallelizable hash (2008) (4)
Computation of the Ramsey Number R(W5,K5) (2005) (4)
A small step forwards on the Erdős-Sós problem concerning the Ramsey numbers R(3, k) (2016) (4)
The vertex and edge graph reconstruction numbers of small graphs (2009) (4)
Developing an Applied, Security-oriented Computing Curriculum (2012) (4)
The parameters 4-(12, 6, 6) and related t-designs (1993) (4)
Chromatic Vertex Folkman Numbers (2016) (4)
The Ramsey numbers R(K_3, K_8 - e) and R(K_3, K_9 - e) (1990) (4)
Implementing authenticated encryption algorithm MK-3 on FPGA (2016) (3)
Ramsey Numbers of $$C_4$$C4 versus Wheels and Stars (2015) (3)
On the Nonexistence of Some Generalized Folkman Numbers (2017) (3)
The Ramsey Numbers R(K_4-e, K_6-e) and R(K_4-e,K_7-e) (1991) (2)
Customization Modes for the Harris MK-3 Authenticated Encryption Algorithm (2018) (2)
The Ramsey multiplicity of K_4 (2001) (2)
On a Diagonal Conjecture for classical Ramsey numbers (2018) (2)
Array-Based Statistical Analysis of the MK-3 Authenticated Encryption Scheme (2018) (2)
Programming and P=NP Conjecture (1977) (2)
Enumeration of all simple t-(t+7,t+1,2) designs (1992) (2)
Evaluation of homomorphic primitives for computations on encrypted data for CPS systems (2016) (2)
Scalable FPGA design and performance analysis of PHASH hashing function (2009) (2)
A Note on Upper Bounds for Some Generalized Folkman Numbers (2017) (2)
New t-designs found by basis reduction (1987) (2)
Case Study on FPGA Performance of Parallel Hash Functions (2010) (2)
Simple 5-(28,6,λ) Designs from PSL2(27) (1987) (2)
On Some Open Questions for Ramsey and (2014) (1)
Hardware Obfuscation of the 16-bit S-box in the MK-3 Cipher (2021) (1)
Neural networks and the search for a quadratic residue detector (2017) (1)
Exploring the Application of Homomorphic Encryption to a Cross Domain Solution (2019) (1)
On the Ramsey number R(K_5 - e,K_5 - e) (1993) (1)
Effectiveness of variable bit-length power analysis attacks on SHA-3 based MAC (2016) (1)
On some edge Folkman numbers, small and large (2019) (1)
NTRU-Based Confidential Data Transmission in Telemedicine Sensor Networks (2009) (1)
Solving the Cross Domain Problem with Functional Encryption (2021) (0)
We discuss some of our favorite open questions about Ramsey numbers and a related problem on edge Folkman numbers (2014) (0)
Master ’ s Project Proposal Exploring the Topology of Small-World Networks (2003) (0)
Memory Protection with Dynamic Authentication Trees (2022) (0)
A step forwards on the Erd\H{o}s-S\'os problem concerning the Ramsey numbers $R(3,k)$ (2015) (0)
Efficient Elliptic Curve Point Multiplication with Montgomery Ladder Algorithm (2016) (0)
1994 On ( n , 5 , 3 )-Turan systems (2017) (0)
Logic and complexity of synchronous parallel computations (1978) (0)
Exploring the topology of small-world networks (2020) (0)
30 <= R(3,3,4) <= 31 (1998) (0)
Computing the Ramsey Number $R(K_5-P_3,K_5)$ (2012) (0)
An elementary proof of the reconstruction conjecture First (2018) (0)
Simple 5-(28,6,lambda) designs from PSL_2(27) (1987) (0)
Some Ramsey Problems Involving Triangles-Computational Approach (2009) (0)
Some Computational and Theoretical Problems for Ramsey Numbers (2015) (0)
Computation of the Ramsey Numbers $R(C_4, K_9)$ and $R(C_4, K_{10})$ (2013) (0)
Affine-Power S-Boxes over Galois Fields with Area-Optimized Logic Implementations (2015) (0)
Statistical Analysis of the MK-3 Customizable Authenticated Encryption (2022) (0)

This paper list is powered by the following services:

Other Resources About Stanisław Radziszowski

en.wikipedia.org

What Schools Are Affiliated With Stanisław Radziszowski?

Stanisław Radziszowski is affiliated with the following schools:

Stanisław Radziszowski's Academic­Influence.com Rankings

Stanisław Radziszowski's Degrees

Why Is Stanisław Radziszowski Influential?

Stanisław Radziszowski's Published Works

Published Works

Other Resources About Stanisław Radziszowski

What Schools Are Affiliated With Stanisław Radziszowski?

Stanisław Radziszowski's AcademicInfluence.com Rankings