EDBT 2026 Demo / reviewers in the wild / expert
Elton Glaser
dblp:03/3915
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2Applied, interdisciplinary, general and emerging 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.
| Theoretical computer science
2 papers |
Graph algorithms and graph theory · 55% Mathematical optimization · 27% Computational complexity · 18% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Emerging computing paradigms · 100% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology
DNA computing |
0.0 | 1 | 1997 | The power of surface-based DNA computation (extended abstract) · RECOMB 1997 |
Emerging computing paradigms › molecular computing
DNA computing |
0.0 | 1 | 1996 | DNA Models and Algorithms for NP-complete Problems · CCC 1996 |
Graph algorithms and graph theory › graph coloring
3-coloring |
0.0 | 1 | 1996 | DNA Models and Algorithms for NP-complete Problems · CCC 1996 |
Mathematical optimization
combinatorial optimization |
0.0 | 1 | 1996 | DNA Models and Algorithms for NP-complete Problems · CCC 1996 |
Graph algorithms and graph theory
independent set |
0.0 | 1 | 1996 | DNA Models and Algorithms for NP-complete Problems · CCC 1996 |
Methods — techniques the papers use, named apart from their topics
surface chemistry · 0.0DNA strand manipulation · 0.0polynomial preprocessing · 0.0exhaustive search · 0.0DNA computing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | DNA Models and Algorithms for NP-Complete Problems
Eric Bach 0001, Anne Condon, Elton Glaser, Celena Tanguay |
J. Comput. Syst. Sci. | 3 |
| 1997 | The power of surface-based DNA computation (extended abstract)abstract) Weiping Cai, Anne E. Condon, Robert M. Corn, Elton Glaser, Zhengdong Fei, Tony Frutos, Zhen Guo, Max G. Lagally, Qinghua Liu, Lloyd M. Smith, Andrew Thiel University of Wisconsin Madison, WI 57306 USA Abstract A new model of DNA computation that is based on surface chemistry is studied. Such computations involve the manipulation of DNA strands that are immobilized on a surface, rather than in solution as in the work of Adleman. Surface-based chemistry has been a critical technology in many recent advances in biochemistry and offers several advantages over solution-based chemistry, including simplified handling of samples and elimination of loss of strands, which reduce error in the computation. The main contribution of this paper is in showing that in principle, surface-based DNA chemistry can efficiently support general circuit computation on many inputs in parallel. To do this, an abstract model of computation that allows parallel manipulation of binary inputs is described. It is... Weiping Cai, Anne Condon, Robert M. Corn, Elton Glaser, Zhengdong Fei, Tony Frutos, Max G. Lagally, Lloyd M. Smith, Andrew Thiel |
RECOMB | 4 |
| 1996 | DNA Models and Algorithms for NP-complete ProblemsabstractA goal of research on DNA computing is to solve problems that are beyond the capabilities of the fastest silicon-based supercomputers. Adleman and Lipton present exhaustive search algorithms for 3Sat and 3-Coloring, which can only be run on small instances and hence are not practical. In this paper, we show how improved algorithms can be developed for the 3-Coloring and Independent Set problems. Our algorithms use only the DNA operations proposed by Adleman and Lipton, but combine them in more powerful ways, and use polynomial preprocessing on a standard computer to tailor them to the specific instance to be solved. The main contribution of this paper is a more general model of DNA algorithms than that proposed by Lipton. We show that DNA computation for NP-complete problems can do more than just exhaustive search. Further research in this direction will help determine whether or not DNA computing is viable for NP-hard problems. A second contribution is the first analysis of errors that arise in generating the solution space for DNA computation. Eric Bach 0001, Anne Condon, Elton Glaser, Celena Tanguay |
CCC | 3 |