Do You See What I See?: The Use of Visual Passwords for Authentication.
Proceedings of the SIGITE '20: The 21st Annual Conference on Information Technology Education, 2020
Discovering a Profile for Protect and Defend: Penetration Testing.
Proceedings of the Learning and Collaboration Technologies. Learning and Teaching, 2018
Expansion properties of a random regular graph after random vertex deletions.
Eur. J. Comb., 2008
Swan: Highly Reliable and Efficient Network of True Peers.
Proceedings of the Handbook on Theoretical and Algorithmic Aspects of Sensor, 2005
Blending simple polytopes at faces.
Discret. Math., 2004
Maximal nonrevisiting paths in simple polytopes.
Discret. Math., 2003
More polytopes meeting the conjectured Hirsch bound.
Discret. Math., 1999
Visualizing text data sets.
Comput. Sci. Eng., 1999
Counterexamples to the Strong d -Step Conjecture for d ge 5.
Discret. Comput. Geom., 1998
Many Polytopes Meeting the Conjectured Hirsch Bound.
Discret. Comput. Geom., 1998
Estimating the parameters for an exponential process via a Hough transform.
Proceedings of the 1990 International Conference on Acoustics, 1990