You are here:
» Faster Algorithms for Computing Longest Common Increasing...
About Aarhus University
Faster Algorithms for Computing Longest Common Increasing Subsequences
Research output: Contribution to book/anthology/report/proceeding › Article in proceedings › Research › peer-review
- Gerth Stølting Brodal
- Kanela Kaligosi, MPI, Germany
- Irit Katriel, Denmark
- Martin Kutz, MPI, Germany
- Department of Computer Science
| Original language | English |
|---|---|
| Title of host publication | Combinatorial Pattern Matching |
| Editors | Moshe Lewenstein, Gabriel Valiente |
| Publisher | Springer |
| Publication year | 2006 |
| Pages | 330-341 |
| DOIs | |
| Publication status | Published - 2006 |
| Event | CPM 2006 - Duration: 17 Dec 2010 → … |
Conference
| Conference | CPM 2006 |
|---|---|
| Periode | 17/12/2010 → … |
| Series | Lecture Notes in Computer Science |
|---|---|
| Volume | 4009 |
See relations at Aarhus University Citationformats
ID: 757717