Citation: M. Middendorf, SHORTEST COMMON SUPERSTRINGS AND SCHEDULING WITH COORDINATED STARTINGTIMES, Theoretical computer science, 191(1-2), 1998, pp. 205-214
Citation: Je. Atkins et M. Middendorf, ON PHYSICAL MAPPING AND THE CONSECUTIVE ONES PROPERTY FOR SPARSE MATRICES, Discrete applied mathematics, 71(1-3), 1996, pp. 23-40
Citation: M. Middendorf, MANHATTAN CHANNEL ROUTING IS NP-COMPLETE UNDER TRULY RESTRICTED SETTINGS, Chicago journal of theoretical computer science, (6), 1996, pp. 1-19
Citation: M. Middendorf, ON FINDING MINIMAL, MAXIMAL, AND CONSISTENT SEQUENCES OVER A BINARY ALPHABET, Theoretical computer science, 145(1-2), 1995, pp. 317-327
Authors:
KAYA C
MIDDENDORF M
MEHRAD F
SAN KT
HUBER B
Citation: C. Kaya et al., LOW-LEVEL GATE CURRENT INJECTIONS IN FLASH MEMORIES INITIATED BY MINORITY-CARRIER COLLECTION ACTION OF FLOATING TERMINALS, I.E.E.E. transactions on electron devices, 42(12), 1995, pp. 2131-2136
Citation: M. Middendorf, MORE ON THE COMPLEXITY OF COMMON SUPERSTRING AND SUPERSEQUENCE PROBLEMS, Theoretical computer science, 125(2), 1994, pp. 205-228
Citation: M. Middendorf, MINIMUM BROADCAST TIME IS NP-COMPLETE FOR 3-REGULAR PLANAR GRAPHS ANDDEADLINE 2, Information processing letters, 46(6), 1993, pp. 281-287