List of Publications - by subject

Stanisław P. Radziszowski

This listing is by subject: Ramsey numbers | graph theory | applied cryptography | combinatorial designs | miscellaneous.
Some papers appear in more than one category. You can view all positions in reverse chronological order of writing the first version of the paper. The linked versions of the papers are in most cases preliminary versions. If a paper appeared in a journal, it is recommended to look at the final journal version. MR review is given if different from summary or no link to paper is available.

Most of my older papers can be accessed through RIT digital library.

1. On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral, (pdf)
   with Janusz Dybizbański and Tomasz Dzido, submitted.

2. New Computational Upper Bounds for Ramsey Numbers R(3,k), (pdf | slides.pdf | slides2up.pdf)
   with Jan Goedgebeur
   Electronic Journal of Combinatorics, 20(1) (2013) #P30, 28 pages.

3. On Some Exact Values of Three-Color Ramsey Numbers for Paths, (pdf)
   with Janusz Dybizbański and Tomasz Dzido, submitted.

4. Use of MAX-CUT for Ramsey Arrowing of Triangles, (pdf | slides.pdf)
   with Aleksander Lange and Xiaodong Xu, submitted.

5. Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs, (pdf | slides.pdf)
   with Xiaodong Xu, to appear in IEEE Transactions on Information Theory.

6. On Some Multicolor Ramsey Numbers Involving K_3+e and K_4-e, (pdf | slides.pdf)
   with Daniel S. Shetler and Michael A. Wurtz,
   SIAM Journal on Discrete Mathematics, 26 (2012) 1256-1264.

7. Computing the Ramsey Number R(K_5-P_3,K_5), (pdf)
   with Jesse A. Calvert and Michael J. Schuster
   Journal of Combinatorial Mathematics and Combinatorial Computing, 82 (2012) 131-140.

8. Small Ramsey Numbers, last revision #13, August 22, 2011, 84 pages
   abstract (ps | pdf), contents (ps | pdf), survey (ps | pdf) 50pp, references (ps | pdf) 34pp
   Electronic Journal of Combinatorics, Dynamic Surveys DS1,
   revisions #1 through #13, 1994-2011, MR 99k:05117.ps
   Preliminary version appeared as a technical report, Department of Computer Science, Rochester Institute of Technology, RIT-TR-93-009 (1993).

9. More Constructive Lower Bounds on Classical Ramsey Numbers, (pdf | slides.pdf)
   with Xiaodong Xu and Zehui Shao
   SIAM Journal on Discrete Mathematics, 25 (2011) 394-400.

10. New Bounds on Some Ramsey Numbers, (pdf)
    with Kevin Black and Daniel Leven
    Journal of Combinatorial Mathematics and Combinatorial Computing, 78 (2011) 213-222.

11. Ramsey Numbers Involving Cycles, a survey, (pdf)
    in Ramsey Theory: Yesterday, Today and Tomorrow, edited by Alexander Soifer, Progress in Mathematics 285, Springer-Birkhauser 2011, 41-62.

12. Some Ramsey Problems Involving Triangles - Computational Approach, (pdf | slides.pdf)
    in Ramsey Theory: Yesterday, Today and Tomorrow, edited by Alexander Soifer, Progress in Mathematics 285, Springer-Birkhauser 2011, 185-188. Problems suggested during talk at the Ramsey Theory Workshop, DIMACS, May 2009.

13. An Improvement to Mathon's Cyclotomic Ramsey Colorings, (ps | pdf)
    with Xiaodong Xu
    Electronic Journal of Combinatorics, 16(1) (2009) #N1, 5 pages.

14. Bounds on Some Ramsey Numbers Involving Quadrilateral, (ps | pdf | slides.pdf)
    with Xiaodong Xu and Zehui Shao
    Ars Combinatoria, 90 (2009) 337-344.

15. 28 <= R(C_4,C_4,C_3,C_3) <= 36, (ps | pdf)
    with Xu Xiaodong
    Utilitas Mathematica, 79 (2009) 253-257.

16. Computation of the Ramsey Number R(W_5, K_5), (ps | pdf)
    with Joshua Stinehour and Kung-Kuen Tse
    Bulletin of the Institute of Combinatorics and Its Applications, 47 (2006) 53-57.

17. Constructive Lower Bounds on Classical Multicolor Ramsey Numbers, (ps | pdf)
    with Xu Xiaodong, Xie Zheng and Geoffrey Exoo
    Electronic Journal of Combinatorics, 11(1) (2004) #R35, 24 pages. MR 2005h:05135.

18. A Constructive Approach for the Lower Bounds on the Ramsey Numbers R(s, t), (ps | pdf)
    with Xu Xiaodong and Xie Zheng
    Journal of Graph Theory, 47 (2004) 231-239. MR 2005k:05161.

19. Computation of the Ramsey Number R(B_3, K_5), (ps | pdf)
    with Andrey Babak and Kung-Kuen Tse
    Bulletin of the Institute of Combinatorics and Its Applications, 41 (2004) 71-76.

20. Ramsey Numbers for Triangles versus Almost-Complete Graphs, (ps | pdf)
    with Brendan D. McKay and Konrad Piwakowski
    Ars Combinatoria, LXXIII (2004) 205-214.

21. An Upper Bound of 62 on the Classical Ramsey Number R(3,3,3,3), (ps | pdf)
    with Susan E. Fettes and Richard L. Kramer
    Ars Combinatoria, LXXII (2004) 41-63. MR 2005f:05105.

22. A Computational Approach for the Ramsey Numbers R(C_4, K_n), (ps | pdf)
    with Kung-Kuen Tse
    Journal of Combinatorial Mathematics and Combinatorial Computing, 42 (2002) 195-207. MR 2003h:05142.ps

23. Towards the Exact Value of the Ramsey Number R(3, 3, 4), (ps | pdf)
    with Konrad Piwakowski
    Proceedings of the 33-rd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 148 (2001) 161-167.

24. The Ramsey Multiplicity of K_4, (ps | pdf)
    with Konrad Piwakowski
    Ars Combinatoria, LX (2001) 131-136.
    Preliminary version appeared as Computation of the Ramsey Multiplicity of K_4 in the Proceedings of the Workshop on Computational Graph Theory and Combinatorics, Victoria, British Columbia (1999) 28-30.

25. 30 <= R(3,3,4) <= 31, (ps | pdf | dvi)
    with Konrad Piwakowski
    Journal of Combinatorial Mathematics and Combinatorial Computing, 27 (1998) 135-141. MR 99f:05083.ps

26. Subgraph Counting Identities and Ramsey Numbers, (ps | pdf | dvi)
    with Brendan D. McKay
    Journal of Combinatorial Theory, Series B, 69 (1997) 193-209. MR 98c:05114.ps

27. R(4,5) = 25, (ps | pdf | dvi)
    with Brendan D. McKay
    Journal of Graph Theory, 19 (1995) 309-322. MR 96e:05114.ps

28. Paths, Cycles and Wheels in Graphs without Antitriangles, (ps | pdf)
    with Jin Xia
    Australasian Journal of Combinatorics, 9 (1994) 221-232. MR 94m:05134.ps
    Preliminary version appeared as a technical report, Department of Computer Science, Rochester Institute of Technology, RIT-TR-92-008 (1992).

29. Linear Programming in Some Ramsey Problems, (ps | pdf)
    with Brendan D. McKay
    Journal of Combinatorial Theory, Series B, 61 (1994) 125-132.

30. On the Ramsey Number R(K_5 - e, K_5 - e), (pdf)
    Ars Combinatoria, 36 (1993) 225-232. MR 94f:05106.ps

31. A New Upper Bound for the Ramsey Number R(5, 5), (ps | pdf)
    with Brendan D. McKay
    Australasian Journal of Combinatorics, 5 (1992) 13-20.

32. Minimum Triangle-Free Graphs, (pdf)
    with Donald L. Kreher
    Ars Combinatoria, 31 (1991) 65-92. MR 92d:05110.ps

33. The First Classical Ramsey Number for Hypergraphs is Computed, (ps | pdf | more data)
    with Brendan D. McKay
    Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91, San Francisco, (1991) 304-308.

34. The Ramsey Numbers R(K_4 - e, K_6 - e) and R(K_4 - e, K_7 - e), (pdf)
    with James N. McNamara
    Proceedings of the 22-nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 81 (1991) 89-96. MR 92k:05094.ps

35. The Number of Edges in Minimum (K_3, K_p - e, n)-good Graphs, (pdf)
    with Jing Zou
    Proceedings of the 21-st Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 78 (1990) 153-165. MR 92h:05074.ps

36. The Ramsey Numbers R(K_3, K_8 - e) and R(K_3, K_9 - e), (pdf)
    Journal of Combinatorial Mathematics and Combinatorial Computing, 8 (1990) 137-145. MR 91j:05072.ps
    Drawing of the unique R(K_3,K_7-e)-critical graph G5 (pdf)

37. Lower Bounds for Multi-Colored Ramsey Numbers from Group Orbits, (pdf)
    with Donald L. Kreher and Wei Li
    Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 87-96. MR 90c:05150.ps

38. Upper Bounds for Some Ramsey Numbers R(3, k), (pdf)
    with Donald L. Kreher
    Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 207-212. MR 90e:05044b.ps

39. On R(3, k) Ramsey Graphs: Theoretical and Computational Results, (pdf)
    with Donald L. Kreher
    Journal of Combinatorial Mathematics and Combinatorial Computing, 4 (1988) 37-52. MR 90e:05044a.ps

40. Search Algorithm for Ramsey Graphs by Union of Group Orbits, (pdf)
    with Donald L. Kreher
    Journal of Graph Theory, 12 (1988) 59-72. MR 89h:05039.ps

1. Use of MAX-CUT for Ramsey Arrowing of Triangles, (pdf | slides.pdf)
   with Aleksander Lange and Xiaodong Xu, submitted.

2. Bounds on Shannon Capacity and Ramsey Numbers from Product of Graphs, (pdf | slides.pdf)
   with Xiaodong Xu, submitted.

3. Multi-Vertex Deletion Graph Reconstruction Numbers, (pdf)
   with David Rivshin
   Journal of Combinatorial Mathematics and Combinatorial Computing, 78 (2011) 303-321.

4. Computing the Folkman Number F_v(2,2,2,2,2;4), (pdf)
   with Joel Lathrop
   Journal of Combinatorial Mathematics and Combinatorial Computing, 78 (2011) 119-128.

5. Vertex and Edge Graph Reconstruction Numbers of Small Graphs, (pdf)
   with David Rivshin
   Australasian Journal of Combinatorics, 45 (2009) 175-188.

6. On the Most Wanted Folkman Graph, (ps | pdf), (slides.ps | slides.pdf)
   with Xu Xiaodong
   Geombinatorics, Vol. XVI (4) (2007) 367-381.
   Paper based on talk delivered October 7, 2005 at 19th MCCCC'05. Substantial citations in The Mathematical Coloring Book by A. Soifer, Springer 2009.

7. Graph Reconstruction Numbers, (ps | pdf)
   with Brian McMullen
   Journal of Combinatorial Mathematics and Combinatorial Computing, 62 (2007) 85-96. Errata in 63 (2007) 93-95.

8. Computing the Folkman Number F_v(2,2,3;4), (ps | pdf)
   with Jonathan Coles
   Journal of Combinatorial Mathematics and Combinatorial Computing, 58 (2006) 13-22.

9. Complexity Results in Graph Reconstruction
   with Edith Hemaspaandra, Lane Hemaspaandra and Rahul Tripathi
   Discrete Applied Mathematics, 152(2) (2007), 103-118.
   Preliminary version in the Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS Prague 2004, LNCS 3153, Berlin 2004, 287-297. Available as Technical Report 852, Department of Computer Science, University of Rochester, October 2004, 27 pages (ps | pdf).

10. On Halving Line Arrangements, (ps | pdf)
    with Alina Beygelzimer
    Discrete Mathematics, special issue "Kleitman and Combinatorics: A Celebration", 257 (2002) 267-283. MR 2003j:52022.ps, see also Sloane's On-Line Encyclopedia of Integer Sequences, sequence A076523.

11. The Ramsey Multiplicity of K_4, (ps | pdf)
    with Konrad Piwakowski
    Ars Combinatoria, LX (2001) 131-136.
    Preliminary version appeared as Computation of the Ramsey Multiplicity of K_4 in the Proceedings of the Workshop on Computational Graph Theory and Combinatorics, Victoria, British Columbia (1999) 28-30.

12. Computation of the Folkman Number F_e(3, 3; 5), (ps | pdf)
    with Konrad Piwakowski and Sebastian Urbanski
    Journal of Graph Theory, 32 (1999) 41-49. MR 2000e:05121.ps

13. Subgraph Counting Identities and Ramsey Numbers, (ps | pdf | dvi)
    with Brendan D. McKay
    Journal of Combinatorial Theory, Series B, 69 (1997) 193-209. MR 98c:05114.ps

14. Minimum Triangle-Free Graphs, (pdf)
    with Donald L. Kreher
    Ars Combinatoria, 31 (1991) 65-92. MR 92d:05110.ps

1. Statistical Analysis and Modeling of a Tree-Based Group Key Distribution Method in Tactical Wireless Networks,
   with Peter Bajorski, Alan Kaminsky, Michael Kurdziel, Marcin Lukowiak and Christopher Wood, submitted.

2. Cybersecurity Education: Bridging the Gap between Hardware and Software Domains, (pdf)
   with Christopher Wood, Marcin Lukowiak and James Vallino, submitted.

3. Developing an Applied, Security-Oriented Computing Curriculum, (pdf)
   with Marcin Lukowiak, Andy Meneely, James Vallino and Christopher Wood,
   Proceedings of the Annual Conference of American Society for Engineering Education, ASEE 2012, June 2012, San Antonio, TX.

4. Designing a Secure Cloud-Based EHR System Using Ciphertext-Policy Attribute-Based Encryption, (pdf)
   with Suhair Alshehri and Rajendra K. Raj,
   Proceedings of the Data Management in the Cloud Workshop, DMC 2012, April 2012, Washington D.C.

5. Effects of GPU and CPU Loads on Performance of CUDA Applications, (pdf)
   with Maksim Bobrov, Roy Melton and Marcin Lukowiak
   Proceedings of International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'11, July 2011, Las Vegas, NV, Vol. II, 575-581.

6. Trustworthy Data Collection from Implantable Medical Devices via High-Speed Security Implementation Based on IEEE 1363
   with Fei Hu, Qi Hao, Marcin Lukowiak, Qingquan Sun, Kyle Wilhelm and Yao Wu
   IEEE Transactions on Information Technology in Biomedicine, 14(6) (2010) 1397-1404.

7. NTRU-based confidential data transmission in telemedicine sensor networks
   with Fei Hu, Xiaojun Cao, Kyle Wilhelm and Marcin Lukowiak
   in Security in Ad Hoc and Sensor Networks, Singapore World Scientific, 2010, 159-192.

8. An Overview of Cryptanalysis Research of the Advanced Encryption Standard, (pdf)
   with Alan Kaminsky and Michael Kurdziel
   Proceedings of MILCOM'2010, San Jose, CA, November 2010.

9. FPGA Design and Performance Analysis of SHA-512, Whirlpool and PHASH Hashing Functions, (pdf)
   with Przemysław Zalewski and Marcin Lukowiak, Proceedings of the 16-th International Conference Mixed Design of Integrated Circuits and Systems, June 2009, Łódź, Poland.
   Modified and extended version, Case Study on FPGA Performance of Parallel Hash Functions, in Przegląd Elektrotechniczny/Electrical Review, ISSN 0033-2097, R 86 NR 11a, 2010, 151-155, (pdf).

10. NTRU-based sensor network security: a low-power hardware implementation perspective, (pdf)
    with Fei Hu, Kyle Wilhelm, Michael Schab, Marcin Lukowiak, and Yang Xiao
    Security and Communication Networks, 2 (2009) 71-81.

11. A Case for a Parallelizable Hash, (pdf)
    with Alan Kaminsky
    Proceedings of MILCOM'2008, San Diego, CA, November 2008.

12. W poszukiwaniu funkcji skrotu, in Polish, (page1.ps | page2.ps | page3.ps)
    (Designing hash function), with Michal Adamaszek
    Delta, 408 (2008) 1-3.

1. There is no (22,8,4) Block Design, (ps | pdf)
   with Richard Bilous, Clement W. H. Lam, Larry H. Thiel, (Ben) P. C. Li, G. H. John van Rees, Wolfgang Holzmann and Hadi Kharaghani
   Journal of Combinatorial Designs, 15 (2007) 262-267.

2. 2-(22, 8, 4) Designs Have No Blocks of Type 3, (ps | pdf | dvi)
   with Brendan D. McKay
   Journal of Combinatorial Mathematics and Combinatorial Computing, 30 (1999) 251-253.

3. Towards Deciding the Existence of 2-(22, 8, 4) Designs, (ps | pdf | dvi)
   with Brendan D. McKay
   Journal of Combinatorial Mathematics and Combinatorial Computing, 22 (1996) 211-222.

4. The Nonexistence of 4-(12, 6, 6) Designs, (ps | pdf | dvi)
   with Brendan D. McKay
   in Computational and Constructive Design Theory (edited by W.D. Wallis), Mathematics and its Applications 368, Kluwer Academic Publishers, (1996) 177-188.

5. On (n, 5, 3)-Turan Systems, (pdf)
   with Elizabeth D. Boyer, Donald L. Kreher and Alexander F. Sidorenko
   Ars Combinatoria, 37 (1994) 13-31. MR 95b:05030.ps

6. The Parameters 4-(12, 6, 6) and Related t-Designs, (ps | pdf)
   with Donald L. Kreher, Dominique de Caen, Sylvia A. Hobart and Earl S. Kramer
   Australasian Journal of Combinatorics, 7 (1993) 3-20.

7. Enumeration of All Simple t-(t+7, t+1, 2) Designs, (ps | pdf)
   Journal of Combinatorial Mathematics and Combinatorial Computing, 12 (1992) 175-178. MR 94e:05047.ps

8. On the Covering of t-sets with (t+1)-sets: C(9, 5, 4) and C(10, 6, 5), (pdf)
   with Dominique de Caen, Donald L. Kreher and William H. Mills
   Discrete Mathematics, 92 (1991) 65-77. MR 92j:05046.ps

9. Constructing 6-(14, 7, 4) Designs, (pdf)
   with Donald L. Kreher
   Contemporary Mathematics, AMS, 111 (1990) 137-151. MR 91h:05020.ps

10. New t-Designs Found by Basis Reduction, (pdf)
    with Donald L. Kreher
    Proceedings of the 18-th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 59 (1987) 155-164. MR 89d:05029.ps

11. Simple 5-(28, 6, lambda) Designs from PSL_2(27), (pdf)
    with Donald L. Kreher
    Annals of Discrete Mathematics 34, special volume on Combinatorial Design Theory dedicated to Alexander Rosa (edited by C.J. Colbourn and R.A. Mathon), North-Holland Mathematics Studies 149 (1987) 315-318. MR 89b:05035.ps

12. Finding Simple t-Designs by Using Basis Reduction, (pdf)
    with Donald L. Kreher
    Proceedings of the 17-th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, 55 (1986) 235-244. MR 88c:05026.ps

13. The Existence of Simple 6-(14, 7, 4) Designs, (pdf)
    with Donald L. Kreher
    Journal of Combinatorial Theory, Series A, 43 (1986) 237-243. MR 87k:05023.ps

1. On Halving Line Arrangements, (ps | pdf)
   with Alina Beygelzimer
   Discrete Mathematics, special issue "Kleitman and Combinatorics: A Celebration", 257 (2002) 267-283. MR 2003j:52022.ps, see also Sloane's On-Line Encyclopedia of Integer Sequences, sequence A076523.

2. Solving Subset Sum Problems with the L^3 algorithm, (pdf)
   with Donald L. Kreher
   Journal of Combinatorial Mathematics and Combinatorial Computing, 3 (1988) 49-63. MR 89i:11142.ps

3. Aritmetica en Precision Multiple para la Maquina FOONLY-F2 (in Spanish)
   [Multiple Precision Integer Arithmetic for the Computer FOONLY-F2]
   IIMAS CT Mon. 76, Universidad Nacional Autonoma de Mexico, Mexico D.F., (1983).

4. Desarollo de la teoria de los algoritmos en paralelo y su aplicacion para evaluacion en la maquina AHR (in Spanish)
   [Theory of Parallel Algorithms and its Applications for the AHR Machine]
   IIMAS CT 347, Universidad Nacional Autonoma de Mexico, Mexico D.F., (1983).

5. Bounded Alternation, (pdf)
   IIMAS CT 242, Universidad Nacional Autonoma de Mexico, Mexico D.F., (1980).

6. Logic and Complexity of Synchronous Parallel Computations
   Ph.D. thesis (in Polish), Institute of Informatics, University of Warsaw (1980)
   English version appeared in the CCPAS-report no. 353, Warsaw (1980).

7. Logic and Complexity of Synchronous Parallel Computations, (pdf)
   Proceedings of Mathematical Logic in Computer Science conference, Colloquia Mathematica Societatis Janos Bolyai 26, Salgotarjan, Hungary (1978), North-Holland, (1981) 675-697. MR 83g:68007.ps

8. Programmability and P = NP Conjecture
   Fundamenta Informaticae IV, 2 (1978/1979) 71-82. MR 80a:68046.ps

9. Programmability and P = NP Conjecture
   Proceedings of the Fundamentals of Computation Theory Conference, Poznan-Kornik 1977, LNCS 56, Springer-Verlag, Berlin, (1977) 494-498. MR 57 #18228.ps

Most of my older papers can be accessed through RIT digital library.

back to spr's main page