Documents from 2011
Moving Away from Programming and Towards Computer Science in the CS First Year, James Heliotis and Richard Zanibbi
Documents from 2009
On the Approximability of Dodgson and Young Elections, Ioannis Caragiannis, Jason Covey, Michal Feldman, Christopher Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D. Procaccia, and Jeffrey S. Rosenschein
Guarantees for the Success Frequency of an Algorithm for Finding Dodgson-Election Winners, Christopher Homan and Lane A. Hemaspaandra
Identifying Layout Classes for Mathematical Symbols Using Layout Context, Ling Ouyang and Richard Zanibbi
An Improvement to Mathon’s Cyclotomic Ramsey Colorings, Xiaodong Xu and Stanislaw Radziszowski
Documents from 2008
Plane Decompositions as Tools for Approximation, Melanie J. Agnew and Christopher M. Homan
Efficient Mining of Heterogeneous Star-Structured Data, Manjeet Rege and Qi Yu
Sudoku: A Little Lesson in OOP, Axel-Tobias Schreiner and James Heliotis
Accelerating time to scientific discovery with a grid-enhanced microsoft project, Gregor von Laszewski and Leor Dilmanian
A cumulus project: design and implementation, Lizhe Wang, Gregor von Laszewski, and Marcel Kunze
Documents from 2007
Graph reconstruction numbers, McMullen Brian and Stanislaw Radziszowski
Performance Analysis of Direct N-body Algorithms on Special-Purpose Supercomputers, Stefan Harfst, Alessia Gualandris, David Merritt, Rainer Spurzem, Simon Portegies Zwart, and Peter Berczik
Documents from 2006
There is No 2-(22,8,4) Block Design, Richard Bilous, Clement W.H. Lam, Larry H. Thiel, Ben P.C. Li, G.H. John van Rees, Stanislaw P. Radziszowski, Wolfgang H. Holzmann, and Hadi Kharaghani
Computing the Folkman number F_v(2,2,3;4), Jonathan Coles and Stanislaw Radziszowski
The Complexity of Computing the Size of an Interval, Lane A. Hemaspaandra, Christopher M. Homan, Sven Kosub, and Klaus W. Wagner
A Parent-centered radial layout algorithm for interactive graph visualization and animation, Andrew Pavlo, Christopher Homan, and Jonathan Schull
Note: Computation of the Ramsey Number R(W5,K5), Stanislaw Radziszowski, Josh Stinehour, and Kung-Kuen Tse
Documents from 2005
Municipal Wireless: A Primer for Public Discussion, David M. Shein
Converged vs. Dedicated IPSec Encryption Testing in Gigabit Ethernet Networks, Luther Troell, Jason Burns, Kurt Chapman, Dave Goddard, Matt Soderlund, and Chris Ward
Documents from 2004
Computation of the Ramsey Number R(B_3, K_5), Andrey Babak, Stanislaw Radziszowski, and Kung-Kuen Tse
An Upper bound of 62 on the classical Ramsey number(3,3,3,3), Susan Fettes, Richard Kramer, and Stanislaw Radziszowski
Ramsey numbers for triangles versus almost-complete graphs, Brendan McKay, Konrad Piwakowski, and Stanislaw Radziszowski
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers, Xiaodong Xu, Xie Zheng, Geoffrey Exoo, and Stanislaw Radziszowski
Documents from 2003
A New Framework for Building Secure Collaborative Systems in Ad Hoc Network, Hans-Peter Bischof, Alan Kaminsky, and Joseph Binder
Documents from 2002
Many-to-Many Invocation: A New Framework for Building Collaborative Applications in Ad Hoc Networks, Hans-Peter Bischof and Alan Kaminsky
Many-to-Many Invocation: A New Object Oriented Paradigm for Ad Hoc Collaborative Systems, Alan Kaminsky and Hans-Peter Bischof
Objects for lexical analysis, Bernd Kuhl and Axel-Tobias Schreiner
A Computational Approach for the Ramsey Numbers R(C_4, K_n), Stanislaw Radziszowski and Kung-Kuen Tse
Documents from 2001
The Ramsey multiplicity of K_4, Konrad Piwakowski and Stanislaw Radziszowski
Towards the Exact Value of the Ramsey Number R(3, 3, 4), Konrad Piwakowski and Stanislaw Radziszowski
Documents from 2000
An Object-oriented LL(1) parser generator, Bernd Kuhl and Axel-Tobias Schreiner
Documents from 1999
2-(22, 8, 4) Designs have no blocks of type 3, Brendan McKay and Stanislaw Radziszowski
Documents from 1998
30 <= R(3,3,4) <= 31, Konrad Piwakowski and Stanislaw Radziszowski
Upper bounds for some Ramsey numbers R(3, k), Stanislaw Radziszowski and Donald Kreher
Documents from 1996
Towards deciding the existance of 2-(22,8,4) designs, Brendan McKay and Stanislaw Radziszowski
Documents from 1994
On (n,5,3)-Turan systems, Elizabeth Boyer, Donald Kreher, and Stanislaw Radziszowski
Paths, cycles and wheels in graphs without antitriangles, Stanislaw Radziszowski and Xia Jin
Documents from 1993
The Parameters 4-(12,6,6) and related t-designs, Donald Kreher, Dominique Caen, and Sylvia Hobart
Documents from 1992
A new upper bound for the Ramsey number R(5,5), Brendan McKay and Stanislaw Radziszowski
Documents from 1991
The Ramsey Numbers R(K_4-e, K_6-e) and R(K_4-e,K_7-e), James McNamara and Stanislaw Radziszowski
Minimum triangle-free graphs, Stanislaw Radziszowski and Donald Kreher
Documents from 1988
Lower bounds for multi-colored Ramsey numbers from group orbits, Donald Kreher, Wei Li, and Stanislaw Radziszowski
On (3, k) Ramsey graphs: Theoretical and computational results, Stanislaw Radziszowski and Donald Kreher
Solving subset sum problems with the L^3 algorithm, Stanislaw Radziszowski and Donald Kreher
Documents from 1987
New T-Designs Found by Basis Reduction, Donald Kreher and Stanislaw Radziszowski
Documents from 1986
Finding Simple T-designs by Using Basis Reduction, Donald Kreher and Stanislaw Radziszowski
