default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKieran T. Herley
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[c14]Geppino Pucci
, Christos D. Zaroliagis, Kieran T. Herley, Henning Meyerhenke:
Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2012: 674-675- 2011
- [r1]Kieran T. Herley:
Network Obliviousness. Encyclopedia of Parallel Computing 2011: 1298-1303
2000 – 2009
- 2008
- [j11]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Store-and-Forward Multicast Routing on the Mesh. Theory Comput. Syst. 42(4): 519-535 (2008) - [c13]Geppino Pucci, Coromoto León, Ioannis Caragiannis, Kieran T. Herley:
Topic 12: Theory and Algorithms for Parallel Computation. Euro-Par 2008: 876 - 2005
- [j10]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
On stalling in LogP. J. Parallel Distributed Comput. 65(3): 307-312 (2005) - [c12]Andrea Pietracaprina, Kieran T. Herley, Christos D. Zaroliagis, Casiano Rodriguez-Leon:
Topic 12 Theory and Algorithms for Parallel Computation. Euro-Par 2005: 929 - 2002
- [j9]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Deterministic parallel backtrack search. Theor. Comput. Sci. 270(1-2): 309-324 (2002) - 2001
- [j8]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) - [c11]Gianfranco Bilardi, Rainer Feldmann, Kieran T. Herley, Bruce M. Maggs:
Topic 06: Complexity Theory and Algorithms. Euro-Par 2001: 332 - [c10]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
One-to-Many routing on the mesh. SPAA 2001: 31-37 - 2000
- [c9]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
On Stalling in LogP. IPDPS Workshops 2000: 109-115
1990 – 1999
- 1999
- [j7]Gianfranco Bilardi, Andrea Pietracaprina, Geppino Pucci, Kieran T. Herley, Paul G. Spirakis:
BSP versus LogP. Algorithmica 24(3-4): 405-422 (1999) - [j6]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) - [j5]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Fast Deterministic Parallel Branch-and-Bound. Parallel Process. Lett. 9(3): 325-333 (1999) - [c8]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Deterministic Branch-and-Bound on Distributed Memory Machines (Extended Abstract). IPPS/SPDP Workshops 1999: 1085-1094 - 1998
- [j4]Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade:
Tight Bounds on Parallel List Marking. J. Parallel Distributed Comput. 51(2): 75-88 (1998) - [c7]Kieran T. Herley, David F. Snelling:
Architectures and Networks. Euro-Par 1998: 967-969 - 1996
- [j3]Kieran T. Herley:
Representing Shared Data in Distributed-Memory Parallel Computers. Math. Syst. Theory 29(2): 111-156 (1996) - [c6]Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci:
Fast Deterministic Backtrack Search. ICALP 1996: 598-609 - [c5]Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul G. Spirakis:
BSP vs LogP. SPAA 1996: 25-32 - 1995
- [c4]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 - [c3]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
- [j2]Kieran T. Herley, Gianfranco Bilardi:
Deterministic Simulations of PRAMs on Bounded Degree Networks. SIAM J. Comput. 23(2): 276-292 (1994) - 1991
- [j1]Kieran T. Herley:
A Note on the Token Distribution Problem. Inf. Process. Lett. 38(6): 329-334 (1991) - 1990
- [b1]Kieran T. Herley:
Simulating Shared Memory on Distributed Models of Parallel Computation. Cornell University, USA, 1990 - [c2]Kieran T. Herley:
Space-Efficient Representations of Shared Data for Parallel Computers. SPAA 1990: 407-416
1980 – 1989
- 1989
- [c1]Kieran T. Herley:
Efficient Simulations of Small Shared Memories on Bounded Degree Networks (Preliminary Version). FOCS 1989: 390-395
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
