Demo Data from EDBT 2026 / reviewers in the wild / expert
Alexander Morgan
dblp:30/8016
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 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.
| Human-computer interaction and pervasive computing
1 paper |
Collaborative and social computing · 77% User interface design and tools · 23% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Collaborative and social computing › computer-mediated communication › messaging
mobile messaging |
0.2 | 1 | 2016 | Forget-me-not: History-less Mobile Messaging · CHI 2016 |
Methods — techniques the papers use, named apart from their topics
field trial · 0.2design probe · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Forget-me-not: History-less Mobile MessagingabstractText messaging has long been a popular activity, and today smartphone apps enable users to choose from a plethora of mobile messaging applications. While we know a lot about SMS practices, we know less about practices of messaging applications. In this paper, we take a first step to explore one ubiquitous aspect of mobile messaging -- messaging history. We designed, built, and trialled a mobile messaging application without history named forget-me-not. The two-week trial showed that history-less messaging no longer supports chit-chat as seen in e.g. WhatsApp, but is still considered conversational and more 'engaging'. Participants expressed being lenient and relaxed about what they wrote. Removing the history allowed us to gain insights into what uses history has in other mobile messaging applications, such as planning events, allowing for distractions, and maintaining multiple conversation threads. Mattias Rost, Christos P. Kitsos, Alexander Morgan, Martin Podlubny, Pietro Romeo, Edoardo Russo, Matthew Chalmers |
CHI | 3 |
| 1987 | Box-bisection for solving second-degree systems and the problem of clusteringabstractBox-bisection is a method for solving nonlinear systems. Space is subdivided into boxes of smaller and smaller diameter, and each subbox is tested for the existence of solutions by a test that either eliminates it from further consideration or marks it for subdivision. Simple bisection uses a test for the exclusion of subboxes, but no test that guarantees the existence of a unique solution in a subbox. Using this simple bisection, we show that the passed boxes tend to cluster in geometrical configura- tions whose number is stable under subdivision. This implies for many problems that the work required to do simple bisection may be prohibitive. However, improvements may be possible by grouping clusters and dynamically redefining the box proportions. The restriction to second-degree systems is sufficient to display this behavior. Alexander Morgan, Vadim Shapiro |
ACM Trans. Math. Softw. | 1 |
| 1987 | Corrigendum: "Box-Bisection for Solving Second-Degree Systems and the Problem of Clustering"abstractNo abstract available. Alexander Morgan, Vadim Shapiro |
ACM Trans. Math. Softw. | 1 |