Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Middendorf, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Finding all sorting tandem duplication random loss operations
Matthias Bernt
,
Ming-Chiang Chen
,
Daniel Merkle
,
Hung-Lung Wang
,
Kun-Mao Chao
,
Martin Middendorf
Lecture Notes in Computer Science
5577
, 2009, pp. 301-313
An algorithm for inferring mitogenome rearrangements in a phylogenetic tree
Matthias Bernt
,
Daniel Merkle
,
Martin Middendorf
LNCS/LNBI
5267
, 2008, pp. 143-157
Using median sets for inferring phylogenetic trees
Matthias Bernt
,
Daniel Merkle
,
Martin Middendorf
Bioinformatics
23
(2), 2007, pp. 129-135
CREx: Inferring genomic rearrangements based on common intervals
Matthias Bernt
,
Daniel Merkle
,
Kai Ramsch
,
Guido Fritzsch
,
Marleen Perseke
,
Detlef Bernhard
,
Martin Schlegel
,
Peter F. Stadler
,
Martin Middendorf
Bioinformatics
23
(21), 2007, pp. 2957-2958
Hyperreconfigurable architectures and the partition into hypercontexts problem
Sebastian Lange
,
Martin Middendorf
Journal Parallel Distributed Computing
65
(6), 2005, pp. 743-754
Decentralized packet clustering in router-based networks
Daniel Merkle
,
Martin Middendorf
,
Alexander Scheidler
International Journal of Foundations of Computer Science
16
(2), 2005, pp. 321-341
Combined super-/substring and super-/subsequence problems
Martin Middendorf
,
David F. Manlove
Theoretical Computer Science
320
(2-3), 2004, pp. 247-267
Width-restricted layering of acyclic digraphs with consideraton of dummy nodes
Jürgen Branke
,
Stefan Leppert
,
Martin Middendorf
,
Peter Eades
Information Processing Letters
81
(2), 2002, pp. 59-63
An evolutionary approach to dynamic task scheduling on FPGAs with restricted buffer
Martin Middendorf
,
Bernd Scheuermann
,
Hartmut Schmeck
,
Hossam ElGindy
Journal Parallel Distributed Computing
62
(9), 2002, pp. 1407-1420
Scheduling inverse trees under the communication model of the LogP-machine
Martin Middendorf
,
Wolf Löwe
,
Wolf Zimmermann
Theoretical Computer Science
215
(1-2), 1999, pp. 137-168
Bit summation on the reconfigurable mesh
Martin Middendorf
Lecture Notes in Computer Science
1586
, 1999, pp. 625-633
Shortest common superstrings and scheduling with coordinated starting times
Martin Middendorf
Theoretical Computer Science
191
(1-2), 1998, pp. 205-214
A simulator for the reconfigurable mesh architecture
Carsten Steckel
,
Martin Middendorf
,
Hossam ElGindy
,
Hartmut Schmeck
Lecture Notes in Computer Science
1388
, 1998, pp. 99-104
On optimal
k
-linear scheduling of tree-like task graphs for LogP-machines
Wolf Zimmermann
,
Martin Middendorf
,
Welf Löwe
Lecture Notes in Computer Science
1470
, 1998, pp. 328-336
On physical mapping and the consecutive ones property for sparse matrices
Jonathan E. Atkins
,
Martin Middendorf
Discrete Applied Mathematics
71
(1-3), 1996, pp. 23-40
Maximal common subsequences and minimal common supersequences
Campbell B. Fraser
,
Robert W. Irving
,
Martin Middendorf
Information and Computation
124
(2), 1996, pp. 145-153
Two-dimensional partitioning problems
Martin Middendorf
Theoretical Computer Science
164
(1-2), 1996, pp. 73-106
On finding minimal, maximal, and consistent sequences over a binary alphabet
Martin Middendorf
Theoretical Computer Science
145
(1-2), 1995, pp. 317-327
More on the complexity of common superstring and supersequence problems
Martin Middendorf
Theoretical Computer Science
125
(2), 1994, pp. 205-228
On the approximation of finding various minimal, maximal, and consistent sequences
Martin Middendorf
Lecture Notes in Computer Science
834
, 1994, pp. 306-314
Minimum Broadcast Time is NP-complete for 3-regular planar graphs and deadline 2
Martin Middendorf
Information Processing Letters
46
(6), 1993, pp. 281-287