Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Marcus Nilsson

dblp:05/1762 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 7Software engineering, systems software and programming languages · 6Human-computer interaction and ubiquitous computing · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Automated reasoning and model checking · 84% Automata and formal languages · 16%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 62% Immersive interaction · 19% User interface design and tools · 19%
Software engineering, system software, and programming languages
2 papers
Program verification · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Automated reasoning and model checking › model checking › infinite-state model checking
regular model checking
0.132004
Regular Model Checking for LTL(MSO) · CAV 2004
Algorithmic Improvements in Regular Model Checking · CAV 2003
Regular Model Checking · CAV 2000
Ubiquitous computing and smart environments
interruption management
0.112005
A Study on Users' Preference on Interruption When Using Wearable Computers and Head Mounted Displays · PerCom 2005
Automated reasoning and model checking
model checking
0.012000
Regular Model Checking · CAV 2000
Automata and formal languages
regular languages
0.012000
Regular Model Checking · CAV 2000
Immersive interaction
head-mounted display
0.012005
A Study on Users' Preference on Interruption When Using Wearable Computers and Head Mounted Displays · PerCom 2005
User interface design and tools
user interface design
0.012005
A Study on Users' Preference on Interruption When Using Wearable Computers and Head Mounted Displays · PerCom 2005
Program verification › model checking
infinite-state model checking
0.012000
Regular Model Checking · CAV 2000

Methods — techniques the papers use, named apart from their topics

regular model checking · 0.1subjective data analysis · 0.1monadic second-order logic · 0.0parameterized verification · 0.0
YearPublicationVenuePosition
2013 Remote supported trauma care: Understanding the situation from afar
abstract
We present results from a study of information needs when teleconsultation is used in trauma resuscitation. Three trauma team training sessions including 14 patient cases were observed together with field studies at emergency units. Technology probes like headcams and visualization of data usually available in the trauma room were used to better understand what information that is important or not for the remote expert to achieve a satisfactory Situation Awareness to support the trauma resuscitation. It was found that the two major information sources that the remote expert relies on are the vital signs and an overview, not necessarily with high video quality, of the team in the trauma room.
Marcus Nilsson, Alexander Yngling, Kristina Groth, Folke Hammarqvist, Christoffer Jernling
CBMS1
2012 Regular model checking for LTL(MSO)
Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Julien d'Orso, Mayank Saksena
Int. J. Softw. Tools Technol. Transf.3
2010 Computational Aspects of Monomial Dynamical Systems
abstract
We consider the dynamics of x ↦ xn, where n ≥ 2 is an integer, over the multiplicative group modulo pk, where k is a positive integer and p an odd prime. This paper is a review of earlier results by the author, but new results are also contained. Possible applications to pseudorandom number generation will be discussed. The main results are a description of the preperiodic points and an algorithm to find the longest possible cycle. The preperiodic points form trees, all isomorphic as graphs to the preperiodic points of the fixed point 1. When n is a prime, different from p, we can describe the tree structure completely. A formula for the length of the longest cycle is presented. We can find one of the longest cycles of the monomial system using a primitive root modulo pk as an initial value.
Marcus Nilsson
Comput. J.1
2005 A Study on Users' Preference on Interruption When Using Wearable Computers and Head Mounted Displays
abstract
An important part of making a wearable computer un-obtrusive is the user interface and the way it interrupts the user. The amount of interruption that have to be made on the users primary task should be minimized. Usage without interruption is of course best for the performance of the primary task but is often not possible as many tasks that the wearable computer is involved in do need interaction with the user. It is therefore important to understand what type of interruption that will benefit the user most. The question about which interruption that causes the least amount of stress for the user is as important as which interruption that gives the best performance. This paper continues on previous work where performance of the users was measured for different types of interruption. In this paper subjective data is analyzed to understand how to build user interfaces for wearable computers and head mounted displays that considers stress and other subjective variables.
Marcus Nilsson, Mikael Drugge, Urban Liljedahl, Kåre Synnes, Peter Parnes
PerCom1
2005 Minimization of Non-deterministic Automata with Large Alphabets
Parosh Aziz Abdulla, Johann Deneux, Lisa Kaati, Marcus Nilsson
CIAA4
2004 Regular Model Checking for LTL(MSO)
Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Julien d'Orso, Mayank Saksena
CAV3
2004 A Survey of Regular Model Checking
Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Mayank Saksena
CONCUR3
2003 Algorithmic Improvements in Regular Model Checking
Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Julien d'Orso
CAV3
2002 Regular Model Checking Made Simple and Efficient
Parosh Aziz Abdulla, Bengt Jonsson 0001, Marcus Nilsson, Julien d'Orso
CONCUR3
2000 Regular Model Checking
Ahmed Bouajjani, Bengt Jonsson 0001, Marcus Nilsson, Tayssir Touili
CAV3
2000 Transitive Closures of Regular Relations for Verifying Infinite-State Systems
Bengt Jonsson 0001, Marcus Nilsson
TACAS2
1999 Handling Global Conditions in Parameterized System Verification
Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson 0001, Marcus Nilsson
CAV4