default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeoffrey Canright
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j7]Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen
, Wenche Nag:
Digital exhaust and mobile communication scholarship: Pursuing the Ling connection. New Media Soc. 25(4): 816-832 (2023)- 2022
- [j6]Riccardo Parviero, Kristoffer H. Hellton, Ola Haug, Kenth Engø-Monsen, Hanne Rognebakke, Geoffrey Canright, Arnoldo Frigessi, Ida Scheel:
An agent-based model with social interactions for scalable probabilistic prediction of performance of a new product. Int. J. Inf. Manag. Data Insights 2(2): 100127 (2022)
2010 – 2019
- 2017
- [c13]Per-Jonny Nesse, Oddvar Risnes, Hanne Stine Hallingby, Arne Munch-Ellingsen, Geoffrey St. John Canright:
Growth of mobile financial services key learnings from literature, industry analysis and cases. ICE/ITMC 2017: 446-453 - 2013
- [p3]Pål Roe Sundsøy, Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen, Rich Ling:
Comparing and Visualizing the Social Spreading of Products on a Large Social Network. The Influence of Technology on Social Network Analysis and Mining 2013: 201-225 - 2012
- [c12]Pål Roe Sundsøy, Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen, Rich Ling:
The Activation of Core Social Networks in the Wake of the 22 July Oslo Bombing. ASONAM 2012: 586-590 - [c11]Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen, Pål Roe Sundsøy, Rich Ling:
A Social Network Study of the Apple vs. Android Smartphone Battle. ASONAM 2012: 983-987 - 2010
- [j5]Johannes Bjelland, Mark Burgess, Geoffrey Canright, Kenth Engø-Monsen:
Eigenvectors of directed graphs and importance scores: dominance, T-Rank, and sink remedies. Data Min. Knowl. Discov. 20(1): 98-151 (2010) - [c10]Pål Roe Sundsøy, Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen, Rich Ling:
Product Adoption Networks and Their Growth in a Large Mobile Phone Network. ASONAM 2010: 208-216
2000 – 2009
- 2009
- [r2]Geoffrey Canright:
Complex Networks and Graph Theory. Encyclopedia of Complexity and Systems Science 2009: 1244-1253 - [r1]Johannes Bjelland, Geoffrey Canright, Kenth Engø-Monsen:
Link Analysis and Web Search. Encyclopedia of Complexity and Systems Science 2009: 5265-5286 - 2007
- [c9]Geoffrey Canright, Kenth Engø-Monsen:
A 'Pumping' Model for the Spreading of Computer Viruses. AIMS 2007: 133-144 - [c8]Márk Jelasity, Geoffrey Canright, Kenth Engø-Monsen:
Asynchronous Distributed Power Iteration with Gossip-Based Normalization. Euro-Par 2007: 514-525 - [p2]Iacopo Carreras, Daniele Miorandi, Geoffrey Canright, Kenth Engø-Monsen:
Eigenvector Centrality in Highly Partitioned Mobile Networks: Principles and Applications. Advances in Biologically Inspired Information Systems 2007: 123-145 - [p1]Sachin Kulkarni, Niloy Ganguly, Geoffrey Canright, Andreas Deutsch:
A Bio-Inspired Location Search Algorithm for Peer to Peer Networks. Advances in Biologically Inspired Information Systems 2007: 267-282 - 2006
- [j4]Özalp Babaoglu, Geoffrey Canright, Andreas Deutsch, Gianni Di Caro, Frederick Ducatelle, Luca Maria Gambardella, Niloy Ganguly, Márk Jelasity, Roberto Montemanni, Alberto Montresor, Tore Urnes:
Design patterns from biology for distributed computing. ACM Trans. Auton. Adapt. Syst. 1(1): 26-66 (2006) - [c7]Iacopo Carreras, Daniele Miorandi, Geoffrey Canright, Kenth Engø-Monsen:
Understanding the spread of epidemics in highly partitioned mobile networks. BIONETICS 2006: 2 - [c6]Sachin Kulkarni, Niloy Ganguly, Geoffrey Canright, Andreas Deutsch:
A new bio-inspired location search algorithm for peer to peer network based internet telephony. BIONETICS 2006: 33 - 2004
- [j3]Mark Burgess, Geoffrey Canright, Kenth Engø-Monsen:
A graph-theoretical model of computer security. Int. J. Inf. Sec. 3(2): 70-85 (2004) - [j2]Geoffrey Canright, Kenth Engø-Monsen:
Roles in networks. Sci. Comput. Program. 53(2): 195-214 (2004) - [j1]Mark Burgess, Geoffrey Canright:
Scalability of Peer Configuration Management in Logically Ad Hoc Networks. IEEE Trans. Netw. Serv. Manag. 1(1): 21-29 (2004) - [c5]Niloy Ganguly, Geoffrey Canright, Andreas Deutsch:
Design of a Robust Search Algorithm for P2P Networks. HiPC 2004: 222-231 - [c4]Niloy Ganguly, Geoffrey Canright, Andreas Deutsch:
Design of an Efficient Search Algorithm for P2P Networks Using Concepts from Natural Immune Systems. PPSN 2004: 491-500 - 2003
- [c3]Mark Burgess, Geoffrey Canright:
Scalability of Peer Configuration Management in Partially Reliable and Ad Hoc Networks. Integrated Network Management 2003: 293-305 - [c2]Tuva Stang, Fahimeh Pourbayat, Mark Burgess, Geoffrey Canright, Kenth Engø, Åsmund Weltzien:
Archipelago: A Network Security Analysis Tool. LISA 2003: 149-158 - 2002
- [c1]Geoffrey Canright:
Ants and Loops. Ant Algorithms 2002: 235-242
Coauthor Index
aka: Kenth Engø
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 23:08 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:
