Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version) - Kieran T. Herley (FOCS, 1989)

Space-Efficient Representations of Shared Data for Parallel Computers. - Kieran T. Herley (SPAA, 1990)

Simulating Shared Memory on Distributed Models of Parallel Computation. - Kieran T. Herley (1990)

A Note on the Token Distribution Problem. - Kieran T. Herley (Inf. Process. Lett., 1991)

Deterministic Simulations of PRAMs on Bounded Degree Networks. - Kieran T. Herley; Gianfranco Bilardi (SIAM J. Comput., 1994)

Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract). - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (ESA, 1995)

Fast Deterministic Backtrack Search. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (ICALP, 1996)

BSP vs LogP. - Gianfranco Bilardi; Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci; Paul G. Spirakis (SPAA, 1996)

Representing Shared Data in Distributed-Memory Parallel Computers. - Kieran T. Herley (Math. Syst. Theory, 1996)

Architectures and Networks. - Kieran T. Herley; David F. Snelling (Euro-Par, 1998)

Tight Bounds on Parallel List Marking. - Sandeep N. Bhatt; Gianfranco Bilardi; Kieran T. Herley; Geppino Pucci; Abhiram G. Ranade (J. Parallel Distributed Comput., 1998)

Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (IPPS/SPDP Workshops, 1999)

BSP versus LogP. - Gianfranco Bilardi; Andrea Pietracaprina; Geppino Pucci; Kieran T. Herley; Paul G. Spirakis (Algorithmica, 1999)

Deterministic Branch-and-Bound on Distributed Memory Machines. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Int. J. Found. Comput. Sci., 1999)

Fast Deterministic Parallel Branch-and-Bound. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Parallel Process. Lett., 1999)

Topic 06: Complexity Theory and Algorithms. - Gianfranco Bilardi; Rainer Feldmann; Kieran T. Herley; Bruce M. Maggs (Euro-Par, 2001)

One-to-Many routing on the mesh. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (SPAA, 2001)

Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Inf. Comput., 2001)

Deterministic parallel backtrack search. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Theor. Comput. Sci., 2002)

Topic 12 Theory and Algorithms for Parallel Computation. - Andrea Pietracaprina; Kieran T. Herley; Christos D. Zaroliagis; Casiano Rodriguez-Leon (Euro-Par, 2005)

On stalling in LogP. - Gianfranco Bilardi; Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (J. Parallel Distributed Comput., 2005)

Topic 12: Theory and Algorithms for Parallel Computation. - Geppino Pucci; Coromoto León; Ioannis Caragiannis; Kieran T. Herley (Euro-Par, 2008)

Store-and-Forward Multicast Routing on the Mesh. - Kieran T. Herley; Andrea Pietracaprina; Geppino Pucci (Theory Comput. Syst., 2008)

Network Obliviousness. - Kieran T. Herley (Encyclopedia of Parallel Computing, 2011)

Topic 12: Theory and Algorithms for Parallel Computation. - Geppino Pucci; Christos D. Zaroliagis; Kieran T. Herley; Henning Meyerhenke (Euro-Par, 2012)