2008 |
24 | EE | Geppino Pucci,
Coromoto León,
Ioannis Caragiannis,
Kieran T. Herley:
Topic 12: Theory and Algorithms for Parallel Computation.
Euro-Par 2008: 876 |
23 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Store-and-Forward Multicast Routing on the Mesh.
Theory Comput. Syst. 42(4): 519-535 (2008) |
2005 |
22 | EE | Andrea Pietracaprina,
Kieran T. Herley,
Christos D. Zaroliagis,
Casiano Rodriguez-Leon:
Topic 12 Theory and Algorithms for Parallel Computation.
Euro-Par 2005: 929 |
21 | EE | Gianfranco Bilardi,
Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
On stalling in LogP.
J. Parallel Distrib. Comput. 65(3): 307-312 (2005) |
2002 |
20 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Deterministic parallel backtrack search.
Theor. Comput. Sci. 270(1-2): 309-324 (2002) |
2001 |
19 | EE | Gianfranco Bilardi,
Rainer Feldmann,
Kieran T. Herley,
Bruce M. Maggs:
Topic 06: Complexity Theory and Algorithms.
Euro-Par 2001: 332 |
18 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
One-to-Many routing on the mesh.
SPAA 2001: 31-37 |
17 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Implementing Shared Memory on Mesh-Connected Computers and on the Fat-Tree.
Inf. Comput. 165(2): 123-143 (2001) |
2000 |
16 | EE | Gianfranco Bilardi,
Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
On Stalling in LogP.
IPDPS Workshops 2000: 109-115 |
1999 |
15 | | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract).
IPPS/SPDP Workshops 1999: 1085-1094 |
14 | EE | Gianfranco Bilardi,
Andrea Pietracaprina,
Geppino Pucci,
Kieran T. Herley,
Paul G. Spirakis:
BSP versus LogP.
Algorithmica 24(3-4): 405-422 (1999) |
13 | | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Deterministic Branch-and-Bound on Distributed Memory Machines.
Int. J. Found. Comput. Sci. 10(4): 391-404 (1999) |
12 | EE | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Fast Deterministic Parallel Branch-and-Bound.
Parallel Processing Letters 9(3): 325-333 (1999) |
1998 |
11 | EE | Kieran T. Herley,
David F. Snelling:
Architectures and Networks.
Euro-Par 1998: 967-969 |
10 | | Sandeep N. Bhatt,
Gianfranco Bilardi,
Kieran T. Herley,
Geppino Pucci,
Abhiram G. Ranade:
Tight Bounds on Parallel List Marking.
J. Parallel Distrib. Comput. 51(2): 75-88 (1998) |
1996 |
9 | | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Fast Deterministic Backtrack Search.
ICALP 1996: 598-609 |
8 | | Gianfranco Bilardi,
Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci,
Paul G. Spirakis:
BSP vs LogP.
SPAA 1996: 25-32 |
7 | | Kieran T. Herley:
Representing Shared Data in Distributed-Memory Parallel Computers.
Mathematical Systems Theory 29(2): 111-156 (1996) |
1995 |
6 | | Kieran T. Herley,
Andrea Pietracaprina,
Geppino Pucci:
Implementing Shared Memory on Mult-Dimensional Meshes and on the Fat-Tree (Extended Abstract).
ESA 1995: 60-74 |
5 | | Sandeep N. Bhatt,
Gianfranco Bilardi,
Kieran T. Herley,
Geppino Pucci,
Abhiram G. Ranade:
Tight Bounds on Parallel List Marking.
Euro-Par 1995: 231-242 |
1994 |
4 | | Kieran T. Herley,
Gianfranco Bilardi:
Deterministic Simulations of PRAMs on Bounded Degree Networks.
SIAM J. Comput. 23(2): 276-292 (1994) |
1991 |
3 | | Kieran T. Herley:
A Note on the Token Distribution Problem.
Inf. Process. Lett. 38(6): 329-334 (1991) |
1990 |
2 | EE | Kieran T. Herley:
Space-Efficient Representations of Shared Data for Parallel Computers.
SPAA 1990: 407-416 |
1989 |
1 | | Kieran T. Herley:
Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version)
FOCS 1989: 390-395 |