Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Herley, Kieran"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Store-and-forward multicast routing on the mesh
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Theory of Computing Systems
42
(4), 2008, pp. 519-535
On stalling in Log
P
Gianfranco Bilardi
,
Kieran Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Journal Parallel Distributed Computing
65
(3), 2005, pp. 307-312
Deterministic parallel backtrack search
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Theoretical Computer Science
270
(1-2), 2002, pp. 309-324
Implementing shared memory on mesh-connected computers and on the fat-tree
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Information and Computation
165
(2), 2001, pp. 123-143
One-to-many routing on the mesh
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'2001 (Crete Island, Greece, July 3-6, 2001)
, 2001, pp. 31-37
Deterministic branch-and-bound on distributed memory machines
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
International Journal of Foundations of Computer Science
10
(4), 1999, pp. 391-404
Deterministic branch-and-bound on distributed memory machines
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Lecture Notes in Computer Science
1586
, 1999, pp. 1085-1094
Fast deterministic parallel branch-and-bound
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Parallel Processing Letters
9
(3), 1999, pp. 325-333
Tight bounds on parallel list marking
Sandeep N. Bhatt
,
Gianfranco Bilardi
,
Kieran T. Herley
,
Geppino Pucci
,
Abhiram Ranade
Journal Parallel Distributed Computing
51
(2), 1998, pp. 75-88
Workshop 13+14 - Architectures and networks
Kieran Herley
,
David Snelling
Lecture Notes in Computer Science
1470
, 1998, pp. 967-969
BSP vs LogP
Gianfranco Bilardi
,
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
,
Paul Spirakis
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'96 (Padua, Italy, June 24-26, 1996)
, 1996, pp. 25-32
Fast deterministic backtrack search
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Lecture Notes in Computer Science
1099
, 1996, pp. 598-609
Tight bounds on parallel list marking
Sandeep N. Bhatt
,
Gianfranco Bilardi
,
Kieran T. Herley
,
Geppino Pucci
,
Abhiram G. Ranade
Lecture Notes in Computer Science
966
, 1995, pp. 231-242
Implementing shared memory on multi-dimensional meshes and on the fat-tree
Kieran T. Herley
,
Andrea Pietracaprina
,
Geppino Pucci
Lecture Notes in Computer Science
979
, 1995, pp. 60-74
Deterministic simulations of PRAMs on bounded degree networks
Kieran T. Herley
,
Gianfranco Bilardi
SIAM Journal on Computing
23
(2), 1994, April, pp. 276-292
A note on the token distribution problem
Kieran T. Herley
Information Processing Letters
38
, 1991, pp. 329-334
Improved bounds for the token distribution problem
Kieran T. Herley
Technical Report (TR 89-1051), 1989, October