Demo Data from EDBT 2026 / reviewers in the wild / expert
Nadia M. Benbernou
dblp:61/1740
· DBLP profile ↗
6ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorTheory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Emerging computing paradigms · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 50% Automata and formal languages · 50% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Emerging computing paradigms › self-assembly
DNA self-assembly |
0.1 | 1 | 2010 | Shape Replication through Self-Assembly and RNase Enzymes · SODA 2010 |
Emerging computing paradigms
molecular computing |
0.1 | 1 | 2010 | Shape Replication through Self-Assembly and RNase Enzymes · SODA 2010 |
Algorithms and data structures
self-assembly |
0.1 | 1 | 2010 | Shape Replication through Self-Assembly and RNase Enzymes · SODA 2010 |
Automata and formal languages
wang tiles |
0.1 | 1 | 2010 | Shape Replication through Self-Assembly and RNase Enzymes · SODA 2010 |
Methods — techniques the papers use, named apart from their topics
tile assembly model · 0.2RNase enzyme · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Universal hinge patterns for folding strips efficiently into any grid polyhedron
Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw |
Comput. Geom. | 1 |
| 2017 | Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron
Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Anna Lubiw |
WADS | 1 |
| 2013 | Efficient reconfiguration of lattice-based modular robots
Greg Aloupis, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, John Iacono, Stefanie Wuhrer |
Comput. Geom. | 2 |
| 2013 | Bounded-degree polyhedronization of point sets
Gill Barequet, Nadia M. Benbernou, David Charlton, Erik D. Demaine, Martin L. Demaine, Mashhood Ishaque, Anna Lubiw, André Schulz 0001, Diane L. Souvaine, Godfried T. Toussaint, Andrew Winslow |
Comput. Geom. | 2 |
| 2010 | Coverage with k-Transmitters in the Presence of Obstacles
Brad Ballinger, Nadia M. Benbernou, Prosenjit Bose, Mirela Damian, Erik D. Demaine, Vida Dujmovic, Robin Y. Flatland, Ferran Hurtado, John Iacono, Anna Lubiw, Pat Morin, Vera Sacristán Adinolfi, Diane L. Souvaine, Ryuhei Uehara |
COCOA (2) | 2 |
| 2010 | Shape Replication through Self-Assembly and RNase EnzymesabstractWe introduce the problem of shape replication in the Wang tile self-assembly model. Given an input shape, we consider the problem of designing a self-assembly system which will replicate that shape into either a specific number of copies, or an unbounded number of copies. Motivated by practical DNA implementations of Wang tiles, we consider a model in which tiles consisting of DNA or RNA can be dynamically added in a sequence of stages. We further permit the addition of RNase enzymes capable of disintegrating RNA tiles. Under this model, we show that arbitrary genus-0 shapes can be replicated infinitely many times using only O(1) distinct tile types and O(1) stages. Further, we show how to replicate precisely n copies of a shape using O(log n) stages and O(1) tile types. Zachary Abel, Nadia M. Benbernou, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Scott Duke Kominers, Robert Schweller |
SODA | 2 |