default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKjell Jørgen Hole
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Kjell Jørgen Hole
:
Tools with general AI and no existential risk. AI Ethics 4(2): 345-352 (2024)- [j38]Kjell Jørgen Hole:
Tool-Augmented Human Creativity. Minds Mach. 34(2): 16 (2024) - 2022
- [j37]Kjell Jørgen Hole:
Tutorial on systems with antifragility to downtime. Computing 104(1): 73-93 (2022)
2010 – 2019
- 2019
- [j36]Kjell Jørgen Hole, Christian Otterstad:
Software Systems With Antifragility to Downtime. Computer 52(2): 23-31 (2019) - [j35]Kjell Jørgen Hole, Subutai Ahmad:
Biologically Driven Artificial Intelligence. Computer 52(8): 72-75 (2019) - [j34]Kjell Jørgen Hole:
Dominating Software Systems: How to Overcome Online Information Asymmetry. IEEE Softw. 36(4): 81-87 (2019) - 2016
- [b1]Kjell Jørgen Hole:
Anti-fragile ICT Systems. Simula SpringerBriefs on Computing 1, Springer 2016, ISBN 978-3-319-30068-9, pp. 3-140 - [j33]Kjell Jørgen Hole:
Building Trust in E-Government Services. Computer 49(1): 66-74 (2016) - [j32]Olav Lysne, Kjell Jørgen Hole, Christian Otterstad, Øyvind Ytrehus, Raymond Aarseth, Jorgen Tellnes:
Vendor Malware: Detection Limits and Mitigation. Computer 49(8): 62-69 (2016) - 2015
- [j31]Kjell Jørgen Hole:
Diversity Reduces the Impact of Malware. IEEE Secur. Priv. 13(3): 48-54 (2015) - [j30]Kjell Jørgen Hole:
Toward Anti-fragility: A Malware-Halting Technique. IEEE Secur. Priv. 13(4): 40-46 (2015) - 2013
- [j29]Kjell Jørgen Hole:
Management of Hidden Risks. Computer 46(1): 65-70 (2013) - 2012
- [j28]Lars Hopland Nestås, Kjell Jørgen Hole:
Building and Maintaining Trust in Internet Voting. Computer 45(5): 74-80 (2012) - [j27]Kjell Jørgen Hole:
Toward a Practical Technique to Halt Multiple Virus Outbreaks on Computer Networks. J. Comput. Networks Commun. 2012: 462747:1-462747:13 (2012) - 2010
- [j26]Kjell Jørgen Hole, Lars-Helge Netland:
Toward Risk Assessment of Large-Impact and Rare Events. IEEE Secur. Priv. 8(3): 21-27 (2010) - [c7]Håvard Raddum, Lars Hopland Nestås, Kjell Jørgen Hole:
Security Analysis of Mobile Phones Used as OTP Generators. WISTP 2010: 324-331
2000 – 2009
- 2009
- [j25]Kjell Jørgen Hole, André N. Klingsheim, Lars-Helge Netland, Yngve Espelid, Thomas Tjøstheim, Vebjørn Moen:
Risk Assessment of a National Security Infrastructure. IEEE Secur. Priv. 7(1): 34-41 (2009) - 2008
- [j24]Anders Gjendemsjø, Geir E. Øien, Henrik Holm, Mohamed-Slim Alouini, David Gesbert, Kjell Jørgen Hole, Pål Orten:
Rate and Power Allocation for Discrete-Rate Link Adaptation. EURASIP J. Wirel. Commun. Netw. 2008 (2008) - [j23]Kjell Jørgen Hole, Lars-Helge Netland, Yngve Espelid, André N. Klingsheim, Hallvar Helleseth, Jan B. Henriksen:
Open Wireless Networks on University Campuses. IEEE Secur. Priv. 6(4): 14-20 (2008) - [c6]André N. Klingsheim, Kjell Jørgen Hole:
Identity Theft: Much Too Easy? A Study of Online Systems in Norway. Financial Cryptography 2008: 192-196 - [c5]Yngve Espelid, Lars-Helge Netland, André N. Klingsheim, Kjell Jørgen Hole:
A Proof of Concept Attack against Norwegian Internet Banking Systems. Financial Cryptography 2008: 197-201 - [c4]Yngve Espelid, Lars-Helge Netland, André N. Klingsheim, Kjell Jørgen Hole:
Robbing Banks with Their Own Software-an Exploit Against Norwegian Online Banks. SEC 2008: 63-77 - 2007
- [j22]André N. Klingsheim, Vebjørn Moen, Kjell Jørgen Hole:
Challenges in Securing Networked J2ME Applications. Computer 40(2): 24-30 (2007) - [j21]Kjell Jørgen Hole, Vebjørn Moen, André N. Klingsheim, Knut M. Tande:
Lessons from the Norwegian ATM System. IEEE Secur. Priv. 5(6): 25-31 (2007) - [j20]Vebjørn Moen, André N. Klingsheim, Kent Inge Fagerland Simonsen, Kjell Jørgen Hole:
Vulnerabilities in e-governments. Int. J. Electron. Secur. Digit. Forensics 1(1): 89-100 (2007) - [i1]Anders Gjendemsjø, Geir E. Øien, Henrik Holm, Mohamed-Slim Alouini, David Gesbert, Kjell Jørgen Hole, Pål Orten:
Rate and Power Allocation for Discrete-Rate Link Adaptation. CoRR abs/0707.2527 (2007) - 2006
- [j19]Kjell Jørgen Hole, Vebjørn Moen, Thomas Tjøstheim:
Case Study: Online Banking Security. IEEE Secur. Priv. 4(2): 14-20 (2006) - [j18]Duc V. Duong, Geir E. Øien, Kjell Jørgen Hole:
Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter. IEEE Trans. Veh. Technol. 55(2): 458-465 (2006) - [c3]Yngve Espelid, Lars-Helge Netland, Khalid A. Mughal, Kjell Jørgen Hole:
Simplifying Client-Server Application Development with Secure Reusable Components. ISSSE 2006 - 2005
- [j17]Kjell Jørgen Hole, Erlend Dyrnes, Per Thorsheim:
Securing Wi-Fi Networks. Computer 38(7): 28-34 (2005) - [c2]Duc V. Duong, Geir E. Øien, Kjell Jørgen Hole:
Adaptive coded modulation with receive antenna diversity and imperfect channel knowledge at receiver and transmitter. EUSIPCO 2005: 1-4 - 2004
- [j16]Vebjørn Moen, Håvard Raddum, Kjell Jørgen Hole:
Weaknesses in the temporal key hash of WPA. ACM SIGMOBILE Mob. Comput. Commun. Rev. 8(2): 76-83 (2004) - [j15]Geir E. Øien, Henrik Holm, Kjell Jørgen Hole:
Impact of channel prediction on adaptive coded modulation performance in Rayleigh fading. IEEE Trans. Veh. Technol. 53(3): 758-769 (2004) - 2002
- [c1]Geir E. Øien, Henrik Holm, Kjell Jørgen Hole:
Channel prediction for adaptive coded modulation in Rayleigh fading. EUSIPCO 2002: 1-4 - 2001
- [j14]Kjell Jørgen Hole, Geir E. Øien:
Spectral efficiency of adaptive coded modulation in urban microcellular networks. IEEE Trans. Veh. Technol. 50(1): 205-222 (2001) - 2000
- [j13]Kjell Jørgen Hole, Henrik Holm, Geir E. Øien:
Adaptive multidimensional coded modulation over flat fading channels. IEEE J. Sel. Areas Commun. 18(7): 1153-1158 (2000) - [j12]Kjell Jørgen Hole:
On classes of convolutional codes that are not asymptotically catastrophic. IEEE Trans. Inf. Theory 46(2): 663-669 (2000)
1990 – 1999
- 1998
- [j11]Kjell Jørgen Hole:
A comparison of trellis modules for binary convolutional codes. IEEE Trans. Commun. 46(10): 1245-1249 (1998) - [j10]Kjell Jørgen Hole, Øyvind Ytrehus:
Cosets of Convolutional Codes with Least Possible Maximum Zero- and One-Run Lengths. IEEE Trans. Inf. Theory 44(1): 423-431 (1998) - 1997
- [j9]Kjell Jørgen Hole:
A note on asymptotically catastrophic convolutional codes of rate (n-1)/n. IEEE Trans. Commun. 45(9): 1014-1016 (1997) - [j8]M. F. Hole, Kjell Jørgen Hole:
Low-complexity decoding of partial unit memory codes on precoded partial-response channels. IEEE Trans. Inf. Theory 43(3): 1052-1058 (1997) - [j7]M. F. Hole, Kjell Jørgen Hole:
Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes. IEEE Trans. Inf. Theory 43(4): 1301-1305 (1997) - 1995
- [j6]Kjell Jørgen Hole:
Cosets of convolutional codes with short maximum zero-run lengths. IEEE Trans. Inf. Theory 41(4): 1145-1150 (1995) - 1994
- [j5]Kjell Jørgen Hole, Øyvind Ytrehus:
Improved coding techniques for preceded partial-response channels. IEEE Trans. Inf. Theory 40(2): 482-493 (1994) - 1991
- [j4]Kjell Jørgen Hole:
An algorithm for determining if a rate (n-1)/n punctured convolutional encoder is catastrophic. IEEE Trans. Commun. 39(3): 386-389 (1991) - [j3]Kjell Jørgen Hole:
Rate k/(k + 1) punctured convolutional encoders. IEEE Trans. Inf. Theory 37(3): 653-655 (1991) - [j2]Kjell Jørgen Hole:
Punctured convolutional codes for the 1-D partial-response channel. IEEE Trans. Inf. Theory 37(3): 808-817 (1991)
1980 – 1989
- 1988
- [j1]Kjell Jørgen Hole:
New short constraint length rate (n-1)/n punctured convolutional codes for soft-decision Viterbi decoding. IEEE Trans. Inf. Theory 34(5): 1079-1081 (1988)
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-06-19 20:56 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:
