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.

M. Ernst

dblp:74/828 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2014
—ORCID · none

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

Security and privacy · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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.

Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › finite field arithmetic
binary field arithmetic
0.012002
A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n) · CHES 2002
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography
0.012002
A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n) · CHES 2002
Hardware accelerators and domain-specific architectures
cryptographic accelerator
0.012002
A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n) · CHES 2002

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

reconfigurable hardware · 0.1elliptic curve cryptography · 0.1
YearPublicationVenuePosition
2014 Semi-Automatic Editing of Graphs with Customized Layouts
abstract
Abstract Usually visualization is applied to gain insight into data. Yet consuming the data in form of visual representation is not always enough. Instead, users need to edit the data, preferably through the same means used to visualize them. In this work, we present a semi‐automatic approach to visual editing of graphs. The key idea is to use an interactive EditLens that defines where an edit operation affects an already customized and established graph layout. Locally optimal node positions within the lens and edge routes to connected nodes are calculated according to different criteria. This spares the user much manual work, but still provides sufficient freedom to accommodate application‐dependent layout constraints. Our approach utilizes the advantages of multi‐touch gestures, and is also compatible with classic mouse and keyboard interaction. Preliminary user tests have been conducted with researchers from bio‐informatics who need to manually maintain a slowly, but constantly growing molecular network. As the user feedback indicates, our solution significantly improves the editing procedure applied so far.
Stefan Gladisch, Heidrun Schumann, M. Ernst, Georg Füllen, Christian Tominski
Comput. Graph. Forum3
2002 A Reconfigurable System on Chip Implementation for Elliptic Curve Cryptography over GF(2n)
M. Ernst, Michael Jung 0002, Felix Madlener, Sorin A. Huss, Rainer Blümel
CHES1