default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Harrigan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Thomas Lloyd, Daire O'Broin, Martin Harrigan:
The On-Chain and Off-Chain Mechanisms of DAO-to-DAO Voting. Blockchain 2024: 649-655- [c18]Martin Harrigan, Thomas Lloyd, Daire O'Broin:
Token Composition: A Graph Based on EVM Logs. COINS 2024: 1-6 - 2023
- [c17]Thomas Lloyd, Daire O'Broin, Martin Harrigan:
Emergent Outcomes of the veToken Model. COINS 2023: 1-6 - [i8]Thomas Lloyd, Daire O'Broin, Martin Harrigan:
Emergent Outcomes of the veToken Model. CoRR abs/2311.17589 (2023) - 2021
- [c16]Liam Hickey
, Martin Harrigan:
Decentralisation over Privacy: An Analysis of the Bisq Trade Protocol. Euro-Par Workshops 2021: 207-218 - 2020
- [c15]Liam Hickey, Martin Harrigan:
The Bisq DAO: On the Privacy Cost of Participation. ISCC 2020: 1-6 - [i7]Liam Hickey, Martin Harrigan:
The Bisq DAO: On the Privacy Cost of Participation. CoRR abs/2007.07048 (2020)
2010 – 2019
- 2018
- [c14]Martin Harrigan, Lei Shi, Jacob Illum:
Airdrops and Privacy: A Case Study in Cross-Blockchain Analysis. ICDM Workshops 2018: 63-70 - [i6]Martin Harrigan, Lei Shi, Jacob Illum:
Airdrops and Privacy: A Case Study in Cross-Blockchain Analysis. CoRR abs/1809.05360 (2018) - 2016
- [c13]Martin Harrigan, Christoph Fretter:
The Unreasonable Effectiveness of Address Clustering. UIC/ATC/ScalCom/CBDCom/IoP/SmartWorld 2016: 368-373 - [i5]Martin Harrigan, Christoph Fretter:
The Unreasonable Effectiveness of Address Clustering. CoRR abs/1605.06369 (2016) - 2013
- [j3]Daniel Archambault, Ruben Bouwmeester, Cosmin Cabulea, Elizabeth M. Daly, Giusy Di Lorenzo, Maarten de Rijke, Martin Harrigan, Eser Kandogan, Michael J. Muller, Mor Naaman, Daniele Quercia, Damiano Spina, Markus Strohmaier, Arkaitz Zubiaga:
Reports on the Workshops Held at the Sixth International AAAI Conference on Weblogs and Social Media. AI Mag. 34(1): 101- (2013) - [j2]Pádraig Cunningham, Martin Harrigan, Guangyu Wu, Derek O'Callaghan:
Characterizing ego-networks using motifs. Netw. Sci. 1(2): 170-190 (2013) - 2012
- [c12]Martin Harrigan, Daniel Archambault, Pádraig Cunningham, Neil J. Hurley:
EgoNav: exploring networks through egocentric spatializations. AVI 2012: 563-570 - [c11]Martin Harrigan, Padraig Cunningham, Lorcan Coyle:
Using Storm to Perform Dynamic Egocentric Network Motif Analysis. ICDM Workshops 2012: 408-415 - [c10]Derek O'Callaghan, Martin Harrigan, Joe Carthy, Pádraig Cunningham:
Network Analysis of Recurring YouTube Spam Campaigns. ICWSM 2012 - [c9]Guangyu Wu, Martin Harrigan, Pádraig Cunningham:
Classifying Wikipedia articles using network motif counts and ratios. WikiSym 2012: 12 - [i4]Derek O'Callaghan, Martin Harrigan, Joe Carthy, Pádraig Cunningham:
Network Analysis of Recurring YouTube Spam Campaigns. CoRR abs/1201.3783 (2012) - [i3]Derek O'Callaghan, Martin Harrigan, Joe Carthy, Pádraig Cunningham:
Identifying Discriminating Network Motifs in YouTube Spam. CoRR abs/1202.5216 (2012) - 2011
- [c8]Guangyu Wu, Martin Harrigan, Pádraig Cunningham:
Characterizing Wikipedia pages using edit network motif profiles. SMUC 2011: 45-52 - [c7]Ursula Redmond, Martin Harrigan, Pádraig Cunningham:
Mining Dense Structures to Uncover Anomalous Behaviour in Financial Network Data. MSM/MUSE 2011: 60-76 - [c6]Fergal Reid, Martin Harrigan:
An Analysis of Anonymity in the Bitcoin System. SocialCom/PASSAT 2011: 1318-1326 - [c5]Martin Harrigan, Patrick Healy:
k-Level Crossing Minimization Is NP-Hard for Trees. WALCOM 2011: 70-76 - [i2]Fergal Reid, Martin Harrigan:
An Analysis of Anonymity in the Bitcoin System. CoRR abs/1107.4524 (2011) - 2010
- [c4]Martin Harrigan:
Using Vector Clocks to Visualize Communication Flow. ASONAM 2010: 241-247
2000 – 2009
- 2009
- [c3]Martin Harrigan, Milos Kravcik, Christina Steiner, Vincent Wade:
What Do Academic Users Really Want from an Adaptive Learning System?. UMAP 2009: 454-460 - 2008
- [j1]Martin Harrigan, Patrick Healy:
Using a Significant Spanning Tree to Draw a Directed Graph. J. Graph Algorithms Appl. 12(3): 293-317 (2008) - 2007
- [c2]Martin Harrigan, Patrick Healy:
Efficiently drawing a significant spanning tree of a directed graph. APVIS 2007: 53-59 - [c1]Martin Harrigan, Patrick Healy:
Practical Level Planarity Testing and Layout with Embedding Constraints. GD 2007: 62-68 - 2005
- [i1]Martin Harrigan, Patrick Healy:
On Layering Directed Acyclic Graphs. Graph Drawing 2005
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-10-16 21:25 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:
